G. N. Purohit

Performance Analysis of Energy Efficient Routing Protocol for Homogeneous Wireless Sensor Network

Wireless Sensor Networks, are made of low-cost, low-power, small insize, and multifunctional sensor nodes. The efficient energy utilization is one of the important performance factors for wireless sensor networks survivability be-cause nodes operate with limited battery power. In this paper we propose and analyze a new approach of zone based clustering head selection algorithm for wireless sensor network of homogeneous nodes. Nodes in the network are uniformly distributed. In this clustering algorithm, network performance is improved by selecting cluster heads on the basis of the residual energy of existing cluster heads, and nearest hop distance of the node. In this paper we evaluate various performance metrics like energy consumption, network life time, number of channel heads metrics in each round and compare these with respect to random algorithm i.e. LEACH. We conclude that proposed protocol effectively extends the network lifetime without degrading the other critical overheads and performance metrics.

Constructing MICDS Algorithm for Data Transmission using Maximal Independent Set in Network Graph

Wireless Sensor Networks (WSNs) is a distributed wireless network which consists of a large number of small (sensor) nodes with sensing, computation and wireless communication capabilities. These sensor nodes work together to monitor various applications and they communicate with each other in multiple hops or directly, with the objective of handing over the processed data to the sink node or access point (AP). WSNs have many issues like self-configuration, faulttolerance, adaptation, flexibility, energy efficiency, security, scalability, interference, architectural issues, mobility and delay tolerance but the most critical and important issue is to reduce energy wastage and interference and increasing network lifetime [1,2, 3]. In order to manage these issues, WSNs require some virtual backbone. A Connected Dominating Set (CDS) can be used to create a virtual backbone in WSNs [5,6,7,8, 9,10]. The CDS is a dominating set which induces a connected subgraph. A maximal independent set is an independent set that is not a subset of any other independent set [7,8]. In this paper, proposed a MICDS (Maximal Independent Connected Dominating Set) algorithm for the WSNs, which are based on the construction of the maximal independent set (MIS) of the representing network graph. There are two different steps in the implementation of MICDS algorithm. In the first phase, the maximal independent set of the network is constructed. In second phase, the dominating set and connectors for the dominating set are constructed using MIS. Using the dominating set and connectors, all the data is transmitted to the sink node or access point (AP). The simulation results indicate that the MICDS algorithm reduce the interference and energy wastage in the network graph, further it also increases the lifetime of the network.

Scenario Based Performance Analysis of AODV and DSDV in Mobile Adhoc Network

A mobile Adhoc network(MANET) is formed by a group of autonomous mobile nodes connected by wireless link without centralized control or established infrastructure. Routing protocols for adhoc networks are typically evaluated using simulation, since the deployment of adhoc network is relatively rare. In this paper, using a simulation tool ns-2 we make a comparison between AODV and DSDV protocols for CBR traffic in mobile ad hoc networks. We analyze the performance of the routing protocol after extracting data from trace file. There are many languages which can be used for analyzing data. We have used AWK scripting language and Java code for extracting data from trace file. The analysis is done for generating various performance metrics like packet delivery fraction, average end-to-end delay, packet loss, packet delay, routing overhead, throughput, route acquisition time.

Sensing and Communication Energy Consumption in Static Sensor Network

A sensor network normally constitutes a Wireless ad-hoc network, meaning that in it each sensor supports a multi-hop routing algorithm (several nodes may forward data packets to the base station). But the sensor nodes suffer from constrained resources i.e., sensors have limited energy resources and their functionality continue only until their energy is drained out. Therefore the limited energy resource in these nodes demands an efficient consumption of these resources which should be managed wisely to extend the lifetime of sensors. In this paper, we study the problem of energy-efficient coverage and we propose various models for placing nodes in a static network. We consider a hexagonal model in two-dimensional deployment and a cubical/hexagonal-prism model for deploying sensors in space. Further, we have considered a rectangular grid divided into regular hexagons and the space covered by cubes and hexagonal-prisms. We have calculated the sensing energy and communication energy consumptions in each model and compared the same with the existing models. However, as far as we know there is no such model for covering the space. General Terms Sensing energy efficiency, Communication energy efficiency, Coverage et. al..

Optimal Clustering in Zone Based Protocol of Wireless Sensor Network

The placement of base stations in wireless sensor networks affect the coverage of sensor nodes and the energy consumption from communication. In this paper we analyzed the performance of the zone based clustering protocol [2] under varying position of base stations, different zone sizes and the effect on network life time with multiple base stations. While evaluating the communication overhead of various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending on a range of parameters. We show that placing multiple base stations in place of single base station in zone based routing protocol enhance the network life time.

Application of Euclidean Distance Power Graphs in Localization of Sensor Networks

Localization of sensor nodes in a wireless sensor network is needed for many practical uses. If the nodes are considered as vertices of a globally rigid graph then the nodes can be uniquely localized up to translation, rotation and reflection. We have given the construction of globally rigid graph through Euclidean distance powers of Unit Disk graph.

Reachability Analysis for spatial Deployment of Heterogenous Nodes in a WSN

Wireless Sensor Networks are taking a big step forward to productive deployments. Initially the Wireless Sensor Networks consisted of homogeneous deployment of identical nodes.. With the passage of time the heterogeneous networks have also come into existence. Less attention has been paid to the heterogeneous deployment of sensors and the amount of research work done with heterogeneous networks is still very less as compared to homogeneous networks. For ensuring reliable data communication among nodes of different capabilities in a heterogeneous network we have focused on the broadcast reachability of the sensor nodes to assure that any type of node (weaker/stronger) is within the transmission range of any other type of node keeping in mind, the asymmetric links among nodes in a heterogeneous network. Broadcasting is one of the fundamental data dissemination mechanisms in mobile ad hoc networks. In this paper, we have considered deployment of sensing nodes of heterogeneous capabilities in a threedimensional region and it is observed that a few strong sensor nodes can reduce the total requirement of sensor nodes in a Wireless Sensor Network. This observation is supported by mathematical analysis.