The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Selecting forwarding neighbors in wireless Ad Hoc networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
Optimized Broadcast Protocol for Sensor Networks
IEEE Transactions on Computers
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Six-Shot Broadcast: A Context-Aware Algorithm for Efficient Message Diffusion in MANETs
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Context-aware broadcasting approaches in mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
International Journal of Sensor Networks
Hi-index | 0.00 |
We consider the broadcasting problem in sensor networks where the nodes have no prior knowledge of their neighbourhood. We describe several Area-based Beaconless Broadcasting Algorithms (ABBAs). In 2D, on receiving the packet (together with geographic coordinates of the sender), each node calculates the ratio P of its perimeter, along the circle of transmission radius, that is not covered by this and previous transmissions of the same packet. The node then sets or updates its timeout to be inversely proportional to P. If the perimeter becomes fully covered, the node cancels retransmissions. Otherwise, it retransmits at the end of the timeout interval. The protocol is reliable, that is, all nodes, connected to the source, are guaranteed to receive the packet, assuming an ideal MAC layer. We also describe three 3D-ABBAs, one of them being reliable. These three protocols are based on covering three projections, covering particular points on intersection circles and covering intersection points of three spheres. Our protocols are the first reliable broadcasting protocols, other than blind flooding.