research-article

Voronoi trees for hierarchical in-network data and space abstractions in wireless sensor networks

Authors:

MSWiM '13: Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems

Pages 207 - 210

https://doi.org/10.1145/2507924.2507999

Published: 03 November 2013 Publication History

Get Access

Abstract

We address the problem of spatial queries in Wireless Sensor Networks (WSN) via hybrid overlays, where the data values may correspond to different physical phenomena and sensors may be correlated with spatial constraints. We show how hierarchical data and space abstractions can be used to represent Voronoi Cell based partitions of the sensing field and use Voronoi Trees to efficiently map the hierarchical abstractions for energy-efficient processing. The proposed scheme is simulated on the SidNET, a JiST/SWANS based sensor network simulation platform. The performance results show significant advantages in terms of accurate field representation at different levels of the tree hierarchy with a trade-off in query processing delay.

References

[1]

Zhao, F. and Guibas, L. 2004. Wireless Sensor Networks: An Information Processing Approach. Morgan Kaufman.

Digital Library

Google Scholar

[2]

Balzer, M., Deussen, O. and Lewerentz, C. 2005. Voronoi treemaps for the visualization of software metrics. In Proc. of ACM Symp. on Software visualization.

Digital Library

Google Scholar

[3]

Shekhar, S. and Chawla, S. 2003. Spatial Databases: A Tour. Prentice Hall.

Google Scholar

[4]

De Berg, M., Cheong, O., Van Kreveld, M. and Overmars, M. 2008. Computational Geometry Algorithms and Applications. Springer.

Digital Library

Google Scholar

[5]

Ali Mohamed, M. M., Khokhar, A., Trajcevski, G., Ansari, R. and Ouksel, A. 2012. Approximate hybrid query processing in wireless sensor networks. In Proc. of ACM GIS.

Digital Library

Google Scholar

[6]

Greenstein, B., Estrin, D., Govindan, R., Ratnasamy, S. and Shenker, S. 2003. DIFS: A Distributed Index for Features in Sensor Networks. Ad Hoc Networks, Vol. 1, pp. 333--349.

Crossref

Google Scholar

[7]

Ganesan, D., Greenstein, B., Estrin, D., Heidemann, J. and Govindan, R. 2005. Multiresolution Storage and Search in Sensor Networks. ACM Transactions on Storage (TOS), Vol. 1, pp. 277--315.

Digital Library

Google Scholar

[8]

Ciancio, A., Pattem, S., Ortega, A. and Krishnamachari, B. 2006. Energy-Efficient Data Repres and Routing for Wireless Sensor Networks Based on a Distributed Wavelet Compression Algorithm. IPSN.

Digital Library

Google Scholar

[9]

Meliou, A., Guestrin, C. and Hellerstein, J. 2009. Approximating Sensor Network Queries Using In-Network Summaries. IPSN Johnson, B. and Shneiderman, B. 1891.

Digital Library

Google Scholar

[10]

Tree-maps: A space-filling approach to the visualization of hierarchical information structures. In Proc. IEEE Visualization Conf.

Digital Library

Google Scholar

[11]

Ghica, O., Trajcevski, G., Scheuermann, P., Bischoff, Z. and Valtchanov, N. 2008. Sidnet-swans: A simulator and integrated development platform for sensor networks applications. ACM SenSys.

Digital Library

Google Scholar

[12]

Ammari, H. M., and Sajal K. D. 2008. Promoting heterogeneity, mobility, and energy-aware voronoi diagram in wireless sensor networks. IEEE Trans. Parallel and Distributed Systems, IEEE Transactions on 18(7).

Digital Library

Google Scholar

[13]

Gold, C. and Angel, P. 2006. Voronoi Hierarchies. Geographic Information Science (pp. 99--111). Springer Berlin Heidelberg.

Digital Library

Google Scholar

Cited By

View all

Xiao SXu Z(2017)Reliable and Energy Efficient Communication Algorithm in Hierarchical Wireless Sensor NetworksWireless Personal Communications: An International Journal10.1007/s11277-016-3705-y95:3(1891-1909)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s11277-016-3705-y
Gold C(2016)Tessellations in GIS: Part I—putting it all togetherGeo-spatial Information Science10.1080/10095020.2016.114644019:1(9-25)Online publication date: 25-Mar-2016
https://doi.org/10.1080/10095020.2016.1146440

Index Terms

Voronoi trees for hierarchical in-network data and space abstractions in wireless sensor networks

Recommendations

Hierarchical Ring-Based Data Gathering for Dense Wireless Sensor Networks

Data gathering is an essential operation in wireless sensor networks. For periodic data gathering applications, each sensor node has data that must be sent to a distant base station in a round of communication. Due to the limited battery power of sensor ...
Relay Node Placement in Wireless Sensor Networks

A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...
Sensor scheduling for p-percent coverage in wireless sensor networks

We study sensor scheduling problems of p-percent coverage in this paper and propose two scheduling algorithms to prolong network lifetime due to the fact that for some applications full coverage is not necessary and different subareas of the monitored ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MSWiM '13: Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems

November 2013

468 pages

ISBN:9781450323536

DOI:10.1145/2507924

General Chairs:
Bjorn Landfeldt
Lund University, Sweden
,
Mónica Aguilar Igartua
Universitat Politàcnica de Catalunya, Spain
,
Program Chairs:
Ravi Prakash
University of Texas at Dallas, USA
,
Cheng Li
Memorial University of Newfoundland, Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MSWiM '13

Sponsor:

SIGSIM

MSWiM '13: 16th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems

November 3 - 8, 2013

Barcelona, Spain

Acceptance Rates

MSWiM '13 Paper Acceptance Rate 42 of 184 submissions, 23%;

Overall Acceptance Rate 398 of 1,577 submissions, 25%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
93
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Xiao SXu Z(2017)Reliable and Energy Efficient Communication Algorithm in Hierarchical Wireless Sensor NetworksWireless Personal Communications: An International Journal10.1007/s11277-016-3705-y95:3(1891-1909)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s11277-016-3705-y
Gold C(2016)Tessellations in GIS: Part I—putting it all togetherGeo-spatial Information Science10.1080/10095020.2016.114644019:1(9-25)Online publication date: 25-Mar-2016
https://doi.org/10.1080/10095020.2016.1146440

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Hierarchical Ring-Based Data Gathering for Dense Wireless Sensor Networks

Relay Node Placement in Wireless Sensor Networks

Sensor scheduling for p-percent coverage in wireless sensor networks