Two algorithms for network size estimation for master/slave ad hoc networks

Authors:
Redouane Ali;Suksant Sae Lor;Miguel Rio
Affiliations:
University College London;University College London;University College London
Venue:
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Year:
2009

Citing 5
Cited 0

Gossip-based aggregation in large dynamic networks

ACM Transactions on Computer Systems (TOCS)
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks

IEEE Transactions on Mobile Computing
Peer counting and sampling in overlay networks: random walk methods

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A survey of clustering schemes for mobile ad hoc networks

IEEE Communications Surveys & Tutorials
Bluetooth: an enabler for personal area networking

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.