Proceedings ArticleDOI
Effective Data Aggregation Supported by Dynamic Routing in Wireless Sensor Networks
Jian Zhang,Wu Qiuhan,Feng-Yuan Ren,Ting He,Cheng-Te Lin +4 more
- pp 1-6
TLDR
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 sizeread more
Citations
More filters
Proceedings ArticleDOI
Maximizing lifetime of multiple data aggregation trees in wireless sensor networks
TL;DR: A hierarchical sensor network routing is proposed in which a base station cooperates with its underlying multiple cluster heads to determine the best routes in each tree-cluster to reduce the energy consumption and extend the lifetime of aggregation trees.
Journal ArticleDOI
The Degree-Constrained Adaptive Algorithm Based on the Data Aggregation Tree
TL;DR: A new algorithm called DADAT (a Degree-based Adaptive algorithm for Data Aggregation Tree) is proposed that can effectively balance the energy consumption and prolong the lifetime of the network, as well as achieving a lower latency.
Load Balanced and Constant Stretch Hole Bypassing Protocol for Wireless Sensor Networks
TL;DR: This dissertation, which focuses on large-scale WSNs which are based on the cooperation of a large number of sensor nodes, finds that balancing traffic over the network to extend the network lifetime is another important designing factor of routing protocol in W SNs.
Proceedings ArticleDOI
Stochastic Delay Bound for Heterogeneous Aggregation in Sensor Networks
TL;DR: The problem that how to calculate the stochastic delay bound under different aggregation schemes is solved with the stoChastic network calculus and it is shown that a good tradeoff between performance and implementation can be achieved with a comprehensive aggregation scheme.
Overview of data aggregation based routing protocols in wireless sensor
TL;DR: In this paper, data aggregation based routing protocols for WSNs are analyzed and the routing protocols of structured architecture such as tree-based, cluster- based, chain-based and unstructured architecturesuch as structure-free are reviewed.
References
More filters
Journal ArticleDOI
An application-specific protocol architecture for wireless microsensor networks
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.
Journal ArticleDOI
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
O. Younis,Sonia Fahmy +1 more
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.
Journal ArticleDOI
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
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.
Dissertation
Application-specific protocol architectures for wireless networks
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.
Journal ArticleDOI
Data gathering algorithms in sensor networks using energy metrics
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.