Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
ESRT: event-to-sink reliable transport in wireless sensor networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Computers
Optimized Broadcast Protocol for Sensor Networks
IEEE Transactions on Computers
IEEE Transactions on Mobile Computing
IEEE/ACM Transactions on Networking (TON)
RBP: robust broadcast propagation in wireless networks
Proceedings of the 4th international conference on Embedded networked sensor systems
ATPC: adaptive transmission power control for wireless sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
GARUDA: Achieving Effective Reliability for Downstream Communication in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Agent-based multicast opportunistic routing protocol for wireless networks
Proceedings of the 2nd ACM workshop on High performance mobile opportunistic systems
Hi-index | 0.24 |
In wireless sensor networks, many communication protocols and applications rely on flooding for various networking purposes. Prior efforts focus on how to design efficient flooding algorithms; that is, they seek to achieve full reliability while reducing the number of redundant broadcasting across the network. To achieve efficient flooding, most of the existing protocols try to reduce the number of transmissions, which is decided without considering any online transmission result. In this paper, we propose a probabilistic and opportunistic flooding algorithm that controls rebroadcasts and retransmissions opportunistically. It seeks to achieve a target reliability required by an application. For this purpose, it makes a given node select only the subset of its one-hop neighbors to rebroadcast the same message. It considers node relations such as link error rates among nodes in selecting eligible neighbors to rebroadcast. The sender controls the number of retransmissions opportunistically by tracking the current status of message reception at its neighbors. Simulation is carried out to reveal that our proposed scheme achieves the given target reliability with less overhead than other flooding algorithms in most cases, thus prolonging the network lifetime.