Transmission power and data rate aware routing on wireless networks
Federal University of Minas Gerais, BrazilComputer Networks (Impact Factor: 1.26). 12/2010; 54(17):2979-2990. DOI: 10.1016/j.comnet.2010.05.009
Wireless networks can vary both the transmission power and modulation of links. Existing routing protocols do not take transmission power control (TPC) and modulation adaptation (also known as rate adaptation – RA) into account at the same time, even though the performance of wireless networks can be significantly improved when routing algorithms use link characteristics to build their routes. This article proposes and evaluates extensions to routing protocols to cope with TPC and RA. The enhancements can be applied to any link state or distance vector routing protocols. An evaluation considering node density, node mobility and link error show that TPC- and RA-aware routing algorithms improve the average latency and the end-to-end throughput, while consuming less energy than traditional protocols.
Conference Paper: Self-configuration of wireless multi-hop networks[Show abstract] [Hide abstract]
ABSTRACT: The extreme dynamics of wireless multi-hop networks (WMN) - those that use multiple wireless links to forward data - require self-configuration solutions in every communication layer. Self-configuration demands mechanisms for information sharing, as well as specific decision-making algorithms for each service or application. Self-configuration must also be embedded in the communication layers in order to cope with changes in the wireless environment. This article is a digest of the three contributions of, which investigated the self-configuration tasks of programmability, sharing of information and specialized control loops for WMN. First, we designed a middleware, based on the Information Plane (InP) concept, to ease the programmability and sharing of information among nodes. Next, we proposed two InP-based control loops for WMN: one for data rate and transmission power aware routing, and another for mobile context-aware peer-to-peer services.
- [Show abstract] [Hide abstract]
ABSTRACT: Traffic in an infrastructure wireless mesh network is routed over multiple hops between clients and gateways, hence performance can be significantly reduced where links interfere with each other. In this paper we consider the problem of optimising link scheduling for wireless mesh networks, making a number of contributions. Adopting a protocol-based model, we introduce an integer programming approach for an optimised schedule using a time-slot model. This model compares favourably against previously published methods and we introduce a rapid heuristic approximation that can present near-optimal solutions in a fraction of the time. We show that taking into consideration the affect of varying data rates across individual links during different time slots can further enhance the throughput achieved. This decreases the local data rate on some links but concurrently reduces the interference range of the transmitted signal which increases spatial reuse across the network. We present efficient heuristics to rapidly find near-optimal solutions to an integer programming model of this problem and provide rigorous justification on benchmark problems.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.