An energy-conserving algorithm for the collection and reporting of data in mobile sensor networks
Pages 50 - 58
Abstract
Advances in mobile and sensor technologies have enabled the collection of continuously changing data such as locations and weather measurements. However, conserving the energy of these devices has been a major challenge. In this work, we propose an energy-efficient solution to a new variant of the Discrete Unit Disk Covering Problem (DUDC), which models a mobile sensor network. We present an approximation algorithm for this problem and theoretical analysis in the case of randomly positioned sensors that shows that three objectives are met: reduce the average number of active sensors that report measurements, spread the measurement burden over time evenly among the reporting sensors and maintain an acceptable quality of the reported measurements. Experimental and theoretical results show that our proposed algorithm has computational complexity and approximation factor comparable to currently known deterministic algorithms while meeting the aforementioned objectives.
References
[1]
B. Brunekreef and S. T. Holgate. Air pollution and health. The lancet, 360(9341):1233--1242, 2002.
[2]
M. F. Bulut and M. Demirbas. Energy efficient proximity alert on android. In Pervasive Computing and Communications Workshops (PERCOM Workshops), 2013 IEEE International Conference on, pages 157--162. IEEE, 2013.
[3]
G. Călinescu, I. I. Măndoiu, P.-J. Wan, and A. Z. Zelikovsky. Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks and Applications, 9(2):101--111, 2004.
[4]
M.-Y. Choi, E. Cho, D.-H. Park, J.-Y. Bae, C.-J. Moon, and D.-K. Baik. A synchronization algorithm of mobile database for ubiquitous computing. In INC, IMS and IDC, 2009. NCM'09. Fifth International Joint Conference on, pages 416--419. IEEE, 2009.
[5]
B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete mathematics, 86(1):165--177, 1990.
[6]
G. K. Das, R. Fraser, A. López-Ortiz, and B. G. Nickerson. On the discrete unit disk cover problem. In WALCOM: Algorithms and Computation, pages 146--157. Springer, 2011.
[7]
S. Fang and R. Zimmermann. Enacq: energy-efficient gps trajectory data acquisition based on improved map matching. In Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pages 221--230. ACM, 2011.
[8]
R. Fraser and A. López-Ortiz. The within-strip discrete unit disk cover problem. In CCCG, pages 53--58, 2012.
[9]
R. Hussian, S. Sharma, V. Sharma, and S. Sharma. Wsn applications: Automated intelligent traffic control system using sensors. International Journal of Soft Computing and Engineering, 2013.
[10]
J. Ko, C. Lu, M. B. Srivastava, J. Stankovic, A. Terzis, M. Welsh, et al. Wireless sensor networks for healthcare. Proceedings of the IEEE, 98(11):1947--1960, 2010.
[11]
L. Loyola, F. Wong, D. Pereira, and H. Sanson. Extending battery lifetime of mobile devices with geofence capabilities on dynamic-speed urban environments. In Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems, pages 51--58. ACM, 2013.
[12]
N. H. Mustafa and S. Ray. Improved results on geometric hitting set problems. Discrete & Computational Geometry, 44(4):883--895, 2010.
[13]
S. Narayanappa and P. Vojtechovsky. An improved approximation factor for the unit disk covering problem. In CCCG, 2006.
[14]
J. Paek, K.-H. Kim, J. P. Singh, and R. Govindan. Energy-efficient positioning for smartphones using cell-id sequence matching. In Proceedings of the 9th international conference on Mobile systems, applications, and services, pages 293--306. ACM, 2011.
[15]
C. P. Wild. The exposome: from concept to utility. International journal of epidemiology, 41(1):24--32, 2012.
[16]
Z. Zhang, F. Yu, L. Chen, and G. Cao. Cenet: A cabinet environmental sensing network. Sensors, 10(2):1021--1040, 2010.
Index Terms
- An energy-conserving algorithm for the collection and reporting of data in mobile sensor networks
Recommendations
Minimal Hop Count Path Routing Algorithm for Mobile Sensor Networks
IMSCCS '06: Proceedings of the First International Multi-Symposiums on Computer and Computational Sciences - Volume 2 (IMSCCS'06) - Volume 02LEACH and LEACH-C have demonstrated the feasibility of achieving good efficient routing path. As considering mixed sensor fields with fixed and mobile nodes in a sensor field LEACH and LEACH-C are not appropriate to support mobile sensor nodes. In this ...
The Sink Node Placement and Performance Implication in Mobile Sensor Networks
Mobile sensor networks are desirable in a variety of application scenarios, in which information collection is no doubt of great importance. In this paper, we present a mobile sensor network architecture consisting of a potentially large number of ...
Detecting node replication attacks in mobile sensor networks: theory and approaches
A wireless sensor network composed of a number of sensor nodes is often deployed in unattended and harsh environments to perform various monitoring tasks. Due to cost concerns, usually, sensor nodes are not made tamper-resistant, and a captured node may ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
November 2015
95 pages
Copyright © 2015 ACM.
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]
Sponsors
- ESRI
- Google Inc.
- NVIDIA
- Microsoft: Microsoft
- Facebook: Facebook
- SIGSPATIAL: ACM Special Interest Group on Spatial Information
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 November 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Information and Communication Technology Fund of United Arab Emirates
- USA National Science Foundation
Conference
SIGSPATIAL'15
Sponsor:
- Microsoft
- SIGSPATIAL
SIGSPATIAL'15: 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems
November 3, 2015
Washington, Bellevue
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 38Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 19 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in