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

Chiu, Hon Sun; Wu, Bin; Yeung, Kwan L.; Lui, King-Shan

doi:10.1109/wcnc.2008.388

Cited by 11 publications

(23 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Broadcasting in MR-MC networks, mostly in the context of wireless mesh networks, has been studied for different optimization objectives (see [5,[9][10][11] and references therein). Differently from the previous ones, our optimization objective can be any cost function which is summable over all the transmissions, thus taking into account channel heterogeneity (e.g., transmissions on different channels may consume different amounts of energy, due to different bandwidths or different propagation characteristics or some other factor).…”

Section: E Related Workmentioning

confidence: 99%

Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes

Ren

Zhao

Ramanathan

et al. 2011

2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems

View full text Add to dashboard Cite

We consider the broadcasting problem in multiradio multi-channel ad hoc networks. The objective is to minimize the total broadcast cost, where the cost can be of any form that is summable over all the transmissions (e.g., the transmission and reception energy, the price for accessing a specific channel). Our technical approach is based on a simplicial complex model that allows us to capture the broadcast nature of the wireless medium and the heterogeneity across radios and channels. Specifically, we show that broadcasting in multi-radio multi-channel ad hoc networks can be formulated as a minimum spanning problem in simplicial complexes. We establish the NP-completeness of the minimum spanning problem and propose two approximation algorithms with order-optimal performance guarantee. These two algorithms offer tradeoffs between performance and timecomplexity. In a broader context, this work appears to be the first that studies the minimum spanning problem in simplicial complexes and weighted minimum connected set cover problem.

show abstract

Section: E Related Workmentioning

confidence: 99%

Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes

Ren

Zhao

Ramanathan

et al. 2011

2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems

View full text Add to dashboard Cite

show abstract

“…MCM was based on heuristic methods, not mathematical formulations. In [12], Chiu and Wu considered the widest spanning tree problem for broadcasting using mathematical formulation. It assumes a schedule-based MAC, which requires channel synchronization on a packet-by-packet basis, significantly increasing the signaling overhead due to fast coordination, while our schemes work for the contention-based 802.11 MAC protocol, without requiring re-synchronization of interfaces for every packet, which is more practical for current available commodity hardware.…”

Section: Related Workmentioning

confidence: 99%

Interference-Aware Broadcast Routing and Channel Assignment in Multi-Radio Wireless Mesh Networks

Qin

Zhang

2009

2009 IEEE 70th Vehicular Technology Conference Fall

View full text Add to dashboard Cite

An important problem in multi-radio multi-channel wireless mesh networks is how to perform efficient network-wide broadcasting. While route discovery or energy efficiency is the major concern for broadcasting in mobile ad-hoc networks or sensor networks, in WMNs, more attention should be paid to the high-throughput schemes. In this paper, we propose an interference-aware broadcast routing and channel assignment scheme for IEEE802.11-based multi-radio multi-channel mesh networks. We first formulate the problem as a mixed integer linear programming which jointly consider the broadcast routing and channel assignment. And then we propose heuristic suboptimal algorithms. Our schemes enable nodes to operate with minimum interference while the channel diversity can be fully exploited. Simulation results show that out schemes can significantly improve the broadcast performance compared with previous work.

show abstract

“…While minimizing energy consumption, or equivalently maximizing the network lifetime, is critical for wireless ad hoc networks [2][3][4][5][6][7] where nodes are powered by battery, energy is generally not a limitation for WMNs. In contrast, current research efforts in WMNs focus at efficient resources utilization for improving the network capacity to meet the ever increasing traffic demand [9][10][11][12][13][14][15][16][17][18][19].…”

Section: Introductionmentioning

confidence: 99%

“…Broadcast latency is defined as the worst-case transmission time for delivering a packet from the root to all other nodes. As broadcast latency only measures packet-level end-to-end delay performance, it is not suitable for measuring large file/content transfer time [14]. For this reason, a widest spanning tree is proposed to minimize the content update time [14], where the width of a tree is defined as its bottleneck link bandwidth.…”

Section: Introductionmentioning

confidence: 99%

“…As broadcast latency only measures packet-level end-to-end delay performance, it is not suitable for measuring large file/content transfer time [14]. For this reason, a widest spanning tree is proposed to minimize the content update time [14], where the width of a tree is defined as its bottleneck link bandwidth. In [15][16][17], real time broadcast call arrivals are considered.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Interface Placement in Constructing Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks

Chiu

Yeung

Lui

2009

2009 IEEE Wireless Communications and Networking Conference

Self Cite

View full text Add to dashboard Cite

Widest spanning tree is a broadcast tree with its bottleneck link bandwidth maximized. It provides a cost effective broadcasting solution in multi-channel multi-interface wireless mesh networks. To find the widest spanning tree, existing algorithms jointly consider channel assignment, routing and scheduling while assuming the number of network interface cards (NICs) at each node is given. In this paper, we treat the number of NICs at each node as a design parameter, whereas the total number of NICs in the system is given. By properly placing more NICs to more "critical" nodes, the bandwidth of the spanning tree can be further increased. To this end, a new Integer Linear Programming (ILP) is formulated for solving the widest spanning tree problem based on joint optimization of interface placement, channel assignment, routing and scheduling. Numerical results show that interface placement provides a significant boost to the bandwidth of the widest spanning tree found.Keywords -multiple channels, multiple interfaces, interface placement, wireless mesh network, widest spanning tree.Number of NICs at each node 5: 0.5 10: 0.5This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 2009 proceedings.Authorized licensed use limited to: The University of Hong Kong Libraries. Downloaded on July 20,2010 at 03:35:31 UTC from IEEE Xplore. Restrictions apply.

show abstract

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

Cited by 11 publications

References 21 publications

Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes

Broadcasting in Multi-Radio Multi-Channel Wireless Networks using Simplicial Complexes

Interference-Aware Broadcast Routing and Channel Assignment in Multi-Radio Wireless Mesh Networks

Interface Placement in Constructing Widest Spanning Tree for Multi-Channel Multi-Interface Wireless Mesh Networks

Contact Info

Product

Resources

About