scispace - formally typeset

Proceedings ArticleDOI

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

01 Feb 2015-pp 1-6

TL;DR: An algorithm is proposed, which does not have a fixed infrastructure ie.

AbstractWireless Sensor Networks (WSNs) are gaining much importance due to their varied characteristics and the ease with which they can be implemented in various environments to suit different purposes. The sensor nodes which are the main components of WSNs are typically battery equipped and difficult to recharge. Hence, the primary concern while designing such networks is to reduce the overall power consumption in order to prolong the network lifetime An efficient energy conservation technique and algorithm in order to generate a network with desired properties while reducing sensor's energy consumption are discussed and shown through simulation in this paper. Here we have proposed an algorithm, which does not have a fixed infrastructure ie., it is Ad-Hoc in nature, for reducing the overall energy usage by means of periodic coordination amongst Gateway Nodes and Base station.

...read more


Citations
More filters
Journal ArticleDOI
TL;DR: This work proposes to build optimal dynamic clusters on the target trajectory to increase energy efficiency and integrates for the first time, to the 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.
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.

5 citations

Proceedings ArticleDOI
20 Apr 2016
TL;DR: 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.
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.

5 citations

Proceedings ArticleDOI
18 Mar 2016
TL;DR: 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.
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.

3 citations


Cites background from "An power efficient algorithm for di..."

  • ...The elected cluster heads must fulfil the terms and condition otherwise another node is selected to perform the cluster head functionality....

    [...]

Proceedings ArticleDOI
01 Sep 2016
TL;DR: This work proposes to build optimal dynamic clusters on the target trajectory to increase energy efficiency and integrates for the first time, to the 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.
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.

2 citations


Cites background or methods from "An power efficient algorithm for di..."

  • ...Forming a clustered network seems an effective mechanism to increase network’s lifetime....

    [...]

  • ...This test is performed with 1000 nodes distributed randomly, with a low speed of 10 m /s, to have the opportunity to compare our algorithm with CHEW and DKF DC algorithms that support only low speeds....

    [...]


References
More filters
Journal Article
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.

2,808 citations

Proceedings ArticleDOI
16 Jul 2001
TL;DR: A geographical adaptive fidelity algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity.
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

2,638 citations


"An power efficient algorithm for di..." refers methods in this paper

  • ...Section II gives an overview of BeamStar and GAF algorithms while in Section III and Section V we describe and analyze our proposed system....

    [...]

  • ...A location based routing algorithm known as Geographical Adaptive Fidelity (GAF) [2] conserves energy by turning off particular nodes belonging to certain geographical area while keeping only a few of them on....

    [...]

  • ...Thus, by switching off unnecessary nodes GAF achieves power consumption [3] with great efficiency....

    [...]

  • ...For reducing the energy consumption of the sensor nodes, a technique similar to the GAF is used....

    [...]

  • ...BeamStar [1] and GAF [2] are two well known algorithms whose concepts have been used in designing the algorithm proposed in this paper....

    [...]

Journal Article
TL;DR: This paper addresses issues associated with control of data transmission in wireless sensor networks (WSN) – a popular type of ad hoc networks with stationary nodes with a new clustering based approach that utilizes the periodical coordination to reduce the overall energy usage.
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

40 citations

Journal ArticleDOI
TL;DR: 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 and can guarantee network connectivity and any degree of sensing coverage.
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.

23 citations

Book ChapterDOI
30 Jul 2009
TL;DR: Cluster-based BeamStar (CBS) follows cluster-based structure to decrease the volume of inter-node communication and the scanning manner in BeamStar is reformed, showing that CBS is scalable, low-cost, and energy efficient.
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.

14 citations


"An power efficient algorithm for di..." refers background in this paper

  • ...The sensor nodes do not have unique global ids and are simply named according to the ring number (RN) and the sector number (SN) in which they reside [5]....

    [...]