Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks

Subramanian, A.; Gupta, Himanshu; Das, Samir R.

doi:10.1109/sahcn.2007.4292860

Cited by 224 publications

(199 citation statements)

References 19 publications

Supporting

Mentioning

194

Contrasting

Unclassified

Order By: Relevance

“…The virtual control in Raniwala and Chiueh (2005) means that a certain fraction of bandwidth is reserved on each channel for channel assignment purposes rather than reserving one exclusive channel. Subramanian, Gupta and Das (2005) proposes use of non-orthogonal channels. Their interference model is theoretically based on a conflict graph and similar to our work, the interference data is acquired through the measurement of link pair interference.…”

Section: Related Workmentioning

confidence: 99%

“…Their interference model is theoretically based on a conflict graph and similar to our work, the interference data is acquired through the measurement of link pair interference. Subramanian, Gupta and Das (2005) uses integer linear programming to obtain bound of optimal solution and evaluate the proposed algorithm. The main drawback of the proposal in Subramanian, Gupta and Das (2005) as well as the one by Ramachandran, Belding., Almeroth, and Buddhikot (2006) is the scalability since a centralised algorithm is used.…”

Section: Related Workmentioning

confidence: 99%

“…Subramanian, Gupta and Das (2005) uses integer linear programming to obtain bound of optimal solution and evaluate the proposed algorithm. The main drawback of the proposal in Subramanian, Gupta and Das (2005) as well as the one by Ramachandran, Belding., Almeroth, and Buddhikot (2006) is the scalability since a centralised algorithm is used. However, both proposals motivate further investigation since they indicate a 40% performance gains in comparison to static assignment.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A topology control-based self-organisation in wireless mesh networks

Prodan

Mirchandani

Debenham

2008

IJCNDS

View full text Add to dashboard Cite

Abstract:An algorithm for self-organisation that assigns the channels intelligently in Multi-Radio Wireless Mesh Networks (MR-WMN) is important for the proper operation of MR-WMN. The aim of the self-organisation algorithm is to reduce the overall interference and increase the aggregate capacity of the network. In this paper, we have first proposed a generic selforganisation algorithm that addresses these two challenges. The basic approach is that of a distributed, light-weight, co-operative multiagent system that guarantees scalability. Second, we have evaluated the performance of the proposed self-organisation algorithm for two sets of initialisation schemes. The initialisation process results in a topology control of MR-WMN by way of spatial distribution of connectivity between the mesh nodes. The results have been obtained for realistic scenarios of MR-WMN node densities and topologies. We have shown further the need to develop non-transmit power control based algorithms to achieve a further increase in system capacity.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A topology control-based self-organisation in wireless mesh networks

Prodan

Mirchandani

Debenham

2008

IJCNDS

View full text Add to dashboard Cite

show abstract

“…WMNs are a collection of both fixed and mobile devices that are connected together by wireless links (channels) to form a multi-hop ad hoc network. The advantage of WMNs is their ability to fix several defects that are found in the network which are represented in the flexibility and connection reliability [1,2]. In addition, WMNs improved the limitation of other networks such as wireless ad hoc networks, wireless local area networks (WLANs) and wireless personal area network (WPANs) by covering large areas due to providing low cost internet access through multi-hop communications [2].…”

Section: Introductionmentioning

confidence: 99%

State of The Art, Channel Assignment Multi-Radio Multi-Channel in Wireless Mesh Network

Alzubir¹,

Bakar²,

Yousif³

et al. 2012

IJCA

View full text Add to dashboard Cite

The emergence of new-generation networking technologies and the wide-spread use of computers and wireless devices are providing opportunities for a new generation of powerful network systems. Recently, many researchers proposed several channel assignment (CA) algorithms in multi-radio multi-channel assignment (MR-MCA) wireless mesh networks (WMNs) to utilize available channels set in the network topology architecture. One of the key challenges faces MR-MCA is how to reduce the interferences to ensure the maximum throughput by improving the aggregate network capacity. There are several studies that have classified these CA algorithms into several approaches. The aim of this paper is to discuss the current channel assignment approaches in MR-MCA in wireless mesh networks and highlighting the state of the art for MR-MCA, which can help researchers and developers in the field of WMNs.

show abstract

“…This problem has recently been the subject of an upsurge of interest in the WLAN literature, e.g. see [2][3][4][5][6][7][8][9][10][11][12][13]. The channel allocation task is often formulated in the literature as finding a proper colouring of a single graph.…”

Section: Introductionmentioning

confidence: 99%

Channel Dependent Interference and Decentralized Colouring

Clifford

Leith

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We consider channel allocation to mitigate interference between wireless LANs. The channel allocation task is often formulated in the literature as finding a proper colouring of a single graph. We show that the interference between WLANs can be channel dependent in which case a different conflict graph is associated with each channel. Channel allocation then corresponds to a multi-graph colouring problem. This potentially has profound implications as the behaviour of many proposed colouring-based algorithms for channel allocation is unclear in a multi-graph context. We prove that a recently proposed decentralized colouring algorithm performs correctly in the multi-graph setting. We also present a new, extended version of this algorithm suited to a wide range of multi-radio architectures.

show abstract

Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks

Cited by 224 publications

References 19 publications

A topology control-based self-organisation in wireless mesh networks

A topology control-based self-organisation in wireless mesh networks

State of The Art, Channel Assignment Multi-Radio Multi-Channel in Wireless Mesh Network

Channel Dependent Interference and Decentralized Colouring

Contact Info

Product

Resources

About