Improved randomized broadcast protocols in multi-hop radio networks

Lee, C.; Burns, James E.; Ammar, Mostafa

doi:10.1109/icnp.1993.340914

Cited by 11 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is however worth of summarizing some results for broadcasting that are for other environments. Works in [3,4,9,10,11,20] assume a packet-radio network environment. Most of these results rely on time division multiple access (TDMA, which requires timing synchronization) and certain levels of topology information.…”

Section: ×øö ømentioning

confidence: 99%

The broadcast storm problem in a mobile ad hoc network

Tseng

Chen

et al. 1999

Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking

2,211

1,534

View full text Add to dashboard Cite

×ØÖ ØBroadcasting is a common operation in a network to resolve many issues. In a mobile ad hoc network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently (such as finding a route to a particular host, paging a particular host, and sending an alarm signal). Because radio signals are likely to overlap with others in a geographical area, a straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, to which we refer as the broadcast storm problem. In this paper, we identify this problem by showing how serious it is through analyses and simulations. We propose several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcasts to alleviate this problem. Simulation results are presented, which show different levels of improvement over the basic flooding approach. Keywords: broadcast, communication, mobile ad hoc network (MANET), mobile computing, wireless network. Applications of MANETs occur in situations like battlefields or major disaster areas where networks need to be deployed immediately but base stations or fixed network infrastructures are not available. Unicast routing in MANET has been studied in several articles [6,7,14,15,23]. A working group called "manet" has been formed by the Internet Engineering Task Force (IETF) to study the related issues and stimulate research in MANET [21].This paper studies the problem of sending a broadcast message in a MANET. Broadcasting is a common operation in many applications, e.g., graph-related problems and distributed computing problems. It is also widely used to resolve many network layer problems. In a MANET in particular, due to host mobility, broadcastings are expected to be performed more frequently (e.g., for paging a particular host, sending an alarm signal, and finding a route to a particular host [6,14,15,23]). Broadcasting may also be used in LAN emulation [2] or serve as a last resort to provide multicast services in networks with rapid changing topologies.In this paper, we assume that mobile hosts in the MANET share a single common channel with carrier sense multiple access (CSMA), but no collision detection (CD), capability. Synchronization in such a network with mobility is unlikely, and global network topology information is unavailable to facilitate the scheduling of a broadcast. So one straightforward and obvious solution is broadcasting by flooding. Unfortunately, in this paper we observe that serious redundancy, contention, and collision could exist if flooding is done blindly. First, because the radio propagation is omnidirectional and a physical location may be covered by the transmission ranges of several hosts, many rebroadcasts are considered to be redundant. Second, heavy contention could exist because rebroadcasting hosts are probably close to each 1 other. Third, collisions are more likely to occur because the RTS/CTS dialogue is inapplicable and the timing of rebroadcasts is highly correlated.Coll...

show abstract

Section: ×øö ømentioning

confidence: 99%

The broadcast storm problem in a mobile ad hoc network

Tseng

Chen

et al. 1999

Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking

2,211

1,534

View full text Add to dashboard Cite

show abstract

“…Lee et al in [18] studied the multisource broadcast problem and designed a randomized algorithm. However, they did not derive any theoretical latency bound.…”

Section: Related Workmentioning

confidence: 99%

Multisource Broadcast in Wireless Networks

Huang

Iyengar

2012

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Nowadays, there is urgent demand for wireless sensor network applications. In these applications, usually a base station is responsible for monitoring the entire network and collecting information. If emergency happens, it will propagate such information to all other nodes. However, quite often the message source is not a fixed node, since there may be base stations in charge of different regions or events. Therefore, how to propagate information efficiently when message sources vary from time to time is a challenging issue. None of conventional broadcast algorithms can deal with this case efficiently, since the change of message source incurs a huge implementation cost of rebuilding a broadcast tree. To deal with this difficult problem, we make endeavor in studying multiple source broadcast, in which targeted algorithms should be source-independent to serve the practical need. In this paper, we formulate the Minimum-Latency Multisource Broadcast problem. We propose a novel solution using a fixed shared backbone, which is independent of the message sources and can be used repeatedly to reduce the broadcast latency. To the best of our knowledge, our work is deemed the first attempt to design such a multisource broadcast algorithm with a derived theoretical latency upper bound.

show abstract

“…The only related work that we are aware of is due to [3] in which the authors designed randomized routing protocols in ad hoc networks with the help of mobile agents roaming the network along random walks. In [8], randomization has also been applied to the problem of broadcasting in ad hoc wireless networks.…”

Section: Introductionmentioning

confidence: 99%