The Community for Technology Leaders
RSS Icon
Issue No.09 - September (2009 vol.20)
pp: 1352-1365
Yong Ding , Michigan State University, East Lansing
Chen Wang , Google Inc., Mountain View
Li Xiao , Michigan State University, East Lansing
This paper presents an adaptive partitioning scheme of sensor networks for node scheduling and topology control with the aim of reducing energy consumption. Our scheme partitions sensors into groups such that a connected backbone network can be maintained by keeping only one arbitrary node from each group in active status while putting others to sleep. Unlike previous approaches that partition nodes geographically, our scheme is based on the measured connectivity between pairwise nodes and does not depend on nodes' locations. In this paper, we formulate node scheduling with topology control as a constrained optimal graph partition problem, which is NP-hard, and propose a Connectivity-based Partition Approach (CPA), which is a distributed heuristic algorithm, to approximate a good solution. We also propose a probability-based CPA algorithm to further save energy. CPA can ensure K-vertex connectivity of the backbone network, which achieves the trade-off between saving energy and preserving network quality. Moreover, simulation results show that CPA outperforms other approaches in complex environments where the ideal radio propagation model does not hold.
Sensor network, sleep scheduling, graph partition, radio irregularity.
Yong Ding, Chen Wang, Li Xiao, "An Adaptive Partitioning Scheme for Sleep Scheduling and Topology Control in Wireless Sensor Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 9, pp. 1352-1365, September 2009, doi:10.1109/TPDS.2008.230
[1] R. Ramanathan and R. Rosales-Hain, “Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment,” Proc. IEEE INFOCOM, 2000.
[2] R. Wattenhofer, L. Li, P. Bahl, and Y.-M. Wang, “Distributed Topology Control for Wireless Multihop Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2001.
[3] N. Li and J.C. Hou, “FLSS: A Fault-Tolerant Topology Control Algorithm for Wireless Networks,” Proc. ACM MobiCom, 2004.
[4] B. Chen, K. Jamieson, H. Balakrishan, and R. Morris, “Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks,” Proc. ACM MobiCom, 2001.
[5] M. Stemm and R.H. Katz, “Measuring and Reducing Energy Consumption of Network Interfaces in Hand-Held Devices,” IEICE Trans. Comm., 1997.
[6] O. Kasten, Energy Consumption, bathtubenergy_consumption.html, 2008.
[7] W. Ye, J. Heidemann, and D. Estrin, “An Energy-Efficient Mac Protocol for Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2002.
[8] T. van Dam and K. Langendoen, “An Adaptive Energy-Efficient Mac Protocol for Wireless Sensor Networks,” Proc. First ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[9] Y. Xu, J. Heidemann, and D. Estrin, “Geography-Informed Energy Conservation for Ad Hoc Routing,” Proc. ACM MobiCom, 2001.
[10] Y. Xu et al., “Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks,” technical report, 2003.
[11] T. He, C. Huang, B.M. Blum, J.A. Stankovic, and T.F. Abdelzaher, “Range-Free Localization Schemes in Large Scale Sensor Networks,” Proc. ACM MobiCom, 2003.
[12] R. Subramanian and F. Fekri, “Sleeping Scheduling and Lifetime Maximization in Sensor Networks: Fundamental Limits and Optimal Solutions,” Proc. Fifth Int'l Conf. Information Processing in Sensor Networks (IPSN), 2006.
[13] J. Luo and J.-P. Hubaux, “Joint Mobility and Routing for Lifetime Elongation in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2005.
[14] W. Wang, V. Srinivasan, and K.-C. Chua, “Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks,” Proc. ACM MobiCom, 2005.
[15] T. Feder, P. Hell, S. Klein, and R. Motwani, “Complexity of Graph Partition Problems,” Proc. 31st Ann. ACM Symp. Theory of Computing (STOC), 1999.
[16] Y. Ding, C. Wang, and L. Xiao, “A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks,” Proc. Third Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), 2007.
[17] M.D. Penrose, “On K-Connectivity for a Geometric Random Graph,” Wiley Random Structures and Algorithms, 1999.
[18] A. Sankar and Z. Liu, “Maximum Lifetime Routing in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2004.
[19] J.-H. Chang and L. Tassiulas, “Energy Conserving Routing in Wireless Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2000.
[20] X.-Y. Li, W.-Z. Song, and W. Wang, “A Unified Energy-Efficient Topology for Unicast and Broadcast,” Proc. ACM MobiCom, 2005.
[21] B. Das and V. Bharghavan, “Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets,” Proc. IEEE Int'l Conf. Comm. (ICC), 1997.
[22] S. Guha and S. Khuller, “Approximation Algorithms for Connected Dominating Sets,” Proc. Fourth Ann. European Symposium Algorithms (ESA), 1996.
[23] S. Banerjee and S. Khuller, “A Clustering Scheme for Hierarchical Control in Multi-Hop Wireless Networks,” Proc. IEEE INFOCOM, 2001.
[24] J. Wu, F. Dai, M. Gao, and I. Stojmenovic, “On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in AdHoc Wireless Networks,” J. Comm. Networks, 2002.
[25] B. Deb and B. Nath, “On the Node-Scheduling Approach to Topology Control in Ad Hoc Networks,” Proc. ACM MobiHoc, 2005.
[26] O. Dousse, P. Mannersalo, and P. Thiran, “Latency of Wireless Sensor Networks with Uncoordinated Power Saving Mechanisms,” Proc. ACM MobiHoc, 2004.
[27] B.K.A.G. Gang Lu and N. Sadagopan, “Delay Efficient Sleep Scheduling in Wireless Sensor Networks,” Proc. IEEE INFOCOM, 2005.
[28] R. Friedman and G. Korland, “Timed Grid Routing (TIGR) Bites Off Energy,” Proc. ACM MobiHoc, 2005.
[29] D. Tian and N. Georganas, “A Coverage-Preserving Node Scheduling Scheme for Large Wireless Sensor Networks,” Proc. First ACM Int'l Workshop Wireless Sensor Networks and Applications (WSNA), 2003.
482 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool