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

Distance Reduction in Mobile Wireless Communication: Lower Bound Analysis and Practical Attainment

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

4 Author(s)
Yu Dong ; IBM, Silicon Valley Lab., San Jose, CA ; Wing-Kai Hon ; David Yau ; Jren-Chit Chin

The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be exploited to greatly reduce the energy required by postponing communication until the sender moves close to a target receiver, subject to application deadline constraints. In this paper, we characterize the fundamental performance limit, namely the lower bound expected communication distance, achievable by any postponement algorithm within given deadline constraints. Our analytical results concern mainly the random waypoint (RWP) model. Specifically, we develop a tight analytical lower bound of the achievable expected communication distance under the model. In addition, we define a more general map-based movement model, and characterize its lower bound distance by simulations. We also address the practical attainment of distance reduction through movement-predicted communication. Specifically, whereas prior work has experimentally demonstrated the effectiveness a least distance (LD) algorithm, we provide an absolute performance measure of how closely LD can match the theoretical optimum. We show that LD achieves an average reduction in the expected communication distance within 62% to 94% of the optimal, over a realistic range of nodal speeds, for both the RWP and map-based models.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:8 ,  Issue: 2 )

Date of Publication:

Feb. 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.