Alano: An Efficient Neighbor Discovery Algorithm in an Energy-Restricted Large-Scale Network

Shen, Tong; Wang, Yuexuan; Gu, Zhaoquan; Li, Dongda; Cao, Zhen; Cui, Heming; Lau, Francis C. M.

doi:10.1109/mass.2018.00058

Cited by 6 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The long tail phenomenon refers to the very slow growth rate when the CDF of the discovery latency approaches 100%. Shen et al [19] proposed Alano, based on the distribution of nodes, which enables low-latency neighbor discovery for large-scale networks. ALOHA-Like [20] analyzes the expected time for each node to discover all n-1 neighbors.…”

Section: A Probabilistic Neighbor Discovery Protocolsmentioning

confidence: 99%

Fedab: A Low-Latency Energy-Efficient Proactive Neighbor Discovery Protocol in MLDC-WSN

et al. 2023

View full text Add to dashboard Cite

Mobile Low-Duty-Cycle Wireless Sensor Network (MLDC-WSN) is a new type of wireless multi-hop network composed of sensor nodes that have mobility and sleep for a long time in a wireless self-organizing manner. Neighbor discovery protocols are used for sensor nodes to discover neighbor nodes within their communication range and can provide neighbor information to other protocols. MLDC-WSN uses low duty cycle technology to reduce energy consumption, and captures dynamic environmental information through the movement of nodes. However, the random mobility and long dormancy of nodes lead to frequent changes in the network topology, and nodes need to consume a lot of energy and time to discover all their neighbors. The sensor nodes are often powered by energy-limited batteries, and battery replacement is difficult. How to implement efficient neighbor discovery with low-latency and low-energy is a challenge of current research. Different from the previous slot model that couples the listening and transmitting of beacons in one slot, this paper proposes a new discovery schedule based on the slot model that separates the listening and transmitting of beacons. The discovery schedule can guarantee unidirectional discovery. And the node proactively transmits the beacon to accelerate bidirectional discovery after unilaterally discovering its neighbor nodes. On this basis, a proactive asynchronous neighbor discovery protocol called Fedab is proposed in this paper. Ignoring beacon collisions and other realistic interference factors, Fedab can enable neighbor discovery within the theoretical worst-case discovery latency. Moreover, Fedab is extended to the scenario where nodes perform different duty cycles, i.e., asymmetric scenarios. After experimental simulations and numerical analysis, the Fedab protocol has better performance compared to other existing neighbor discovery protocols.

show abstract

Section: A Probabilistic Neighbor Discovery Protocolsmentioning

confidence: 99%

Fedab: A Low-Latency Energy-Efficient Proactive Neighbor Discovery Protocol in MLDC-WSN

et al. 2023

View full text Add to dashboard Cite

show abstract

“…In recent years, wireless sensor networks have been extensively studied [1,[3][4][5][6][7][8][23][24][25][26][27][28]; as a cornerstone of constructing wireless sensor networks, increasingly sophisticated protocols for neighbor discovery have been proposed. These neighbor-discovery protocols mainly fall into two categories.…”

Section: Related Workmentioning

confidence: 99%

A Low-Latency and Energy-Efficient Neighbor Discovery Algorithm for Wireless Sensor Networks

Cao

Tian

et al. 2020

Sensors

Self Cite

View full text Add to dashboard Cite

Wireless sensor networks have been widely adopted, and neighbor discovery is an essential step to construct the networks. Most existing studies on neighbor discovery are designed on the assumption that either all nodes are fully connected or only two nodes compose the network. However, networks are partially connected in reality: some nodes are within radio range of each other, while others are not. Low latency and energy efficiency are two common goals, which become even more challenging to achieve at the same time in partially connected networks. We find that the collision caused by simultaneous transmissions is the main obstruction of achieving the two goals. In this paper, we present an efficient algorithm called Panacea to address these challenges by alleviating collisions. To begin with, we design Panacea-NCD (Panacea no collision detection) for nodes that do not have a collision detection mechanism. When n is large, we show the discovery latency is bounded by O ( n · ln n ) for any duty cycle (the percentage time to turn on the radio), where each node has n neighbors on average. For nodes that can detect collisions, we then present Panacea-WCD which also bounds the latency within O ( n · ln n ) slots. Finally, we conduct extensive evaluations and the results also corroborate our analyses.

show abstract

Function Virtualization Can Play a Great Role in Blockchain Consensus

et al. 2022

View full text Add to dashboard Cite

Alano: An Efficient Neighbor Discovery Algorithm in an Energy-Restricted Large-Scale Network

Cited by 6 publications

References 25 publications

Fedab: A Low-Latency Energy-Efficient Proactive Neighbor Discovery Protocol in MLDC-WSN

Fedab: A Low-Latency Energy-Efficient Proactive Neighbor Discovery Protocol in MLDC-WSN

A Low-Latency and Energy-Efficient Neighbor Discovery Algorithm for Wireless Sensor Networks

Function Virtualization Can Play a Great Role in Blockchain Consensus

Contact Info

Product

Resources

About