Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Computers
Fault Estimation and Fault Map Construction on Cluster-based Wireless Sensor Network
SUTC '06 Proceedings of the IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing - Vol 2 - Workshops - Volume 02
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Reliable Greedy Forwarding in Obstacle-Aware Wireless Sensor Networks
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Hi-index | 0.00 |
Geographic routing protocols on Wireless Sensor Network (WSN) had been researched for many years, but they did not concern with the fault problem. In this paper, we propose an approach to enhance dependability of existing geographical routing protocols to deal with the fault problem and consider the routing problem based on the fault map via query-driven models. For query-driven model, a novel algorithm, called Relay Node Selection Algorithm (RNSA) is proposed, which selects a few relay nodes as temporary destinations. Simulation shows that the success rate of data transmission originated from base station can be raised substantially and the hop count is also reduced via the selected relay nodes.