Dhanashri Narayan Wategaonkar

Bio: Dhanashri Narayan Wategaonkar is an academic researcher from VIT University. The author has contributed to research in topics: Wireless sensor network & Network packet. The author has an hindex of 3, co-authored 6 publications receiving 17 citations. Previous affiliations of Dhanashri Narayan Wategaonkar include Massachusetts Institute of Technology.

Characterization of reliability in WSN

Abstract: A wireless sensor network (WSN) consists of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, pressure, etc. and to cooperatively pass their data through the network to a main location. In WSN the delivery of all sending packet is important so we called it as reliability. In transport layer reliable message delivery and congestion control are important factors. The aptitude of the network to ensure reliable data transmission in a state of continuous change of network structure. This paper focuses on the existing transport protocols provide the entire requirement of transport protocol, the factors affecting the reliability and different ways to achieve reliability.

On improvement of performance for transport protocol using sectoring scheme in wsn

Abstract: A wireless sensor network (WSN) consists of spatially disseminated self-governing sensors to examine physical or ecological situation. In WSN the delivery of all sending packet is important. In transport layer reliable message delivery and congestion control are significant factors. The aptitude of the network is to ensure reliable data transmission in a state of continuous change of network structure. This paper focuses on sectoring scheme which incorporates the logical sectors in existing WSN. Finally the proposed scheme is compare for its performance against QoS parameters.

Multi-hop Energy-Efficient Reliable Cluster-based Sectoring Scheme Using Markov Chain Model to Improve QoS Parameters in a WSN

Abstract: The data dissemination toward the sink node in a wireless sensor network in one of three ways: single-hop data dissemination, multi-hop dissemination, and multi-hop dissemination, using the nearest cluster head or sector head (SH). This study focuses on third multi-hop data dissemination in which SHs are selected in the network, other nodes disseminate data toward these SHs, and then, the SHs transfer the collected data to the sink node. This paper proposes a novel approach to SH selection called Energy-Efficient Reliable Sectoring-Scheme (EERSS). It is supported by an optimization algorithm called Cat Swarm Optimization (CSO), which proves that the elected number of SH is optimal. This CSO based EERSS algorithm is implemented to rank quality of service parameters, such as network lifetime maximization, with reliability and to minimize energy consumption. A path reliability prediction-based Markov chain model is applied to the CSO-based-EERSS algorithm to achieve results that are superior to that of traditional models. After the construction of the proposed prediction algorithms CSO-based-EERSS (P-CSO-EERSS), its performance is compared with that of the traditional CSO-based-EERSS, EERSS, and Particle Swarm Optimization based EERSS, concerning packet delivery ratio(PDR), end-to-end delay, and energy consumption. The SH selection performance of the proposed P-CSO-EERSS is superior to that of the traditional algorithms based on low energy consumption and high PDR.

A Survey on Reliability in Wireless Sensor Network

Abstract: Objectives: This study was conducted to identify Quality of Service parameters used in network. Different reliability types and performance metrics needed to predict reliability in wireless sensor network. Methods/Analysis: Sectoring scheme can be used for partitioning of network into different sectors. This scheme is used to improve reliability in wireless sensor network. Findings: In existing method various clustering algorithms are used for partitioning of network. Clustering consists of position of cluster head and if it far away from the sink in large network, the cluster node utilizes more energy. Therefore, for WSNs, it is especially vital to intend an algorithm to divide sensors in sectors to maximize the reliability (packet) and minimize the energy consumption apply for transformation of information from the sensor nodes to the base station i.e., sink node. Application/Improvement: Sectoring scheme is unique method used to acquire more packet delivery ratio i.e., the reliability of a sensor based network. To achieve reliability, different factors need to be considered for network review like number of sectors, angle between two sectors, packet size, node density, MAC protocols and Routing protocols.

Modeling of clustering and sectoring approach in WSN

Abstract: This paper emphasis on different hierarchical routing protocols in wireless sensor network. The Clustering approached is used in LEACH protocol for better communication with energy saving. The Sectoring Scheme is used in MARS approach for dividing the sensor network into different sectors. It improves reliability of an application or network. The working of both the approaches is explained in algorithmic form. The mathematical modeling of LEACH and MARS protocol is discussed.

RMST: Reliable Data Transport in Sensor Networks

Abstract: 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.

Intelligent Query-Based Data Aggregation Model and Optimized Query Ordering for Efficient Wireless Sensor Network

Abstract: Data aggregation algorithms play a primary role in WSN, as it collects and aggregates the data in an energy efficient manner so that the life expectancy of the network is extended. This paper intends to develop a query-based aggregation model for WSN using the advanced optimization algorithm called group search optimization (GSO). The proposed model is constructed in such a way that the querying order (QO) can be ranked based on latency and throughput. Accordingly, the main objective of the proposed GSO-based QO is to minimize the latency and maximize the throughput of WSN. The proposed data aggregation model facilitates the network administrator to understand the best queries so that the performance of the base station can be improved. After framing the model, it compares the performance of GSO-based QO with the traditional PSO-based QO, FF-based QO, GA-based QO, ABC-based QO and GSO-based QO in terms of idle time and throughput. Thus the data aggregation performance of proposed GSO-based QO is superior to the traditional algorithms by attaining high throughput and low latency.

Modeling the Message Alternative Routes in a Large Scale Wireless Sensor Network

Abstract: One of the most common methods for relaying messages in a variety of networks is the shortest path. In terms of energy and time, it provides an effective message relaying to the destination through many nodes. The shortest hop or distance path can be constructed using a variety of algorithms. However, no algorithm for building a shortest hop multipath for wireless sensor networks (WSNs) has yet been proposed in the literature. This paper proposed a distributed shortest hop multipath algorithm for WSNs. An alternative approach is suggested as a path in the case of allocating certain node on another path at the same time to avoid the busy path. This case to solve the simultaneous data dissemination or routing messages from different nodes to a sink. This paper reduces the problem of losing the messages when there are common nodes on different paths at the same time. The proposed algorithm produces multi alternative paths with the fewest hops to ensure network load balancing.

Machine Learning-Based Optimized Hierarchical Routing Protocols for WSN Lifetime: A Review

Abstract: In Wireless Sensor Networks, network lifetime optimization has challenging and significant issue. Subsequently, most of the existing works delineate several factors to improve the network lifetime: by decreasing the amount of the consumption of energy, reducing latency, load balancing, clustering, efficient data aggregating and by minimizing the data transmission delays. This paper provides a review of recent techniques and presents a Machine Learning-based Optimized Hierarchical Routing Protocols for WSN Lifetime. Research has been done, and reviews have been studied to explore the energy management schemes using optimized routing approach and Machine Learning Adaptability for WSN’s. Further, recommend future directions related to the Optimized Clustering Approaches to enhance wsn lifetime.