GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Depth First Search and Location Based Localized Routing and QoS Routing in Wireless Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing for wireless networks
Geographic routing for wireless networks
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
On the effect of localization errors on geographic face routing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Wireless Sensor Networks: Technology, Protocols, and Applications
Wireless Sensor Networks: Technology, Protocols, and Applications
Worldsens: development and prototyping tools for application specific wireless sensors networks
Proceedings of the 6th international conference on Information processing in sensor networks
On-demand Geographic Forwarding for data delivery in wireless sensor networks
Computer Communications
Avoid 'void' in geographic routing for data aggregation in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
An efficient void resolution method for geographic routing in wireless sensor networks
Journal of Systems and Software
Constructing virtual coordinate for routing in wireless sensor networks under unreliable links
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
A Survey of Ant-Based Routing Algorithms for Mobile Ad-hoc Networks
ICSPS '09 Proceedings of the 2009 International Conference on Signal Processing Systems
Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
GOAFR Plus-ABC: geographic routing based on adaptive boundary circle in MANETs
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
IEEE Transactions on Computers
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
A preventive rerouting scheme for avoiding voids in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
IEEE Transactions on Computers
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS
IEEE Communications Surveys & Tutorials
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Self organization in mobile ad hoc networks: the approach of Terminodes
IEEE Communications Magazine
IEEE Communications Magazine
Continuous range k-nearest neighbor queries in vehicular ad hoc networks
Journal of Systems and Software
Hi-index | 0.00 |
Abstract: Geographic routing is one of the most suitable routing strategies for large scale wireless sensor networks due to its low overhead and high scalability features. A geographic routing scheme usually combines a geographic greedy forwarding with a recovery mechanism to solve the local minima problem. Solutions proposed in the literature commonly combine greedy forwarding with the well known face routing for achieving this goal. However, the average path length in number of hops produced by face routing could be much worse than the optimal topological path in most realistic scenarios. In this paper, we propose a new intermediate procedure between the geographic greedy mode and the recovery mode in order to improve routing efficiency in number of hops, without network overhead. It exploits the optimal topological route to base stations, obtained by beacon messages, as a resource to find better routes than the ones created by face routing. We show by simulations that the proposed hybrid approach leads to a significant improvement of routing performance when applied to combined greedy-face routing algorithms.