DS-VBF : dual sink vector-based routing protocol for underwater wireless sensor network

Underwater wireless sensor networks (UWSNs) have become the seat of researchers' attention recently due to their proficiency to explore underwater areas and design different applications for marine discovery and oceanic surveillance. One of the main objectives of each deployed underwater network is discovering the optimized path over sensor nodes to transmit the monitored data to onshore station. The process of transmitting data consumes energy of each node, while energy is limited in UWSNs. So energy efficiency is a challenge in underwater wireless sensor network. Dual sinks vector based forwarding (DS-VBF) takes both residual energy and location information into consideration as priority factors to discover an optimized routing path to save energy in underwater networks. The modified routing protocol employs dual sinks on the water surface which improves network lifetime. According to deployment of dual sinks, packet delivery ratio and the average end to end delay are enhanced. Based on our simulation results in comparison with VBF, average end to end delay reduced more than 80%, remaining energy increased 10%, and the increment of packet reception ratio was about 70%.

A Slotted Aloha joint MAC-cum-Routing protocol for data gathering sensor network applications

In this paper we have proposed and implemented a joint Medium Access Control (MAC) -cum- Routing scheme for environment data gathering sensor networks. The design principle uses node 'battery lifetime' maximization to be traded against a network that is capable of tolerating: A known percentage of combined packet losses due to packet collisions, network synchronization mismatch and channel impairments Significant end-to-end delay of an order of few seconds We have achieved this with a loosely synchronized network of sensor nodes that implement Slotted-Aloha MAC state machine together with route information. The scheme has given encouraging results in terms of energy savings compared to other popular implementations. The overall packet loss is about 12%. The battery life time increase compared to B-MAC varies from a minimum of 30% to about 90% depending on the duty cycle.

An Efficient Distributed Scheme for Source Routing Protocol in Communication Networks

In this paper, we propose an efficient source routing algorithm for unicast flows, which addresses the scalability problem associated with the basic source routing technique. Simulation results indicate that the proposed algorithm indeed helps in reducing the message overhead considerably, and at the same time it gives comparable performance in terms of resource utilization across a wide range of workloads.

Routing protocol enhancement for handling node mobility in wireless sensor networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Energy Optimized Secure Routing Protocol for Wireless Sensor Networks

The evolution of wireless sensor network technology has enabled us to develop advanced systems for real time monitoring. In the present scenario wireless sensor networks are increasingly being used for precision agriculture. The advantages of using wireless sensor networks in agriculture are distributed data collection and monitoring, monitor and control of climate, irrigation and nutrient supply. Hence decreasing the cost of production and increasing the efficiency of production. This paper describes the security issues related to wireless sensor networks and suggests some techniques for achieving system security. This paper also discusses a protocol that can be adopted for increasing the security of the transmitted data

Routing Protocol Enhancement for handling Node Mobility in Wireless Sensor Networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

Energy Aware Cluster-based Multihop Routing Protocol for Sensor Networks

Clustering combined with multihop communication is a promising solution to cope with the energy requirements of large scale Wireless Sensor Networks. In this work, a new cluster based routing protocol referred to as Energy Aware Cluster-based Multihop (EACM) Routing Protocol is introduced, with multihop communication between cluster heads for transmitting messages to the base station and direct communication within clusters. We propose EACM with both static and dynamic clustering. The network is partitioned into near optimal load balanced clusters by using a voting technique, which ensures that the suitability of a node to become a cluster head is determined by all its neighbors. Results show that the new protocol performs better than LEACH on network lifetime and energy dissipation

Routing Protocol Enhancement for handling Node Mobility in Wireless Sensor Networks

In wireless sensor networks, the routing algorithms currently available assume that the sensor nodes are stationary. Therefore when mobility modulation is applied to the wireless sensor networks, most of the current routing algorithms suffer from performance degradation. The path breaks in mobile wireless networks are due to the movement of mobile nodes, node failure, channel fading and shadowing. It is desirable to deal with dynamic topology changes with optimal effort in terms of resource and channel utilization. As the nodes in wireless sensor medium make use of wireless broadcast to communicate, it is possible to make use of neighboring node information to recover from path failure. Cooperation among the neighboring nodes plays an important role in the context of routing among the mobile nodes. This paper proposes an enhancement to an existing protocol for accommodating node mobility through neighboring node information while keeping the utilization of resources to a minimum.

A mesh based anycast routing protocol for ad hoc networks

Ad hoc networks became a hot topic recently, but the routing algorithm of anycast in the ad hoc networks has not yet been much explored. In this paper, we propose a mesh-based anycast routing algorithm (MARP) for ad hoc networks. The proposed routing model is robust and reliable, which can solve the unsteady topology problem in ad hoc networks. The future work is discussed at the end of this paper.

A case for cross layer design: the impact of physical layer properties on routing protocol performance in MANETs

In this work we evaluate the performance of routing protocols for mobile ad hoc networks using different physical layer models. The results obtained show that the performance results obtained using idealized models such as the free space propagation model vary significantly when propagation effects such as path loss and shadowing are considered. This difference in performance indicates that optimization is required in the protocol development space that takes into account channel state information (CSI). Such an optimization requires a cross layer approach to be adopted and a framework for protocol performance evaluation to be established. We believe that this work would serve as a first step in this direction. We provide comparative performance results through network simulations.

GeoConnect : geographic and connectivity-aware routing protocol for wireless sensor network

Sensor nodes are closely tied with their geographic location and their connectivity. In recent years many routing protocols have been developed to provide efficient strategy. But most of them are either focus on the geographic proximity or on connectivity. However in sparse network, Geographic routing would fail at local dead ends where a node has no neighbour closer to destination. In contrast, connectivity-based routing may result in non-optimal path and overhead management. In this paper we designed a scalable and distributed routing protocol, GeoConnect, which considers geographic proximity and connectivity for choosing next hop. In GeoConnecl, we construct a new naming system that integrates geographic and connectivity information into a node identification. We use dissimilarity function to compute the dissimilarity and apply a distributed routing algorithm to route packets. The experimental results show that GeoConnect routing provides robust and better performance than sole geographic routing or connectivity routing.

M-Dimension : multi-characteristics based routing protocol in human associated delay-tolerant networks with improved performance over one dimensional classic models

Human associated delay-tolerant network (HDTN) is a new delay-tolerant network where mobile devices are associated with humans. It can be viewed from both their geographic and social dimensions. The combination of these different dimensions can enable us to more accurately comprehend a delay-tolerant network and consequently use this multi-dimensional information to improve overall network efficiency. Alongside the geographic dimension of the network which is concerned with geographic topology of routing, social dimensions such as social hierarchy can be used to guide the routing message to improve not only the routing efficiency for individual nodes, but also efficiency for the entire network.

We propose a multi-dimensional routing protocol (M-Dimension) for the human associated delay-tolerant network which uses the local information derived from multiple dimensions to identify a mobile node more accurately. Each dimension has a weight factor and is organized by the Distance Function to select an intermediary and applies multi-cast routing. We compare M-Dimension to existing benchmark routing protocols using the MIT Reality Dataset, a well-known benchmark dataset based on a human associated mobile network trace file. The results of our simulations show that M-Dimension has a significant increase in the average success ratio and is very competitive when End-to-End Delay of packet delivery is used in comparison to other multi-cast DTN routing protocols.

CodePipe : an opportunistic feeding and routing protocol for reliable multicast with pipelined network coding

Multicast is an important mechanism in modern wireless networks and has attracted significant efforts to improve its performance with different metrics including throughput, delay, energy efficiency, etc. Traditionally, an ideal loss-free channel model is widely used to facilitate routing protocol design. However, the quality of wireless links would be affected or even jeopardized by many factors like collisions, fading or the noise of environment. In this paper, we propose a reliable multicast protocol, called CodePipe, with advanced performance in terms of energy-efficiency, throughput and fairness in lossy wireless networks. Built upon opportunistic routing and random linear network coding, CodePipe not only simplifies transmission coordination between nodes, but also improves the multicast throughput significantly by exploiting both intra-batch and inter-batch coding opportunities. In particular, four key techniques, namely, LP-based opportunistic routing structure, opportunistic feeding, fast batch moving and inter-batch coding, are proposed to offer substantial improvement in throughput, energy-efficiency and fairness. We evaluate CodePipe on ns2 simulator by comparing with other two state-of-art multicast protocols, MORE and Pacifier. Simulation results show that CodePipe significantly outperforms both of them.

Adaptation of LEACH routing protocol to cognitive radio sensor networks

One of the drawbacks of LEACH protocol is the uncontrolled selection of cluster heads which, in some rounds, leads to the concentration of them in a limited area due to the randomness of the selection procedure. LEACH-C is a variant of LEACH that uses a centralized clustering algorithm and forms good clusters through sink control. According to experimental results, the IEEE 802.15.4 packets are damaged by WLAN interferences in ISM band. It seems that, sensor nodes equipped with cognitive radio capabilities can overcome this problem. In cognitive radio sensor networks (CRSN), routing must be accompanied by channel allocation. This requires spectrum management which can be devolved to cluster heads. For this networks, new duty cycle mechanisms must be designed that jointly consider neighbor discovery, and spectrum sensing/allocation. Cluster-based network architecture is a good choice for effective dynamic spectrum management. In such architecture, cluster heads have a proper spatial distribution and are optimally located all over the network. In this paper, using the physical layer information and preserving the feature of random cluster head selection in LEACH, it has been tried to both move the position of cluster heads to appropriate locations and make their quantity optimal. The simulation results show that the transferal of cluster heads to appropriate locations increases the network lifetime significantly though this comes at the price of early instability appearance. By considering the energy level in cluster head election algorithm, one can overcome the network stability issues too. However, this will move the cluster heads away from their appropriate locations. © 2012 IEEE.

Fuzzy logic optimized wireless sensor network routing protocol

Wireless sensor networks (WSNs) are used in health monitoring, tracking and security applications. Such networks transfer data from specific areas to a nominated destination. In the network, each sensor node acts as a routing element for other sensor nodes during the transmission of data. This can increase energy consumption of the sensor node. In this paper, we propose a routing protocol for improving network lifetime and performance. The proposed protocol uses type-2 fuzzy logic to minimize the effects of uncertainty produced by the environmental noise. Simulation results show that the proposed protocol performs better than a recently developed routing protocol in terms of extending network lifetime and saving energy and also reducing data packet lost.