Local heuristic for the refinement of multi-path routing in wireless mesh networks

We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR, as well as their multi-path variants, as underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern

Throughput optimization in MPR-capable multi-hop wireless networks

Recent advances in the physical layer have enabled the simultaneous reception of multiple packets by a node in wireless networks. This capability has the potential of improving the performance of multi-hop wireless networks by a logarithmic factor with respect to current technologies. However, to fully exploit multiple packet reception (MPR) capability, new routing and scheduling schemes must be designed. These schemes need to reformulate a historically underlying assumption in wireless networks which states that any concurrent transmission of two or more packets results in a collision and failure of all packet receptions. In this work, we present a generalized model for the throughput optimization problem in MPR-capable multi-hop wireless networks. The formulation incorporates not only the MPR protocol model to quantify interference, but also the multi-access channel. The former is related with the MAC and routing layers, and considers a packet as the unit of transmission. The latter accounts for the achievable capacity of links used by simultaneous packet transmissions. The problem is modeled as a joint routing and scheduling problem. The scheduling subproblem deals with finding the optimal schedulable sets, which are defined as subsets of links that can be scheduled or activated simultaneously. Among other results, we demonstrate that any solution of the scheduling subproblem can be built with |E| + 1 or fewer schedulable sets, where |E| is the number of links of the network. This result contrasts with a conjecture that states that a solution of the scheduling subproblem, in general, is composed of an exponential number of schedulable sets. The model can be applied to a wide range of networks, such as half and full duplex systems, networks with directional and omni-directional antennas with one or multiple transmit antennas per node. Due to the hardness of the problem, we propose several polynomial time schemes based on a combination of linear programming, approximation algorithm and greedy paradigms. We illustrate the use of the proposed schemes to study the impact of several design parameters such as decoding capability and number of transmit antennas on the performance of MPR-capable networks

Topology-Transparent Scheduling in Mobile Ad Hoc Networks With Multiple Packet Reception Capability

Recent advances in the physical layer have enabled wireless devices to have multiple packet reception (MPR) capability, which is the capability of decoding more than one packet, simultaneously, when concurrent transmissions occur. In this paper, we focus on the interaction between the MPR physical layer and the medium access control (MAC) layer. Some random access MAC protocols have been proposed to improve the network performance by exploiting the powerful MPR capability. However, there are very few investigations on the schedule-based MAC protocols. We propose a novel m-MPR-l-code topology-transparent scheduling ((m, l)-TTS) algorithm for mobile ad hoc networks with MPR, where m indicates the maximum number of concurrent transmissions being decoded, and l is the number of codes assigned to each user. Our algorithm can take full advantage of the MPR capability to improve the network performance. The minimum guaranteed throughput and average throughput of our algorithm are studied analytically. The improvement of our (m, l)-TTS algorithm over the conventional topology-transparent scheduling algorithms with the collision-based reception model is linear with m. The simulation results show that our proposed algorithm performs better than slotted ALOHA as well.published_or_final_versio

Cross-layer Design for Wireless Mesh Networks with Advanced Physical and Network Layer Techniques

Cross-layer optimization is an essential tool for designing wireless network protocols. We present a cross-layer optimization framework for wireless networks where at each node, various smart antenna techniques such as beam-forming, spatial division multiple access and spatial division multiplexing are employed. These techniques provide interference suppression, capability for simultaneous communication with several nodes and transmission with higher data rates, respectively. By integrating different combinations of these multi-antenna techniques in physical layer with various constraints from MAC and network layers, three Mixed Integer Linear Programming models are presented to minimize the scheduling period. Since these optimization problems are combinatorially complex, the optimal solution is approached by a Column Generation (CG) decomposition method. Our numerical results show that the resulted directive, multiple access and multiplexing gains combined with scheduling, effectively increase both the spatial reuse and the capacity of the links and therefore enhance the achievable system throughput. The introduced cross-layer approach is also extended to consider heterogeneous networks where we present a multi-criteria optimization framework to model the design problem with an objective of jointly minimizing the cost of deployment and the scheduling period. Our results reveal the significant benefits of this joint design method. We also investigate the achievable performance gain that network coding (with opportunistic listening) when combined with Successive Interference Cancellation (SIC) brings to a multi-hop wireless network. We develop a cross-layer formulation in which SIC enables concurrent receptions from multiple transmitters and network coding reduces the transmission time-slot for minimizing the scheduling time. To solve this combinatorially complex non-linear problem, we decompose it to two linear sub-problems; namely opportunistic network coding aware routing, and scheduling sub-problems. Our results affirm our expectation for a remarkable performance improvement when both techniques are jointly used. Further, we develop an optimization model for combining SIC with power control (PC). Our model optimally adjusts the transmission power of nodes to avoid interference on unintended receivers and properly embraces undesired interference through SIC. Therefore, it provides a balance between usage of PC and SIC at the transmitting and receiving sides, respectively. Our results show considerable throughput improvement in dense and heavily loaded networks

Aggregation Latency-Energy Tradeoff in Wireless Sensor Networks with Successive Inter- ference Cancellation

published_or_final_versio