Multihop wireless mesh networks are becoming a new attractive communication paradigm owing to their low cost and ease of deployment. Routing protocols are critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along predetermined paths and face difficulties in coping with unreliable and unpredictable wireless medium. In this paper, we propose a simple opportunistic adaptive routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks. SOAR incorporates the following four major components to achieve high throughput and fairness: 1) adaptive forwarding path selection to leverage path diversity while minimizing duplicate transmissions, 2) priority timer-based forwarding to let only the best forwarding node forward the packet, 3) local loss recovery to efficiently detect and retransmit lost packets, and 4) adaptive rate control to determine an appropriate sending rate according to the current network conditions. We implement SOAR in both NS-2 simulation and an 18-node wireless mesh testbed. Our extensive evaluation shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios.

/pdf/soar-simple-opportunistic-adaptive-routing-protocol-for-vejf426r1q.pdf

SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks

Opportunistic routing is a recent routing paradigm that achieves high throughput in the face of universally lossy wireless links in mobile ad hoc networks, likewise, network coding popularly investigated by many institutes is another approach of improving the throughput in wireless networks. How to combine the both techniques is an interesting research. To our knowledge, this is still an open issue to implement the multicast routing in mobile ad hoc networks simultaneously employing the both mechanisms. Due to feedback explosion, most existing wireless network multicast protocols don't guarantee the reliable delivery. In this paper, we propose a novel reliable multicast protocol based on the opportunistic routing and network coding. Additionally, we also provide an ETX (expected number of transmissions) based cost metric formula of the multicast subgroup. Extensive simulation reveals that the performance of the novel presented multicast routing protocol outperforms the conventional multicast routing protocol in ad hoc wireless networks.

A reliable multicast for MANETs based on opportunistic routing and network coding

The paper presents a heuristic Theoretical Optimal Routing Algorithm(TORA) to achieve location-aided optimal data-gathering structure in wireless sensor networks(WSN). The algorithm's construction is based on a kind of swarm intelligence mechanism, i.e., ant colony optimization (ACO). The novel design of heuristic factor and pheromone updating rule can endow ant-like agents with the ability of detecting the local energy status of networks to approach the theoretical optimal routing. Via the division of WSN into different functional regions and introduction of energy-efficient weight in heuristic factor, the criterion in routing selection can be adaptively adjusted based on asymmetric power configurations and consumption to improve the robustness of data-routing tree. Finally, simulation results show that the proposed routing scheme can contribute to minimize the total communication energy cost, meanwhile, to enhance the QoS- performance and energy-balance effect in data-gathering.

Swarm Intelligence-Inspired Adaptive Routing Construction in WSN

Cooperative communication is known for its various advantages, such as robust to fading, improved diversity gains, capacity gains and increased power consumption performance. It allows for the achievement of effects of the virtual MIMO, so that diversity gain can be obtained from just merely one antenna for each node. However, conventional cooperative communication has low data rates when diversity gain increases. If we do not consider diversity gain to avoid this, we cannot achieve diversity gain. In addition, increasing the number of relays makes networks consume more power. This is one of the most important issues that increase power consumption performance in terms of WSN. Therefore, we propose an appropriate scenario which would increase the number of relays for optimal power consumption in a Wireless Sensor Network in consideration of the data rate, studying the tradeoff between distance (from Source to Destination) and power consumption to determine the optimal power consumption for a network.

The Distance-Power Consumption Tradeoff for Cooperative Wireless Sensor Networks

Cooperative communication allows achieving the effects of the virtual MIMO, so that diversity gain can be obtained from just one antenna for each node. However, conventional cooperative communication causes lower data rates as diversity gain increases. In addition, increasing the number of relays makes networks consume more power. This is one of the most important issues for cooperative Wireless Sensor Networks (WSNs). Therefore, we propose an appropriate system model to achieve the optimal number of relays in terms of power consumption by studying the trade-off between the distance (from source to destination) and power consumption in consideration of the data rate.

The distance-power consumption trade-off with the optimal number of relays for cooperative Wireless Sensor Networks

A major concern in sensor networks is to reduce the data traffic and the energy consumption to extend the lifetime of the network. In this regard, radio transmission is the dominant factor in energy consumption. Therefore, the routing policy has a significant impact on the overall lifespan of the sensor network. For instance, pure multi-hop routing, e.g., tree-based routing, has the drawback that nodes closest to the data collection point (sink node) consume their energy and die first. In this paper, we propose an opportunistic routing mechanism that aims to extend network lifespan by balancing energy consumption. Our approach distributes the power consumption in the network by altering the communication range when applicable. Our experiment results suggest significant improvements when compared to tree-based routing pure multihoping and LEACH based routing.

Chi Chen

Papers

Processed Data Collection using Opportunistic Routing in Location Aware Wireless Sensor Networks