In this paper, the indoor environment monitoring application scenario is taken as an example and a matching network layer protocol is proposed. In view of the ...
A greedy multiple fixed node networking algorithm for indoor environmental monitoring scenarios. Shengming Li, Wenqiang Xu, Lin Feng. Faculty of Electronic ...
The performance evaluation shows that the greedy networking algorithms with multiple fixed nodes is better than the classical AODV, DSDV, ZBR and other ...
Request PDF | On Aug 1, 2019, Shengming Li and others published A Greedy Multiple Fixed Node Networking Algorithm for Indoor Environmental Monitoring ...
A Greedy Multiple Fixed Node Networking Algorithm for Indoor Environmental Monitoring Scenarios pp. 107-112. Room Geometry Reconstruction Based on Speech and ...
poet lee.A greedy multiple fixed node networking algorithm for indoor environmental monitoring scenarios.3rd IEEE International Conference on Smart Internet ...
Greedy Zone Routing constructs a higher level greedy embedding by establishing geographically addressable zones. A sub set of nodes constitute a zone and greedy ...
This study proposes a new methodology to optimize the task-allocation and route-planning for multiple indoor robots with multiple starts and destination depots.
The proposed greedy node detection algorithm receives as input the database of all nodes in the network with their parameters as indicated in Table 2. It will ...
SUMMARY. Location estimation of sensor nodes is an essential part of most applications for wireless sensor and actor networks (WSAN).