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

Bounded-Delay, Probability-Based Routing in Intermittently Connected Mobile 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

2 Author(s)
Xianning Li ; Sch. of Inf. Eng., Univ. of Sci. & Technol. Beijing, Beijing ; Xianwei Zhou

Routing in intermittently connected mobile ad hoc networks (ICMAN) is particularly challenging due to intermittent connectivity and unstable topology. To deal with this problem, researchers have proposed some routing schemes based on message relay. Proposed efforts focus on the tradeoff between average message delivery delay and communication overhead. However, message delivery with a certain probability of bounded delay, rather than average delay, is more practical in real world scenario. In this paper, we introduce a new routing scheme that can guarantee the bounded delivery delay with a certain probability in random way models. We study the relationship between the probability of bounded delivery delay and the chosen nodes for forwarding. In our scheme, each message is labeled with an expected probability of bounded delivery delay. The fields of messages are updated each time message relay happens. The total number of nodes used for delivery depends on the delivery probability and delay. It is designed to provide bounded end-to-end delay with a certain probability compared with other bounded average delay schemes. The simulation results show that our novel scheme requires less resource than epidemic routing, while provides similar performance.

Published in:

Distributed Computing Systems Workshops, 2008. ICDCS '08. 28th International Conference on

Date of Conference:

17-20 June 2008

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.