By Topic

A heuristic protocol combined location service in geographic ad hoc routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
You-fu Jiang ; School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan Zhejiang 316000, China ; Guang-hui Wang ; Hai-yang Jin

Wireless geographic Ad Hoc routing has been extensively studied in recent years. As geographic routing has topology-unrelated features, and it can independently selects the next hop with local location information, it is suitable for large-scale Ad Hoc networks. However, geographic forwarding suffers from a problem of how to do at the local minimum node where greedy forwarding fails. In this paper, we proposed the heuristic algorithm to solve this problem, and proposed an improved heuristic algorithm which constrains the forwarding on the basis of the adjacent connection-grid instead of jumping over the world like the static networks because of the limited power of wireless nodes. This scheme can not only overcome the complexity of the planar graph routing, but also provide the prediction of the void to cope with the complex terrain problem. Simulation results show that our solutions can significantly reduce the number of the extended nodes, improve the packet delivery success rate and decrease the routing overhead.

Published in:

Wireless Communications, Networking and Information Security (WCNIS), 2010 IEEE International Conference on

Date of Conference:

25-27 June 2010