Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks

Details Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks

2009-08-16

arxiv.org/abs/0908.2231v3

Computer Science

Networking and Internet Architecture

3 pages, 2 figures, submitted to ANTS'09 - Corrected typos and definitions

Scientific paper

This paper proposes an adaptation of two network size estimation methods: random tour and gossip-based aggregation to suit master/slave mobile ad hoc networks. We show that it is feasible to accurately estimate the size of ad hoc networks when topology changes due to mobility using both methods. The algorithms were modified to account for the specific constraints of master/slave ad hoc networks and the results show that the proposed modifications perform better on these networks than the original protocols. Each of the two algorithms presents strengths and weaknesses and these are outlined in this paper.

Affiliated with

Also associated with

No associations

Rating

Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704674