Energy Efficient Geographic Anycast in Wireless Sensor Networks

One of the basic operations in a wireless sensor network is the enquiry and transmission of sensed data from sensor devices in some specified regions to the data center for further processing. A key challenge in data enquiring and transmitting is to minimize the total energy cost occurring at all sensor nodes involved. In this paper, we introduce and study the energy efficient data enquiring problem under the geographic anycast model: given the location of a data sink and some sensor nodes in a set of regions, construct a tree rooted at the sink such that at least one sensor in each given region is in the tree. The objective is to minimize the total energy cost of the transmitting nodes in the tree. We first prove that this problem is NP-hard and unlikely has an approximation algorithm with a performance ratio in logarithmic of the number of sensors in the network. We then propose some tree based approximation algorithms. We make both theoretical and simulation analysis for the performances of proposed algorithms. Our study shows that anycast approach is more energy efficient than broadcast or multicast

[1]  Weifa Liang,et al.  Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.

[2]  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).

[3]  Anthony Ephremides,et al.  Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks , 2001, Mob. Networks Appl..

[4]  John Wroclawski,et al.  A framework for scalable global IP-anycast (GIA) , 2001, CCRV.

[5]  Hai Liu,et al.  Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks , 2004, IEEE Trans. Mob. Comput..

[6]  Maggie Xiaoyan Cheng,et al.  Energy-efficient broadcast and multicast routing in ad hoc wireless networks , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[7]  T. Gonzalez,et al.  Minimum-energy Broadcast in Simple Graphs with Limited Node Power , 2007 .

[8]  Dina Katabi,et al.  A framework for scalable global IP-anycast (GIA) , 2000, SIGCOMM 2000.

[9]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

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

[11]  R. Ravi,et al.  A polylogarithmic approximation algorithm for the group Steiner tree problem , 2000, SODA '98.

[12]  Wendi Heinzelman,et al.  Proceedings of the 33rd Hawaii International Conference on System Sciences- 2000 Energy-Efficient Communication Protocol for Wireless Microsensor Networks , 2022 .

[13]  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).

[14]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[15]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[16]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.