On multipacket reception based neighbor discovery in low-duty-cycle wireless sensor networks

Software defined networks brings greater flexibility to networks and therefore generates new vitality. Thanks to the ability to update soft code to sensor nodes, wireless sensor networks (WSNs) brings profound changes to Internet of Things. However, it is a challenging issue to minimize delay and transmission times and maintain long lifetime when broadcasting data packets in high loss ratio and low duty cycle WSNs. Although there have been some research concerning code dissemination, those schemes can only achieve a tradeoff between different performances, instead of optimizing all these important performances at the same time. Therefore, in this paper we propose a new strategy that can reduce delay and transmission times simultaneously. In traditional method, the broadcasting nature of wireless communication is not sufficiently utilized. By allowing sons of the same parent node to share awake slots, the broadcasting nature is well exploited and delay is thus reduced as well as transmission times with lifetime not affected. And, as we discover there is energy surplus when collecting data in area away from sink, we further improve this strategy so that all the performances can be further bettered. Compared with traditional method, the methods we design (IFAS, BTAS and AAPS) can respectively reduce delay by 20.56%, 31.59%, 55.16% and reduce transmission times by 29.53%, 43.93%, 42.04%, while not reducing lifetime.

Download Full-text

Measurement and design on data collection of low-duty cycle wireless sensor networks

10.14711/thesis-b1255211 ◽

2013 ◽

Author(s):

Zhichao Cao

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Data Collection ◽

Duty Cycle ◽

Wireless Sensor ◽

Low Duty Cycle

Download Full-text

Improving Transmission Delay with Sink Location in Low-Duty-Cycle Wireless Sensor Networks

International Journal of Ad Hoc and Ubiquitous Computing ◽

10.1504/ijahuc.2017.10005520 ◽

2017 ◽

Vol 25 (1) ◽

pp. 1

Author(s):

Yu Yuan Lin

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Duty Cycle ◽

Transmission Delay ◽

Wireless Sensor ◽

Low Duty Cycle ◽

Sink Location

Download Full-text

A Low Duty Cycle MAC Protocol for Directional Wireless Sensor Networks

Wireless Personal Communications ◽

10.1007/s11277-016-3728-4 ◽

2016 ◽

Vol 96 (4) ◽

pp. 5035-5059 ◽

Cited By ~ 4

Author(s):

Fernaz Narin Nur ◽

Selina Sharmin ◽

Md. Abdur Razzaque ◽

Md. Shariful Islam ◽

Mohammad Mehedi Hassan

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Duty Cycle ◽

Mac Protocol ◽

Wireless Sensor ◽

Low Duty Cycle

Download Full-text

Efficient group-based discovery for wireless sensor networks

International Journal of Distributed Sensor Networks ◽

10.1177/1550147717719056 ◽

2017 ◽

Vol 13 (7) ◽

pp. 155014771771905 ◽

Cited By ~ 1

Author(s):

Pengpeng Chen ◽

Ying Chen ◽

Shouwan Gao ◽

Qiang Niu ◽

Jun Gu

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

High Mobility ◽

Wireless Sensor ◽

Relative Distance ◽

Neighbor Discovery ◽

Trade Off ◽

Low Duty Cycle ◽

Order Of Magnitude

Due to the combination of constrained power, low duty cycle, and high mobility, neighbor discovery is one of the most challenging problems in wireless sensor networks. Existing discovery designs can be divided into two types: pairwise-based and group-based. The former schemes suffer from high discovery delay, while the latter ones accelerate the discovery process but incur too much energy overhead, far from practical. In this article, we propose a novel efficient group-based discovery method based on relative distance, which makes a delicate trade-off between discovery delay and energy consumption. Instead of directly referring to the wake-up schedules of a whole group of nodes, efficient group-based discovery selectively recommends nodes that are most likely to be neighbors, in which the probability is calculated based on the nodes’ relative distance. Moreover, the sequence of received signal strengths are employed to estimate the relative distance for avoiding the effect of the node distribution. Extensive simulations are conducted to verify the effectiveness of the design. The results indicate that efficient group-based discovery statistically achieves a good trade-off between energy cost and discovery latency. Efficient group-based discovery also shows one order of magnitude reduction in discovery delay with a maximum of 6.5% increase in energy consumption compared with typical discovery methods.

Download Full-text