Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Experimental Results Regarding the Greedy Formation Algorithm for 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)
Galvin, J. ; Dept. of Comput. Sci., Univ. Coll. Cork ; Grigoras, D.

Management operations of mobile ad hoc networks (MANET) like network formation, join and merge/split are complex and highly demanding on the battery, a scarce resource for any mobile device. In a previous paper, we proposed two MANET management algorithms that proved, by ns-2 simulation, to be feasible, reliable and cost-effective. This paper presents the experimental results of implementing one of the two algorithms, the greedy formation algorithm for MANET, on real devices. Data acquired so far and included in this paper are a strong argument in the favor of this approach

Published in:

Parallel and Distributed Computing, 2006. ISPDC '06. The Fifth International Symposium on

Date of Conference:

6-9 July 2006