A Minimized Latency Broadcast in Multi-Rate Wireless Mesh Networks: Distributed Formulation and Rate First Algorithm

Wang, Tai; Li, Bo; Yang, Zhen; Cheng, Wenqing

doi:10.1109/icme.2007.4285018

Cited by 4 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…within one frame. From the above, the interference constraint (11) allows nodes within each other's interference range to finish their transmissions within one frame, and the NIC constraint (12) allows every node to finish their transmission in different channels with multiple NICs within one frame, we can conclude that the required time fractions is schedulable. ■ IV.…”

Section: Widest Spanning Tree Formationmentioning

confidence: 98%

“…Theorem 1: The required time fractions must be schedulable if the interference constraint (11) and NIC constraint (12) are not violated.…”

Section: Widest Spanning Tree Formationmentioning

confidence: 99%

“…Though the results in [9][10][11][12][13][14] are interesting, broadcast latency only measures packet-level end-to-end delay performance. For applications involved large file/content transfer, content update time is of paramount importance.…”

Section: Introductionmentioning

confidence: 98%

“…Some recent research work focuses on minimizing the broadcast latency in a wireless network using multiple transmission rates [9][10][11][12][13][14]. Broadcast latency is defined as the maximum time required for transmitting one packet from the root to all other nodes.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks

Chiu

Yeung

et al. 2008

2008 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

Efficient broadcast schemes are essential in wireless mesh networks (WMNs) for minimizing the content update time. In this paper, we consider the widest spanning tree problem in a multi-channel multi-interface WMN, where the width of a tree is determined by the bottleneck link bandwidth. To the best of our knowledge, we present the first effort in solving the widest spanning tree problem using mathematical formulation. In our model, we jointly consider and solve the problems of channel assignment, routing, scheduling and server/root placement. Unlike other spanning tree approaches, we allow WMN nodes to have heterogeneous number of network interface cards (NICs), and multiple NICs of a node can share the same assigned set of channels. To find a practical schedule, we also introduce the channel conflict graph and NIC constraint graph, and show that the associated scheduling problem is equivalent to the classic graph coloring problem.

show abstract

Section: Widest Spanning Tree Formationmentioning

confidence: 98%

“…Theorem 1: The required time fractions must be schedulable if the interference constraint (11) and NIC constraint (12) are not violated.…”

Section: Widest Spanning Tree Formationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks

Chiu

Yeung

et al. 2008

2008 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…, n} such that γ h=1 |A h | max j∈A h {r j } ≤ 1.10 n j=1 r j . A vaguely related problem studied in the literature in the context of radio broadcasting is that of distributing in a fast and efficient manner a common content to all sensors/endusers [3]- [6]. In [3], a low-latency multi-hop multi-rate broadcast has been addressed in a wireless mesh network, where each node can reach its neighbors at different rates.…”

Section: Introductionmentioning

confidence: 99%

Algorithms for Services with Multiple Levels of Quality

Navarra

Palazzo

Pinotti

et al. 2016

2016 30th International Conference on Advanced Information Networking and Applications Workshops (WAINA)

View full text Add to dashboard Cite

We consider the problem of serving a set of sensors/end-users at multi-level quality of service. Consider for example the problem, which arises in augmented reality applications, of single-hop radio broadcasting a common content from a provider. Each end-user requires a minimal quality level of the common content. The provider must satisfy all end-users at their required minimal quality level with a pointto-point encrypted transmission. Since the number of different quality level versions of the common content cannot be as large as the number of end-users, the provider has to partition the end-users into groups. The provider adopts for each group a quality level which is the maximum among the levels required by the end-users of that group. In doing so, the provider incurs into an encryption and transmission cost which is proportional to the product between the end-user group size and the adopted quality level. Such a problem consists in finding a partition of the end-users that satisfies their requests and minimizes the overall provider cost. These quality of service problems are optimally solved in polynomial time by dynamic programming techniques for an arbitrary number of end-users. A faster greedy heuristic is also proposed which quickly finds a solution very close to the optimum one.

show abstract