A lower bound for radio broadcast
Journal of Computer and System Sciences
A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
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
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Multipoint Relaying for Flooding Broadcast Messages in Mobile Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Information Processing Letters
Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
MISTRAL: efficient flooding in mobile ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON)
RMTP: a reliable multicast transport protocol
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Flooding in wireless ad hoc networks
Computer Communications
A comparison of sender-initiated and receiver-initiated reliable multicast protocols
IEEE Journal on Selected Areas in Communications
Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks
Journal of Parallel and Distributed Computing
A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
A graph coloring based service discovery in ad hoc networks
Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
Chorus: collision resolution for efficient wireless broadcast
INFOCOM'10 Proceedings of the 29th conference on Information communications
Stochastic broadcast for VANET
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Realizing and benchmarking broadcast algorithms in wireless mesh networks
Computer Communications
Tree-based double-covered broadcast for wireless ad hoc networks
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
RNBB: a reliable hybrid broadcasting algorithm for ad-hoc networks
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
On the behavior of broadcasting protocols for MANETs under omission faults scenarios
LADC'07 Proceedings of the Third Latin-American conference on Dependable Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The broadcast operation, as a fundamental service in mobile ad hoc networks (MANETs), is prone to the broadcast storm problem if forwarding nodes are not carefully designated. The objective of reducing broadcast redundancy while still providing high delivery ratio under high transmission error rate is a major challenge in MANETs. In this paper, we propose a simple broadcast algorithm, called double-covered broadcast (DCB), which takes advantage of broadcast redundancy to improve the delivery ratio in an environment that has rather high transmission error rate. Among the 1-hop neighbors of the sender, only selected forwarding nodes retransmit the broadcast message. Forwarding nodes are selected in such a way that 1) the sender's 2-hop neighbors are covered and 2) the sender's 1-hop neighbors are either forwarding nodes or nonforwarding nodes covered by at least two forwarding neighbors. The retransmissions of the forwarding nodes are received by the sender as the confirmation of their reception of the packet. The nonforwarding 1-hop neighbors of the sender do not acknowledge the reception of the broadcast. If the sender does not detect all its forwarding nodes' retransmissions, it will resend the packet until the maximum number of retries is reached. Simulation results show that the proposed broadcast algorithm provides good performance under a high transmission error rate environment.