skip to main content
10.1145/1860093.1860118acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

Near optimal multi-application allocation in shared sensor networks

Published: 20 September 2010 Publication History

Abstract

Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a shared sensor network, in order to maximize the overall Quality of Monitoring (QoM) subject to resource constraints (e.g., in terms of memory and network bandwidth). The resulting constrained optimization problem is a difficult and open problem since it is discrete, nonlinear, and not in closed-form. This paper makes several important contributions towards optimal multi-application allocation in shared sensor networks. (1) We formulate the optimal application allocation problem for a common class of distributed sensing applications whose QoM can be modeled as variance reduction functions. (2) We prove key theoretical properties of the optimization problem, including the monotonicity and submodularity of the variance reduction functions and the multiple knapsack structure of constraints; (3) By exploiting these properties, we propose a local search algorithm, which is efficient and has a good approximation bound, for application allocation in shared sensor networks. Simulations based on both real-world datasets and randomly generated networks demonstrate that our algorithm is competitive against simulated annealing in term of QoM, with up to three orders of magnitude reduction in execution times, making it a practical solution towards multi-application allocation in shared sensor networks.

References

[1]
}}http://research.cens.ucla.edu/areas/2005/NIMS/.
[2]
}}http://www.xbow.com/Products/Product_pdf_files/Wireless_pdf/TelosB_Datash%eet.pdf.
[3]
}}http://db.csail.mit.edu/labdata/labdata.html.
[4]
}}S. Bhattacharya, A. Saifullah, C. Lu, and G.-C. Roman. Multi-application deployment in shared sensor networks based on quality of monitoring. In RTAS'10.
[5]
}}F. Bian, D. Kempe, and R. Govindan. Utility-based sensor selection. In IPSN'06.
[6]
}}J. Byers and G. Nasser. Utility-based decision-making in wireless sensor networks. In MobiHoc'00.
[7]
}}Citysense. http://www.citysense.net/.
[8]
}}M. Conforti and G. CornuŐjols. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the rado-edmonds theorem. Discrete Applied Mathematics, 7(3):251--274, 1984.
[9]
}}U. Feige. A threshold of ln n for approximating set cover. J. ACM, 45(4):634--652, 1998.
[10]
}}M. Fisher, G. Nemhauser, and L. Wolsey. An analysis of approximations for maximizing submodular setfunctions-ii. Mathematical Programming Study, 8:73--87, 1978.
[11]
}}C. Frank and K. R&3246;mer. Algorithms for generic role assignment in wireless sensor networks. In SenSys'05.
[12]
}}L. Wolsey G. Nemhauser and M. Fisher. An analysis of approximations for maximizing submodular set functions-i. Mathematical Programming, 14(1):265--294, 1978.
[13]
}}C. Guestrin, A. Krause, and A. Singh. Near-optimal sensor placements in gaussian processes. In ICML'05.
[14]
}}J. Horey, A. Maccabe, and A. Mielke. A dynamic tasking architecture for sensor networks. In WWSNA'07.
[15]
}}V. Isler and R. Bajcsy. The sensor selection problem for bounded uncertainty sensing models. In IPSN'05.
[16]
}}A. Krause and A. Gupta. Near-optimal sensor placements: Maximizing information while minimizing communication cost. In IPSN'06, pages 2--10.
[17]
}}A. Krause, J. Leskovec, C. Guestrin, J. VanBriesen, and C. Faloutsos. Efficient sensor placement optimization for securing large water distribution networks. Journal of Water Resources Planning and Management, 134(6):516--526, November 2008.
[18]
}}A. Krause, B. McMahan, C. Guestrin, and A. Gupta. Robust submodular observation selection. Journal of Machine Learning Research (JMLR), 9:2761--2801, December 2008.
[19]
}}A. Kulik, H. Shachnai, and T. Tamir. Maximizing submodular set functions subject to multiple linear constraints. In SODA'09.
[20]
}}J. Lee, V. Mirrokni, V. Nagarjan, and M. Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints, 2009.
[21]
}}Q. Ma, D. Parkes, and M. Welsh. A utility-based approach to bandwidth allocation and link scheduling in wireless networks. In ATSN'07.
[22]
}}G. Mainland, D. Parkes, and Welsh M. Decentralized, adaptive resource allocation for sensor networks. In NSDI'05.
[23]
}}S. Russel and P. Norvig. Artificial Intelligence: A Modern Approach, 2nd Edition. Prentice-Hall, 2003.
[24]
}}M. Sviridenko. A note on maximizing a submodular set function subject to a knapsack constraint. Operations Research Letters, 32(1):41--43, 2004.
[25]
}}Y. Yu, L. Rittle, V. Bhandari, and J. LeBrun. Supporting concurrent applications in wireless sensor networks. In SenSys'06.
[26]
}}G. Zhou, T. He, J. Stankovic, and T. Abdelzaher. RID: radio interference detection in wireless sensor networks. In INFOCOM'05.

Cited By

View all
  • (2022)PEACE: Towards Optimizing Monitoring Utility of Unmanned Aerial Vehicles with Adverse Effect Constraints2022 Tenth International Conference on Advanced Cloud and Big Data (CBD)10.1109/CBD58033.2022.00057(13-18)Online publication date: Nov-2022
  • (2019)A Data Fusion Algorithm for Multiple Applications in Wireless Sensor NetworksMission-Oriented Sensor Networks and Systems: Art and Science10.1007/978-3-319-91146-5_14(533-568)Online publication date: 19-Sep-2019
  • (2018)CapNetACM Transactions on Sensor Networks10.1145/327862415:1(1-34)Online publication date: 15-Dec-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
MobiHoc '10: Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
September 2010
272 pages
ISBN:9781450301831
DOI:10.1145/1860093
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 September 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. resource allocation
  2. shared sensor network
  3. submodular optimization

Qualifiers

  • Research-article

Conference

MobiCom/MobiHoc '10
Sponsor:

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2022)PEACE: Towards Optimizing Monitoring Utility of Unmanned Aerial Vehicles with Adverse Effect Constraints2022 Tenth International Conference on Advanced Cloud and Big Data (CBD)10.1109/CBD58033.2022.00057(13-18)Online publication date: Nov-2022
  • (2019)A Data Fusion Algorithm for Multiple Applications in Wireless Sensor NetworksMission-Oriented Sensor Networks and Systems: Art and Science10.1007/978-3-319-91146-5_14(533-568)Online publication date: 19-Sep-2019
  • (2018)CapNetACM Transactions on Sensor Networks10.1145/327862415:1(1-34)Online publication date: 15-Dec-2018
  • (2018)Joint Application Admission Control and Network Slicing in Virtual Sensor NetworksIEEE Internet of Things Journal10.1109/JIOT.2017.27694465:1(28-43)Online publication date: Feb-2018
  • (2017)PSAllocatorProceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing10.1145/2998181.2998193(1139-1151)Online publication date: 25-Feb-2017
  • (2017)Energy-aware dynamic resource allocation in virtual sensor networks2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC)10.1109/CCNC.2017.7983116(264-267)Online publication date: Jan-2017
  • (2016)CATSACM Transactions on Sensor Networks10.1145/295510212:4(1-26)Online publication date: 7-Sep-2016
  • (2016)A Systematic Review of Shared Sensor NetworksACM Computing Surveys10.1145/285151048:4(1-50)Online publication date: 9-Feb-2016
  • (2016)Joint Scheduling and Sensing Allocation in Energy Harvesting Sensor Networks With Fusion CentersIEEE Journal on Selected Areas in Communications10.1109/JSAC.2016.261196234:12(3577-3589)Online publication date: 1-Dec-2016
  • (2016)SERAPH: Service Allocation Algorithm for the Execution of Multiple Applications in Heterogeneous Shared Sensor and Actuator NetworksManagement of Cyber Physical Objects in the Future Internet of Things10.1007/978-3-319-26869-9_5(93-113)Online publication date: 30-Jan-2016
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media