By Topic

On the Packet Header Size and Network State Tradeoff for Trajectory-Based Routing 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)
Rajagopal Iyengar ; ECSE Department, Rensselaer Polytechnic Institute, Troy, NY, 12180 ; Murat Yuksel

This paper considers the tradeoffs between packet header size, network state and accuracy of representation in wireless networks which use trajectory based routing techniques. The models presented here are applicable in sensor networks for which trajectory based routing techniques have previously been proposed. We begin with simple discrete models to make clear the tradeoff between header size and network state. We show that the problem of accurate representation of a trajectory with the objective of minimizing the cost incurred due to header size and network state is difficult to solve optimally. Therefore, we present two heuristics to solve this problem. We note that this work leads to further interesting problems when applied to practical systems

Published in:

2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications

Date of Conference:

11-14 Sept. 2006