#### DMCA

## Minimum-interference channel assignment in multi-radio wireless mesh networks (2006)

### Cached

### Download Links

- [www.wings.cs.sunysb.edu]
- [www.wings.cs.sunysb.edu]
- [www.ieee-icnp.org]
- [www.wings.cs.sunysb.edu]
- [www.wings.cs.sunysb.edu]
- [www.cs.sunysb.edu]
- [cs.sunysb.edu]
- [alum.cs.sunysb.edu]
- [www.cs.stonybrook.edu]
- [alum.cs.sunysb.edu]
- [www.cs.sunysb.edu]
- [cs.sunysb.edu]
- [alum.cs.sunysb.edu]
- [www.cs.stonybrook.edu]
- [www3.cs.stonybrook.edu]
- [alum.cs.sunysb.edu]

Venue: | IN SECON |

Citations: | 107 - 2 self |

### Citations

3242 | The capacity of wireless networks
- Gupta, Kumar
- 1998
(Show Context)
Citation Context ...ampuses, and in metropolitan areas. An important design goal for wireless mesh networks is capacity. It is well-known that wireless interference severely limits network capacity in multi-hop settings =-=[15]-=-. One common technique used to improve overall network capacity is use of multiple channels [19]. Essentially, wireless interference can be minimized by using orthogonal (non-interfering) channels for... |

1404 |
Geometric Algorithms and Combinatorial Optimization
- Grotschel, Lovasz, et al.
- 1993
(Show Context)
Citation Context ...ique to optimize a linear function of a symmetric positivesemidefinite matrix 4 subject to linear equality constraints. Semidefinite programs can be solved in polynomial time using various techniques =-=[14]-=-. The reader is referred to [3, 12] for further details on semidefinite programming and its application to combinatorial optimization. The standard form of semidefinite program is as follows. Minimize... |

1209 | D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Goemans, Williamson
- 1995
(Show Context)
Citation Context ...for very large network sizes. Note that the SDP and LP formulations are used only to demonstrate the performance of our Tabu-based and Greedy algorithms. Semidefinite Programs. A semidefinite program =-=[12]-=- is a technique to optimize a linear function of a symmetric positivesemidefinite matrix 4 subject to linear equality constraints. Semidefinite programs can be solved in polynomial time using various ... |

686 | Wireless mesh networks: a survey
- Akyildiz, Wang, et al.
(Show Context)
Citation Context ...dios. Also, detailed ns2 simulation studies demonstrate the performance potential of our channel assignment algorithms in 802.11-based multi-radio mesh networks. 1 Introduction Wireless mesh networks =-=[2]-=- are multihop networks of wireless routers. There is an increasing interest in using wireless mesh networks as broadband backbone networks to provide ubiquitousnetwork connectivity in enterprises, cam... |

565 | Impact of interference on multi-hop wireless network performance,” Wireless networks - Jain, Padhye, et al. - 2005 |

543 | Interior point methods in semidefinite programming with applications to combinatorial optimization
- Alizadeh
- 1995
(Show Context)
Citation Context ...on of a symmetric positivesemidefinite matrix 4 subject to linear equality constraints. Semidefinite programs can be solved in polynomial time using various techniques [14]. The reader is referred to =-=[3, 12]-=- for further details on semidefinite programming and its application to combinatorial optimization. The standard form of semidefinite program is as follows. Minimize C.X such that Ai.X = bi, 1 ≤ i ≤ m... |

443 | Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks,”
- Alicherry, Bhatia, et al.
- 2005
(Show Context)
Citation Context ...os is not sufficient to measure network interference/capacity, since a link still can use one of many channels for transmission. access model is hard. The previous works in the literature [15], [16], =-=[17]-=-, [18] that maximize overall network throughput, assume a time-slotted synchronized medium access model with scheduling as one part of the problem. In a timeslotted synchronized medium access model, m... |

430 | Multi-channel mac for ad hoc networks: handling multi-channel hidden terminals using a single transceiver
- So, Vaidya
- 2004
(Show Context)
Citation Context ...gnment approaches is to frequently change the channel on the interface; for instance, for each packet transmission based on the current state of the medium. Such dynamic channel assignment approaches =-=[4, 35, 36, 42]-=- require channel switching at a very fast time scale (per packet or a handful of packets). The fast-channel switching requirement makes these approaches unsuitable for use with commodity hardware, whe... |

353 | Ssch: Slotted seeded channel hopping for capacity improvement in ad hoc networks
- Bahl, Chandra, et al.
- 2004
(Show Context)
Citation Context ...gnment approaches is to frequently change the channel on the interface; for instance, for each packet transmission based on the current state of the medium. Such dynamic channel assignment approaches =-=[4, 35, 36, 42]-=- require channel switching at a very fast time scale (per packet or a handful of packets). The fast-channel switching requirement makes these approaches unsuitable for use with commodity hardware, whe... |

325 |
Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network
- Raniwala, Chiueh
- 2005
(Show Context)
Citation Context ...ardware. Static or Quasi-static Channel Assignment. Due to the difficulty of use of above dynamic approach with commodity hardware, there is need to develop techniques that assign channels statically =-=[1, 26, 31, 32, 38]-=-. Such static assignments can be changed whenever there are significant changes to traffic load or network topology; however, such changes are infrequent enough that the channel-switching delay and tr... |

275 | Capacity of multi-channel wireless networks:Impact of number of channels and interfaces,” in
- Kyasanur, Vaidya
- 2005
(Show Context)
Citation Context ...ity. It is well-known that wireless interference severely limits network capacity in multi-hop settings [15]. One common technique used to improve overall network capacity is use of multiple channels =-=[19]-=-. Essentially, wireless interference can be minimized by using orthogonal (non-interfering) channels for neighboring wireless transmissions. The current IEEE 802.11 standard for WLANs (also used for m... |

244 | Characterizing the capacity region in multi-radio multi-channel wireless mesh networks,” - Kodialam, Nandagopal - 2005 |

226 | Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks
- Raniwala, Gopalan, et al.
(Show Context)
Citation Context ...ardware. Static or Quasi-static Channel Assignment. Due to the difficulty of use of above dynamic approach with commodity hardware, there is need to develop techniques that assign channels statically =-=[1, 26, 31, 32, 38]-=-. Such static assignments can be changed whenever there are significant changes to traffic load or network topology; however, such changes are infrequent enough that the channel-switching delay and tr... |

212 | A New Multi-Channel MAC Protocol with On-Demand Channel Assignment for Multi-Hop Mobile Ad Hoc Networks.
- Wu, Lin, et al.
- 2000
(Show Context)
Citation Context ...gnment approaches is to frequently change the channel on the interface; for instance, for each packet transmission based on the current state of the medium. Such dynamic channel assignment approaches =-=[4, 35, 36, 42]-=- require channel switching at a very fast time scale (per packet or a handful of packets). The fast-channel switching requirement makes these approaches unsuitable for use with commodity hardware, whe... |

193 | MultiNet: Connecting to Multiple IEEE 802.11 Networks Using a Single Wireless Card.
- Chandra, Bahl, et al.
- 2004
(Show Context)
Citation Context ...andful of packets). The fast-channel switching requirement makes these approaches unsuitable for use with commodity hardware, where channel switching delays itself can be in the order of milliseconds =-=[6]-=- which is an order of magnitude higher than typical packet transmission times (in microseconds). Some of the dynamic channel assignment approaches also require specialized MAC protocols or extensions ... |

176 | Improved Approximation Algorithms for MAX k-CUT
- Frieze, Jerrum
- 1997
(Show Context)
Citation Context ...echnique called Tabu search [16] that has been used in the past in graph coloring problems. The distributed approach is motivated by the greedy approximation algorithm for Max K-cut problem in graphs =-=[10]-=-. To evaluate their performances, we develop two mathematical programming formulations, using integer linear programming (ILP) and a semidefinite programming (SDP). We obtain bounds on the optimal sol... |

170 | Measurement-based models of delivery and interference in static wireless networks.
- Reis, Mahajan, et al.
- 2006
(Show Context)
Citation Context ... conflict graph. The conflict graph (along with the edge weights for fractional interference; see Section 7) can be computed using methods similar to recently reported measurement-based techniques in =-=[29, 33]-=-. These techniques are localized, , due to the localized nature of interference, and hence, can be easily run in a distributed manner. Also, in most cases (for static network topologies), the above me... |

163 | A multi-radio unification protocol for IEEE 802.11 wireless networks.
- Adya, Bahl, et al.
- 2003
(Show Context)
Citation Context ...ardware. Static or Quasi-static Channel Assignment. Due to the difficulty of use of above dynamic approach with commodity hardware, there is need to develop techniques that assign channels statically =-=[1, 26, 31, 32, 38]-=-. Such static assignments can be changed whenever there are significant changes to traffic load or network topology; however, such changes are infrequent enough that the channel-switching delay and tr... |

158 | Using tabu search techniques for graph coloring. - Hertz, Werra - 1987 |

149 | Interference-aware topology control and QoS routing in multi-channel wireless mesh networks”, in:
- Tang, Xue, et al.
- 2005
(Show Context)
Citation Context ...i-static channel assignment. Due to the difficulty of use of above dynamic approach with commodity hardware, there is a need to develop techniques that assign channels statically [7], [8], [9], [10], =-=[11]-=-. Such static assignments can be changed whenever there are significant changes to traffic load or network topology; however, such changes are infrequent enough that the channel-switching delay, and t... |

139 | Architecture and algorithms for an
- Raniwala, Chiueh
- 2005
(Show Context)
Citation Context .... Static or quasi-static channel assignment. Due to the difficulty of use of above dynamic approach with commodity hardware, there is a need to develop techniques that assign channels statically [7], =-=[8]-=-, [9], [10], [11]. Such static assignments can be changed whenever there are significant changes to traffic load or network topology; however, such changes are infrequent enough that the channel-switc... |

135 |
Interference-aware channel assignment in multi-radio wireless mesh networks, in:
- Ramachandran, Belding, et al.
- 2006
(Show Context)
Citation Context ... Das et al. present a couple of optimization models for the static channel assignment problem in a multi-radio mesh network. However, they do not present any practical (polynomial time) algorithm. In =-=[30]-=-, a purely measurement-based approach is taken for channel assignment to radios (instead of links). Here, one radio at each node is tuned to a common channel to preserve the original topology; however... |

130 |
A new algorithm for minimizing convex functions over convex sets
- Vaidya
- 1996
(Show Context)
Citation Context ...of a SDP. SDPs. SDP [38] is a technique to optimize a linear function of a symmetric positive-semidefinite matrix 3 subject to linear equality constraints. SDP is a special case of convex programming =-=[39]-=-, since a set of positive semidefinite matrices constitutes a convex cone. SDPs can be solved in polynomial time using various techniques [40]. The reader is referred to [38] and [41] for further deta... |

119 | Solving large-scale sparse semidefinite programs for combinatorial optimization.
- Benson, Ye, et al.
- 2000
(Show Context)
Citation Context ... evaluate various algorithms based on a certain graphtheoretic performance metric. To solve LPs, we used GLPK [44], which is a public-domain MIP/LP solver, while to solve SDPs, we used DSDP 5.0 [43], =-=[45]-=-, which uses an efficient interior-point technique. Graph parameters. We consider two sets of random network, namely, dense and sparse networks, generated by randomly placing 50 nodes in 500 500 and 8... |

114 | Routing and link-layer protocols for multi-channel multi-interface ad hoc wireless networks,‖
- Kyasanur, Vaidya
- 2006
(Show Context)
Citation Context ...tic for minimizing the network interference. We compare the performance of our proposed algorithm with this heuristic, and show a significant improvement. Other Related Works. In other related works, =-=[20]-=- proposes a hybrid channel assignment strategy: some interfaces on a node have a fixed assignment, and the rest can switch channels as needed. To put things in perspective, our work presents algorithm... |

111 | Estimation of link interference in static multihop wireless networks,”
- Padhye, Agarwal, et al.
- 2005
(Show Context)
Citation Context ... conflict graph. The conflict graph (along with the edge weights for fractional interference; see Section 7) can be computed using methods similar to recently reported measurement-based techniques in =-=[29, 33]-=-. These techniques are localized, , due to the localized nature of interference, and hence, can be easily run in a distributed manner. Also, in most cases (for static network topologies), the above me... |

104 |
A multi-radio unification protocol for
- Adya, Bahl, et al.
- 2004
(Show Context)
Citation Context ...nnels, and the communication range of each wireless node is less compared to 802.11b/g modes so that we could get different multihop topologies within indoors. Due to board crosstalk or radio leakage =-=[10]-=-, [12], there is interference between the radios in the same node even when they are configured to separate orthogonal channels. In order to over come this, we separated the three external antennas at... |

94 |
Algorithmic aspects of capacity in wireless networks,”
- Kumar, Marathe, et al.
- 2005
(Show Context)
Citation Context ...ectly maximize overall network throughput, it turns out that modeling network throughput analytically in a random access based medium access model is hard. The previous works in the literature ([15], =-=[16]-=-, [17], [18]) that maximize overall network throughput assume a time-slotted synchronized medium access model with scheduling as one part of the problem. In a time-slotted synchronized medium access m... |

81 | A distributed joint channel-assignment, scheduling and routing algorithm for multi-channel ad-hoc wireless networks,”
- Lin, Rasool
- 2007
(Show Context)
Citation Context ...not sufficient to measure network interference/capacity, since a link still can use one of many channels for transmission. access model is hard. The previous works in the literature [15], [16], [17], =-=[18]-=- that maximize overall network throughput, assume a time-slotted synchronized medium access model with scheduling as one part of the problem. In a timeslotted synchronized medium access model, modelin... |

74 | A measurement-based approach to modeling link capacity in 802.11-based wireless networks
- Kashyap, Ganguly, et al.
- 2007
(Show Context)
Citation Context ...d synchronized medium access model, modeling throughput is much easier relative to a CSMA-based random access model. There indeed has been several attempts in recent literature to model link capacity =-=[19]-=-, [20] in a CSMA-based network using measurements from real 802.11-based networks. However, these models are quite complex, and it is difficult to use them as objective functions for an optimization p... |

62 | Experimenting with a multi-radio mesh networking testbed.
- Robinson, Papagiannaki, et al.
- 2005
(Show Context)
Citation Context ...annel to all radios/links in the network to preserve network connectivity. Thus, such assignment schemes require use of multiple radio interfaces at each node. Due to board crosstalk or radio leakage =-=[1, 34]-=-, commodity radios on a node may actually interfere even if they are tuned to different channels. However, this phenomena can be addressed by providing some amount of shielding or antenna separation [... |

56 |
Exploiting partially overlapping channels in wireless networks: turning a peril into an advantage,”
- Mishra, Rozner, et al.
- 2005
(Show Context)
Citation Context ...scheduling support. While our algorithms indeedsuse interference and traffic models as input, such models can be gathered using experimental methods. • Our work generalizes to non-orthogonal channels =-=[25]-=-, including channels that are supposedly orthogonal but interfere because of crosstalk or leakage [34]. • Ours is the first work that establishes good lower bounds on the optimal network interference,... |

54 | Optimization models for fixed channel assignment in wireless mesh networks with multiple radios," in
- Das, Alazemi, et al.
- 2005
(Show Context)
Citation Context ...iwala et al. propose a centralized load-aware channel assignment algorithm; however, they require that source-destination pairs with associated traffic demands and routing paths be known a priori. In =-=[8]-=-, Das et al. present a couple of optimization models for the static channel assignment problem in a multi-radio mesh network. However, they do not present any practical (polynomial time) algorithm. In... |

50 | Characterizing the Capacity Region - Kodialam, Nandagopal - 2005 |

38 | Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks,‖ in
- Shi, Salonidis, et al.
- 2006
(Show Context)
Citation Context ...es is to frequently change the channel on the interface; for instance, for each packet transmission based on the current state of the medium. Such dynamic channel assignment approaches [2], [3], [4], =-=[5]-=- require channel switching at a very fast time scale (per packet or a handful of packets). The fast-channel switching requirement makes . A.P. Subramanian, H. Gupta, and S.R. Das are with the Computer... |

37 | Multi-channel MAC protocols for wireless networks,
- Maheshwari, Gupta, et al.
- 2006
(Show Context)
Citation Context ... on starvation mitigation. In [13] the authors use a channel assignment approach using a routing protocol and then use these channels to transmit data. For coordination, control channels are used. In =-=[22]-=- two radio and single radio multichannel protocols are proposed, but separate control channels are not needed. All the above protocols require a small channel switching delay (of the order of hundred ... |

31 | On the hardness of approximating Max k-Cut and its dual
- Kann, Khanna, et al.
- 1997
(Show Context)
Citation Context ... constant approximation algorithm using semidefinite algorithm for general graphs, while [34] consider uniformly random Gn;p graphs and give an approximation scheme. As a hardness result, Kann et al. =-=[35]-=- proves that unless P NP, the Max K-cut problem cannot be approximated within a factor of 1 1 34K . 4 CENTRALIZED TABU-BASED ALGORITHM In this section, we describe one of our algorithms for the chan... |

28 | Component Based Channel Assignment in Single Radio, Multi-channel Ad Hoc Networks,” InMobiCom.
- Vedantham, Kakumanu, et al.
- 2006
(Show Context)
Citation Context ... an associated procedure. Similar experiences were reported in [6]. , and in particular, it has been shown in [4], [25] that packet-based channel assignment may not be feasible in a practical setting =-=[26]-=-. In addition, the above approaches require changes to the MAC layer. Thus, the above approaches are not suitable with currently available commodity hardware. Static/Quasi-Static Channel Assignment in... |

27 |
Measurement-based Models of Delivery and
- Reis, Mahajan, et al.
- 2006
(Show Context)
Citation Context ...hronized medium access model, modeling throughput is much easier relative to a CSMA-based random access model. There indeed has been several attempts in recent literature to model link capacity [19], =-=[20]-=- in a CSMA-based network using measurements from real 802.11-based networks. However, these models are quite complex, and it is difficult to use them as objective functions for an optimization problem... |

25 |
Joint channel allocation, interface assignment, and MAC design for multi-channel wireless mesh networks,” in
- Mohsenian-Rad, Wong
- 2007
(Show Context)
Citation Context ..., Das et al. present a couple of optimization models for the static channel assignment problem in a multiradio mesh network. However, they do not present any practical (polynomial time) algorithm. In =-=[29]-=-, the authors propose a linear optimization model that assign channels to interfaces, and then, assign interfaces to neighbors so that neighbors having interfaces with common channels can communicate.... |

22 | DSDP5: Software for semidefinite programming,”
- Benson, Ye
- 2005
(Show Context)
Citation Context ...network interference can be obtained by subtracting it from |Ec|. The above relaxed version can be easily converted into the standard SDP formulation for use by a standard SDP solver such as DSDP 5.0 =-=[5]-=-. We omit the details due to lack of space.s7 Generalizations In the previous sections, for sake of clarity, we made various assumptions, viz., uniform traffic on all communication links, a binary int... |

15 | Experimental characterization of an 802.11b wireless mesh network,”
- Liese, Mohapatra
- 2005
(Show Context)
Citation Context ...], commodity radios on a node may actually interfere even if they are tuned to different channels. However, this phenomena can be addressed by providing some amount of shielding or antenna separation =-=[21, 34]-=-, or increased channel separation (as is the case in 802.11a) [32]. Problem Addressed. In our article, we address the problem of quasi-static assignment of channels to links in the context of networks... |

13 |
Optimization models for fixed channel assignment
- Das, Alazemi, et al.
- 2005
(Show Context)
Citation Context ...iwala et al. propose a centralized load-aware channel assignment algorithm; however, they require that source-destination pairs with associated traffic demands and routing paths be known a priori. In =-=[28]-=-, Das et al. present a couple of optimization models for the static channel assignment problem in a multiradio mesh network. However, they do not present any practical (polynomial time) algorithm. In ... |

12 |
A Topology Control Approach to Channel Assignment in Multi-Radio Wireless Mesh Networks,” Broadnets,
- Marina, Das
- 2005
(Show Context)
Citation Context |

11 |
Algorithmic Aspects of Capacity in
- Kumar, Marathe, et al.
- 2005
(Show Context)
Citation Context ...o radios is not sufficient to measure network interference/capacity, since a link still can use one of many channels for transmission. access model is hard. The previous works in the literature [15], =-=[16]-=-, [17], [18] that maximize overall network throughput, assume a time-slotted synchronized medium access model with scheduling as one part of the problem. In a timeslotted synchronized medium access mo... |

10 |
k-cut and approximating the chromatic number of random graphs
- Coja-Oghlan, Moore, et al.
(Show Context)
Citation Context ...ront, the related Max K-cut problem has been studied extensively. In particular, Frieze and Jerrum [14] gives a constant approximation algorithm using semidefinite algorithm for general graphs, while =-=[34]-=- consider uniformly random Gn;p graphs and give an approximation scheme. As a hardness result, Kann et al. [35] proves that unless P NP, the Max K-cut problem cannot be approximated within a factor ... |

8 |
Lower bounds for fixed spectrum frequency assignment
- Montemanni, Smith, et al.
- 2002
(Show Context)
Citation Context ...P formulation was very loose; thus, we add additional constraints as follows. Clique Constraint. For each vertex u ∈Vc, let Su be the set of vertices in a maximal clique containing u. It can be shown =-=[28]-=- that the number of monochromatic edges in the complete subgraph of size |Su| when colored by K colors is at least: σ(Su,K) = βα(α + 1) + (K − β)α(α − 1) , (7) 2 where α = ⌊ |Su| K ⌋ and β = |Su| mod ... |

8 |
Using Tabu Search Techniques for Graph
- HERTZ, WERRA
- 1987
(Show Context)
Citation Context ...For the above described channel assignment problem, we develop a centralized and a distributed algorithm. The centralized algorithm is based on a popular heuristic search technique called Tabu search =-=[13]-=- that has been used in the past in graph coloring problems. The distributed approach is motivated by the greedy approximation algorithm for the Max K-cut problem in graphs [14]. To evaluate their perf... |

8 |
Component Based Channel Assignment
- Vedantham, Kakumanu, et al.
- 2006
(Show Context)
Citation Context ...an associated procedure. Similar experiences were reported in [6], and in particular, it has been shown in [4] and [25] that packet-based channel assignment may not be feasible in a practical setting =-=[26]-=-. In addition, the above approaches require changes to the MAC layer. Thus, the above approaches are not suitable with currently available commodity hardware. Static/quasi-static channel assignment in... |

5 |
k-CUT and Approximating the Chromatic Number of Random Graphs
- MAX
(Show Context)
Citation Context ...ur choice of greedy approach is motivated by the following two observations. Here, Gn,p graphs are defined as random graph over n vertices where each edge exists with a uniform probability of p. • In =-=[7]-=-, the authors consider the Max K-cut problem in Gn,p graphs, and show that the greedy heuristic that greedily decides the partition of one vertex at a time delivers a (1 − 1 Kx )-approximate solution ... |

5 | A Combined Proactive Routing and Multi-Channel MAC Protocol for Wireless Ad Hoc Networks
- Gong, Midkiff, et al.
- 2005
(Show Context)
Citation Context ...control packets and the data packets are sent in the negotiated channels. In AMCP [35], the authors uses similar notion of a control channel, but a single radio and focus on starvation mitigation. In =-=[13]-=- the authors use a channel assignment approach using a routing protocol and then use these channels to transmit data. For coordination, control channels are used. In [22] two radio and single radio mu... |

1 |
Channel Assignment and Routing for throughput optimization in Multi-Radio wireless mesh networks
- Joint
- 2005
(Show Context)
Citation Context ...ome interfaces on a node have a fixed assignment, and the rest can switch channels as needed. To put things in perspective, our work presents algorithms for making these fixed assignments. Authors in =-=[23, 27]-=- address joint channel assignment, routing and scheduling problems. Both these papers makes an assumption of synchronized time-slotted channel model as scheduling is integrated in their methods. This ... |

1 |
Temporal TopologyControl in Multi-channel Multihop Wireless Access Networks
- Xue, Ganz
- 2005
(Show Context)
Citation Context ... a multiradio setting. In particular, [32] assume a treebased communication pattern to ease coordination for optimizing channel assignment. Similar tree-based communication patterns have been used in =-=[43]-=-. The above schemes do not quantify the performance of their solutions with respect to the optimal. In addition, [38] considers minimum-interference channel assignments that preserve k-connectivity. N... |

1 |
Temporal Topology Control
- Xue, Ganz
- 2005
(Show Context)
Citation Context ...cy. In particular, Raniwala and Chiueh [8] assume a treebased communication pattern to ease coordination for optimizing channel assignment. Similar tree-based communication patterns have been used in =-=[27]-=-. The above schemes do not quantify the performance of their solutions with respect to the optimal. In addition, Tang et al. [11] consider minimum-interference channel assignments that preserve k-conn... |

1 |
Channel Overlap Calculations for 802.11b Networks
- Inc
- 2002
(Show Context)
Citation Context ...ere are 11 channels, with only three of them being mutually orthogonal. For modeling the interference between nonorthogonal channels, we follow the technique outlined in Section 7. We use the data in =-=[47]-=- to model the “weighted” nature of conflicts. This data is obtained based on a simple analysis of the amount of overlapped spectrum between every pair of channels in 802.11b. We also did direct measur... |