Issue No. 03 - March (2013 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2012.19
H. Adam , Mobile Syst. Group, Univ. of Klagenfurt, Klagenfurt am Worthersee, Austria
E. Yanmaz , Mobile Syst. Group, Univ. of Klagenfurt, Klagenfurt am Worthersee, Austria
C. Bettstetter , Mobile Syst. Group, Univ. of Klagenfurt, Klagenfurt am Worthersee, Austria
Several communication protocols and applications require a node to know how many neighboring nodes exhibiting a certain attribute it has. Conventionally, such neighbor information is obtained by explicit message exchange between nodes, which is reliable but inefficient in densely connected networks in terms of overhead and delay. An alternative approach is to perform an estimation of the neighbor cardinality using probabilistic methods. This paper pursues such an approach by proposing neighbor cardinality estimators that require no coordination among polled nodes but are based on a simple random access scheme with busy tones, where the number of empty slots is exploited to infer about the neighbor cardinality. We compare three estimators with different levels of adaptability and feedback from the query node and discuss their suitability for IEEE 802.11 and low power sensors. Performance is studied in terms of estimation accuracy and delay.
wireless LAN, estimation theory, probability, protocols, estimation accuracy, contention-based estimation, communication protocol, neighboring node, message exchange, network overhead, network delay, neighbor cardinality estimation, probabilistic method, random access scheme, busy tone, query node, IEEE 802.11, low power sensor, Estimation, Accuracy, Delay, Mobile computing, Protocols, Radiofrequency identification, Approximation methods, RFID, Neighbor cardinality, estimation protocols, slotted random access, degree distribution
E. Yanmaz, C. Bettstetter and H. Adam, "Contention-Based Estimation of Neighbor Cardinality," in IEEE Transactions on Mobile Computing, vol. 12, no. , pp. 542-555, 2013.