A novel energy-efficient neighbor discovery procedure in a wireless self-organization network

Wang, Yupeng; Yu, Zelong; Huang, Jun; Choi, Chang

doi:10.1016/j.ins.2018.06.004

Cited by 10 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides, sophisticated hardware tools were used to reach a good tradeoff between latency and duty cycle in [30], but it required a complicated internal mechanism and increased the network cost. Recently, more methods targeted at collision problems are proposed in [31][32][33][34], but they introduced overhead to assist for packet collision indication, which adds to the complexity of networks. In deterministic algorithms, radios are pre-scheduled to be "on" or "off" in each time slot based on some mathematical theorems to guarantee the discovery between every two neighbors.…”

Section: Related Workmentioning

confidence: 99%

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

Cao

Tian

et al. 2020

Sensors

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

Section: Related Workmentioning

confidence: 99%

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

Cao

Tian

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…It is 6.4% better than [108]. A new energy efficient DD procedure for self-organization D2D networks is proposed in [109], where power based fuzzy discovery data is achieved. The results analysis shows that distance error has 2% performance loss logically for 20% estimation distance error.…”

Section: Miscellaneousmentioning

confidence: 99%

“…For instance, if a device only includes active discovery resource unit for fast discovery, its discovery latency would be high in the dense areas. In recent work [109], the number of transmissions is enhanced as active slots. Further enhancement and analysis are left open.…”

Section: B Future Research Directionsmentioning

confidence: 99%

See 1 more Smart Citation

Device Discovery in D2D Communication: A Survey

et al. 2019

View full text Add to dashboard Cite

Device to Device (D2D) communication was first considered in out-band to manage energy issues in the wireless sensor networks. The primary target was to secure information about system topology for successive communication. Now the D2D communication has been legitimated in in-band by the 3rd Generation Partnership Project (3GPP). To initiate D2D communication, Device Discovery (DD) is a primary task and every D2D application benefits from DD as an end to end link maintenance and data relay when the direct path is obstructed. The DD is facing new difficulties because of the mobility of the devices over static systems, and the mobility makes it more challenging for D2D communication. For in-band D2D, DD in a single cell and multi-cell, and dense area is not legitimated properly, causing latency, inaccuracy, and energy consumption. Among extensive studies on limiting energy consumption and latency, DD is one of the essential parts concentrating on access and communication. In this paper, a comprehensive survey on DD challenges, for example single cell/multi-cell and dense area DD, energy consumption during discovery, discovery delay, and discovery security, etc., has been presented to accomplish an effective paradigm of D2D networks. In order to undertake the device (user) needs, an architecture has been projected, which promises to overwhelm the various implementation challenges of DD. The paper mainly focuses on DD taxonomy and classification with an emphasis on discovery procedures and algorithms, a summary of advances and issues, and ways for potential enhancements. For ensuring a secure DD and D2D, auspicious research directions have been proposed, based on taxonomy.

show abstract

Multi-user Shared Access (MUSA) procedure for device discovery in D2D communication

2020

View full text Add to dashboard Cite

A novel energy-efficient neighbor discovery procedure in a wireless self-organization network

Cited by 10 publications

References 8 publications

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

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

Device Discovery in D2D Communication: A Survey

Multi-user Shared Access (MUSA) procedure for device discovery in D2D communication

Contact Info

Product

Resources

About