Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
IEEE Transactions on Computers
Self-configuring localization systems: Design and Experimental Evaluation
ACM Transactions on Embedded Computing Systems (TECS)
Convex Optimization
Protocols and Architectures for Wireless Sensor Networks
Protocols and Architectures for Wireless Sensor Networks
On Distributed Fault-Tolerant Detection in Wireless Sensor Networks
IEEE Transactions on Computers
Geographic routing without planarization
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
| Hi-index | 0.00 |
The research community has recently witnessed the emergence of densely deployed Wireless Sensor Networks (WSNs) consisting of a large number of battery-operated sensor nodes. As a candidate for monitoring remote faulty regions, WSNs may suffer from hardware and software faults which may cause misbehavior of a portion of network. Geographic routing algorithms aims at traversing data packets in such environments with admissible communication complexity. In this paper, we propose a novel region routing algorithm that addresses message loss tolerability in harsh and hostile environments by assigning higher weights to higher harsh regions. Finally, we present extensive simulation experiments to validate the accuracy of the proposed algorithm.