Advertisement

Software Defined Sensing

  • Deze Zeng
  • Lin Gu
  • Shengli Pan
  • Song Guo
Chapter
Part of the SpringerBriefs in Computer Science book series (BRIEFSCOMPUTER)

Abstract

After a decade of extensive research on application-specific WSNs, the recent development of information and communication technologies makes it practical to realize SDSNs, which are able to adapt to various application requirements and to fully explore the resources of WSNs. A sensor node in SDSN is able to conduct multiple tasks with different sensing targets simultaneously. A given sensing task usually involves multiple sensors to achieve a certain quality-of-sensing, e.g., coverage ratio. It is significant to design an energy-efficient sensor scheduling and management strategy with guaranteed quality-of-sensing for all tasks. To this end, three issues shall be considered: (1) the subset of sensor nodes that shall be activated, i.e., sensor activation, (2) the task that each sensor node shall be assigned, i.e., task mapping, and (3) the sampling rate on a sensor for a target, i.e., sensing scheduling. In this chapter, they are jointly considered and formulated as a mixed-integer with quadratic constraints programming (MIQP) problem, which is then reformulated into a mixed-integer linear programming (MILP) formulation with low computation complexity via linearization. To deal with dynamic events such as sensor node participation and departure, during SDSN operations, an efficient online algorithm using local optimization is developed. Simulation results show that the proposed online algorithm approaches the globally optimized network energy efficiency with much lower rescheduling time and control overhead.

References

  1. 7.
    Md Zakirul Alam Bhuiyan, Guojun Wang, Jiannong Cao, and Jie Wu. Sensor placement with multiple objectives for structural health monitoring. ACM Transactions on Sensor Networks (TOSN), 10(4):68, 2014.CrossRefGoogle Scholar
  2. 8.
    Daniel Bienstock. Computational study of a family of mixed-integer quadratic programming problems. Mathematical Programming, 74(2):121–140, 1996.MathSciNetCrossRefGoogle Scholar
  3. 11.
    Jiming Chen, Kejie Cao, Keyong Li, and Youxian Sun. Distributed sensor activation algorithm for target tracking with binary sensor networks. Cluster Computing, 14(1):55–64, 2011.CrossRefGoogle Scholar
  4. 30.
    Jean-Marie Garcia, Olivier Brun, and David Gauchard. Transient analytical solution of m/d/1/n queues. Journal of applied probability, pages 853–864, 2002.MathSciNetCrossRefGoogle Scholar
  5. 34.
    Lin Gu and John A Stankovic. Radio-triggered wake-up for wireless sensor networks. Real-Time Systems, 29(2–3):157–182, 2005.CrossRefGoogle Scholar
  6. 36.
    Gurobi Optimization. Gurobi Optimizer Reference Manual, 2013.Google Scholar
  7. 47.
    Chi-Fu Huang and Yu-Chee Tseng. The coverage problem in a wireless sensor network. Mobile Networks and Applications, 10(4):519–528, 2005.CrossRefGoogle Scholar
  8. 51.
    Neeraj Jaggi, Sreenivas Madakasira, Sandeep Reddy Mereddy, and Ravi Pendse. Adaptive algorithms for sensor activation in renewable energy based sensor systems. Ad Hoc Networks, 11(4):1405–1420, 2013.CrossRefGoogle Scholar
  9. 59.
    Philip Levis, Sam Madden, Joseph Polastre, Robert Szewczyk, Kamin Whitehouse, Alec Woo, David Gay, Jason Hill, Matt Welsh, Eric Brewer, et al. TinyOS: An Operating System for Sensor Networks. In Ambient Intelligence, pages 115–148. Springer, 2005.Google Scholar
  10. 63.
    Tie Luo, Hwee-Pink Tan, and T.Q.S. Quek. Sensor OpenFlow: Enabling Software-Defined Wireless Sensor Networks. IEEE Communications Letters, 16(11):1896–1899, 2012.CrossRefGoogle Scholar
  11. 70.
    Toshiaki Miyazaki. Dynamic Function Alternation to Realize Robust Wireless Sensor Network. International Journal of Handheld Computing Research (IJHCR), 3(3):17–34, July 2012.CrossRefGoogle Scholar
  12. 71.
    Toshiaki Miyazaki, Daiki Shitara, Yuji Endo, Yuuki Tanno, Hidenori Igari, and Ryouhei Kawano. Die-hard Sensor Network: Robust Wireless Sensor Network Dedicated to Disaster Monitoring. In Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication (ICUIMC), pages 53:1–53:10. ACM, 2011.Google Scholar
  13. 96.
    Danbing Seto, John P Lehoczky, Lui Sha, and Kang G Shin. On task schedulability in real-time control systems. In Proceedings of the 17th Real-Time Systems Symposium (RTSS), pages 13–21. IEEE, 1996.Google Scholar
  14. 112.
    Bang Wang. Coverage Problems in Sensor Networks: A Survey. ACM Computer Survey, 43(4):32:1–32:53, Oct. 2011.Google Scholar
  15. 113.
    Jie Wang and Ning Zhong. Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization, 11(3):291–304, 2006.MathSciNetCrossRefGoogle Scholar
  16. 117.
    Rebecca Willett, Aline Martin, and Robert Nowak. Backcasting: adaptive sampling for sensor networks. In Proceedings of the 3rd international symposium on Information processing in sensor networks, pages 124–133. ACM, 2004.Google Scholar
  17. 122.
    David KY Yau, Nung Kwan Yip, Chris YT Ma, Nageswara SV Rao, and Mallikarjun Shankar. Quality of monitoring of stochastic events by periodic and proportional-share scheduling of sensor coverage. ACM Transactions on Sensor Networks (TOSN), 7(2):18, 2010.Google Scholar
  18. 123.
    Mohamed Younis, Moustafa Youssef, and Khaled Arisha. Energy-aware routing in cluster-based sensor networks. In Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002. MASCOTS 2002. Proceedings. 10th IEEE International Symposium on, pages 129–136. IEEE, 2002.Google Scholar

Copyright information

© The Author(s), under exclusive license to Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Deze Zeng
    • 1
  • Lin Gu
    • 2
  • Shengli Pan
    • 1
  • Song Guo
    • 3
  1. 1.School of Computer ScienceChina University of GeosciencesWuhanChina
  2. 2.Huazhong University of Science and TechnologyWuhanChina
  3. 3.Department of ComputingThe Hong Kong Polytechnic UniversityHong KongHong Kong

Personalised recommendations