scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Effective Data Aggregation Supported by Dynamic Routing in Wireless Sensor Networks

Jian Zhang1, Wu Qiuhan1, Feng-Yuan Ren1, Ting He1, Cheng-Te Lin1 
23 May 2010-pp 1-6
TL;DR: This work aims to design an effective data aggregation mechanism supported by dynamic routing (DASDR) which can adapt to different scenarios without incurring much overhead and scales well with regard to the network size.
Abstract: Data aggregation is an main method to conserve energy in wireless sensor network (WSN) Prior work on data aggregation protocols are generally based on static routing schemes, such as tree-based, cluster-based or chain-based routing schemes Although they can save energy to some extent, in dynamic scenarios where the source nodes are changing frequently, they will not only incur high overhead to continuously reconstruct the routing but also can not reduce the communication overhead effectively Our work aims to design an effective data aggregation mechanism supported by dynamic routing (DASDR) which can adapt to different scenarios without incurring much overhead Enlightened by the concept of potential field in the discipline of physics, the dynamic routing in DASDR is designed based on two potential fields: depth potential field which guarantees packets reaching the sink at last and queue potential field which makes packets more spatially convergent and thus data aggregation will be more efficient Simulation results show that DASDR is more effective in energy savings as well as scales well with regard to the network size
Citations
More filters
Journal ArticleDOI
TL;DR: This research work depicts a broad methodical literature analysis of data aggregation in the area of WSNs in specific which includes techniques, tools, methodology and challenges in data aggregation.
Abstract: Wireless sensor networks (WSNs) consist of large number of small sized sensor nodes, whose main task is to sense the desired phenomena in a particular region of interest. These networks have large number of applications such as habitat monitoring, disaster management, security and military etc. Sensor nodes are very small in size and have limited processing capability as these nodes have very low battery power. WSNs are also prone to failure, due to low battery power constraint. Data aggregation is an energy efficient technique in WSNs. Due to high node density in sensor networks same data is sensed by many nodes, which results in redundancy. This redundancy can be eliminated by using data aggregation approach while routing packets from source nodes to base station. Researchers still face trouble to select an efficient and appropriate data aggregation technique from the existing literature of WSNs. This research work depicts a broad methodical literature analysis of data aggregation in the area of WSNs in specific. In this survey, standard methodical literature analysis technique is used based on a complete collection of 123 research papers out of large collection of 932 research papers published in 20 foremost workshops, symposiums, conferences and 17 prominent journals. The current status of data aggregation in WSNs is distributed into various categories. Methodical analysis of data aggregation in WSNs is presented which includes techniques, tools, methodology and challenges in data aggregation. The literature covered fifteen types of data aggregation techniques in WSNs. Detailed analysis of this research work will help researchers to find the important characteristics of data aggregation techniques and will also help to select the most suitable technique for data aggregation. Research issues and future research directions have also been suggested in this research literature.

110 citations

Proceedings ArticleDOI
17 Aug 2012
TL;DR: In this article, potential based routing (PBR) is introduced to achieve several design goals such as availability, adaptability, diversity, and robustness for ICN, and the performance of a random caching policy is examined.
Abstract: Information Centric Networking (ICN) has shown possibilities to solve several problems of the Internet. At the same time, some problems need to be tackled in order to advance this promising architecture. In this paper we address two of the problems, namely routing and content caching. For the routing, we introduce the Potential Based Routing (PBR) to achieve several design goals such as availability, adaptability, diversity, and robustness. In addition, we examine the performance of a random caching policy which can be a promising candidate for ICN. The integrated system of both PBR and a caching policy is named the Cache Aware Target idenTification (CATT). Simulation results demonstrate that PBR with replications located on less than 1% of total nodes can achieve a near optimal routing performance (close to the shortest path routing) even though a request message is randomly forwarded.

96 citations

Journal ArticleDOI
TL;DR: In this article, a Q-learning-based data aggregation-aware energy-efficient routing algorithm is proposed to maximize the rewards, defined in terms of the efficiency of the sensor-type-dependent data aggregation, communication energy and node residual energy, at each sensor node to obtain an optimal path.
Abstract: The energy consumption of the routing protocol can affect the lifetime of a wireless sensor network (WSN) because tiny sensor nodes are usually difficult to recharge after they are deployed. Generally, to save energy, data aggregation is used to minimize and/or eliminate data redundancy at each node and reduce the amount of the overall data transmitted in a WSN. Furthermore, energy-efficient routing is widely used to determine the optimal path from the source to the destination, while avoiding the energy-short nodes, to save energy for relaying the sensed data. In most conventional approaches, data aggregation and routing path selection are considered separately. In this study, we consider the degrees of the possible data aggregation of neighbor nodes when a node needs to determine the routing path. We propose a novel Q-learning-based data-aggregation-aware energy-efficient routing algorithm. The proposed algorithm uses reinforcement learning to maximize the rewards, defined in terms of the efficiency of the sensor-type-dependent data aggregation, communication energy and node residual energy, at each sensor node to obtain an optimal path. We used sensor-type-dependent aggregation rewards. Finally, we performed simulations to evaluate the performance of the proposed routing method and compared it with that of the conventional energy-aware routing algorithms. Our results indicate that the proposed protocol can successfully reduce the amount of data and extend the lifetime of the WSN.

65 citations

19 Jan 2012
TL;DR: In this paper, potential based routing (PBR) is introduced to achieve several design goals such as availability, adaptability, diversity, and robustness for ICN, and the performance of a random caching policy is examined.
Abstract: Information Centric Networking (ICN) has shown possibilities to solve several problems of the Internet. At the same time, some problems need to be tackled in order to advance this promising architecture. In this paper we address two of the problems, namely routing and content caching. For the routing, we introduce the Potential Based Routing (PBR) to achieve several design goals such as availability, adaptability, diversity, and robustness. In addition, we examine the performance of a random caching policy which can be a promising candidate for ICN. The integrated system of both PBR and a caching policy is named the Cache Aware Target idenTification (CATT). Simulation results demonstrate that PBR with replications located on less than 1% of total nodes can achieve a near optimal routing performance (close to the shortest path routing) even though a request message is randomly forwarded.

60 citations

Journal ArticleDOI
TL;DR: This paper focuses on designing a structure-free Real-time data AGgregation protocol, RAG, using two mechanisms for temporal and spatial convergence of packets - Judiciously Waiting policy and Real- time Data-aware Anycasting policy.

59 citations


Cites background or methods from "Effective Data Aggregation Supporte..."

  • ...However, it might lead to high computing complexity and heavy message exchange overhead to enhance the service quality of real-time packet delivery in WSNs....

    [...]

  • ...SPEED [20] implements the end-to-end transmission delay control....

    [...]

  • ...First, what is the real-time policy to implement data aggregation for delay-constraint packets....

    [...]

  • ...In this paper, we focus on designing a structure-free Real-time data AGgregation protocol, RAG, using two mechanisms for temporal and spatial convergence of packets – Judiciously Waiting policy and Real-time Data-aware Anycasting policy....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: This work develops and analyzes low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality.
Abstract: Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

10,296 citations

Journal ArticleDOI
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


"Effective Data Aggregation Supporte..." refers background or methods in this paper

  • ...The two main methods for efficient data aggregation are making packets more spatially [5-12] and temporally [1-4] convergent....

    [...]

  • ...The typical examples are LEACH [5] and HEED [7]....

    [...]

  • ...However, the present routing schemes for data aggregation are generally static, such as cluster-based [5, 7], chain-based [6], tree-based [8-12], which mainly have two disadvantages....

    [...]

  • ...The other category focuses on establishing a proper routing scheme to improve aggregation ratio [5-12]....

    [...]

  • ...[7] O. Younis and S. Fahmy, “HEED: a Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor networks,”IEEE Trans....

    [...]

Journal ArticleDOI
09 Dec 2002
TL;DR: This work presents the Tiny AGgregation (TAG) service for aggregation in low-power, distributed, wireless environments, and discusses a variety of optimizations for improving the performance and fault tolerance of the basic solution.
Abstract: We present the Tiny AGgregation (TAG) service for aggregation in low-power, distributed, wireless environments. TAG allows users to express simple, declarative queries and have them distributed and executed efficiently in networks of low-power, wireless sensors. We discuss various generic properties of aggregates, and show how those properties affect the performance of our in network approach. We include a performance study demonstrating the advantages of our approach over traditional centralized, out-of-network methods, and discuss a variety of optimizations for improving the performance and fault tolerance of the basic solution.

3,166 citations


"Effective Data Aggregation Supporte..." refers methods in this paper

  • ...The two main methods for efficient data aggregation are making packets more spatially [5-12] and temporally [1-4] convergent....

    [...]

  • ...One category focuses on timing control [1-4]....

    [...]

Dissertation
01 Jan 2000
TL;DR: This dissertation supports the claim that application-specific protocol architectures achieve the energy and latency efficiency and error robustness needed for wireless networks by developing two systems.
Abstract: In recent years, advances in energy-efficient design and wireless technologies have enabled exciting new applications for wireless devices. These applications span a wide range, including real-time and streaming video and audio delivery, remote monitoring using networked microsensors, personal medical monitoring, and home networking of everyday appliances. While these applications require high performance from the network, they suffer from resource constraints that do not appear in more traditional wired computing environments. In particular, wireless spectrum is scarce, often limiting the bandwidth available to applications and making the channel error-prone, and the nodes are battery-operated, often limiting available energy. My thesis is that this harsh environment with severe resource constraints requires an application-specific protocol architecture, rather than the traditional layered approach, to obtain the best possible performance. This dissertation supports this claim using detailed case studies on microsensor networks and wireless video delivery. The first study develops LEACH (Low-Energy Adaptive Clustering Hierarchy), an architecture for remote microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. This approach improves system lifetime by an order of magnitude compared to general-purpose approaches when the node energy is limited. The second study develops an unequal error protection scheme for MPEG-4 compressed video delivery that adapts the level of protection applied to portions of a packet to the degree of importance of the corresponding bits. This approach obtains better application-perceived performance than current approaches for the same amount of transmission bandwidth. These two systems show that application-specific protocol architectures achieve the energy and latency efficiency and error robustness needed for wireless networks. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)

1,253 citations


"Effective Data Aggregation Supporte..." refers background or methods in this paper

  • ...The two main methods for efficient data aggregation are making packets more spatially [5-12] and temporally [1-4] convergent....

    [...]

  • ...The typical examples are LEACH [5] and HEED [7]....

    [...]

  • ...However, the present routing schemes for data aggregation are generally static, such as cluster-based [5, 7], chain-based [6], tree-based [8-12], which mainly have two disadvantages....

    [...]

  • ...The other category focuses on establishing a proper routing scheme to improve aggregation ratio [5-12]....

    [...]

Journal ArticleDOI
TL;DR: This paper presents an improved scheme, called PEGASIS (power-efficient gathering in sensor information systems), which is a near-optimal chain-based protocol that minimizes energy, and presents two new schemes that attempt to balance the energy and delay cost for data gathering from sensor networks.
Abstract: Gathering sensed information in an energy efficient manner is critical to operating the sensor network for a long period of time. The LEACH protocol presented by Heinzelman et al. (2000) is an elegant solution where clusters are formed to fuse data before transmitting to the base station. In this paper, we present an improved scheme, called PEGASIS (power-efficient gathering in sensor information systems), which is a near-optimal chain-based protocol that minimizes energy. 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. For many applications, in addition to minimizing energy, it is also important to consider the delay incurred in gathering sensed data. We capture this with the energy /spl times/ delay metric and present schemes that attempt to balance the energy and delay cost for data gathering from sensor networks. We present two new schemes to minimize energy /spl times/ delay using CDMA and non-CDMA sensor nodes. We compared the performance of direct, LEACH, and our schemes with respect to energy /spl times/ delay using extensive simulations for different network sizes. Results show that our schemes perform 80 or more times better than the direct scheme and also outperform the LEACH protocol.

1,194 citations


"Effective Data Aggregation Supporte..." refers background or methods in this paper

  • ...The two main methods for efficient data aggregation are making packets more spatially [5-12] and temporally [1-4] convergent....

    [...]

  • ...However, the present routing schemes for data aggregation are generally static, such as cluster-based [5, 7], chain-based [6], tree-based [8-12], which mainly have two disadvantages....

    [...]

  • ...The other category focuses on establishing a proper routing scheme to improve aggregation ratio [5-12]....

    [...]

  • ...A typical chain-based data aggregation protocol PEGASIS [6] employs the greedy algorithm to construct the chain....

    [...]

  • ...Second, some static routing schemes, such as [6], need the global information to construct the route for data aggregation, which will incur high overhead especially when the number of nodes becomes large and the topology changes frequently when some sensor nodes die one after another due to energy exhaustion or something....

    [...]