Suraj Sharma

Cluster Based Multipath Routing Protocol for Wireless Sensor Networks

Wireless Sensor Network (WSN) consists of low power sensor nodes. Energy is the main constraint associated with the sensor nodes. In this paper, we propose a cluster based multipath routing protocol, which uses the clustering and multipath techniques to reduce energy consumption and increase the reliability. The basic idea is to reduce the load of the sensor node by giving more responsibility to the base station (sink). We have implemented and compared the protocol with existing protocols and found that it is more energy-efficient and reliable.

Rendezvous based routing protocol for wireless sensor networks with mobile sink

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit data. Data transmission happens either directly to the sink node or through the intermediate nodes. As the sensor node has limited energy, it is very important to develop efficient routing technique to prolong network life time. In this paper we proposed rendezvous-based routing protocol, which creates a rendezvous region in the middle of the network and constructs a tree within that region. There are two different modes of data transmission in the proposed protocol. In Method 1, the tree is directed towards the sink and the source node transmits the data to the sink via this tree, whereas in Method 2, the sink transmits its location to the tree, and the source node gets the sink’s location from the tree and transmits the data directly to the sink. The proposed protocol is validated through experiment and compared with the existing protocols using some metrics such as packet delivery ratio, energy consumption, end-to-end latency, network life time.

EAMRP: energy aware multipath routing protocol for wireless sensor networks

Wireless sensor networks WSNs are made of the sensor nodes with restricted battery life and transmission capability. In this paper, we propose an energy aware multipath routing protocol for wireless sensor networks. This protocol is designed to improve the lifetime, latency and reliability through discovering multiple paths from the source node to the sink base station. It is the sink initiated route discovery process with the known location information of the source node. At the end of the route formation, one primary path and number of alternate paths are built. The proposed protocol is implemented and compared with the existing protocols and found that it outperformed the existing protocols in terms of energy consumption, throughput, latency and network lifetime.

Data Dissemination Protocol for Mobile Sink in Wireless Sensor Networks

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit the data. The sensor node transmits the data directly to the sink, or it relays the data through neighbor nodes. The nodes near to the sink transmit more data than other nodes. It results in the small lifetime of the network. To prolong the lifetime of the network, we use the mobile sink approach. The mobile sink makes the network dynamic. It is a challenging task to find the route in the dynamic network. In this paper, we have proposed a distributed tree-based data dissemination (TEDD) protocol with mobile sink. The protocol is validated through simulation and compared with the existing protocols using some metrics such as energy consumption, average end-to-end delay, and throughput. The experiment results show that the proposed protocol outperforms the existing protocols.

MistGIS: Optimizing Geospatial Data Analysis Using Mist Computing

Geospatial data analysis with the help of cloud and fog computing is one of the emerging areas for processing, storing, and analysis of geospatial data. Mist computing is also one of the paradigms where fog devices help to reduce the latency period and increase throughput for assisting at the near of edge device of the client. It discusses the emergence of mist computing for mining analytics in geospatial big data from geospatial application. This paper developed a mist computing-based framework for mining analytics from geospatial big data. We developed MistGIS framework for Ganga River Management System using mist computing. It built a prototype using Raspberry Pi, an embedded microprocessor. The developed MistGIS framework has validated by doing preliminary analysis including K-means clustering and overlay analysis. The results showed that mist computing can assist the fog and cloud computing hold an immense promise for analysis of big data in geospatial application particularly in the management of Ganga River Basin.

A Vertical and Horizontal Segregation Based Data Dissemination Protocol

A base station and multiple sensor nodes are two main components of the wireless sensor network. Main task of sensor nodes is to aggregate and forward the collected data to the base station. The main objective of wireless sensor network is to maximize the network lifetime and providing as low latency delay as possible. To seek to accomplish this, we are proposing a Vertical and Horizontal segregation based data dissemination protocol. This protocol considers mobile base station that helps in improving the network lifetime by collecting the data from each and every node by moving to provide high throughput. Mobile base station requires informing all the sensor nodes about its location. This consumes large energy. Our proposed protocol saves this energy by informing few sensor nodes, in place of informing all the sensor nodes.

VGBST: A Virtual Grid-Based Backbone Structure Type Scheme for Mobile Sink Based Wireless Sensor Networks

In Wireless Sensor Networks, sensor nodes energy consumption can be balanced by the mobile sink. Due to the sensor nodes limited energy, storage capacity, computing power and random mobility of sinks, it is a challenging task to find the route for data dissemination in the wireless sensor networks. Sensor nodes need to reconstruct their routes for efficient data delivery to the mobile sink latest location. In this paper, we propose a Virtual Grid-based Backbone Structure Type scheme (VGBST) to maintain optimal routes to mobile sink latest location and to minimize sensor nodes routes reconstruction cost.

Erratum to: Rendezvous based routing protocol for wireless sensor networks with mobile sink

An energy-efficient routing protocol called ring routing has been proposed by Tunca et al. [10]. It establishes a ring structure that aims to combine the easy accessibility of the grid structures and the easy changeability of the backbone structure. Since it incorporates a minimal number of nodes in the ring structure, the redundancy of data packets is significantly reduced for sharing sink position advertisement packets among the ring nodes. It devises a straightforward and efficient mechanism. The ring

Proactive data routing using controlled mobility of a mobile sink in Wireless Sensor Networks

Abstract Stationary sink based Wireless Sensor Networks (WSN) have issues like sink neighborhood problem, end-to-end delay, data delivery ratio, network lifetime, etc. Although several routing approaches with mobile sink have been introduced to mitigate those issues across the network, very few, have considered delay requirements of applications. In this paper, we propose an efficient virtual grid based hierarchical routing approach suitable for delay bound applications, which judiciously selects a mobile sink’s path by considering both hop counts and data generation rates of the sensor nodes, which reduces the overall energy consumption for multi-hop data communication. Data aggregation at each level of the hierarchy aims to reduce data traffic and increase throughput. The performance of the proposed protocol has been evaluated using simulation based on different metrics and compared with an existing routing protocol. Results have demonstrated that it performs better than the existing one while it still meets delay constraints of applications.

MSGR: A Mode-Switched Grid-Based Sustainable Routing Protocol for Wireless Sensor Networks

A Wireless Sensor Network (WSN) consists of enormous amount of sensor nodes. These sensor nodes sense the changes in physical parameters from the sensing range and forward the information to the sink nodes or the base station. Since sensor nodes are driven with limited power batteries, prolonging the network lifetime is difficult and very expensive, especially for hostile locations. Therefore, routing protocols for WSN must strategically distribute the dissipation of energy, so as to increase the overall lifetime of the system. Current research trends from areas, such as from Internet of Things and fog computing use sensors as the source of data. Therefore, energy-efficient data routing in WSN is still a challenging task for real-time applications. Hierarchical grid-based routing is an energy-efficient method for routing of data packets. This method divides the sensing area into grids and is advantageous in wireless sensor networks to enhance network lifetime. The network is partitioned into virtual equal-sized grids. The proposed mode-switched grid-based routing protocol for WSN selects one node per grid as the grid head. The routing path to the sink is established using grid heads. Grid heads are switched between active and sleep modes alternately. Therefore, not all grid heads take part in the routing process at the same time. This saves energy in grid heads and improves the network lifetime. The proposed method builds a routing path using each active grid head which leads to the sink. For handling the mobile sink movement, the routing path changes only for some grid head nodes which are nearer to the grid, in which the mobile sink is currently positioned. Data packets generated at any source node are routed directly through the data disseminating grid head nodes on the routing path to the sink.