Minimum-Latency Beaconing Schedule in Multihop Wireless Networks

Wan, Peng‐Jun; Xu, Xiaoli; Wang, L.; Jia, Xiaohua; Park, E. K.

doi:10.1109/infcom.2009.5062160

Cited by 12 publications

(12 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When ρ > 1, we have Clearly, h (ρ) is continuous. It was proved in [8] that arccos ρ−1 2ρ − arcsin 1 ρ strictly increases with ρ. Thus, h (ρ) is also strictly increasing.…”

Section: B Proof Of Theoremmentioning

confidence: 99%

Approximate Capacity Subregions of Uniform Multihop Wireless Networks

Wan

Wang

Huang

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-The capacity region of multihop wireless network is involved in many capacity optimization problems. However, the membership of the capacity region is NP-complete in general, and hence the direct application of capacity region is quite limited. As a compromise, we often substitute the capacity region with a polynomial approximate capacity subregion. In this paper, we construct polynomial μ-approximate capacity subregions of multihop wireless network under either 802.11 interference model or protocol interference model in which all nodes have uniform communication radii normalized to one and uniform interference radii ρ ≥ 1. The approximation factor μ decreases with ρ in general and is smaller than the best-known ones in the literature. For example, μ = 3 when ρ ≥ 2.2907 under the 802.11 interference model or when ρ ≥ 4.2462 under the protocol interference model. Our construction exploits a nature of the wireless interference called strip-wise transitivity of independence discovered in this paper and utilize the independence polytopes of cocomparability graphs in a spatial-divide-conquer manner. We also apply these polynomial μ-approximate capacity subregions to compute μ-approximate solutions for maximum (concurrent) multiflows.

show abstract

“…When ρ > 1, we have Clearly, h (ρ) is continuous. It was proved in [8] that arccos ρ−1 2ρ − arcsin 1 ρ strictly increases with ρ. Thus, h (ρ) is also strictly increasing.…”

Section: B Proof Of Theoremmentioning

confidence: 99%

Approximate Capacity Subregions of Uniform Multihop Wireless Networks

Wan

Wang

Huang

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

show abstract

“…However, they did not derive any theoretical latency bound. Related problems such as beaconing, gossiping, and dominating set construction were studied in [19], [20], and [21], respectively. To the best of our knowledge, this work is the first attempt to design a multisource broadcast algorithm with a proven 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

“…Variants of MLBS have been studied since the mid-1980s [2], [3], [4], [8], [9], [13], [11], [12], [14], [15]. All the prior works assumed either implicitly or explicitly the protocol interference model.…”

Section: Introductionmentioning

confidence: 99%

“…All prior works except [14] assumed implicitly that all nodes also have unit interference radius. In other words, each node has equal the interference radius and beaconing radius, both of which are equal to one.…”

Section: Introductionmentioning

confidence: 99%

“…A classic greedy coloring algorithm due to [7] was adopted by Sen and Malesinska [12] to produce a beaconing schedule, whose approximation bound was shown to be 7 by Wan et al [15]. Recently, Wan et al [14] considered a slightly more general scenario in which all nodes have uniform interference radius of arbitrary value ρ ≥ 1. They proposed a different algorithm with approximation bound ranging from 3 to 6 depending on the value of ρ.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

First-Fit Scheduling for Beaconing in Multihop Wireless Networks

Wan

Wang

et al. 2010

2010 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Abstract-Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed in synchronous time-slots and each node can transmit at most one fixed-size packet in each time-slot. The problem Minimumlatency beaconing schedule (MLBS) in multihop wireless networks seeks a shortest schedule for beaconing subject to the interference constraint. MLBS has been intensively studied since the mid-1980s, but all assume the protocol interference model with uniform interference radii. In this paper, we first present a constant-approximation algorithm for MLBS under the protocol interference model with arbitrary interference radii. Then, we develop a constant-approximation algorithm for MLBS under the physical interference model. Both approximation algorithms have efficient implementations in a greedy first-fit manner.

show abstract

Minimum-Latency Beaconing Schedule in Multihop Wireless Networks

Cited by 12 publications

References 14 publications

Approximate Capacity Subregions of Uniform Multihop Wireless Networks

Approximate Capacity Subregions of Uniform Multihop Wireless Networks

Multisource Broadcast in Wireless Networks

First-Fit Scheduling for Beaconing in Multihop Wireless Networks

Contact Info

Product

Resources

About