Appearing in 1st IEEE International Workshop on Sensor Net Protocols and Applications (SNPA). Anchorage, Alaska, USA. May 11, 2003. RMST: Reliable Data Transport in Sensor Networks Fred Stann, John Heidemann Abstract – Reliable data transport in wireless sensor networks is a multifaceted problem influenced by the physical, MAC, network, and transport layers. Because sensor networks are subject to strict resource constraints and are deployed by single organizations, they encourage revisiting traditional layering and are less bound by standardized placement of services such as reliability. This paper presents analysis and experiments resulting in specific recommendations for implementing reliable data transport in sensor nets. To explore reliability at the transport layer, we present RMST (Reliable Multi- Segment Transport), a new transport layer for Directed Diffusion. RMST provides guaranteed delivery and fragmentation/reassembly for applications that require them. RMST is a selective NACK-based protocol that can be configured for in-network caching and repair. Second, these energy constraints, plus relatively low wireless bandwidths, make in-network processing both feasible and desirable [3]. Third, because nodes in sensor networks are usually collaborating towards a common task, rather than representing independent users, optimization of the shared network focuses on throughput rather than fairness. Finally, because sensor networks are often deployed by a single organization with inexpensive hardware, there is less need for interoperability with existing standards. For all of these reasons, sensor networks provide an environment that encourages rethinking the structure of traditional communications protocols. The main contribution is an evaluation of the placement of reliability for data transport at different levels of the protocol stack. We consider implementing reliability in the MAC, transport layer, application, and combinations of these. We conclude that reliability is important at the MAC layer and the transport layer. MAC-level reliability is important not just to provide hop-by-hop error recovery for the transport layer, but also because it is needed for route discovery and maintenance. (This conclusion differs from previous studies in reliability for sensor nets that did not simulate routing. [4]) Second, we have developed RMST (Reliable Multi-Segment Transport), a new transport layer, in order to understand the role of in- network processing for reliable data transfer. RMST benefits from diffusion routing, adding minimal additional control traffic. RMST guarantees delivery, even when multiple hops exhibit very high error rates. 1 Introduction Wireless sensor networks provide an economical, fully distributed, sensing and computing solution for environments where conventional networks are impractical. This paper explores the design decisions related to providing reliable data transport in sensor nets. The reliable data transport problem in sensor nets is multi-faceted. The emphasis on energy conservation in sensor nets implies that poor paths should not be artificially bolstered via mechanisms such as MAC layer ARQ during route discovery and path selection [1]. Path maintenance, on the other hand, benefits from well- engineered recovery either at the MAC layer or the transport layer, or both. Recovery should not be costly however, since many applications in sensor nets are impervious to occasional packet loss, relying on the regular delivery of coarse-grained event descriptions. Other applications require loss detection and repair. These aspects of reliable data transport include the provision of guaranteed delivery and fragmentation/ reassembly of data entities larger than the network MTU. Sensor networks have different constraints than traditional wired nets. First, energy constraints are paramount in sensor networks since nodes can often not be recharged, so any wasted energy shortens their useful lifetime [2]. This work was supported by DARPA under grant DABT63-99-1-0011 as part of the SCAADS project, and was also made possible in part due to support from Intel Corporation and Xerox Corporation. Fred Stann and John Heidemann are with USC/Information Sciences Institute, 4676 Admiralty Way, Marina Del Rey, CA, USA E-mail: fstann@usc.edu, johnh@isi.edu. 2 Architectural Choices There are a number of key areas to consider when engineering reliability for sensor nets. Many current sensor networks exhibit high loss rates compared to wired networks (2% to 30% to immediate neighbors)[1,5,6]. While error detection and correction at the physical layer are important, approaches at the MAC layer and higher adapt well to the very wide range of loss rates seen in sensor networks and are the focus of this paper. MAC layer protocols can ameliorate PHY layer unreliability, and transport layers can guarantee delivery. An important question for this paper is the trade off between implementation of reliability at the MAC layer (i.e. hop to hop) vs. the Transport layer, which has traditionally been concerned with end-to-end reliability. Because sensor net applications are distributed, we also considered implementing reliability at the application layer. Our goal is to minimize the cost of repair in terms of transmission.

RMST: Reliable Data Transport in Sensor Networks

Even after 16 years of existence, low energy adaptive clustering hierarchy (LEACH) protocol is still gaining the attention of the research community working in the area of wireless sensor network (WSN). This itself shows the importance of this protocol. Researchers have come up with various and diverse modifications of the LEACH protocol. Successors of LEACH protocol are now available from single hop to multi-hop scenarios. Extensive work has already been done related to LEACH and it is a good idea for a new research in the field of WSN to go through LEACH and its variants over the years. This paper surveys the variants of LEACH routing protocols proposed so far and discusses the enhancement and working of them. This survey classifies all the protocols in two sections, namely, single hop communication and multi-hop communication based on data transmission from the cluster head to the base station. A comparitive analysis using nine different parameters, such as energy efficiency, overhead, scalability complexity, and so on, has been provided in a chronological fashion. The article also discusses the strong and the weak points of each and every variants of LEACH. Finally the paper concludes with suggestions on future research domains in the area of WSN.

A Survey on Successors of LEACH Protocol

/pdf/how-the-mobile-communication-5b8eflx7w5.pdf

How the mobile communication

Cluster-based routing protocols in wireless sensor networks: A survey based on methodology

In recent years, wireless sensor networks (WSNs) have played a major role in applications such as tracking and monitoring in remote environments. Designing energy efficient protocols for routing of data events is a major challenge due to the dynamic topology and distributed nature of WSNs. Main aim of the paper is to discuss hierarchical routing protocols in order to improve the energy efficiency and network lifetime. This paper provides a discussion about hierarchical energy efficient routing protocols based on classical and swarm intelligence approach. The routing protocols belonging to both categories can be summarized according to energy efficiency, data aggregation, location awareness, QoS, scalability, load balancing, fault tolerance, query based and multipath. A systematic literature review has been conducted for hierarchical energy efficient routing protocols reported from 2012 to 2017. This survey provides a technical direction for researchers on how to develop routing protocols. Finally, research gaps in the reviewed protocols and the potential future aspects have been discussed.

Comprehensive review for energy efficient hierarchical routing protocols on wireless sensor networks

A survey on LEACH and other’s routing protocols in wireless sensor network

Energy-efficient routing algorithms must handle power-limitation issue of the sensor nodes intelligently to prolong the network life of wireless networks. Accordingly, it is indispensable to collect and exchange the sensor data in an optimized way to reduce energy consumption. Subsequently, an ACO Optimized Self-Organized Tree-Based (AOSTEB) Energy Balance Algorithm for Wireless Sensor Network has been proposed that discovers an efficient route during intra-cluster communication. AOSTEB scheme operates in three phases: cluster-formation, multi-path creation, and data transmission. During cluster-formation, the desired number of sensor nodes are alleviated to the role of cluster-heads (CHs), and the remaining neighboring sensor nodes join the nearest CHs to form a cluster. Further, the multiple paths between the CH and member nodes are discovered using Ant Colony Optimization algorithm. A dynamic energy efficient optimized route is selected within a specific cluster on account of shortest distance and less energy-consumption to initiate the data exchange process within the cluster. The extensive simulation observations ascertain the efficiency of the proposed algorithm by demonstrating the prolonged network lifetime, enhanced stability period, and reduced energy consumption in contrast to the earlier reported works in wireless sensor networks.

ACO optimized self-organized tree-based energy balance algorithm for wireless sensor network: AOSTEB

A distributed, multi‐hop, adaptive, tree‐based energy‐balanced routing approach

Ant colony optimization (ACO) is a well-applied technique to solve the real-time problem of discovering the energy-efficient routes to transmit the sensing information to the base station (BS). Traditionally, ACO incorporated wireless sensor networks used only one pheromone, i.e., minimum distance between the sensor nodes to discover the optimum route to the BS. The authors illustrated a multiple pheromone-based ACO technique known as multiple pheromone ant colony optimization (MPACO), for instance, distance between sensing nodes, their residual energy and number of neighbor nodes to ascertain an efficient route. MPACO enables the sensing nodes to transmit the sensing data to BS over optimal routes with economical energy consumption to achieve a prolonged network life span. The comprehensive evaluation reveals that MPACO proffers 20% more network lifetime than the current existing ACO technique, i.e., improved ACO. Moreover, MPACO shows a significant improvement of 300% in network life span than another existing fuzzy-based strategy, i.e., multi-objective fuzzy clustering algorithm.

A multiple pheromone ant colony optimization scheme for energy-efficient wireless sensor networks

Wireless local area networks (WLANs) are in a period of great expansion and there is a strong need for them to support multimedia applications. With the increasing demand and penetration of wireless services, users of wireless networks now expect Quality of Service (QoS) and performance comparable to what is available from fixed networks. Providing QoS requirements like good throughput and minimum access delay are challenging tasks with regard to 802.11 WLAN protocols and Medium Access Control (MAC) functions.

Vishal Arora

Papers

A survey on LEACH and other’s routing protocols in wireless sensor network

ACO optimized self-organized tree-based energy balance algorithm for wireless sensor network: AOSTEB

A distributed, multi‐hop, adaptive, tree‐based energy‐balanced routing approach

A multiple pheromone ant colony optimization scheme for energy-efficient wireless sensor networks

QoS in WLAN Using IEEE802.11e: Survey of QoS in MAC Layer Protocols