By Topic

Geographical routing using partial information for wireless ad hoc 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

3 Author(s)
Jain, R. ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; Puri, A. ; Sengupta, Raja

We present an algorithm for routing in wireless ad hoc networks using information about the geographical location of the nodes. We assume each node knows its geographical position and the position of the node to which it wants to send a packet. Initially, the nodes know only their neighbors. But over time they discover other nodes in the network. The routing table at a node S is a list <(pi,Si)>, where pi is a geographical position and Si is a neighbor of node S. When node S receives a packet for a node D at position pos(D), it finds the p i in its routing table which is closest to pos(D) and forwards the packet to the neighbor Si. We prove the correctness of the algorithm and show that our algorithm naturally aggregates the nodes so that the routing tables remain small. We show that the mean routing table size is O(L¯logn), where L¯ is the average number of hops between two nodes and n is the number of nodes in the network. We also present methods for taking positional errors, node failures and mobility into account. We justify the results through simulation

Published in:

Personal Communications, IEEE  (Volume:8 ,  Issue: 1 )