A review on routing protocols for application in wireless sensor networks

Wireless sensor networks are harshly restricted by storage capacity, energy and computing power. So it is essential to design effective and energy aware protocol in order to enhance the network lifetime. In this paper, a review on routing protocol in WSNs is carried out which are classified as data-centric, hierarchical and location based depending on the network structure. Then some of the multipath routing protocols which are widely used in WSNs to improve network performance are also discussed. Advantages and disadvantages of each routing algorithm are discussed thereafter. Furthermore, this paper compares and summarizes the performances of routing protocols.Comment: 20 pages, 16 figures, 2 table

Reliable Robust and Real-Time Communication Protocol for Data Delivery in Wireless sensor Networks

WSNs can be considered a distributed control system designed to react to sensor information with an effective and timely action. For this reason, in WSNs it is important to provide real-time coordination and communication to guarantee timely execution of the right actions. In this paper a new communication protocol RRRT to support robust real-time and reliable event data delivery with minimum energy consumption and with congestion avoidance in WSNs is proposed. The proposed protocol uses the fault tolerant optimal path for data delivery. The proposed solution dynamically adjust their protocol configurations to adapt to the heterogeneous characteristics of WSNs. Specifically, the interactions between contention resolution and congestion control mechanisms as well as the physical layer effects in WSNs are investigated.Comment: 15 pages, 6 figure

An Adaptive and Multi-Service Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are highly distributed networks consisting of a large number of tiny, low-cost, light-weight wireless nodes deployed to monitor an environment or a system. Each node in a WSN consists of three subsystems: the sensor subsystem which senses the environment, the processing subsystem which performs local computations on the sensed data, and the communication subsystem which is responsible for message exchange with neighboring sensor nodes. While an individual sensor node has limited sensing region, processing power, and energy, networking a large number of sensor nodes give rise to a robust, reliable, and accurate sensor network covering a wide region. Thus, routing in WSNs is a very important issue. This paper presents a query-based routing protocol for a WSN that provides different levels of Quality of Service (QoS): energy-efficiency, reliability, low latency and fault-tolerance-under different application scenarios. The algorithm has low computational complexity but can dynamically guarantee different QoS support depending on the requirement of the applications. The novelty of the proposed algorithm is its ability to provide multiple QoS support without reconfiguration and redeployment of the sensor nodes. The algorithm is implemented in network simulator ns-2 and its performance has been evaluated. The results show that the algorithm is more efficient than some of the currently existing routing algorithms for WSNs.Comment: 6 pages, 8 figures. 16th IEEE Asia-Pacific Conference on Communications (APCC) 2010, Auckland, New Zealand, October 31 - November 3, 201

A Delay Aware Routing Protocol for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) consist of sensor nodes which can be deployed for various operations such as agriculture and environmental sensing, wild life monitoring, health care, military surveillance, industrial control, home automation, security etc. Quality of Service (QoS) is an important issue in wireless sensor networks (WSNs) and providing QoS support in WSNs is an emerging area of research. Due to resource constraints nature of sensor networks like processing power, memory, bandwidth, energy etc. providing QoS support in WSNs is a challenging task. Delay is an important QoS parameter for forwarding data in a time constraint WSNs environment. In this paper we propose a delay aware routing protocol for transmission of time critical event information to the Sink of WSNs. The performance of the proposed protocol is evaluated by NS2 simulations under different scenarios.Comment: 6 Pages, 8 Figures, journa

Real Time and Energy Efficient Transport Protocol for Wireless Sensor Networks

Reliable transport protocols such as TCP are tuned to perform well in traditional networks where packet losses occur mostly because of congestion. Many applications of wireless sensor networks are useful only when connected to an external network. Previous research on transport layer protocols for sensor networks has focused on designing protocols specifically targeted for sensor networks. The deployment of TCP/IP in sensor networks would, however, enable direct connection between the sensor network and external TCP/IP networks. In this paper we focus on the performance of TCP in the context of wireless sensor networks. TCP is known to exhibit poor performance in wireless environments, both in terms of throughput and energy efficiency. To overcome these problems we introduce a mechanism called TCP Segment Caching .We show by simulation that TCP Segment Caching significantly improves TCP Performance so that TCP can be useful e en in wireless senso

Link and Location Based Routing Mechanism for Energy Efficiency in Wireless Sensor Networks

In Wireless Sensor Networks, sensed data are reported to the sink by the available nodes in the communication range. The sensed data should be reported to the sink with the frequency expected by the sink. In order to have a communication between source and sink, Link based routing is used. Link based routing aims to achieve an energy efficient and reliable routing path. This mechanism considers the status (current energy level in terms of Joules) of each node, link condition (number of transmissions that the Cluster Head (CH)and the Gateway (GW) candidates conducts) and the transmit power (power required for transmission in terms of Joules). A metric called Predicted Transmission Count (PTX) for each node is calculated using its status, link condition and transmit power. The node which has highest PTX will have the highest priority and it will be the potential candidate to act as CH or GW. Thus the selection of proper CH or GW reduces the energy consumption, and the network lifetime is increased.Comment: 6 pages, 3 figure

Comparative Analysis of Routing Protocols for Under Water Wireless Sensor Networks

Underwater Wireless Sensor Networks are significantly different from terrestrial sensor networks due to peculiar characteristics of low bandwidth, high latency, limited energy, node float mobility and high error probability. These features bring many challenges to the network protocol design of UWSNs. Several routing protocols have been developed in recent years for these networks. One of the major difficulties in comparison and validation of the performance of these proposals is the lack of a common standard to model the acoustic propagation in the harsh underwater environment. In this paper we analyze the evolution of certain underwater routing protocols like VBF, DBR, H2-DAB, QELAR etc. in terms of their localization techniques, energy minimization characteristics and holding time calculations. The design of each protocol follows certain goals i.e. reduction of energy consumption, improvement of communication latency, achievement of robustness and scalability etc. This paper examines the main approaches and challenges in the design and implementation of underwater sensor networks. The detailed descriptions of the selected protocols contribute in understanding the direction of the current research on routing layer in UWSN

Real Time scheduling with Virtual Nodes for Self Stabilization in Wireless Sensor Networks

In this paper we propose a new scheduling algorithm called Real Time Scheduling (RTS) which uses virtual nodes for self stabilization. This algorithm deals with all the contributing components of the end-to-end travelling delay of data packets in sensor network and with virtual nodes algorithm achieves QoS in terms of packet delivery, multiple connections, better power management and stable routes in case of failure. RTS delays packets at intermediate hops (not just prioritizes them) for a duration that is a function of their deadline. Delaying packets allows the network to avoid hot spotting while maintaining deadline-faithfulness. We compare RTS with another prioritizing and scheduling algorithm for real-time data dissemination in sensor networks, velocity monotonic scheduling. This paper simulates RTS based on two typical routing protocols, shortest path routing and greedy forwarding with J-Sim.Comment: arXiv admin note: substantial text overlap with arXiv:cs/0608069 by other authors without attributio

Reliable Group Communication Protocol for Internet of Things

In this paper, we propose RECOUP, a reliable group communication routing protocol for IoT networks. RECOUP efficiently uses a low-overhead cluster-based multicast routing technique on top of the RPL protocol. RECOUP increases the probability of message delivery to the intended destination(s), irrespective of the network size and faults (such as broken links or non-responsive nodes), and in the presence of misbehaving nodes.We show that the cluster-based routing mechanism of RECOUP remains robust in presence of various topology (i.e., rank and sybil) and data communication (i.e., blackhole, wormhole, and jamming) attacks targeting the IoT networking infrastructure.An implementation of RECOUP is realized in Contiki. Our results show the effectiveness of RECOUP over state-of-art protocols concerning packet delivery ratio to 25%, end-to-end delay down to 100 ms, low radio transmissions required for per packet delivery to 6 mJ, and most importantly, it improves the robustness and scalability of data communication process in thewhole network.Comment: 14 Pages, 11 Figure

Geographic routing protocols for underwater wireless sensor networks:a survey

Underwater wireless sensor networks (UWSN), similar to the terrestrial sensor networks, have different challenges such as limited bandwidth, low battery power, defective underwater channels, and high variable propagation delay. A crucial problem in UWSN is finding an efficient route between a source and a destination. Consequently, great efforts have been made for designing efficient protocols while considering the unique characteristics of underwater communication. Several routing protocols are proposed for this issue and can be classified into geographic and non-geographic routing protocols. In this paper we focus on the geographic routing protocols. We introduce a review and comparison of different algorithms proposed recently in the literature. We also presented a novel taxonomy of these routing in which the protocols are classified into three categories (greedy, restricted directional flooding and hierarchical) according to their forwarding strategies.Comment: 19 pages, IJWMN journa