Minimum-energy reprogramming with guaranteed quality-of-sensing in software-defined sensor networks

After a decade of extensive research on application-specific wireless sensor networks (WSNs), the recent development of information and communication technologies make it practical to realize software-defined sensor networks (SDSNs), which are able to adapt to various application requirements and to fully explore the resources of WSNs. In SDSNs, wireless sensor nodes can be dynamically reprogrammed for different sensing tasks via the over-the-air-programming technique. For a given sensing task, it is usually required to guarantee certain quality-of-sensing, e.g., coverage ratio. Intuitively, the more sensors are deployed with a program, the higher quality-of-sensing of the corresponding task can be achieved. However, this is at the expense of high reprogramming energy consumption. In this paper, we investigate how to design an energy-efficient reprogramming strategy with guaranteed quality-of-sensing for a sensing task. To this end, two issues will be tackled: 1) the subset of sensors that shall be reprogrammed, i.e., reprogramming sensor selection and 2) the program distribution routing. They are jointly considered and formulated as an integer linear programming (ILP) problem, based on which an algorithm with low computation complexity is then proposed. The high efficiency of our algorithm is validated by extensive simulation studies.

[1]  S. Sitharama Iyengar,et al.  Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks , 2002, IEEE Trans. Computers.

[2]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  Yigal Bejerano,et al.  Lifetime and Coverage Guarantees Through Distributed Coordinate-Free Sensor Activation , 2011, IEEE/ACM Transactions on Networking.

[4]  Anthony Ephremides,et al.  Energy-Efficient Broadcast and Multicast Trees in Wireless Networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[6]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[7]  Bang Wang,et al.  Coverage problems in sensor networks: A survey , 2011, CSUR.

[8]  Hossam S. Hassanein,et al.  No-reboot and zero-flash over-the-air programming for Wireless Sensor Networks , 2012, 2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[9]  Michele Zorzi,et al.  SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes , 2010, IEEE Transactions on Mobile Computing.

[10]  Toshiaki Miyazaki,et al.  Die-hard sensor network: robust wireless sensor network dedicated to disaster monitoring , 2011, ICUIMC '11.

[11]  Toshiaki Miyazaki.  Dynamic Function Alternation to Realize Robust Wireless Sensor Network , 2012, Int. J. Handheld Comput. Res..

[12]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

[13]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[15]  Song Guo,et al.  Evolution of Software-Defined Sensor Networks , 2013, 2013 IEEE 9th International Conference on Mobile Ad-hoc and Sensor Networks.

[16]  Hwee Pink Tan,et al.  Sensor OpenFlow: Enabling Software-Defined Wireless Sensor Networks , 2012, IEEE Communications Letters.