Author
Listed:
- Jianping Zhu
- Chunfeng Lv
- Zhengsu Tao
Abstract
Most of analyses for the IEEE 802.15.4 Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) scheme for multi-hop wireless sensor networks (WSNs) focus on how to avoid the impacts of hidden terminal problems rather than how to derive the exact multi-hop characters. In this paper, we propose a novel analysis model to analyze and improve the behaviors of multi-hop WSNs touching upon both avoiding the impacts of hidden terminals and acquiring the exact multi-hop behaviors. At first, a novel Hidden Terminal Couple (HTC) algorithm is proposed to avoid the impacts of hidden terminals, and a parallel access scheme is proposed to dispense with taking the routing overhead into account. Along with these two strategies, the accurate statistical performance metrics of throughput and delay of unsaturated, unacknowledged IEEE 802.15.4 beacon-enabled networks for 1-hop and 2-hop scenarios are then predicted based on the models which contains n modified semi-Markov chains and one macro-Markov chain, in which nodes are assumed to locate randomly over a circle plane according to Poisson distribution. Moreover, performance comparisons between our scheme (called HTC scheme) and other multi-hop CSMA/CA schemes which involve hidden terminal avoiding are also proposed. Comprehensive NS-2 simulations demonstrate that the analysis results of these models match well the simulation results, especially for larger transmission range and relatively higher node density. Besides, the analysis and comparison results show that delay behavior of HTC is improved largely relatively to other schemes, while throughput performance is improved in some cases of more node density and larger transmission range.
Suggested Citation
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:9:y:2013:i:11:p:452423. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.