By Topic

Improving Routing Quality of Greedy Forwarding in Wireless 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
$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

2 Author(s)
Chen Wang ; Department of Computer Science and Engineering, Michigan State University, Email: ; Li Xiao

In this paper, we reveal the inherent tradeoff between the quality of routing performance and the size of routing states in wireless networks. We suggest that the key approach to an optimal routing design is how to efficiently encode a network topology into small dimensional coordinates from which hop count distances between pairwise sensors can be accurately recovered. Based on the precisely hop count distance comparison, our proposed topology aware routing can assist the greedy forwarding to find the right neighbor that is one hop closer to the destination, and therefore achieve high success rate of packet delivery. The intensive performance evaluation shows that the topology aware routing can achieve routing performance comparable to the shortest path routing while preserving the routing states as small as location aware routing. Particularly, high routing success rate can be achieved in both concave environments where voids are presented and dynamic environments where nodes crash frequently.

Published in:

2007 Fifteenth IEEE International Workshop on Quality of Service

Date of Conference:

21-22 June 2007