Abstract

Super dense and distributed wireless sensor networks have become very popular with the development of small cell technology, Internet of Things (IoT), Machine-to-Machine (M2M) communications, Vehicular-to-Vehicular (V2V) communications and public safety networks. While densely deployed wireless networks provide one of the most important and sustainable solutions to improve the accuracy of sensing and spectral efficiency, a new channel access scheme needs to be designed to solve the channel congestion problem introduced by the high dynamics of competing nodes accessing the channel simultaneously. In this paper, we firstly analyzed the channel contention problem using a novel normalized channel contention analysis model which provides information on how to tune the contention window according to the state of channel contention. We then proposed an adaptive channel contention window tuning algorithm in which the contention window tuning rate is set dynamically based on the estimated channel contention level. Simulation results show that our proposed adaptive channel access algorithm based on fast contention window tuning can achieve more than of the theoretical optimal throughput and of fairness index especially in dynamic and dense networks.

Highlights

  • Distributed Wireless Sensor Networks (WSNs) play an important role of monitoring and sensing wide-range of environmental parameters in the current and future surveillance systems

  • We focus on analyzing carrier sense multiple access with collision avoidance (CSMA/CA) based channel access and contention problem, and proposing a new channel accessing algorithm which is adaptive to the dynamics of the contending nodes

  • Because smaller contention window tuning rate is required in sparse deployed networks and the throughput of Binary Exponential Backoff (BEB) declines severely when the number of contending nodes reaches 20, we focus on the performance of idle sense algorithm and our proposed algorithm with parameters of (γ = 1.2, M = 10), (γ = 1.8, M = 6), (γ = 1.2, M = 1) and (γ = 1.8, M = 1)

Read more

Summary

Introduction

Distributed Wireless Sensor Networks (WSNs) play an important role of monitoring and sensing wide-range of environmental parameters in the current and future surveillance systems. We focus on analyzing CSMA/CA based channel access and contention problem, and proposing a new channel accessing algorithm which is adaptive to the dynamics of the contending nodes. Without estimating the exact number of contending nodes, the proposed algorithms try to tune the contention window according to whether the estimated channel state parameter is optimal or not. These methods can effectively improve the network throughput when the number of contending nodes is very large.

Normalized Channel Contention Analysis
Model Construction
Model Verification
Case 1
Case 2
Case 3
The Analysis of System Throughput
Model Evaluation
Adaptive Multi-Level Contention Window Tuning Algorithm
Basic Contention Window Tuning under Normalized Model
Algorithm Design
The Selection of M
Performance Evaluation of M-level Contention Window Tuning Algorithm
KB 224 bit 160 bit 112 bit 112 bit
Simulations in Sparse Networks
Performance in Super Dense Networks
Simulations in Very Dynamic Super Dense Networks
Findings
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.