Cart (Loading....) | Create Account
Close category search window
 

Geographic routing based on on-demand neighbor position information in large-scale mobile sensor networks

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
$31 $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

5 Author(s)
Euisin Lee ; Dept. of Comput. Eng., Chungnam Nat. Univ., Daejeon, South Korea ; Soochang Park ; Hosung Park ; Jeongchul Lee
more authors

Geographic routing has been considered as a scalable approach in ad-hoc and sensor networks since it exploits pure position information of neighbors and a destination node instead of global topology information to route data packets. To obtain the position information of the neighbors, many geographic routing protocols assume that each node exchange periodically its own position information with its neighbors. However, these periodically position exchanges in regions without packet forwarding make nodes consume unnecessary energy. In addition, given that the nodes have mobility, when a node forwards a packet, the position information of its neighbor nodes may be invalid. Hence, in these mobile networks, it is more efficient that a mobile node collects the position information of its neighbors when it needs to forward a packet. Because every sender node in geographic routing also selects the nearest neighbor node to the destination node as the receiver node, obtaining the position information of only closer neighbor nodes to the destination node can save more wireless resources than obtaining that of all neighbor nodes. In large-scale networks, because many wireless collisions can happen due to position exchanges of many neighbor nodes, they should share limited wireless resources. Therefore, we propose a mechanism to solve these issues of geographic routing in large-scale mobile networks. Simulation results show that the proposed mechanism has better performance than the existing geographic routing protocols.

Published in:

Autonomous Decentralized Systems, 2009. ISADS '09. International Symposium on

Date of Conference:

23-25 March 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.