Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06)
Experimental Results Regarding the Greedy Formation Algorithm for Mobile Ad Hoc Networks
Timisoara, Romania
July 06-July 09
ISBN: 0-7695-2638-1
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.
Citation:
James Galvin, Dan Grigoras, "Experimental Results Regarding the Greedy Formation Algorithm for Mobile Ad Hoc Networks," ispdc, pp.133-139, Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06), 2006