A new channel assignment strategy towards the wireless mesh networks

Abstract

the Frequency Division Multiple Access (FDMA), a code of .4b.strac-Recently. the wireless mesh network attracts the intcmst of many people as a new broadband network of the next generation. The wireless mesh network only consists terminals, the code Division Multiple Access ( C D m ) , and on: Since then a terminal in tbr network can communicate with the other cochannel interference may occur, we cannot assign channels terminal beyond the transmission range by multihopping as randomly. Here, we constmct a graph from the network as S a m e as ad hoc networks. In this network a :ommunicatiofl follows. Each vertex represents a terminal and each edge link between two terminals which can communicate directly IS represents a link which can communicate directly, we need to required a channel. Since cochannel interference may occur, we need tn assign channels to communication links carefully. In this assip channels efficiently to achieve paper, we describe a channel assignment ~bategy which takes Ifl the network. A channel a s s i w e n t to terminal Pairs corthe degrep of cochannel interference into consideration. and we responds to an edge coloring in the graph & network theory. evaluate an effectiveness of this strategy by computer simulations. Strong edge coloring [7] is related to this channel assignment We show that thb strategy is more effective than u sbategy problem on WN. seong edge colo,i,,g is a strategy in wont cases of cochannel interference and does not take the which does not take the degree of cochannel interference into consideration.degree of interference into consideration. Therefore, in [SI we define a new edge coloring strategy which takes the dewee of wCtral

On channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks

“…One of the most significant interference reduction techniques is channel assignment, which specifies the channel to be assigned to a radio in such a way that there is the least contribution to the overall interference. Channel assignment for unicast routing in MCMR WMNs has been addressed extensively in the literature (e.g., Kodialam and Nandagopal (2005), Skalli et al (2007), Subramanian et al (2008), Rad and Wong (2006), Ramachandran et al (2006), Marina et al (2010), Das et al (2005), Alicherry et al (2005), Tang et al (2005), Raniwala et al (2004) and Tasaki et al (2004). The mainstream of research in this area can be classified in two categories.…”

A mathematical formulation for joint channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks

“…, /* Constraints ( 15) and ( 16) stipulate the link establishment conditions between Src and Des:1) they are located within transmission range of each other , and: 2) a common channel is assigned to both radio SR of Src and radio DR of Des*/ (16) Finally, the objective is to minimize the total number of links together with the overall interference; as specified below:…”

“…The channel assignment problem has previously been investigated in the context of unicast routing by many researchers (e.g. [7][8][9][10][11][12][13][14][15][16][17]); unicast-based interference reduction schemes can, in essence, be classified along the lines of the following two categories:…”

Automated Frequency Deconfliction for Tactical Networks

“…In [7], TDD-CDMA systems are the focus, where co-channel interference across time slots between adjacent base stations is the primary consideration assuming that there is no interference on adjacent frequencies. In [8], mesh networks are considered by applying cochannel interference to graph coloring approaches increasing complexity and assuming negligible adjacent channel interference. The wrk in this paper differs in that it also considers all deconfliction processes including both cochannel and adjacent channel interference effects while providing a method for assigning frequencies to RF links.…”