Achieving Asymmetric Sensing Coverage for Duty Cycled Wireless Sensor Networks

作     者：Gu, Yu Cheng, Long Niu, Jianwei He, Tian Du, David Hung-Chang 

作者机构：Singapore Univ Technol & Design Singapore Singapore Beihang Univ State Key Lab Virtual Real Technol & Syst Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn State Key Lab Virtual Real Technol & Syst Beijing 100191 Peoples R China Univ Minnesota Dept Comp Sci & Engn Minneapolis MN USA 

出 版 物：《IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS》 (IEEE Trans Parallel Distrib Syst)

年 卷 期：2014年第25卷第12期

页      面：3076-3087页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：973 Program [2013CB035503] National Natural Science Foundation of China [61170296, 61190125, 61300174] RD Program [2013BAH35F01] CPSF [2013M530511] Open Foundation of State key Lab of Networking and Switching Technology at BUPT [SKLNST-2013-1-02] iTrust [IGDSi1301013] SUTD-MIT International Design Center [IDD61000102A, NRF2012EWTEIRP002-04] 

主　　题：Architecture sensing coverage two-level scheduling sensor networks uSense uScan 

摘      要：As a key approach to achieve energy efficiency in sensor networks, sensing coverage has been studied extensively in the literature. Researchers have designed many coverage protocols to provide various kinds of service guarantees on the network lifetime, coverage ratio and detection delay. While these protocols are effective, they are not flexible enough to meet multiple design goals simultaneously. In this paper, we propose a unified sensing coverage architecture for duty cycled wireless sensor networks, called uSense, which features three novel ideas: Asymmetric Architecture, Generic Switching and Global Scheduling. We propose asymmetric architecture based on the conceptual separation of switching from scheduling. Switching is efficiently supported in sensor nodes, while scheduling is done in a separated computational entity, where multiple scheduling algorithms are supported. As an instance, we propose a two-level global coverage algorithm, called uScan. At the first level, coverage is scheduled to activate different portions of an area. We propose an optimal scheduling algorithm to minimize area breach. At the second level, sets of nodes are selected to cover active portions. Importantly, we show the feasibility to obtain optimal set-cover results in linear time if the layout of areas satisfies certain conditions. Through extensive testbed and simulation evaluations, we demonstrate that uSense is a promising architecture to support flexible and efficient coverage in sensor networks.