TY - GEN
T1 - Collision avoidance multiple access in wireless sensor networks
AU - Jianwei, Wang
AU - Yuping, Zhao
AU - Dong, Wang
AU - Korhonen, Timo
PY - 2007
Y1 - 2007
N2 - Collision avoidance multiple access plays an important role in wireless sensor networks, especially for those composed of nodes having a simple access protocol functionality. Numerous protocols have been proposed for wireless sensor networks during the past decades. However, the majority of these proposals require too much actions to be taken by sensor nodes, which makes the sensor nodes too complex. In this paper, we focus on the sensor networks composed of simple function nodes and presented novel collision avoidance multiple access algorithms. Both suggested algorithms are based on two functional stages: the channel allocation stage and the actual data transmission by using TDMA and/or CDMA. Simulation results indicate that our algorithms significantly improve communication efficiency via collision avoidance scheme, comparing to existing proposals. In reference to this improvement, we will also address user-fairness of our algorithms.
AB - Collision avoidance multiple access plays an important role in wireless sensor networks, especially for those composed of nodes having a simple access protocol functionality. Numerous protocols have been proposed for wireless sensor networks during the past decades. However, the majority of these proposals require too much actions to be taken by sensor nodes, which makes the sensor nodes too complex. In this paper, we focus on the sensor networks composed of simple function nodes and presented novel collision avoidance multiple access algorithms. Both suggested algorithms are based on two functional stages: the channel allocation stage and the actual data transmission by using TDMA and/or CDMA. Simulation results indicate that our algorithms significantly improve communication efficiency via collision avoidance scheme, comparing to existing proposals. In reference to this improvement, we will also address user-fairness of our algorithms.
UR - http://www.scopus.com/inward/record.url?scp=47849092603&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=47849092603&partnerID=8YFLogxK
U2 - 10.1109/ICNPCW.2007.4351539
DO - 10.1109/ICNPCW.2007.4351539
M3 - Conference contribution
AN - SCOPUS:47849092603
SN - 0769529437
SN - 9780769529431
T3 - Proceedings - 2007 IFIP International Conference on Network and Parallel Computing Workshops, NPC 2007
SP - 529
EP - 534
BT - Proceedings - 2007 IFIP International Conference on Network and Parallel Computing Workshops, NPC 2007
T2 - 2007 IFIP International Conference on Network and Parallel Computing Workshops, NPC 2007
Y2 - 18 September 2007 through 21 September 2007
ER -