Comparing random access protocols in UWB based wireless sensor networks

Author(s):  
Leonardo Goratti ◽  
Jussi Haapola ◽  
Alberto Rabbachin
Author(s):  
Elias Yaacoub

Wireless sensor networks consisting of several sensors deployed in a given area, under an internet of things (IoT) paradigm, are considered. Sensor nodes may or may not be close enough to communicate with each other in order to perform collaborative transmissions. A communication protocol based on random access and orthogonal frequency division multiple access (OFDMA) is proposed in order to allow the sensors to operate autonomously by transmitting their measured data to a central processing system, where it is processed and analyzed. Whenever it has data to transmit, each sensor independently accesses a time-frequency slot in a probabilistic manner to avoid collisions. A controlling entity, e.g., a central base station (BS) covering a certain sensor deployment area receives the sensor transmissions and provides synchronization information by periodically transmitting a pilot signal over the available OFDMA subcarriers. Sensors use this signal for channel quality estimation. Results show that this approach performs well in terms of transmission data rates and collision probability.


2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Xinyan Xu ◽  
Fan Zhang ◽  
Gangqiang Yang ◽  
Liguo Xie ◽  
Qing Liu ◽  
...  

In wireless sensor networks, an improved throughput capacity region can be achieved by equipping multiple channels. However, such approach inevitably brings the issue of solving the coupled channel assignment and scheduling problem. This paper put forward a low-complexity distributed channel assignment and scheduling policy for multichannel wireless sensor networks with single-hop traffic flows, named LDCS, as well as its multihop multipath extension. Under the proposed algorithms, random access and backoff time techniques are introduced to keep the complexity low and independent of the number of links and channels. Through theoretical analysis and simulation experiments, it is proved that the proposed algorithms are throughput guaranteed, and in some network scenarios, the achieved capacity region can be larger than that of other comparable distributed algorithms.


Sign in / Sign up

Export Citation Format

Share Document