Hierarchical data gathering schemes in wireless sensor networks
05 Sep 2008-International Journal of Pervasive Computing and Communications (Emerald Group Publishing Limited)-Vol. 4, Iss: 3, pp 299-321
TL;DR: The proposed method performs better, in terms of the number of rounds and the energy × delay cost, than other data gathering protocols with different network sizes and node densities, and provides good coverage preservation in different environments.
Abstract: Purpose – This paper aims to balance the total energy consumption and the transmission delay for data gathering application in wireless sensor networks.Design/methodology/approach – This paper adopts a hierarchical grid structure to reduce the total energy consumption, and utilizes a tree architecture to decrease the transmission delay.Findings – In the results, the proposed method performs better, in terms of the number of rounds and the energy × delay cost, than other data gathering protocols with different network sizes and node densities. Moreover, the proposed method also provides good coverage preservation in different environments.Research limitations/implications – In this paper, sensor nodes are assumed to be uniformly distributed, homogenous, energy‐constrained. Each sensor node also has ability to adjust its transmission power. For practice, the proposed method needs location information of sensor nodes and the radio interference between sensor nodes during data transmissions should be consider...
Citations
More filters
TL;DR: Simulation results show that the proposed data gathering protocols enable the nodes to transmit data with least number of hops and simultaneously reduce the data gathering path length traced by the mobile sink.
30 citations
Cites methods from "Hierarchical data gathering schemes..."
...The authors in [29] propose a hierarchical grid structure to reduce the total energy consumption, and utilizes a tree architecture to decrease the transmission delay....
[...]
TL;DR: The proposed query‐based aggregation model can help the network administrator to envisage the best query orders in improving the performance of the base stations under uncertain query ordering and derive a best‐fit mathematical model to study the behavior of data aggregation with uncertain queries order.
Abstract: Purpose – Energy constraint is always a serious issue in wireless sensor networks, as the energy possessed by the sensors is limited and non‐renewable. Data aggregation at intermediate base stations increases the lifespan of the sensors, whereby the sensors' data are aggregated before being communicated to the central server. This paper proposes a query‐based aggregation within Monte Carlo simulator to explore the best and worst possible query orders to aggregate the sensors' data at the base stations. The proposed query‐based aggregation model can help the network administrator to envisage the best query orders in improving the performance of the base stations under uncertain query ordering. Furthermore, it aims to examine the feasibility of the proposed model to engage simultaneous transmissions at the base station and also to derive a best‐fit mathematical model to study the behavior of data aggregation with uncertain querying order.Design/methodology/approach – The paper considers small and medium‐siz...
1 citations
Cites methods from "Hierarchical data gathering schemes..."
...In another attempt to minimize the energy in data gathering applications, the authors (Hwang et al., 2008) adopted hierarchical grid structure to minimize the total energy consumption and utilized tree architecture to minimize delay cost for data gathering application....
[...]
...gathering applications, the authors (Hwang et al., 2008) adopted hierarchical grid structure to minimize the total energy consumption and utilized tree architecture to...
[...]
Journal Article•
01 Jan 2014
TL;DR: This paper addresses the problem of collection of sensed data to the sink of a sensor network, and suggests ways and means to minimize the time and power consumption to complete the process as an essential need.
Abstract: Wireless sensor networks have been identified as one of the most important technologies in the modern scenario. This paper traces the history of research in data collection in sensor networks, and presents a statistical report, based on the implementation of their algorithms and identifies the corresponding issues and challenges. Efficient data collection in sensor network is a challenging task. This paper addresses the problem of collection of sensed data to the sink(1) of a sensor network, and suggests ways and means to minimize the time and power consumption to complete the process as an essential need. On the basis of these issues, the best rate algorithms with new techniques are proposed. Irrespective of the size and volume of business , uploading or downloading large volume of data with least cost is essential. As sensors are battery powered devices, they consume a lot of energy during transmission than during processing. Hence, many researchers have attempted to formulate ways and means to minimize the schedule length and degree, power consumption, time delay, topologies and so on. Before venturing into the survey and suggestion of new techniques, conclusions of recent research papers have to be compared. This comparative analysis produces implemented values of the base paper and related papers. The comparative ratios of data collection rate are useful to identify the new trends. This will help us to formulate revised effective algorithms to implement and enhance ratio. The proposed technique will eliminate the negatives, and finally, lower bounds or eliminating interference. The higher bounds in data collection can also be authentically proved.
Cites methods from "Hierarchical data gathering schemes..."
...TOPOLOGY This paper adopts a hierarchical grid structure[16] to reduce the total energy consumption, and utilizes a tree architecture and cache node to decrease the transmission delay....
[...]
References
More filters
TL;DR: The concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics is described.
17,936 citations
"Hierarchical data gathering schemes..." refers background in this paper
...In such applications, the sensor nodes are randomly and densely deployed in a sensing field to collect useful information, and transmit sensed data to the base station (BS) in multiple hops or directly ( Akyildiz, 2002...
[...]
04 Jan 2000
TL;DR: The Low-Energy Adaptive Clustering Hierarchy (LEACH) as mentioned in this paper is a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our findings that the conventional protocols of direct transmission, minimum-transmission-energy, multi-hop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show the LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional outing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
12,497 citations
01 Jan 2000
TL;DR: LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster based station (cluster-heads) to evenly distribute the energy load among the sensors in the network, is proposed.
Abstract: Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have signicant impact on the overall energy dissipation of these networks. Based on our ndings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local cluster base stations (cluster-heads) to evenly distribute the energy load among the sensors in the network. LEACH uses localized coordination to enable scalability and robustness for dynamic networks, and incorporates data fusion into the routing protocol to reduce the amount of information that must be transmitted to the base station. Simulations show that LEACH can achieve as much as a factor of 8 reduction in energy dissipation compared with conventional routing protocols. In addition, LEACH is able to distribute energy dissipation evenly throughout the sensors, doubling the useful system lifetime for the networks we simulated.
11,412 citations
"Hierarchical data gathering schemes..." refers background in this paper
...Various cluster-based routing protocols ( Heinzelman et al. , 2000...
[...]
TL;DR: It is proved that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks.
Abstract: Topology control in a sensor network balances load on sensor nodes and increases network scalability and lifetime. Clustering sensor nodes is an effective topology control approach. We propose a novel distributed clustering approach for long-lived ad hoc sensor networks. Our proposed approach does not make any assumptions about the presence of infrastructure or about node capabilities, other than the availability of multiple power levels in sensor nodes. We present a protocol, HEED (Hybrid Energy-Efficient Distributed clustering), that periodically selects cluster heads according to a hybrid of the node residual energy and a secondary parameter, such as node proximity to its neighbors or node degree. HEED terminates in O(1) iterations, incurs low message overhead, and achieves fairly uniform cluster head distribution across the network. We prove that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks. Simulation results demonstrate that our proposed approach is effective in prolonging the network lifetime and supporting scalable data aggregation.
4,889 citations
09 Mar 2002
TL;DR: PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH, is proposed, where each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round.
Abstract: Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an energy efficient manner is critical to operate the sensor network for a long period of time. In W. Heinzelman et al. (Proc. Hawaii Conf. on System Sci., 2000), a data collection problem is defined where, in a round of communication, each sensor node has a packet to be sent to the distant base station. If each node transmits its sensed data directly to the base station then it will deplete its power quickly. The LEACH protocol presented by W. Heinzelman et al. is an elegant solution where clusters are formed to fuse data before transmitting to the base station. By randomizing the cluster heads chosen to transmit to the base station, LEACH achieves a factor of 8 improvement compared to direct transmissions, as measured in terms of when nodes die. In this paper, we propose PEGASIS (power-efficient gathering in sensor information systems), a near optimal chain-based protocol that is an improvement over LEACH. In PEGASIS, each node communicates only with a close neighbor and takes turns transmitting to the base station, thus reducing the amount of energy spent per round. Simulation results show that PEGASIS performs better than LEACH by about 100 to 300% when 1%, 20%, 50%, and 100% of nodes die for different network sizes and topologies.
3,731 citations