Carleton University - School of Computer Science Honours Project
Summer 2019
Implementation of Approximate Neighbour Counting in Radio Networks
SCS Honours Project Image
ABSTRACT
Neighbourhood size in an important parameter for many algorithms; however, in radio networks this information can be difficult to obtain due to ad hoc deployments and shared collision-prone communication channels. As a result, this report records findings from implementations of approximate neighbour counting algorithms discussed by Calvin Newport and Chaodong Zheng. These findings are on the percentages of estimates. Regarding the correctness of an estimate’s value range, an estimate may be or may not be in the specified range of iterations.