Sciweavers

Share
DIALM
2004
ACM

Batch conflict resolution algorithm with progressively accurate multiplicity estimation

9 years 6 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc. The communication tasks in such wireless networks often involve an inquiry over a shared channel, which can be invoked for: discovery of neighboring devices in ad hoc networks, counting the number of active sensors in sensor networks, estimating the mean value contained in a group of sensors etc. Such inquiry solicits replies from possibly large number of terminals n. This necessitates the usage of algorithms for resolving batch conflicts with unknown conflict multiplicity n. In this paper we present a novel approach to the batch conflict resolution. We show how the conventional tree algorithms for conflict resolution can be used to obtain progressively accurate estimation of the multiplicity. We use the estimation to propose a more efficient binary tree algorithm, termed Estimating Binary Tree (EBT) algorit...
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where DIALM
Authors Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
Comments (0)
books