Efficient group-based discovery for wireless sensor networks
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 discov...
Saved in:
Main Authors: | Pengpeng Chen, Ying Chen, Shouwan Gao, Qiang Niu, Jun Gu |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2017-07-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1177/1550147717719056 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An Improved Group-Based Neighbor Discovery Algorithm for Mobile Sensor Networks
by: Qiang Niu, et al.
Published: (2014-04-01) -
Survey: Discovery in Wireless Sensor Networks
by: Valerie Galluzzi, et al.
Published: (2012-01-01) -
Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks
by: Woosik Lee, et al.
Published: (2019-01-01) -
Energy Efficient Tree-Based Routing Algorithm for Wireless Sensor Networks
by: Ni Chen, et al.
Published: (2025-01-01) -
An Efficient Secure Data Aggregation Based on Homomorphic Primitives in Wireless Sensor Networks
by: Qiang Zhou, et al.
Published: (2014-01-01)