Data networks
Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
On the Dynamic Initialization of Parallel Computers
The Journal of Supercomputing
Randomized Initialization Protocols for Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Adaptive initialization algorithm for ad hoc radio networks with carrier sensing
Theoretical Computer Science
Initialization for ad hoc radio networks with carrier sensing and collision detection
ADHOC-NOW'06 Proceedings of the 5th international conference on Ad-Hoc, Mobile, and Wireless Networks
Adaptive initialization algorithm for ad hoc radio networks with carrier sensing
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
| Hi-index | 0.00 |
Although collision free TDMA schemes have been proposed and used for more than two decades, an important ingredient of these schemes, the initialization of stations (that is, assigning ID numbers 1,2,...,n) was not investigated until recently. Binary and n-ary partitioning algorithms were recently proposed for the case of stations with collision detection capability. The main contribution of this paper is a new randomized hybrid initialization protocol which combines the two partitioning algorithms into a more efficient one. The new scheme optimizes the binary partition protocol for small values of n (e.g. n=2, 3, 4). The hybrid scheme then applies n-ary partition protocol on the whole set, followed by binary partition on the stations that caused collision. We proved analytically that the expected number of time slots in the hybrid algorithm with known number of users is