Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
Discrete Mathematics
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Mellin transforms and asymptotics: harmonic sums
Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with No Collision Detection
IEEE Transactions on Parallel and Distributed Systems
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Monitoring churn in wireless networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Time-optimal information exchange on multiple channels
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Monitoring churn in wireless networks
Theoretical Computer Science
| Hi-index | 0.00 |
Radio networks (RN) are distributed systems (ad hoc networks) consisting in n=2 radio stations. Assuming the number n unknown, two distinct models of RN without collision detection (no-CD) are addressed: the model with weak no-CD RN and the one with strong no-CD RN. We design and analyze two distributed leader election protocols, each one running in each of the above two (no-CD RN) models, respectively. Both randomized protocols are shown to elect a leader within O(log(n)) expected time, with no station being awake for more than O(loglog(n)) time slots (such algorithms are said to be energy-efficient). Therefore, a new class of efficient algorithms is set up that match the @W(log(n)) time lower-bound established by Kushilevitz and Mansour [E. Kushilevitz, Y. Mansour, An @W(Dlog(N/D)) lower-bound for broadcast in radio networks, SIAM J. Comp. 27 (1998) 702-712).].