Multi-hop optimal position based opportunistic routing for wireless sensor networks

Wireless sensor network is a collection of a group of sensors connected to monitor an area of interest. Installation flexibility, mobility, reduced cost and scalability have given popularity to wireless sensor networks. Opportunistic routing is a routing protocol that takes the advantage of broadcasting nature of wireless sensor network for multi-hop communication. Considering the importance of communication between source-destination pairs in a wireless sensor network a Multi-hop Optimal position based Opportunistic Routing (MOOR) protocol is proposed in this paper. The algorithm chooses the path with minimum distance and number of hops between source and destination for transmission of data in the network. It is illustrated by simulation experiments that the proposed protocol has a good effect on End-to-End delay and lifetime of the network. In addition, it is observed that the average End-to-End delay is lesser for different simulation times when compared with existing EEOR protocol

Simulation Based Comparative Performance Analysis of OSPF and EIGRP Routing Protocols

In the computer networks, the data traffic transmission is based on the routing protocol which select the best routes between two nodes. Variety of routing protocols are applied to specific network environments. Routing protocol\ud is taking a crucial role in the modern communication networks and its functionality is to determine how the routers communicate with each other and forward the packets through the optimal path from source to destination node. In\ud this paper, two typical types of routing protocol are chosen as the simulation samples: EIGRP and OSPF. Each of them has different architecture, route delays and convergence characteristics. The aim is to present a simulation based comparative analysis between EIGRP and OSPF for real time applications considering realistic backbone communication links and existing subnets. The\ud evaluation of the proposed routing protocols is performed based on the widely accepted quantitative metrics such as: convergence time, end-to-end delay, jitter, packet loss and throughput of the simulated network models. Tractable\ud conclusions and discussions are presented for each protocols and multi-protocol network implementations

Energy-delay bounds analysis in wireless multi-hop networks with unreliable radio links

Energy efficiency and transmission delay are very important parameters for wireless multi-hop networks. Previous works that study energy efficiency and delay are based on the assumption of reliable links. However, the unreliability of the channel is inevitable in wireless multi-hop networks. This paper investigates the trade-off between the energy consumption and the end-to-end delay of multi-hop communications in a wireless network using an unreliable link model. It provides a closed form expression of the lower bound on the energy-delay trade-off for different channel models (AWGN, Raleigh flat fading and Nakagami block-fading) in a linear network. These analytical results are also verified in 2-dimensional Poisson networks using simulations. The main contribution of this work is the use of a probabilistic link model to define the energy efficiency of the system and capture the energy-delay trade-offs. Hence, it provides a more realistic lower bound on both the energy efficiency and the energy-delay trade-off since it does not restrict the study to the set of perfect links as proposed in earlier works

Throughput Optimal Flow Allocation on Multiple Paths for Random Access Wireless Multi-hop Networks

In this paper we consider random access wireless multi-hop mesh networks with multi-packet reception capabilities where multiple flows are forwarded to the gateways through node disjoint paths. We address the issue of aggregate throughput-optimal flow rate allocation with bounded delay guarantees. We propose a distributed flow rate allocation scheme that formulates flow rate allocation as an optimization problem and derive the conditions for non-convexity for an illustrative topology. We also employ a simple model for the average aggregate throughput achieved by all flows that captures both intra- and inter-path interference. The proposed scheme is evaluated through NS-2 simulations. Our preliminary results are derived from a grid topology and show that the proposed flow allocation scheme slightly underestimates the average aggregate throughput observed in two simulated scenarios with two and three flows respectively. Moreover it achieves significantly higher average aggregate throughput than single path utilization in two different traffic scenarios examined.Comment: Accepted for publication at the 9th IEEE BROADBAND WIRELESS ACCESS WORKSHOP (BWA2013), IEEE Globecom 2013 Workshop

Reliable multi-hop routing with cooperative transmissions in energy-constrained networks

We present a novel approach in characterizing the optimal reliable multi-hop virtual multiple-input single-output (vMISO) routing in ad hoc networks. Under a high node density regime, we determine the optimal cardinality of the cooperation sets at each hop on a path minimizing the total energy cost per transmitted bit. Optimal cooperating set cardinality curves are derived, and they can be used to determine the optimal routing strategy based on the required reliability, transmission power, and path loss coefficient. We design a new greedy geographical routing algorithm suitable for vMISO transmissions, and demonstrate the applicability of our results for more general networks