Open AccessPerformance improvement for IEEE 802.15.4 CSMA/CA scheme in large‐scale wireless multi‐hop sensor networks
Author(s) -
Zhu Jianping,
Tao Zhengsu,
Lv Chunfeng
Publication year - 2013
Publication title -
iet wireless sensor systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.433
H-Index - 27
eISSN - 2043-6394
pISSN - 2043-6386
DOI - 10.1049/iet-wss.2012.0079
Subject(s) - carrier sense multiple access with collision avoidance , hidden node problem , computer science , computer network , wireless sensor network , multiple access with collision avoidance for wireless , hop (telecommunications) , throughput , markov chain , energy consumption , wireless , routing (electronic design automation) , wireless network , routing protocol , optimized link state routing protocol , engineering , wi fi array , telecommunications , electrical engineering , machine learning
The hidden‐terminal problem and routing establishment or maintenance bring about a tremendous amount of energy consumption in multi‐hop wireless sensor networks (WSNs). In this study, the authors propose a carrier sense multiple access with collision avoidance (CSMA/CA) scheme MultiCSMA for multi‐hop WSNs adopting two strategies which refer to a novel hidden‐terminal list algorithm to avoid the impact of hidden terminals and a parallel access scheme to dispense with taking the routing overhead into account. The accurate statistical performance metrics of throughput and delay of unsaturated, unacknowledged IEEE 802.15.4 beacon enabled networks for one‐hop and two‐hop scenarios are predicted based on Markov models adopting these two improved strategies, in which nodes are assumed to locate randomly over a circle plane according to Poisson distribution. Comprehensive simulations demonstrate that the analysis results match well with the simulation results, and delay performance of the authors schemes is superior to those of other schemes, whereas throughput is superior to others for relative higher node density.