Dnyaneshwar Mantri

Two Tier Cluster based Data Aggregation (TTCDA) in Wireless Sensor Network

Wireless Sensor Network (WSN) is used for the monitoring and control applications where sensor nodes gather data and send it to the sink. Most of the energy of these nodes is consumed in transmission of data packets without aggregation to sink, which may be located at single or multi hop distance. The direct transmission of data packets to the sink from nodes in the network causes increased communication costs in terms of energy, average delay and network life time. In this context the data aggregation techniques minimize the communication cost with efficient bandwidth utilization by decreasing the packet count reached at the sink. Here we propose Two Tier Cluster based Data Aggregation (TTCDA) algorithm for the randomly distributed nodes to minimize computation and communication cost. The TTCDA is energy and bandwidth efficient, since it reduces the transmission of number of packets to the sink. It is based on the additive and divisible aggregation functions at Cluster head. The functions are applied according to data packets generated by each node by considering spatial and temporal correlation. The aggregation function used in TTCDA effectively reduces the packet count reported to the sink and prevent transmission of redundant data packets by improving energy consumption. The performance of algorithm is validated using examples and simulations.

Bandwidth efficient cluster-based data aggregation for Wireless Sensor Network

Cluster head is elected according to the highest energy among the CM, number of neighbor nodes with one hop connectivity.Network uses random distribution of heterogeneous nodes with mobile sink.Packets are generated at variable rate by each node and aggregated at CH and then at sink.It uses the perfectly compressible aggregation function on data generated by nodes.The performance is measured in terms of PDR and throughput to show the effective utilization of bandwidth. A fundamental challenge in the design of Wireless Sensor Network (WSNs) is the proper utilization of resources that are scarce. The critical challenge is to maximize the bandwidth utilization in data gathering and forwarding from sensor nodes to the sink. The main design objective is to utilize the available bandwidth efficiently. The proposed Bandwidth Efficient Cluster-based Data Aggregation (BECDA) algorithm presents the solution for the effective data gathering with in-network aggregation. It considers the network with heterogeneous nodes in terms of energy and mobile sink to aggregate the data packets. The optimal approach is achieved by intra and inter-cluster aggregation on the randomly distributed nodes with the variable data generation rate. The proposed algorithm uses the correlation of data within the packet for applying the aggregation function on the data generated by nodes. BECDA shows significant improvement in PDR (67.44% and 26.79%) and throughput (41.25% and 26.16%) as compared to the state-of-the-art solutions.

BHCDA: Bandwidth efficient heterogeneity aware cluster based data aggregation for Wireless Sensor Network

The fundamental challenge in design of Wireless Sensor Network (WSNs) is proper utilization of resources which are scare. One of the critical challenges is to maximize the bandwidth utilization in data gathering from sensor nodes and forward to sink. The main design objective of this paper is to utilize the available bandwidth efficiently in terms of reduced packet delivery ratio and throughput. Bandwidth Efficient Heterogeneity aware Cluster based Data Aggregation (BHCDA) algorithm presents the solution for the effective data gathering with in-network aggregation. It considers the network with heterogeneous nodes in terms of energy and mobile sink to aggregate the data packets. It embodies the optimal approach by Intra and inter-cluster aggregation on the randomly distributed nodes with variable data generation rate while routing data to sink. It uses the correlation of data within the packet for applying the aggregation function on data generated by nodes. BHCDA shows significant improvement in packet delivery ratio (67.66 % & 19.62 %) and throughput (37.01 % & 17.16 %) as compared with the state-of-the-art solutions, Two Tier Cluster based Data Aggregation (TTCDA) and Energy Efficient Cluster based Data Aggregation (EECDA).

An efficient schedule based data aggregation using node mobility for wireless sensor network

In the Wireless Sensor Networks, (WSNs) a key challenge is to schedule the activities of the mobile node for improvement in throughput, energy consumption and delay. This paper proposes efficient schedule based data aggregation algorithm using node mobility (SDNM). It considers the cluster-based myopic and non-myopic scheduling scheme for conflict free schedule based on the current and next state. It uses TDMA as the MAC layer protocol and schedules the aggregated packets with consecutive slots. Simulation results show that, SDNM is energy efficient, has less delay as compared with state-of-the-art solutions.

MHBCDA: Mobility and heterogeneity aware bandwidth efficient Cluster based Data Aggregation for Wireless Sensor Network

Wireless Sensor Network (WN) offers variety of novel applications for mobile targets. It generates the large amount of redundant sensing data. The data aggregation techniques are extensively used to reduce the energy consumption and increase the network lifetime, although it has the side effect of reduced reliability. In the mobile environment, it is necessary to consider the techniques which minimize the communication cost with efficient bandwidth utilization by decreasing the packet count reached at the sink. This paper proposes the mobility and heterogeneity aware bandwidth efficient Cluster-based Data Aggregation (MHBCA) algorithm for the randomly distributed nodes. It considers the mobile sink based packet aggregation for the heterogeneous WSN. It uses predefined region for the aggregation at cluster head to minimize computation and communication cost. The MHBCDA is energy and bandwidth efficient. It exploits correlation of data packets generated by varying the packet generation rate. It prevents transmission of redundant data packets by improving energy consumption by 4.11% and prolongs the network life by 34.45% as compared with state-of-the-art solutions.

Scheduled Collision Avoidance in wireless sensor network using Zigbee

Transmission reliability and energy consumptions are two critical concerns associated with wireless sensor network (WSN) design for a long time and continuous operation. With the increase in reliability of the transmission, the energy consumption increases by affecting the efficiency of the network. This paper proposes the Schedule based Collision Avoidance (SCA) algorithm for finding the tradeoff between reliability and energy efficiency by fusion of CSMA/CA and TDMA techniques in Zigbee/ IEEE802.15.4. It uses the multi-path data propagation for collision avoidance and effective utilization of the channel providing efficient energy consumption. It analyses different scheduling schemes to provide an appropriate solution for reducing collisions and improving network lifetime.

Sink Mobility-aware Node Scheduling algorithm for Wireless Sensor Network

In application base environment using Wireless Sensor Network (WSNs), mobility sink and node plays a key role in concern with topological changes affecting on the bandwidth utilization, energy consumption and delay. Due to the scarcity of available resources, it demands the solution with a better reduction in delay and energy consumption for increased slot utilization and reduced collisions. The paper proposes Sink Mobility-aware Node Scheduling algorithm (SMNS) using TDMA as basic MAC. Slots are scheduled to reduce glitches and offset occurring in switching the data from nodes to movable sink in clustered environment. The collision-free slots allocated shows reduced energy consumption and delay as compared to state-of-the-art solutions.

Bandwidth Efficient Hybrid Synchronization for Wireless Sensor Network

Data collection and transmission are the fundamental operations of Wireless Sensor Networks (WSNs). A key challenge in effective data collection and transmission is to schedule and synchronize the activities of the nodes with the global clock. This paper proposes the Bandwidth Efficient Hybrid Synchronization Data Aggregation Algorithm (BESDA) using spanning tree mechanism (SPT). It uses static sink and mobile nodes in the network. BESDA considers the synchronization of a local clock of node with global clock of the network. In the initial stage algorithm established the hierarchical structure in the network and then perform the pair-wise synchronization. With the mobility of node, the structure frequently changes causing an increase in energy consumption. To mitigate the problem BESDA aggregate data with the notion of a global timescale throughout the network and schedule based time-division multiple accesses (TDMA) techniques as MAC layer protocol. It reduces the collision of packets. Simulation results show that BESDA is energy efficient, with increased throughput, and has less delay as compared with state-of-the-art.

Synchronized Data Aggregation for Wireless Sensor Network

Wireless Sensor Networks (WSNs) are used for monitoring and data collection purposes. A key challenge in effective data collection is to schedule and synchronize the activities of the nodes with global clock. This paper proposes the Synchronized Data Aggregation Algorithm (SDA) using spanning tree mechanism. It provides network-wide time synchronization for sensor network. In the initial stage algorithm established the hierarchical structure in the network and then perform the pair - wise synchronization. SDA aggregate data with a global time scale throughout the network. The aggregated packets are scheduled using TDMA as the MAC layer protocol. Simulation results show that, SDA gives promising result of energy efficiency and delay as compared with state-of-the-art solutions.