Subscribe
Issue No.08 - August (2010 vol.9)
pp: 1161-1172
Santosh Kumar , University of Memphis, Memphis
Ten H. Lai , The Ohio State University, Columbus
Marc E. Posner , The Ohio State University, Columbus
Prasun Sinha , Ohio State University , Columbus
ABSTRACT
To make a network last beyond the lifetime of an individual sensor node, redundant nodes must be deployed. What sleep-wake-up schedule can then be used for individual nodes so that the redundancy is appropriately exploited to maximize the network lifetime? We develop optimal solutions to both problems for the case when wireless sensor nodes are deployed to form an impenetrable barrier for detecting movements. In addition to being provably optimal, our algorithms work for nondisk sensing regions and heterogeneous sensing regions. Further, we provide an optimal solution for the more difficult case when the lifetimes of individual nodes are not equal. Developing optimal algorithms for both homogeneous and heterogeneous lifetimes allows us to obtain, by simulation, several interesting results. We show that even when an optimal number of sensor nodes has been deployed randomly, statistical redundancy can be exploited to extend the network lifetime by up to seven times. We also use simulation to show that the assumption of homogeneous lifetime can result in severe loss (two-thirds) of the network lifetime. Although these results are specifically for barrier coverage, they provide an indication of behavior for other coverage models.
INDEX TERMS
Wireless sensor networks, sleep-wakeup, sensor deployment, barrier coverage, multiroute network flows.
CITATION
Santosh Kumar, Ten H. Lai, Marc E. Posner, Prasun Sinha, "Maximizing the Lifetime of a Barrier of Wireless Sensors", IEEE Transactions on Mobile Computing, vol.9, no. 8, pp. 1161-1172, August 2010, doi:10.1109/TMC.2010.78
REFERENCES
 [1] S. Kumar, T.H. Lai, and A. Arora, "Barrier Coverage with Wireless Sensors," Proc. ACM MobiCom, pp. 284-298, 2005. [2] A. Arora et al., "Line in the Sand: A Wireless Sensor Network for Target Detection, Classification, and Tracking," Computer Networks, vol. 46, no. 5, pp. 605-634, 2004. [3] A. Arora et al., "ExScal: Elements of an Extreme Scale Wireless Sensor Network," Proc. 11th IEEE Int'l Conf. Real-Time Computing Systems and Applications (RTCSA '05), 2005. [4] J. Hwang, T. He, and Y. Kim, "Exploring In-Situ Sensing Irregularity in Wireless Sensor Networks," Proc. Fifth ACM Conf. Embedded Networked Sensor Systems (SenSys '07), 2007. [5] G. Tolle and D.E. Culler, "Design of an Application-Cooperative Management System for Wireless Sensor Networks," Proc. European Workshop Wireless Sensor Networks (EWSN '05), 2005. [6] J.W. Hui and D. Culler, "The Dynamic Behavior of a Data Dissemination Protocol for Network Programming at Scale," Proc. ACM Conf. Embedded Networked Sensor Systems (Sensys '04), 2004. [7] P. Balister, B. Bollobás, A. Sarkar, and S. Kumar, "Reliable Density Estimates for Coverage and Connectivity in Thin Strips of Finite Length," Proc. ACM MobiCom, pp. 75-86, 2007. [8] S. Slijepcevic and M. Potkonjak, "Power Efficient Organization of Wireless Sensor Networks," Proc. IEEE Int'l Conf. Comm., vol. 2, pp. 472-476, 2001. [9] M. Cardei, M. Thai, and W. Wu, "Energy-Efficient Target Coverage in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2005. [10] T. He et al., "Energy-Efficient Surveillance System Using Wireless Sensor Networks," Proc. ACM Mobisys, pp. 270-283, 2004. [11] S. Kumar, T.H. Lai, and J. Balogh, "On $k$ -Coverage in a Mostly Sleeping Sensor Network," Proc. ACM MobiCom, pp. 144-158, 2004. [12] H. Zhang and J. Hou, "Maintaining Sensing Coverage and Connectivity in Large Sensor Networks," Proc. NSF Int'l Workshop Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, 2004. [13] A. Chen, S. Kumar, and T.H. Lai, "Designing Localized Algorithms for Barrier Coverage," Proc. ACM MobiCom, pp. 63-74, 2007. [14] B. Liu, O. Dousse, J. Wang, and A. Saipulla, "Strong Barrier Coverage of Wireless Sensor Networks," Proc. Ninth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 411-420, 2008. [15] K.-F. Ssu, W.-T. Wang, F.-K. Wu, and T.-T. Wu, "$k$ -Barrier Coverage with a Directional Sensing Model," Int'l J. Smart Sensing and Intelligent Systems, vol. 2, no. 1, pp. 75-93, 2009. [16] D.B. West, Introduction to Graph Theory. Prentice Hall, 2001. [17] A. Schrijver, Combinatorial Optimization. Springer, 2003. [18] M. Pinedo, Scheduling: Theory, Algorithms, and Systems. Prentice Hall, 1995. [19] W. Kishimoto, "A Method for Obtaining the Maximum Multiroute Flows in a Network," Networks, vol. 27, no. 4, pp. 279-291, 1996. [20] B. Kuris and T. Dishongh, "Shimmer Mote: Hardware Guide," http://www.eecs.harvard.edu/~konrad/projects/ shimmer/ referencesSHIMMER_HWGuide_REV1P3.pdf , 2006. [21] V. Shnayder, M. Hempstead, B. Chen, B.W. Allen, and M. Welsh, "Simulating the Power Consumption of Large-Scale Sensor Network Applications," Proc. Second ACM Conf. Embedded Networked Sensor Systems (SenSys '04), 2004. [22] R. McNaughton, "Scheduling with Deadlines and Loss Functions," Management Science, vol. 6, pp. 1-12, 1959. [23] W. Kishimoto and M. Takeuchi, "On $m$ Route Flows in a Network," IEICE Trans., vol. J-76-A, no. 8, pp. 1185-1200, 1993, (in Japanese). [24] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979. [25] P. Balister and S. Kumar, "Random versus Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors," Proc. IEEE INFOCOM, 2009. [26] P. Balister, Z. Zheng, S. Kumar, and P. Sinha, "Trap Coverage: Allowing Coverage Holed of Bounded Diameter in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2009.