[1]LIANG Junbin,LIU Ming.Lifetime maximization for delay constraint connected target coverage[J].CAAI Transactions on Intelligent Systems,2013,8(4):319-326.[doi:10.3969/j.issn.1673-4785.201304030]
Copy

Lifetime maximization for delay constraint connected target coverage

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 8 Number of periods: 2013 4 Page number: 319-326 Column: 学术论文—人工智能基础 Public date: 2013-08-25
Title:
Lifetime maximization for delay constraint connected target coverage
Author(s):
LIANG Junbin1; 2;  LIU Ming2
1.School of Computer and Electronic Information, Guangxi University, Nanning 530004, China; 2. School of Information Science and Engineering, Central South University, Changsha 410083, China
Keywords:
wireless sensor networks;  connected target coverage;  lifetime maximization;  delay constraint;  energy efficiency
CLC:
TP393
DOI:
10.3969/j.issn.1673-4785.201304030
Abstract:
The issue of guarantying the QoS (target coverage, network connectivity, etc.), and simultaneously maximizing the lifetime in wireless sensor network is a hot topic, yet difficult subject of study. In some delay-sensitive sensor networks, sensors must transmit data to sink-node within a limited time in order to monitor the critical physical environment (fires, explosions, etc.). To study connected target coverage in such delay-sensitive sensor networks, we propose to examine the delay-constraint connected target coverage (DCCTC) problem. The study, specifically, includes of: 1) modelling DCCTC problem as a Height Limited Maximum Cover Tree (HLMCT) problem and proving it is NP-complete 2) developping a fast heuristic algorithm, named HLCWGC(height-limited communication weighted greedy cover) to solve the HLMCT problem. Simulation results and theoretical researches show that HLCWGC algorithm is better than the existing algorithms in the delay-constraint sensor networks.
References:
［1］任丰原，黄海宁，林闯. 无线传感器网络［J］. 软件学报，2003，14(7): 1282-1291.
????????? REN Fengyuan, HUANG Haining, LIN Chuang. Wireless sensor networks［J］. Journal of Software, 2003，14(7): 1282-1291.
［2］崔莉，鞠海玲，苗勇，等. 无线传感器网络研究进展［J］. 计算机研究与发展， 2005, 42 (1): 163-174.
????????? CUI Li, JU Hailing, MIAO Yong, et al. Overview of wireless sensor networks［J］. Journal of Computer Research and Development, 2005, 42 (1): 163-174.
［3］SLIJEPCEVIC S, POTKONJAK M. Power efficient organization of wireless sensor networks［C］//IEEE International Conference of Communications(ICC). Beijing， China, 2001: 472-476.
［4］CARDEI M, DU Dingzhu. Improving wireless sensor network lifetime through power aware organization［J］. Wireless Networks, 2005, 11(3): 333-340.
［5］CARDEI M, THAI M T, LI Yingshu, et al. Energy-efficient target coverage in wireless sensor networks［C］//24th IEEE International Conference on Computer Communications(INFOCOM). Miami, USA, 2005: 1976-1984.
［6］CARDEI M, WU Jie, LU Mingming, et al. Maximum network lifetime in wireless sensor networks with adjustable sensing ranges［C］//IEEE International Conference of Wireless and Mobile Computing, Networking and Communications (WiMob). Montreal, Canada, 2005: 1-5.
［7］LU Mingming, WU Jie, CARDEI M, et al. Energy-efficient connected coverage of discrete targets in wireless sensor netorks［C］//International Conference of Computer Networks and Mobile Computing (ICCNMC). Zhangjiajie, China, 2005: 137-147.
［8］ZHAO Qun, GURUSAMY M. Lifetime maximization using observation time scheduling in multi-hop sensor networks［C］//IEEE/CreateNet International Workshop on Broadband Advanced Sensor Networks(BroadNets). Boston, USA, 2005: 1-5.
［9］ZHAO Qun, GURUSAMY M. Lifetime maximization for connected target coverage in wireless sensor networks［J］. IEEE/ACM Transactions on Networking, 2008, 16(6): 1378-1391.
［10］LI Deying, CAO Jiannong, LIU Ming, et al. K-connected target coverage problem in wireless sensor networks［J］. Lecture Notes in Computer Science, 2007, 46(1): 20-31.
［11］WU Lidong, DU Hongwei, WU Weili, et al. Approximations for minimum connected sensor cover［C］//32nd IEEE International Conference on Computer Communications(INFOCOM). Turin, Italy, 2013: 1424-1432.
［12］GU Yu, LIU Hengchang, ZHAO Baohua. Target coverage with QoS requirements in wireless sensor networks［C］//IEEE International Conference on Intelligent Pervasive Computing(IPC). Jeju Island, Korea, 2007: 35-38.
［13］BOUKERCHE A, PAZZI R, ARAUJO R. A fast and reliable protocol for wireless sensor networks in critical conditions monitoring applications［C］//7th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM). Venice, Italy, 2004: 157-164.
［14］YU Zuoming, TENG Jin, LI Xinfeng. On wireless network coverage in bounded areas［C］//32nd IEEE International Conference on Computer Communications(INFOCOM). Turin, Italy, 2013: 1752-1760.
［15］AREY M R, JOHNSON D S. Computers and intractability: a guide to the theory of NP-Completeness［M］. New York: W.H.Freeman, 1979: 210-216.
［16］CHANG J H, TASSIULAS L. Maximum lifetime routing in wireless sensor networks［J］. IEEE/ACM Transactions on Networking, 2004, 12(4): 609-619.
Similar References:

Memo

-

Last Update: 2013-09-25

Copyright © CAAI Transactions on Intelligent Systems