Network lifetime optimization for wireless video sensor networks with network coding/ARQ hybrid adaptive error-control scheme

Division of the entire wireless sensor network geographic area into number of equal sized regions by applying virtual grid and strategy to appoint head node of the cluster in each region improves stability, consistency, and lifetime of the wireless sensor network. Applying the same size of grid to the different size of wireless sensor networks will not give consistent performance. In this paper, we are presenting a protocol which will dynamically determine the size of the virtual grid, which will give optimal performance of any geographic sized wireless sensor network. The protocol also allows to place sink node to any location and not at some fixed specific location. Protocol discussed in this paper can also support multiple sink nodes. Protocol dynamically takes decision to transmit the data directly to the sink node or by using multi-hop transmission by considering distances between sensor nodes internally and sink node(s), which will optimize energy efficiency of the sensor nodes and increases the lifetime of wireless sensor network.

We analyze the impact of the structure of the Data Gathering (DG) trees on node lifetime (round of first node failure) and network lifetime (minimum number of rounds by which the network gets either disconnected due to node failures or the fraction of coverage loss reaches a threshold) in wireless sensor networks through extensive simulations. The two categories of DG trees studied are: the Bottleneck Node Weight-Based (BNW-DG) trees and Bottleneck Link Weight-Based (BLW-DG) trees. The BNW-DG trees incur a smaller diameter and a significantly larger fraction of nodes as leaf nodes: thus, protecting a majority of the nodes in the network from simultaneously being exhausted of the energy resources (contributing to a significantly larger network lifetime); nevertheless the nodes that serve as intermediate nodes in the first few instances of the BNW-DG trees are bound to lose their energy more quickly than the other nodes, leading to a smaller node lifetime compared to that of the BLW-DG trees (that incur a larger diameter and a relatively lower fraction of nodes as leaf nodes).

Limited energy supply (battery-powered) is a crucial problem in wireless sensor networks (WSNs). Sensor node placement schemes and routing protocols are mostly proposed to address this problem. In this paper, we first present how to place sensor nodes by use of a minimal number of them to maximize the coverage area when the communication radius of the sensor node is different from the sensing radius, which results in the application of regular topology to WSNs deployment. With nodes placed at an equal distance and equipped with an equal power supply, the problem of unbalanced energy consumption in 2-D regular topologies becomes more severe and much more difficult to tackle than that in 1-D chains, though the latter is known as an already quite hard problem. We address this problem and propose an adaptive data collection scheme by employing different communication radii for nodes in different locations to balance the energy consumption in WSNs. In order to achieve the ultimate goal of maximizing network lifetime in grid-based WSNs, we give a mathematical formulation, which shows the problem of maximizing network lifetime is a nonlinear programming problem and NP-hard even in the 1-D case. We discuss several heuristic solutions and show that the halving shift data collection scheme is the best solution among them. We also generalize the maximizing network lifetime problem to the randomly-deployed WSNs, which shows the significance of our mathematical formulation for this crucial problem in WSNs.

Wireless Sensor Networks (WSN) concentrate on the essential problem of increasing the network lifetime of WSN, which are bordered by low capacity batteries1,3 One of the fundamental egresses in WSN is maximizing the network lifetime by mitigating the Hotspot problem. It is the problem of isolation of sink node due to energy diminution of nodes most closelipped to sink1. In WSN nodes which are most adjacent to the Base Station (BS) need to relay many packets while compare with nodes far away from the sink. The outcome of this approach is these nodes deplete their energy very quickly. It results in a network partitioning and reduces the network lifetime. This paper proposes and evaluates a technique for maximizing the lifetime of WSN by preventing sink isolation due to hotspot problem. The clustering mechanism can be used to reduce the energy depletion of node near to the sink node. The cluster is formed based on distance attribute. This mechanism provides the scalability and avoids the redundancy through data collection operation. This paper will analyze the energy consumption of proposed technique using various distance measures. *Author for correspondence Indian Journal of Science and Technology, Vol 7(S4), 92–98, April 2014 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Increase the Lifetime of WSN by Preventing Sink Isolation using Supercluster Formation R. Devika1 , B. Santhi2 and T. Sivasubramanian3 1,2School of Computing, SASTRA University, Thanjavur, India; srdevika.cse@sastra.edu, b.shanthi@sastra.edu 3 Kings College of Engineering, Punalkulam, Pudhukkotai District, India; shivamiru@gmail.com Keywords: Clustering Mechanism, Data Aggregation Operation, Hotspot Problem, Network Lifetime, Sink

Extensive research is being done on Wireless sensor Networks (WSNs) in present decade. WSNs consist of large number of sensor nodes which perform sensing of certain phenomena and send the sensed data to the sinks. This operation consumes energy of sensor nodes which effects the lifetime of a network. To prolong the lifetime of WSNs various strategies and routing algorithms have been proposed. Use of mobile sinks has proved effective in this respect. In this paper we are analyzing the impact of multiple mobile sinks with proactive hierarchical clustering protocols LEACH and network reactive hierarchical protocol TEEN. This paper will give simulation based analysis of using multiple mobile sinks in network and their effect on lifetime of a network. Performance analysis will be done on basis of dead nodes, alive nodes, throughput and residual energy.

Wireless sensor network is an emerging technology capable of having low-cost and low-power and battery-powered sensor node. At this point the protocol concentric clustered power-efficient gathering in sensor information systems and clustered general self organized tree based energy-balance routing protocol energy efficient protocol are used to increase the energy and to extend network lifetime. For these achievement of clustering techniques, optimization technique particle swarm optimization is used for data transmission through base station. If the base station is inaccessible region from the cluster-head, energy consumption will be augmented and it can shrink the lifetime of wireless sensor network. To conquer these, multi-hop gateway node is implemented with both protocol to achieve maximum lifetime and energy efficiency of wireless sensor network. To improve the quality-of-service (QoS) placing more number of gateways is required. So we propose a new algorithm nearer optimal algorithm which recursively computes least possible adequate dominating sets, at the time constantly preserving QoS requirements across iterations. In this paper comparison is done in terms of throughput, packets delivery ratio and number of nodes alive.

Maximization of lifetime of wireless sensor network (WSN) is an emerging area of research in present scenario. Many authors are performing their research work, so that they could achieve lower energy consumption for the sensor network which leads to increase in lifetime of network. Our work focuses on sink mobility in a fixed trajectory within a wireless sensor network while sensed data are required to be collected. We divide the whole sensor network into two different regions as direct communication area (DCA) and multi-hop communication area (MCA). Sensors node that lies in DCA is at one hop count distance from the sink node trajectory while sensors within MCA are at more than one hop count from the trajectory. We considered all the sensors that are within DCA as subsink nodes. During sink mobility, whenever a subsink is closer to the mobile sink node, then it starts transmitting its data to the sink node. But those sensors that are within MCA needs to search an appropriate sink node for sending its sensed data to the subsink so that on further stage, that subsink could provide those data to the sink node whenever it is in nearest proximity of that subsink. Basically, a sink node is the ultimate destination for the data while a subsink node acts as a relay node for the nodes that are within MCA. So our work is to find out the appropriate subsink node from a given set of subsinks. For doing so, we used location-aided routing on global positioning system (GPS)-enabled sensors and sink node. Our work is validated through simulation experiments using NS-2.

A wireless sensor network (WSN) comprised of a plurality of sensor nodes powered by their internal batteries and one or more base stations. Efficient utilization of the energy resources leads to prolonged network lifetime. In this study, the effects of limiting the total hop count within the network on network lifetime is investigated by using a mixed integer programming (MIP) framework. Our results show that when the hop count of network is limited by minimum hop count, lifetime of network can decrease by %40 of the lifetime obtained without any constraint on hop count. If hop count limit of network is increased by %10, lifetime of network can reach %98 of maximum lifetime obtained without any restrictions on hop count.

It is important to prolong the network lifetime in Wireless Sensor Networks. There are two approaches to increase the network lifetime, which are balancing energy consumption and reducing the number of non-working nodes. This paper presents two Cluster head Selection algorithms, one is based on Ensuring target Area and the other is based on Affinity Propagation. We propose a method which makes the energy uniformly distributed throughout the network nodes. In particular, we analyse the effect of the powerful nodes on the network lifetime and cluster characteristics. Simulation results show that the two proposed algorithms distribute non-working nodes evenly, such that the target area is well covered by the remaining nodes. Our proposed algorithms balance the traffic load and energy distributions, and prolong the network lifetime effectively compared with the existing schemes.

SummaryEnergy consumption in wireless sensor network (WSN) is one of the important issues as tiny sensor nodes are equipped with a non‐replaceable batteries. Clustering is one of the effective means to prolong the network lifetime in WSN by reducing the number of packets to be sent from cluster heads (CHs) to base station (BS). Recently, game theory techniques have been applied in the clustering process for optimal CH election at each round. However, none of them have considered the energy parameter in their game strategy and multihop routing for data transmission. In this manuscript, an energy‐efficient game‐theoretic clustering and multi‐hop routing scheme (EGCR) has been proposed where the non‐cooperative approach of game theory is used to elect optimal CHs. In the proposed game theoretic framework, each node behaves in a selfish manner while considering the residual energy of nodes and focuses on increasing the overall lifetime of the network. Nash equilibrium is determined among a set of pure and mixed strategies, and then the expected payoff of a node is determined for Nash equilibria. Apart from the energy‐efficient clustering, the EGCR also proposes a multi‐hop routing solution for data transmission that further enhances the lifetime of whole network. In the multi‐hop routing approach, inter‐cluster and intra‐cluster routing techniques are proposed to identify optimal routes from nodes to CHs and from CHs to BS by using various factors such as node centrality, distance from the node to BS, and residual energy. The proposed algorithm is compared with traditional clustering schemes like low‐energy adaptive clustering hierarchy (LEACH) and efficient energy‐aware game theory‐based clustering (EEGC) and also with existing game theory‐based algorithms such as clustered routing for selfish sensors (CROSS), localized game theoretical clustering algorithm (LGCA), and energy‐efficient clustering algorithm based on game theory (ECAGT). Simulation experiments validate that the proposed algorithm enhances the network's lifetime up to 47.49% compared to existing clustering algorithms.

Using the mobile sink for data collection from all sensors is the most highly effective way to prolong the network lifetime of wireless sensor networks(WSNs). Many studies focused on the anchors selection, aiming to reduce the path length of mobile sink and prolong the network lifetime. However, the appropriateness and the number of the selected anchors, which significantly impact the network lifetime of the entire WSNs, still can be improved. This paper proposes a Dynamic Anchor Points Mechanism for data collection, called DAM, aiming to select appropriate anchors under the path length constraint for prolonging the network lifetime. The experimental results show that the proposed DAM outperforms existing data collection mechanisms in term of network lifetime and fairness index.

Wireless sensor networks with the mobile sink can help to prevent the hot-spot problem and improve the network lifetime. However, in practice, the trajectories of the sink can not ideally change due to the obstacle of the environment or the requirement of the application. The constraint on trajectory of the mobile sink causes the different connection time between the mobile sink and the sensor node, which might result in the imbalance depletion of energy. We propose here an efficient data gathering policy to jointly consider the constrained mobility of the sink and the different connection time at the sensor node. The policy increases the network lifetime in wireless sensor networks with path-constrained mobile sink by optimizing the assignment sensor node. In addition, we also propose the policy to cope with the overlapped connection time of the sink and sensor node due to the movement of the sink. The simulation results demonstrate the effectiveness of the proposed policy: by carefully considering the trajectory of the sink and effectively assigning the sensor node, the network lifetime is increased.

In wireless sensor networks, sensor nodes have limited battery power. Data aggregation is an important technique in a wireless sensor network to reduce the energy consumption by eliminating the redundant data and delivering useful data to the user. Data aggregation technique is used to gather the data sensed by the sensor nodes in the network and aggregates the sensed data in an energy-efficient way so that overall network lifetime can be increased. Cluster, tree, chain, and grid are some of the architectures for data aggregation in wireless sensor networks. In this paper, authors present an analysis-based survey of data aggregation protocols for tree-based architecture in wireless sensor networks. The authors analyze each algorithm on the basis of performance measurements such as network lifetime, energy consumption, and node distance. Authors also compare these algorithms on the basis of the preferred parameter and a key feature of each algorithm. In the fifth section of the paper, authors described the proposed approach to construct the data aggregation tree to maximize the network lifetime. In the proposed approach, authors used distance parameter to construct minimum spanning tree, and other parameters such as load and energy are preferred in a balanced manner to reduce the energy consumption and to maximize the network lifetime.

Wireless sensor networks offer a lot of potential to improve our ability to see and manage the physical world, but the issue of power consumption in these networks has emerged as a key factor in their dependability and in many use cases for networks. End-to-end quality parameters for wireless sensors must be guaranteed, and these networks' support for quality of service is crucial. The lifespan of each network in wireless sensor networks, which is closely correlated with the energy use of the network sensors, is one of the most crucial challenges. One of the most difficult tasks in these types of networks is to extend the network's lifetime. The most efficient strategy for reducing power consumption in wireless sensor networks is clustering, which is presented in this study. This is the most efficient approach for increasing the scalability and lowering the energy consumption of wireless sensor networks. The simulation results demonstrate that the suggested algorithm may significantly extend the lifetime of the wireless sensor network and decrease its energy consumption.

Towards energy balancing optimization in wireless sensor networks: A novel quantum inspired genetic algorithm based sinks deployment approach