An power efficient algorithm for distributed ad-hoc cluster based Wireless Sensor Networks

Dynamic Clustering Algorithm for Tracking Targets with High and Variable Celerity ATHVC

Abstract: Target tracking with the wireless sensors networks is to detect and locate a target on its entire path through a region of interest. This application arouses interest in the world of research for its many fields of use. Wireless sensor networks, thanks to their versatility, can be used in many hostile and inaccessible to humans environments. However, with a limited energy, they cannot remain permanently active, which can significantly reduce their lifetime. The formation of a cluster network seems an effective mechanism to increase network lifetime. We propose to build optimal dynamic clusters on the target trajectory. For increasing energy efficiency, our algorithm integrates for the first time, to our knowledge, strategies to avoid overlapping clusters and a model to wake up the sensors, adapting to the context of targets with large and variable speed.

Performance evaluation of Distance based Angular Clustering Algorithm (DACA) using data aggregation for heterogeneous WSN

Abstract: Wireless sensor network (WSN) is collection of homogeneous or heterogeneous sensor nodes used to sense the data from physical environments and pass it to sink node. Data collection or sensing environment without any clustering mechanism is little hard which causes the high processing power, high battery consumption, maximize redundant bits etc. To avoid mentioned overheads, Distance based Angular Clustering Algorithm (DACA) with data aggregation techniques is used and to make sure the improvement, computation of various parameters are processed i.e. delay, throughput, network load, number of packets lost, PDR, jitter and packet efficiency. Our simulation results shows improved and energy efficient WSN.

Distance based Angular Clustering Algorithm (DACA) for heterogeneous wireless sensor networks

Abstract: Today the main concern is to improve the lifetime of Wireless Sensor Network (WSN) because WSN is collection of no. of small battery equipped sensor nodes which consume battery to communicate with each other and once battery is dead it is not possible to recharge it. They have the huge responsibility of sensing the environment, collect the data and then transfer it to Base station. For transmitting the data from edge node to parent node, sensor nodes must know the path which may or may not be the shortest that increases the overhead of path formation. To overcome the path formation overhead, clustering is one solution which further leads to the problem of non-coverage area. In this work, we are proposing a Distance based Angular Clustering Algorithm (DACA) on heterogeneous network which will overcome the path formation and non-coverage area problem by combining the data-aggregation algorithm to prolong the lifetime of wireless network.

Dynamic Clustering Algorithm for Tracking Target with High and Variable Celerity

Abstract: Target tracking with the wireless sensors networks is to detect and locate a target on its entire path through a region of interest. This application arouses interest in the world of research for its many fields of use. Wireless sensor networks, thanks to their versatility, can be used in many hostile environments and inaccessible to humans. However, with a limited energy, they cannot remain permanently active which can significantly reduce their lifetime. The formation of a cluster network seems an effective mechanism to increase network lifetime ". We propose to build optimal dynamic clusters on the target trajectory. For increasing energy efficiency, our algorithm integrates for the first time, to our knowledge, strategies to avoid overlapping clusters and a model to wake up the sensors, adapting to the context of targets with large and variable speed.

Geography-informed Energy Conservation for Ad Hoc Routing

Abstract: We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks. GAF conserves energy by identifying nodes that are equivalent from a routing perspective and turning off unnecessary nodes, keeping a constant level of routing fidelity. GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use. GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodified AODV and DSR. Analysis and simulation studies of GAF show that it can consume 40% to 60% less energy than an unmodified ad hoc routing protocol. Moreover, simulations of GAF suggest that network lifetime increases proportionally to node density; in one example, a four-fold increase in node density leads to network lifetime increase for 3 to 6 times (depending on the mobility pattern). More generally, GAF is an example of adaptive fidelity, a technique proposed for extending the lifetime of self-configuring systems by exploiting redundancy to conserve energy while maintaining application fidelity.

Geography-informed energy conservation for Ad Hoc routing

Abstract: We introduce a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks GAF conserves energy by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity GAF moderates this policy using application- and system-level information; nodes that source or sink data remain on and intermediate nodes monitor and balance energy use GAF is independent of the underlying ad hoc routing protocol; we simulate GAF over unmodified AODV and DSR Analysis and simulation studies of GAF show that it can consume 40% to 60% less energy than an unmodified ad hoc routing protocol Moreover, simulations of GAP suggest that network lifetime increases proportionally to node density; in one example, a four-fold increase in node density leads to network lifetime increase for 3 to 6 times (depending on the mobility pattern) More generally, GAF is an example of adaptive fidelity, a technique proposed for extending the lifetime of self-configuring systems by exploiting redundancy to conserve energy while maintaining application fidelity

Comparative Study of Wireless Sensor Networks Energy-Efficient Topologies and Power Save Protocols

Abstract: Ad hoc networks are the ultimate technology in wireless communication that allow network nodes to communicate without the need for a fixed infrastructure. The paper addresses issues associated with control of data transmission in wireless sensor networks (WSN) – a popular type of ad hoc networks with stationary nodes. Since the WSN nodes are typically battery equipped, the primary design goal is to optimize the amount of energy used for transmission. The energy conservation techniques and algorithms for computing the optimal transmitting ranges in order to generate a network with desired properties while reducing sensors energy consumption are discussed and compared through simulations. We describe a new clustering based approach that utilizes the periodical coordination to reduce the overall energy usage by

A Location-free Algorithm of Energy-Efficient Connected Coverage for High Density Wireless Sensor Networks

Abstract: One of the most serious concerns for wireless sensor networks (WSN) is energy. To obtain long lifetime, one potential method is deploying redundant sensors in the WSN and let each sensor switch its state between ACTIVE and OFF. At the same time, the WSN should meet various requirements of quality of service (QoS). This paper focuses on two important measurements of OoS: sensing coverage and network connectivity. Existing researches have provided many algorithms to schedule the nodes' states for coverage preserving, including location-free ones. Our work differs from existing location-free algorithms in several key ways: (1). We propose a novel principle on coverage preserving that is suitable for location-free schemes; (2). Following the principle, a distributed, localized and location-free node scheduling algorithm, Stand Guard Algorithm (StanGA), is proposed for treating coverage and connectivity in a unified scheme. Under certain conditions, StanGA can guarantee network connectivity and any degree of sensing coverage. Simulation results show that StanGA is scalable and robust, and also show that StanGA outperforms existing location-free algorithms even when only coverage issue is considered.

A Cluster-Based Data Routing for Wireless Sensor Networks

Abstract: To promise low energy consumption for wireless sensor network routing, a number of routing protocols have been published. A novel routing protocol called BeamStar was proposed in [6]. In BeamStar, each base station uses a directional antenna with power control to assist locating sensors. It shifts the burden of network control and management from resource-limited sensors to resource-abundant and more sophisticate base stations, but still has three serious problems. The different size between the nearer and farther region, base station's scanning time, and a great quantity of inter-node communication all waste precious energy. In the cause of solving these problems, we present a routing protocol, namely Cluster-based BeamStar (CBS), for wireless sensor networks. CBS follows cluster-based structure to decrease the volume of inter-node communication and we have reformed the scanning manner in BeamStar. Our simulations show that CBS is scalable, low-cost, and energy efficient.