The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Unlike most IEEE 802.11-based ad hoc networks, in which only a single channel is used, wireless mesh networks allow the simultaneous use of multiple channels to increase the aggregated capacity. Many efforts have been taken to better exploit multiple non-overlapped channels. Although the IEEE 802.11 b/g standards, which govern the unlicensed 2.4 GHz industrial, scientific and medical (ISM) band, provide...
The aggregate capacity of wireless mesh networks can be increased by the use of multiple channels. In this paper, we present the joint channel assignment implementation for multi- interface and multi-channel wireless network. To reap the full performance potential of this architecture, we propose and evaluate a combination of centralized and dynamic peer oriented distribution channel assignment, and...
The capacity of wireless channels has been studied extensively by the information theory community over the years. There have been several efforts to extend this theory to multi-hop wireless networks. One approach to estimating the capacity of multihop wireless networks is to determine asymptotically how the capacity scales as the number of nodes in the network increases. In these models, the traffic...
The routing problem in wireless mesh networks is concerned with finding "good" source-destination paths. It generally faces multiple objectives to be optimized, such as i) path capacity, which accounts for the bits per second that can be sent along the path connecting the source to the destination node, and ii) end-to-end delay. This paper presents the mesh routing algorithm (MRA), a dynamic...
We present a novel routing approach for multichannel cognitive radio networks (CRNs). Our approach is based on probabilistically estimating the available capacity of every channel over every CR-to-CR link, while taking into account primary radio (PR). Our routing design consists of two main phases. In the first phase, the source node attempts to compute the most probable path (MPP) to the destination...
Channel capacity and node energy represent resources and constraints in designing efficient routing schemes for Wireless Sensor Networks(WSNs). To delivery more data, a higher rate is desirable, which however consumes more energy and may demand more bandwidth. Hence, data transmission in WSNs should take into account both limited capacity and constrained energy. In this paper, we propose an utility-based...
We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference noise ratio in our formulation. In a previous work, using a duality approach, the optimal link scheduling and power control that minimizes the total average transmission power is found. We formulate this problem as a linear...
The combination of multi-radio nodes in conjunction with a suitably structured mesh architecture has the potential to solve some of the key limitations of present day mesh networks. We propose and evaluate two practical and self-stabilizing channel assignment algorithms for multi-channel dual-radio mesh backhauls. The objective is to find a channel assignment that maximizes network capacity through...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.