TY - GEN
T1 - A lightweight deterministic MAC protocol using low cross-correlation sequences
AU - Kim, Dongho
AU - Esteki, Danesh J.
AU - Hu, Yih Chun
AU - Kumar, P. R.
PY - 2011
Y1 - 2011
N2 - In traditional wireless networks, two nodes cannot simultaneously transmit their packets to each other with one radio device (having no machinery enabling full duplex). To ensure bidirectional communications, we need a medium access protocol to coordinate neighboring nodes' transmissions. Two conflicting design goals for the medium access protocol are the ease of implementation and performance guarantees. We propose a novel medium access protocol which is easily implementable (not requiring clock synchronization) and guarantees performance (the fraction of available slots). Our basic idea is to exploit a set of binary sequences having provably low cross-correlation. Each node has its own code sequence and determines whether to transmit or receive a packet by sequentially examining each bit of the code sequence. As an example, we consider the application of Gold code sequences and theoretically analyze the the fraction of available slots that a Gold-code- based MAC can provide. Our simulation verifies our analysis and shows that a Gold-code-based MAC guarantees the fraction of available slots even on a short time scale.
AB - In traditional wireless networks, two nodes cannot simultaneously transmit their packets to each other with one radio device (having no machinery enabling full duplex). To ensure bidirectional communications, we need a medium access protocol to coordinate neighboring nodes' transmissions. Two conflicting design goals for the medium access protocol are the ease of implementation and performance guarantees. We propose a novel medium access protocol which is easily implementable (not requiring clock synchronization) and guarantees performance (the fraction of available slots). Our basic idea is to exploit a set of binary sequences having provably low cross-correlation. Each node has its own code sequence and determines whether to transmit or receive a packet by sequentially examining each bit of the code sequence. As an example, we consider the application of Gold code sequences and theoretically analyze the the fraction of available slots that a Gold-code- based MAC can provide. Our simulation verifies our analysis and shows that a Gold-code-based MAC guarantees the fraction of available slots even on a short time scale.
UR - http://www.scopus.com/inward/record.url?scp=84863143188&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863143188&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2011.6134489
DO - 10.1109/GLOCOM.2011.6134489
M3 - Conference contribution
AN - SCOPUS:84863143188
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -