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

Analysis of leveled probabilistic routing in 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)
Qi Zhang ; OBR Center for Distributed & Mobile Comput., Cincinnati Univ., OH, USA ; Agrawal, D.P.

In mobile ad hoc networks (MANET), some mobile hosts may be outside the range of the source node. In order to deliver the message to those hosts, intermediate nodes should relay the packets for them. Due to the node mobility, we cannot have a fixed group of mobile nodes perform the task of packet relaying. In this paper we propose a routing protocol based on the preassigned probability model. In this protocol, a mobile host probabilistically sends the relay packets (rebroadcasts) according to its neighborhood information. We exploit the "HELLO" message exchanges between immediate neighbors to obtain the neighborhood information. Using this method, we can reduce routing cost by minimizing the number of rebroadcasts in route discovery period without a significant impact on the network connectivity. Moreover, the chance of contention and collision among neighboring nodes is also reduced. As a result, the overall network performance is improved, while higher goodput and lower energy consumption is achieved. Our approach categorizes mobile hosts into four groups according to their neighborhood information. For each group of nodes, we assign a specified value of rebroadcasting probability. The mobile hosts with more neighbors are given higher rebroadcasting probability, while the mobile hosts with fewer neighbors have a lower rebroadcasting probability. Analytical results show that our approach outperforms the AODV protocol.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:7 )

Date of Conference:

20-24 June 2004

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.