Algorithm design for data communications in duty-cycled wireless sensor networks: A survey

Han, Kai; Luo, Jun; Liu, Yang; Vasilakos, Athanasios V.

doi:10.1109/mcom.2013.6553686

Cited by 187 publications

(83 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…From the results, we can see that the worst-case delay of the simulated protocols does not have significant difference, except for the case (10,60) where the delay of Searchlight outweighs the others. This is because approximating the duty cycle reciprocal 10 by a power-multiple 16 has a pronounced negative impact on the worst-case discovery delay.…”

Section: Performance In Single-channel Casementioning

confidence: 90%

“…Under duty cycling, each device alternates between active and sleeping modes by turning their radios on only periodically to achieve synchronization and save energy. Duty cycle refers to the fraction of time a device is in the active mode [2], [10]. For example, a device whose duty cycle is 1% activates during one time slot every 100 slots.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Chen¹,

Bian²,

Zheng³

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Neighbor discovery is of paramount importance in mobile sensing applications and is particularly challenging if the operating frequencies of mobile devices span multiple channels. In this paper, we formulate the multi-channel neighbor discovery problem and establish a theoretical framework of it, under which we derive the performance bound of any neighbor discovery protocol guaranteeing discovery. We then develop a multi-channel discovery protocol that achieves guaranteed discovery with orderminimum worst-case discovery delay and fine-grained control of energy conservation levels.

show abstract

Section: Performance In Single-channel Casementioning

confidence: 90%

Section: Introductionmentioning

confidence: 99%

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Chen¹,

Bian²,

Zheng³

2016

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…By simply synchronizing the timer of wireless sensors through exchanging periodic control packets, sensor nodes can meet each other within a certain amount of time. Diverse time synchronization mechanisms [21][22][23][24] are developed to address the neighbor discovery problem. However, this approach has a huge overhead for exchanging control messages between nodes at a regular interval of time.…”

Section: Asymmetric Neighbor Discovery Problemmentioning

confidence: 99%

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

Choi

2016

Sustainability

View full text Add to dashboard Cite

Abstract:Neighbor discovery is one of the emerging research areas in a wireless sensor network. After sensors are distributed, neighbor discovery is the first process to set up a communication channel with neighboring sensors. This paper proposes a new block design-based asymmetric neighbor discovery protocol for sensor networks. We borrow the concept of combinatorial block designs for our block combination scheme for neighbor discovery. First, we introduce an asymmetric neighbor discovery problem and define a target research question. Second, we propose a new asymmetric block design-based neighbor discovery protocol and explain how it works. Third, we analyze the worst-case neighbor discovery latency numerically between our protocol and some well-known protocols in the literature, and compare and evaluate the performance between the proposed protocol and others. Our protocol reveals that the worst-case latency is much lower than that of Disco and U-Connect. Finally, we conclude that the minimum number of slots per a neighbor schedule shows the lowest discovery time in terms of discovery latency and energy consumption.

show abstract

“…The methods and conclusion of the papers are taken as a basis for this paper. Han et al [9] surveyed data communication protocols in DS-WSNS and the survey can be served as motivations and inspiration for our research. Xiao et al [10] studied the underwater sensor networks according to the tight performance bounds of multihop fair access for MAC protocols.…”

Section: Introductionmentioning

confidence: 99%

An adaptive traffic MAC protocol based on correlation of nodes

Wang

2015

J Wireless Com Network

View full text Add to dashboard Cite

EA-MAC protocol is proposed on the basis of SMAC protocol to remedy the shortcomings of SMAC. In the EA-MAC, node correlation analysis algorithm and traffic adaptive duty cycle mechanism are added. Meanwhile, the residual energy is introduced into the existing traffic adaptive back-off mechanism to measure the saving efficiency. In the node correlation algorithm, all network nodes are divided into several areas by computing node correlation according to the collected information. The clustering mechanism is applied for choosing representative node in each area for transmitting data. This method can effectively reduce redundant nodes transmitting duplicate data. In traffic adaptive duty cycle mechanism, the duty cycle is regulated dynamically to decrease idle listening by comparing the threshold set with the flow value obtained from the predict flow model. In back-off mechanisms, by adjusting the value of contention window and back-off time, data collisions can be effectively avoided when network traffic is heavy. In addition, nodes with more remaining energy have priority to access the channel and have shorter back-off time, which can keep the balance of the whole network energy consumption and lengthen network lifetime. Simulation results show that the EA-MAC protocol has better energy saving, throughput, shorter delay performance, and low packet loss rate than that of SMAC protocol in dynamic traffic sensor networks.

show abstract

Algorithm design for data communications in duty-cycled wireless sensor networks: A survey

Cited by 187 publications

References 18 publications

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Never Live Without Neighbors: From Single- to Multi-Channel Neighbor Discovery for Mobile Sensing Applications

Asymmetric Block Design-Based Neighbor Discovery Protocol in Sensor Networks

An adaptive traffic MAC protocol based on correlation of nodes

Contact Info

Product

Resources

About