Traffic and Interference Aware Scheduling for Multiradio Multichannel Wireless Mesh Networks

Chakchouk, Nesrine; Hamdaoui, Bechir

doi:10.1109/tvt.2010.2102057

Cited by 27 publications

(17 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A more accurate approach for channel assignment, which has been adopted in [6][7][8][9], is to consider the load of the links. In this approach, firstly the loads of the links are estimated.…”

Section: Related Workmentioning

confidence: 99%

“…Here, ε and bigM are respectively small and big constants, which are used for linearization. As it is shown in "Appendix 1", using (9) …”

Section: The Optimal Modelmentioning

confidence: 99%

“…Therefore, a wide range of research has studied channel assignment problem and tried to minimize the interference . A portion of these works have studied unicast routing and considered the characteristics of data flows to fully exploit the capacity of MC-MR WMNs [2][3][4][5][6][7][8][9][10]. The problem of multicast routing in these networks has been studied in a number of works including [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25], where the interdependence of multicast traffic and channel assignment is taken into account to provide efficient solutions.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Minimum Cost Bandwidth Guaranteed Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks

Farzinvash

Dehghan

2014

Wireless Pers Commun

View full text Add to dashboard Cite

Multicast communication is an important service in wireless mesh networks (WMNs). It covers a broad range of applications, including data distribution, video conferencing, and distance learning. In this paper, we discuss the issue of bandwidth guaranteed multicast routing in multi-channel multi-radio WMNs. The problem of our concern is to construct a tree per multicast session such that the cost of the system, which is defined as the amount of total consumed bandwidth, is minimized. In order to solve the problem efficiently, we design Bandwidth Guaranteed Minimum Cost Tree construction (BGMCT) algorithm. Our algorithm yields cost-effective solutions as it exploits the wireless broadcast advantage (WBA) property of the wireless medium. In the proposed algorithm, we have developed two strategies for constructing minimum cost trees. Firstly, the number of the relay nodes in each tree is minimized. Secondly, the amount of overlapping between the shortest paths which connect different destinations of each session to its source node, is taken into account. The simulation results demonstrate that our algorithm outperforms existing solutions. Moreover, BGMCT provides near to optimal outcomes in a reasonable time.Keywords Wireless mesh networks · WMN · Multicast · Bandwidth guaranteed tree · Wireless broadcast advantage · WBA · Multi-channel multi-radio networks · MC-MR

show abstract

Section: Related Workmentioning

confidence: 99%

“…Here, ε and bigM are respectively small and big constants, which are used for linearization. As it is shown in "Appendix 1", using (9) …”

Section: The Optimal Modelmentioning

confidence: 99%

mentioning

confidence: 99%

See 1 more Smart Citation

Minimum Cost Bandwidth Guaranteed Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks

Farzinvash

Dehghan

2014

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…Later Zhijun Cai [13] proposed a Sequenced Neighbor Double Reservation Multi-channel Ad Hoc Networks based on receiver-based data transmission scheme, similar to SNMS protocol. Nessrine Chakchouk [9] proposed Multiradio Multichannel Traffic and Interference Aware Scheduling algorithm. The protocol increases the throughput of the network by eliminating the interference between the routers.…”

Section: Snmsmentioning

confidence: 99%

A Survey and Qualitative Analysis of Multi-channel Mac Protocols for VANET

Kakarla¹,

Sathya²

2012

IJCA

View full text Add to dashboard Cite

Vehicular Ad-hoc Network (VANET) is an emerging and promising technology that places great demand on the access capability of the existing wireless technology. In VANET one primary issue is Medium Access Control (MAC), which aims to utilize the radio spectrum efficiently, to resolve potential contention and collision among vehicles for using the medium. Contention reduces the performance of single channel MAC layer and the workload distribution is also not well defined. So multi channel MAC protocols are useful to provide better quality of services (QoS) wherein, multi channel interference is a major problem to assign channel to a particular vehicle. Hence a survey is necessary on multi channel MAC protocols based on various parameters in vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communication. This paper gives a brief overview of various issues involved in the design of multi channel MAC protocol in VANET.

show abstract

“…There have been some other efforts on formulating and solving cross-layer optimization problems with joint consideration of channel assignment and scheduling [8]- [11]. However, these works were done either without targeting at optimizing throughput performance [8], [9] or in a centralized manner to solve the optimization problem [10], [11]. On the other hand, for centralized schemes, some arousing results have been achieved with small delay or low complexity [12]- [14].…”

Section: Introductionmentioning

confidence: 99%

Distributed Algorithm for Multi-Channel Wireless Networks with Low Complexity

Zhang

Cao

Wang

2014

2014 IEEE 79th Vehicular Technology Conference (VTC Spring)

View full text Add to dashboard Cite

Equipping multi-channel in wireless networks brings not only an improved capacity region but also high challenge in designing joint channel-assignment and scheduling algorithms. With regard to the distributed and online strategies under multi-channel network systems, the implementation complexity is non-negligible and much higher than that of the single-channel cases. In this paper, we propose a low-complexity throughput guaranteed distributed policy, i.e., LDCSA, in multichannel Ad hoc wireless networks, which has the property of low complexity, i.e., the computation time of the algorithm is low and increases neither with the size of network nor with the number of available channels. It is proved that the capacity region achieved by LDCSA can be arbitrarily close to that of other comparable maximal matching-based scheduling algorithms.

show abstract

Traffic and Interference Aware Scheduling for Multiradio Multichannel Wireless Mesh Networks

Cited by 27 publications

References 24 publications

Minimum Cost Bandwidth Guaranteed Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks

Minimum Cost Bandwidth Guaranteed Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks

A Survey and Qualitative Analysis of Multi-channel Mac Protocols for VANET

Distributed Algorithm for Multi-Channel Wireless Networks with Low Complexity

Contact Info

Product

Resources

About