Broadcasting with Least Redundancy in Wireless Sensor Networks
In wireless sensor networks (WSN), broadcasting could allow the nodes to share their data efficiently. Due to the limited energy supply of each sensor node, it has become a crucial issue to minimize energy consumption and maximize the network lifetime in the design of broadcast protocols. In this pa...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-12-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2012/957606 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In wireless sensor networks (WSN), broadcasting could allow the nodes to share their data efficiently. Due to the limited energy supply of each sensor node, it has become a crucial issue to minimize energy consumption and maximize the network lifetime in the design of broadcast protocols. In this paper, we propose a Broadcast Algorithm with Least Redundancy (BALR) for WSN. By identifying the optimized number of induced forwarders as 2, BALR establishes a weighted sum model, taking both rebroadcast efficiency and residual energy into consideration, as a new metric to compute the self-delay of the nodes before rebroadcasting. BALR further incorporates both strategies based on distance and coverage degree which means the number of neighbors that have not yet received the broadcast packet, to optimize the rebroadcast node selections. To reveal the performance bounds, rebroadcast ratios in the ideal and worst case are theoretically analyzed, indicating that the rebroadcast ratio of BALR decreases with the increase of node density. BALR can significantly prolong the network lifetime of WSN and is scalable with respect to network size and node density, as demonstrated by simulations. |
|---|---|
| ISSN: | 1550-1477 |