Lightning: A High-Efficient Neighbor Discovery Protocol for Low Duty Cycle WSNs

Wei, Liangxiong; Zhou, Beisi; Ma, Xichu; Chen, Dexin; Zhang, Jing Yu; Peng, Jian; Luo, Qian; Sun, Limin; Li, Dingcheng; Chen, Liangyin

doi:10.1109/lcomm.2016.2536018

Cited by 38 publications

(36 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many asynchronous neighbor discovery algorithms have emerged in recent years. Based on whether the discovery latency is finite or not, existing pairwise asynchronous protocols are divided into the probabilistic algorithms [12,19,20] and deterministic ones [8,[21][22][23][24][25][26][27][28].…”

Section: Related Workmentioning

confidence: 99%

“…The later researchers find that employing unequal-sized slots can obtain good discovery performance. Searchlight-Striped [7], Non-integer [25] and Lightning [26] are included. There are other related methods, i.e., block-based methods [8,27] and Nihao [28].…”

Section: Related Workmentioning

confidence: 99%

“…Quorum-based [21,22,29]; Prime-based: Disco [23], U-connect 2 [24]; Searchlight [7]; Unequal-sized Slot methods [7,25,26]; Block-based [8,27]; middleware methods WiFlock [13], Acc 3 [14], EQS 4 [9], Group [10] 1 prime-set-based algorithm; 2 unified connect; 3 on-demand accelerations; 4 extended quorum systems.…”

Section: Sub-categories Main Workmentioning

confidence: 99%

See 2 more Smart Citations

A Fast Neighbor Discovery Algorithm in WSNs

Wei¹,

Sun²,

Chen³

et al. 2018

Computer Supported Cooperative Work and Social Computing

Self Cite

View full text Add to dashboard Cite

With the quick development of Internet of Things (IoT), one of its important supporting technologies, i.e., wireless sensor networks (WSNs), gets much more attention. Neighbor discovery is an indispensable procedure in WSNs. The existing deterministic neighbor discovery algorithms in WSNs ensure that successful discovery can be obtained within a given period of time, but the average discovery delay is long. It is difficult to meet the need for rapid discovery in mobile low duty cycle environments. In addition, with the rapid development of IoT, the node densities of many WSNs greatly increase. In such scenarios, existing neighbor discovery methods fail to satisfy the requirement in terms of discovery latency under the condition of the same energy consumption. This paper proposes a group-based fast neighbor discovery algorithm (GBFA) to address the issues. By carrying neighbor information in beacon packet, the node knows in advance some potential neighbors. It selects more energy efficient potential neighbors and proactively makes nodes wake up to verify whether these potential neighbors are true neighbors, thereby speeding up neighbor discovery, improving energy utilization efficiency and decreasing network communication load. The evaluation results indicate that, compared with other methods, GBFA decreases the average discovery latency up to 10.58% at the same energy budget.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Fast Neighbor Discovery Algorithm in WSNs

Wei¹,

Sun²,

Chen³

et al. 2018

Computer Supported Cooperative Work and Social Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, in recent years, we find a few of neighbor discovery algorithms that are based on directional antennas. The existing works can broadly be categorized in two types: one-way broadcasting mechanisms [22][23][24][25][26][27] and two-or three-way handshaking mechanisms [11,13,14,[28][29][30].…”

Section: Related Workmentioning

confidence: 99%

“…The node that receives a HELLO message checks its neighbor table to find whether the node is discovered earlier or not. If there exists a record, the node checks the flag value and if the value is 1, it does not give any REPLY message to that node assuming that it has exchanged messages in the earlier slots with that node; otherwise, it updates the information in the neighbor table and sends a REPLY message in a random sub-slot to the direction of the sender node (lines [15][16][17][18][19][20][21][22]. If the sender node receives a REPLY message (without any collision) from any neighbor, it adds the node in the neighbor table (lines [8][9][10][11][12].…”

Section: Indirect Discoverymentioning

confidence: 99%

Collaborative neighbor discovery in directional wireless sensor networks: algorithm and analysis

Nur

Sharmin

Habib

et al. 2017

J Wireless Com Network

View full text Add to dashboard Cite

In directional wireless sensor networks (DSNs), sensor nodes with directional antennas provide extended network lifetime and better coverage performance. However, one of the key challenges of directional nodes is to discover their neighbors due to difficulty in achieving synchronization among their directed transmissions and receptions. Existing solutions suffer from high discovery latency and poor percentage of neighbor discovery either due to lack of proper coordination or centralized management of the discovery operation. In this work, we develop a collaborative neighbor discovery (COND) mechanism for DSNs. Each COND node polls to directly discover its neighbors in a distributed way and collaborates with the already discovered nodes so as to allow indirect discovery. It helps to increase the neighbor discovery performance significantly. A Markov chain-based analytical model is developed to quantify theoretical performances of the proposed COND system. The performance of the COND system is evaluated in Network Simulator Version 3, and simulation results reveal that it greatly reduces the discovery latency and increases neighbor discovery ratio compared to state-of-the-art approaches.

show abstract