By Topic

Probabilistic Routing Protocol for Intermittently Connected Mobile Ad hoc Network (PROPICMAN)

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

3 Author(s)
Hoang Anh Nguyen ; ISIN-DTI, SUPSI, Switzerland, HoangAnh.Nguyen@supsi.ch ; Silvia Giordano ; Alessandro Puiatti

Routing in intermittently connected mobile ad hoc networks (ICMAN) is a very challenging problem because disconnections are prevalent and the lack of knowledge about network dynamics hinders good decision making. In ICMAN one of the most important decisions is how to choose the most suitable intermediate(s) to forward the message to the destination. We propose in this document a new algorithm (PROPICMAN) that, based on context information, allows the sender to select the neighbor(s) such that the message has the highest probability to reach the destination.

Published in:

2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks

Date of Conference:

18-21 June 2007