Approximate Neighbor Counting in Radio Networks

by   Calvin Newport, et al.

For many distributed algorithms, neighborhood size is an important parameter. In radio networks, however, obtaining this information can be difficult due to ad hoc deployments and communication that occurs on a collision-prone shared channel. This paper conducts a comprehensive survey of the approximate neighbor counting problem, which requires nodes to obtain a constant factor approximation of the size of their network neighborhood. We produce new lower and upper bounds for three main variations of this problem in the radio network model: (a) the network is single-hop and every node must obtain an estimate of its neighborhood size; (b) the network is multi-hop and only a designated node must obtain an estimate of its neighborhood size; and (c) the network is multi-hop and every node must obtain an estimate of its neighborhood size. In studying these problem variations, we consider solutions with and without collision detection, and with both constant and high success probability. Some of our results are extensions of existing strategies, while others require technical innovations. We argue this collection of results provides insight into the nature of this well-motivated problem (including how it differs from related symmetry breaking tasks in radio networks), and provides a useful toolbox for algorithm designers tackling higher level problems that might benefit from neighborhood size estimates.


page 1

page 2

page 3

page 4


Information Gathering in Ad-Hoc Radio Networks

In the ad-hoc radio network model, nodes communicate with their neighbor...

Performance analysis of a distributed algorithm for admission control in wireless networks under the 2-hop interference model

A general open problem in networking is: what are the fundamental limits...

Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information

We consider ad-hoc networks consisting of n wireless nodes that are loca...

Randomized Communication in Radio Networks

A communication network is called a radio network if its nodes exchange ...

Finding Subgraphs in Highly Dynamic Networks

In this paper we consider the fundamental problem of finding subgraphs i...

Randomized Communication Without Network Knowledge

Radio networks are a long-studied model for distributed system of device...

Neighborhood Information-based Probabilistic Algorithm for Network Disintegration

Many real-world applications can be modelled as complex networks, and su...

Please sign up or login with your details

Forgot password? Click here to reset