Virtual base station election for wireless sensor networks
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
Correction, generalisation and validation of the "max-min d-cluster formation heuristic"
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Collision-minimizing CSMA and its applications to wireless sensor networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We consider a network with N nodes competing for access to the channel using un-slotted ALOHA. When a request is sent, each node may answer after a certain backoff time. Only the first answer is of importance, that is why we want to minimize the loss rate of the first message. We derive the optimal backoff probability distribution which minimizes the collision probability on the first message answering toa request. Unlike previous works, we extract the collisionprobability in continuous time domain. To this goal, weuse a variational method. This problem had only be solvedbefore in a slotted context (i.e. discrete time domain), butwe want to be able to manage later situations where the nodes are not perfectly synchronized, which requires to know how to solve it in the continuous time context.