Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks

Qadir, Junaid; Chou, Chun Tung; Misra, Archan

doi:10.1109/wowmom.2008.4594835

Cited by 24 publications

(46 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed algorithm, called a robust flooding algorithm in MR-MC WMNs (FAM), alleviates the broadcast storm problem and at the same time increases the reliability of flooding in MR-MC WMNs. Although flooding in MR-MC WMNs has already been studied in [22][23][24][25][26], our study differs from these previous studies in that we studied the reliability issue without making any assumption about link quality, whereas the previous studies either did not address the reliability issue [22][23][24] or addressed the reliability issue based on strong assumptions about link quality [25,26]. (We give a brief description of the previous studies in section II.…”

Section: Introductionmentioning

confidence: 93%

“…Some other studies [22,24] addressed the problem of minimizing the worst-case broadcast delay in MR 2 -MC WMNs (multi-radio multi-channel multi-rate WMNs). In [22], four heuristic algorithms that construct a low latency broadcast tree were proposed.…”

Section: Introductionmentioning

confidence: 99%

“…In [22], four heuristic algorithms that construct a low latency broadcast tree were proposed. The simulation results of this work showed the proposed algorithms achieved low latency close to the theoretical optimal, but the problem is that all these algorithms operate in a centralized fashion, which implies that they are not scalable with respect to the number of nodes.…”

Section: Introductionmentioning

confidence: 99%

“…The simulation results of this work showed the proposed algorithms achieved low latency close to the theoretical optimal, but the problem is that all these algorithms operate in a centralized fashion, which implies that they are not scalable with respect to the number of nodes. The authors of [24] presented a four-stage distributed algorithm whose basic idea is to construct a CDS (connected domination set) consisting of nodes that can cover all nodes in the network with relatively high rate transmissions and to build a low latency broadcast tree over this CDS.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A robust flooding algorithm in multi-radio multi-channel wireless mesh networks

Lee

Cho

Kwon

et al. 2010

2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

Abstract-Flooding, that is to deliver a packet from one node to all other nodes in the network, is an integral part of many wireless protocols. Flooding is often implemented by a series of broadcasts of each node and this causes some problems such as the broadcast storm and low reliability, by being engaged with the effects of radio signal propagation, e.g., multipath fading and interference. Many researchers have studied these problems over the years, however, most of these studies have been carried out assuming that all nodes in the network are equipped with a single radio interface and utilize only a single channel. This implies that most of the existing mechanisms that enhance the performance of flooding in wireless networks will not work in multi-radio multi-channel wireless mesh networks (MR-MC WMNs). Motivated by this, in this paper, we propose a flooding mechanism that works well in MR-MC WMNs. Our flooding mechanism, which can operate with an arbitrary number of radio interfaces and channels, increases the reliability of flooding while alleviates the broadcast storm problem, using only local information. Through a detailed simulation study, we demonstrate that our flooding mechanism improves both the reliability and the efficiency of flooding in MR-MC WMNs.

show abstract

Section: Introductionmentioning

confidence: 93%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A robust flooding algorithm in multi-radio multi-channel wireless mesh networks

Lee

Cho

Kwon

et al. 2010

2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

show abstract

“…The non-uniform channel availability (specially the possibility of unavailability of globally common channel) makes it hard to use single channel broadcast scheduling heuristics in CR networks. Qadir et al [6] studied the minimum-latency broadcast scheduling problem for multi-channel, multi-hop radio networks. They have proposed a set of centralized heuristic solutions to the problem.…”

Section: Related Workmentioning

confidence: 99%

Minimal Time Broadcasting in Cognitive Radio Networks

Arachchige

Venkatesan

Chandrasekaran

et al. 2011

Distributed Computing and Networking

View full text Add to dashboard Cite

Abstract. This paper addresses time-efficient broadcast scheduling problem in Cognitive Radio (CR) Networks. Cognitive Radio is a promising technology that enables the use of unused spectrum in an opportunistic manner. Because of the unique characteristics of CR technology, the broadcast scheduling problem in CR networks needs unique solutions. Even for single channel wireless networks, finding a minimum-length broadcast schedule is an NP-hard problem. In addition, the multi-channel nature of the CR networks, especially the nonuniform channel availability, makes it a more complex problem to solve. In this paper, we first present an Integer Linear Programming formulation (ILP) to determine the minimum broadcast schedule length for a CR network. We then present two heuristics to construct minimal length broadcast schedules. Comparison of optimal results (found by solving the ILP formulation) with the result of the heuristics through simulation shows that both heuristics produce schedules of either optimal or very closer to optimal lengths.

show abstract

Broadcasting in Multi-Radio Multi-Channel and Multi-Hop Wireless Networks

Qin

Zhang

2007

Real-Time Mobile Multimedia Services

View full text Add to dashboard Cite

Localized minimum-latency broadcasting in multi-radio multi-rate wireless mesh networks

Cited by 24 publications

References 16 publications

A robust flooding algorithm in multi-radio multi-channel wireless mesh networks

A robust flooding algorithm in multi-radio multi-channel wireless mesh networks

Minimal Time Broadcasting in Cognitive Radio Networks

Broadcasting in Multi-Radio Multi-Channel and Multi-Hop Wireless Networks

Contact Info

Product

Resources

About