TY - JOUR
T1 - Contention-free MAC protocols for wireless sensor networks
AU - Busch, Costas
AU - Magdon-Ismail, Malik
AU - Sivrikaya, Fikret
AU - Yener, Bülent
PY - 2004
Y1 - 2004
N2 - A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of such MAC protocol are: it should be distributed and contention-free (avoid collisions); it should self-stabilize to changes in the network (such as arrival of new nodes), and these changes should be contained, i.e., affect only the nodes in the vicinity of the change; it should not assume that nodes have a global time reference, i.e., nodes may not be time-synchronized. We give the first MAC protocols that satisfy all of these requirements, i.e., we give distributed, contention-free, self-stabilizing MAC protocols which do not assume a global time reference. Our protocols self-stabilize from an arbitrary initial state, and if the network changes the changes are contained and the protocol adjusts to the local topology of the network. The communication complexity, number and size of messages, for the protocol to stabilize is small (logarithmic in network size).
AB - A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of such MAC protocol are: it should be distributed and contention-free (avoid collisions); it should self-stabilize to changes in the network (such as arrival of new nodes), and these changes should be contained, i.e., affect only the nodes in the vicinity of the change; it should not assume that nodes have a global time reference, i.e., nodes may not be time-synchronized. We give the first MAC protocols that satisfy all of these requirements, i.e., we give distributed, contention-free, self-stabilizing MAC protocols which do not assume a global time reference. Our protocols self-stabilize from an arbitrary initial state, and if the network changes the changes are contained and the protocol adjusts to the local topology of the network. The communication complexity, number and size of messages, for the protocol to stabilize is small (logarithmic in network size).
UR - http://www.scopus.com/inward/record.url?scp=29844449219&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=29844449219&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30186-8_18
DO - 10.1007/978-3-540-30186-8_18
M3 - Article
AN - SCOPUS:29844449219
SN - 0302-9743
VL - 3274
SP - 245
EP - 259
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -