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

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.

• Publication year

  2009

• Venue

  International Workshop on Ant Colony Optimization and Swarm Intelligence

• Publication date

  2009-08-16

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/ANTS.2009.5409896arXiv 0908.2231
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Practical Approach to Network Size Estimation for Structured Overlays

  2008cited by this paper
• Peer counting and sampling in overlay networks: random walk methods

  2006influential reference
• Exploring complex networks through random walks.

  2006cited by this paper
• Peer to peer size estimation in large and dynamic networks: A comparative study

  2006cited by this paper
• Gossip-based aggregation in large dynamic networks

  2005cited by this paper
• Random walks in peer-to-peer networks

  2004cited by this paper
• New clustering schemes for energy conservationin two-tiered mobile ad hoc networks

  2002cited by this paper
• Random walk for self-stabilizing group communication in ad hoc networks

  2002cited by this paper
• Master-slave cluster-based multihop ad-hoc networking

  2002cited by this paper
• Bluetooth: an enabler for personal area networking

  2001cited by this paper
• New clustering schemes for energy conservation in two-tiered mobile ad-hoc networks

  2001cited by this paper

• Network Size Estimation for Direct-to-Satellite IoT

  2023influential citation
• Distributed Network Structure Estimation Using Consensus Methods

  2018cites this paper
• Distributed Node Counting in Wireless Sensor Networks in the Presence of Communication Noise

  2017cites this paper
• A survey on real-time Ethernet

  2017cites this paper
• Optimization Between Estimation Error and Transmit Energy in Cross-Correlation Based Underwater Network Cardinality Estimation

  2017cites this paper
• Optimization Between Estimation Error and Transmit Energy in Cross-Correlation Based Underwater Network Cardinality Estimation

  2017cites this paper
• Optimization and Control in Dynamical Network Systems

  2016cites this paper
• Cramer-Rao Bounds for Distributed System Size Estimation Using Consensus Algorithms

  2016cites this paper
• Distributed Cardinality Estimation in Anonymous Networks

  2014cites this paper
• Underwater network size estimation using cross-correlation: Selection of estimation parameter

  2014cites this paper
• Consensus Algorithms in Dynamical Network Systems

  2013cites this paper
• Optimal Forwarding Games in Mobile Ad Hoc Networks with Two-Hop f-cast Relay

  2012cites this paper
• Distributed size estimation of dynamic anonymous networks

  2012cites this paper
• Semi-Markov process based model for performance analysis of wireless LANs

  2011cites this paper
• Model and analysis of burst packet losses and packet delays in IP networks using Markov chains

  2011cites this paper
• Distributed size estimation in anonymous networks

  2011cites this paper
• Cooperative leader election algorithm for master/slave mobile ad hoc networks

  2009cites this paper