Results 1 - 10
of
687
NeXt generation/dynamic spectrum access/cognitive Radio Wireless Networks: A Survey
- COMPUTER NETWORKS JOURNAL (ELSEVIER
, 2006
"... Today's wireless networks are characterized by a fixed spectrum assignment policy. However, a large portion of the assigned spectrum is used sporadically and geographical variations in the utilization of assigned spectrum ranges from 15% to 85% with a high variance in time. The limited availabl ..."
Abstract
-
Cited by 746 (15 self)
- Add to MetaCart
Today's wireless networks are characterized by a fixed spectrum assignment policy. However, a large portion of the assigned spectrum is used sporadically and geographical variations in the utilization of assigned spectrum ranges from 15% to 85% with a high variance in time. The limited available spectrum and the ine#ciency in the spectrum usage necessitate a new communication paradigm to exploit the existing wireless spectrum opportunistically. This new networking paradigm is referred to as NeXt Generation (xG) Networks as well as Dynamic Spectrum Access (DSA) and cognitive radio networks. The term xG networks is used throughout the paper. The novel functionalities and current research challenges of the xG networks are explained in detail. More specifically, a brief overview of the cognitive radio technology is provided and the xG network architecture is introduced. Moreover, the xG network functions such as spectrum management, spectrum mobility and spectrum sharing are explained in detail. The influence of these functions on the performance of the upper layer protocols such as routing and transport are investigated and open research issues in these areas are also outlined. Finally, the cross-layer design challenges in xG networks are discussed.
Joint Channel Assignment and Routing for Throughput Optimization in Multi-radio Wireless Mesh Networks
, 2005
"... Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their singlehop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using o ..."
Abstract
-
Cited by 443 (0 self)
- Add to MetaCart
Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their singlehop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways to the Internet, thereby improving per-client throughput. Unlike previous heuristic approaches, we mathematically formulate the joint channel assignment and routing problem, taking into account the interference constraints, the number of channels in the network and the number of radios available at each mesh router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem. Our evaluation demonstrates that our algorithm can effectively exploit the increased number of channels and radios, and it performs much better than the theoretical worst case bounds.
Interference-aware topology control and qos routing in multi-channel wireless mesh networks
- in Proceedings of ACM MOBIHOC
, 2005
"... The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels can reduce interference influence. In this paper, we study interference-aware topology control and QoS routing in IEEE 802. ..."
Abstract
-
Cited by 149 (8 self)
- Add to MetaCart
(Show Context)
The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels can reduce interference influence. In this paper, we study interference-aware topology control and QoS routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. Channel assignment and routing are two basic issues in such networks. Different channel assignments can lead to different network topologies. We present a novel definition of co-channel interference. Based on this concept, we formally define and present an effective heuristic for the minimum INterference Survivable Topology Control (INSTC) problem which seeks a channel assignment for the given network such that the induced network topology is interference-minimum among all K-connected topologies. We then formulate the Bandwidth-Aware Routing (BAR) problem for a given network topology, which seeks routes for QoS connection requests with bandwidth requirements. We present a polynomial time optimal algorithm to solve the BAR problem under the assumption that traffic demands are splittable. For the non-splittable case, we present a maximum bottleneck capacity path routing heuristic. Simulation results show that compared with the simple common channel assignment and shortest path routing approach, our scheme improves the system performance by 57 % on average in terms of connection blocking ratio.
Minimum-interference channel assignment in multi-radio wireless mesh networks
- IN SECON
, 2006
"... In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communication. We address the problem of assigning channels to communication links in the network with the objective of minimizing ov ..."
Abstract
-
Cited by 107 (2 self)
- Add to MetaCart
(Show Context)
In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communication. We address the problem of assigning channels to communication links in the network with the objective of minimizing overall network interference. Since the number of radios on any node can be less than the number of available channels, the channel assignment must obey the constraint that the number of different channels assigned to the links incident on any node is atmost the number of radio interfaces on that node. The above optimization problem is known to be NP-hard. We design centralized and distributed algorithms for the above channel assignment problem. To evaluate the quality of the solutions obtained by our algorithms, we develop a semidefinite program formulation of our optimization problem to obtain a lower bound on overall network interference. Empirical evaluations on randomly generated network graphs show that our algorithms perform close to the above established lower bound, with the difference diminishing rapidly with increase in number of radios. Also, detailed ns-2 simulation studies demonstrate the performance potential of our channel assignment algorithms in 802.11-based multi-radio mesh networks.
A Topology Control Approach for Utilizing Multiple Channels in Multi-Radio Wireless Mesh Networks
- In Proc. IEEE International Conference on Broadband Networks (BroadNets
, 2005
"... We consider the channel assignment problem in a multi-radio wireless mesh network that involves assigning channels to radio interfaces for achieving efficient channel utilization. We present a graph-theoretic formulation of the channel assignment guided by a novel topology control perspective, and s ..."
Abstract
-
Cited by 102 (3 self)
- Add to MetaCart
(Show Context)
We consider the channel assignment problem in a multi-radio wireless mesh network that involves assigning channels to radio interfaces for achieving efficient channel utilization. We present a graph-theoretic formulation of the channel assignment guided by a novel topology control perspective, and show that the resulting optimization problem is NP-complete. We also present an ILP formulation that is used for obtaining a lower bound for the optimum. We then develop a new greedy heuristic channel assignment algorithm (termed CLICA) for finding connected, low interference topologies by utilizing multiple channels. Our evaluations show that the proposed CLICA algorithm exhibits similar behavior and comparable performance relative to the optimum bound with respect to interference and capacity measures. Moreover, our extensive simulation studies show that it can provide a large reduction in interference even with a small number of radios per node, which in turn leads to significant gains in both link layer and multihop performance in 802.11-based multi-radio mesh networks.
Enabling Distributed Throughput Maximization in Wireless Mesh Networks -- A Partitioning Approach
, 2006
"... This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can a ..."
Abstract
-
Cited by 85 (4 self)
- Add to MetaCart
This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the throughput fraction by designing new algorithms, in this paper we present a novel approach that takes advantage of the inherent multi-radio capability of WMNs. We show that this capability can enable partitioning of the network into subnetworks in which simple distributed scheduling algorithms can achieve 100 % throughput. The partitioning is based on the recently introduced notion of Local Pooling. Using this notion, we characterize topologies in which 100% throughput can be achieved distributedly. These topologies are used in order to develop a number of channel assignment algorithms that are based on a matroid intersection algorithm. These algorithms partition a network in a manner that not only expands the capacity regions of the subnetworks but also allows distributed algorithms to achieve these capacity regions. Finally, we evaluate the performance of the algorithms via simulation and show that they significantly increase the distributedly achievable capacity region.
Capacity Enhancement using Throwboxes in DTNs
- in IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS
, 2006
"... Abstract Disruption Tolerant Networks (DTNs) are designed to overcome limitations in connectivity due to conditions such as mobility, poor infrastructure, and short range radios. DTNs rely on the inherent mobil-ity in the network to deliver packets around frequent and extended network partitions us ..."
Abstract
-
Cited by 55 (3 self)
- Add to MetaCart
(Show Context)
Abstract Disruption Tolerant Networks (DTNs) are designed to overcome limitations in connectivity due to conditions such as mobility, poor infrastructure, and short range radios. DTNs rely on the inherent mobil-ity in the network to deliver packets around frequent and extended network partitions using a store-carry-and-forward paradigm. However, missed contact opportunities decrease throughput and increase delay in the network. We propose the use of throwboxes in mobile DTNs to create a greater number of contact opportunities, consequently improving the performance of the network. Throwboxes are wireless nodes that act as relays, creating additional contact opportunities in the DTN. We propose algorithms to deploy stationary throwboxes in the network that simultaneously consider routing as well as placement. We also present placement algorithms that use more limited knowledge about the network structure. We perform an extensive evaluation of our algorithms by varying both the underlying routing and mobility models. Our results suggest several ndings to guide the design and operation of throwbox-augmented DTNs. I.
ARSA: An Attack-Resilient Security Architecture for Multihop Wireless Mesh Networks
, 2006
"... Multihop wireless mesh networks (WMNs) are finding ever-growing acceptance as a viable and effective solution to ubiquitous broadband Internet access. This paper addresses the security of WMNs, which is a key impediment to wide-scale deployment of WMNs, but thus far receives little attention. We fi ..."
Abstract
-
Cited by 43 (7 self)
- Add to MetaCart
(Show Context)
Multihop wireless mesh networks (WMNs) are finding ever-growing acceptance as a viable and effective solution to ubiquitous broadband Internet access. This paper addresses the security of WMNs, which is a key impediment to wide-scale deployment of WMNs, but thus far receives little attention. We first thoroughly identify the unique security requirements of WMNs for the first time in the literature. We then propose ARSA, an attack-resilient security architecture for WMNs. In contrast to a conventional cellular-like solution, ARSA eliminates the need for establishing bilateral roaming agreements and having real-time interactions between potentially numerous WMN operators. With ARSA in place, each user is no longer bound to any specific network operator, as he or she ought to do in current cellular networks. Instead, he or she acquires a universal pass from a third-party broker whereby to realize seamless roaming across WMN domains administrated by different operators. ARSA supports efficient mutual authentication and key agreement both between a user and a serving WMN domain and between users served by the same WMN domain. In addition, ARSA is designed to be resilient to a wide range of attacks. We also discuss other important issues such as incontestable billing.
Feasibility Study of Mesh Networks for All-Wireless Offices
- in Proc. of MobiSys
, 2006
"... There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, none of the prior work has evaluated the feasibility of applications on mesh through the use of deployed networks and rea ..."
Abstract
-
Cited by 42 (2 self)
- Add to MetaCart
(Show Context)
There is a fair amount of evidence that mesh (static multihop wireless) networks are gaining popularity, both in the academic literature and in the commercial space. Nonetheless, none of the prior work has evaluated the feasibility of applications on mesh through the use of deployed networks and real user traffic. The state of the art is the use of deployed testbeds with synthetic traces consisting of random traffic patterns. In this paper, we evaluate the feasibility of a mesh network for an all-wireless office using traces of office users and an actual 21-node multi-radio mesh testbed in an office area. Unlike previous mesh studies that have examined routing design in detail, we examine how different office mesh design choices impact the performance of user traffic. From our traces of 11 users spanning over a month, we identify 3 one hour trace periods with different characteristics
Cognitive Wireless Mesh Networks with Dynamic Spectrum Access
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2008
"... Wireless Mesh Networks (WMNs) are envisaged to extend Internet access and other networking services in personal, local, campus, and metropolitan areas. Mesh routers (MR) form the connectivity backbone while performing the dual tasks of packet forwarding as well as providing network access to the me ..."
Abstract
-
Cited by 36 (4 self)
- Add to MetaCart
Wireless Mesh Networks (WMNs) are envisaged to extend Internet access and other networking services in personal, local, campus, and metropolitan areas. Mesh routers (MR) form the connectivity backbone while performing the dual tasks of packet forwarding as well as providing network access to the mesh clients. However, the performance of such networks is limited by traffic congestion, as only limited bandwidth is available for supporting the large number of nodes in close proximity. This problem can be alleviated by the cognitive radio paradigm that aims at devising spectrum sensing and management techniques, thereby allowing radios to intelligently locate and use frequencies other than those in the 2.4GHzISM band. These promising technologies are integrated in our proposed COgnitive Mesh NETwork (COMNET) algorithmic framework, thus realizing an intelligent frequency-shifting self-managed mesh network. The contribution of this paper is threefold: (1) A new approach for spectrum sensing is devised without any change to the working of existing de facto mesh protocols. (2) An analytical model is proposed that allows MRs to estimate the power in a given channel and location due to neighboring wireless LAN traffic, thus creating a virtual map in space and frequency domains. (3) These models are used to formulate the task of channel assignment within the mesh network as an optimization problem, which is solved in a decentralized manner. Our analytical models are validated through simulation study, and results reveal the benefits of load sharing by adopting unused frequencies for WMN traffic.
