期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于兴趣点分类的无线传感器网络扫描覆盖机制 被引量：4

POI Classfication Based Sweep Coverage Scheme in Wireless Sensor Networks
在线阅读 下载PDF
导出
摘要 针对无线传感器网络中的扫描覆盖问题,建立了同时满足兴趣点覆盖需求和数据投递要求的扫描覆盖数学模型,并通过与组合覆盖中经典的车辆路径问题类比分析,证明了该问题是NP-hard问题.在此基础上,提出了一种基于兴趣点分类的扫描覆盖机制FCSC(FDBSCAN_clustering_based sweep coverage).该机制利用FDBSCAN聚类算法,根据兴趣点位置信息将兴趣点分类,针对每类兴趣点,利用启发式算法生成移动传感器节点对兴趣点的访问路径,完成数据采集.仿真结果表明,在相同的网络场景下,相较于传统的扫描覆盖机制,提出的机制有效地降低了算法复杂度,节约了50%以上的算法运行时间. A sweep coverage model for wireless sensor network which satisfies both POI （point of interest） coverage and data delivery was proposed. The sweep coverage problem was proved to be a NP-hard after translating it to a vehicle routing problem which is a classic combinatorial optimization problem. Based on this model, a novel sweep coverage scheme FCSC （FDBSCAN_clustering_based sweep coverage） was proposed by introducing clustering algorithm to classify POIs in accordance with their locations. FCSC was operated with two steps. In the first step, all the POIs in monitoring area were classified using FDBSCAN algorithm. Then, in the second step, an insertion heuristic algorithm was applied for the POIs in the same cluster to generate the trajectory of mobile sensor nodes. The simulation results show that compared with traditional sweep coverage approaches, FCSC effectively reduces the computational complexity and decreases overall execution time by more than 50% while achieving the similar performance in the same network scenarioes.
作者 舒莉 林锋 刘中豪 游健 周激流
机构地区 四川大学计算机学院
出处 《西南交通大学学报》 EI CSCD 北大核心 2014年第1期165-172,共8页 Journal of Southwest Jiaotong University
基金 教育部博士点基金优先发展领域资助项目(20110181130007) 四川省科技支撑项目(2011RZ0004 2010GZ0169)
关键词 无线传感器网络 覆盖机制 扫描覆盖 聚类分析 启发式算法 wireless sensor networks coverage approach sweep coverage cluster analysis heuristicalgorithm
分类号 TN92 [电子电信—通信与信息系统]
  • 相关文献

参考文献16

  • 1周小佳,吴侠,闫斌.基于移动基站的动态无线传感器网络[J].西南交通大学学报,2011,46(5):793-796. 被引量：5
  • 2CARDEI M, WU Jie. Handbook of sensor networks [ M ]. Boca Raton : CRC Press, 2005 : 361-372.
  • 3AMMARI H M, DAS S K. Centralized and clustered k- coverage protocols for wireless sensor networks[ J]. IEEE Transactions on Computers, 2012, 61(1 ) : 118-133.
  • 4BAI Xiaole, YUN Ziqiu, XUAN Dong, et al. Deploying four-connectivity and full-coverage wireless sensor networks[ C]//Proceedings of IEEE INFOCOM 2008. Phoenix : IEEE Press, 2008 : 296-300.
  • 5WANG Xiaolong, NI Wenjing, FANG Qiansheng, et al. Study on worst case coverage of mobile sensors in hybrid wireless sensor networks[J]. Applied Mechanics and Materials, 2012, 157(5) : 1004-1007.
  • 6TAO Dan, TANG Shaojie, ZHANG Haitao, et al. Strong barrier coverage in directional sensor networks [J]. Computer Communications, 2012, 35 (8) : 895-905.
  • 7CHENG Weifang, LI Mo, LIU Kebin, et al. Sweep coverage with mobile sensors [ C ] // Proceedings of 22nd 1EEE International Parallel and Distributed Processing Symposium. Miami: IEEE Press, 2008 : 1-9.
  • 8LI Mo, CHENG Weifang, LIU Kebin, et al. Sweep coverage with mobile sensors[ J]. IEEE Transactions on Mobile Computing, 2011, 10(11) : 1534-1545.
  • 9ZHANG Zhenya, CHEN Yan, CHENG Hongmei, et al. MTSP based solution for minimum mobile node number problem in sweep converge of wireless sensor network[ C]//Proceedings of IEEE ICCSNT. Hangzhou: IEEE Press, 2011 : 1827-1830.
  • 10XI Min, WU Kui, QI Yong, et al. Run to potential: sweep coverage in wireless sensor networks[C] // Proceedings of IEEE ICPP. Vienna: IEEE Press,2009 : 50-57.

二级参考文献36

  • 1CHIASSERINI C F, CHLAMTAC I, MONTI P, et al. An energy-efficient method tbr nodes assignment it cluster-based Ad hoc networks[J]. Wireless Networks 2004, 10(3) : 223-231.
  • 2HUBAUX J P, JUN Luo. Joint mobility and routing for lifetime elongation in wireless sensor networks[ C]// Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Piscataway : IEEE Press, 2005 : 1735-1746.
  • 3HEINZELMAN W R, CHANDRAKASAN A, BALAKRISHNAN H. Energy efficient communication protocol for wireless micro sensor networks[ C ]//Proc. of the 33rd Hawaii International Conference on System Sciences. Piscataway: IEEE Press, 2000: 3005-3014.
  • 4HAAS Z J, HALPER N J Y, LI Li. Gossip-based Ad Hoc routing[C]// Proc. of IEEE INFOCOM. New York: IEEE Communications Society, 2002: 1707- 1716.
  • 5YOUNIS O, FAHMY S. An experimental studt of routing and data aggregation in sensor networks [ C ]// Proc. of the 2nd IEEE International Conference on Mobile Ad Hoc and Sensor Systems. Piscataway: IEEE Press, 2005 : 115-126.
  • 6KUL I K J, HEINZELMAN W R, BALAKRISHNAN H. Negotiation-based protocols for disseminating information in wireless sensor networks[J]. Wireless Networks, 2002, 8(2/3) : 169-185.
  • 7HEINZELMAN W B, CHANDRAKASAN A P, BALAKRISHNAN H. An application-specific protocol architecture for wireless microsensor networks [ J ]. IEEE Transactions on Wireless Communications, 2002, 1(4) : 660-670.
  • 8MANJESHWAR A, AGRAWAI D P. TEEN:a protocol for enhanced efficiency in wireless sensor networks [ C] //Proceedings of the 1st International Workshop on Parallel and Distributed Computing Issues in Wireless Network sand Mobile Computing. SanFrancisco : [s. n. ], 2001: 212-219.
  • 9SOMASUNDARA A, KANSAL A, JEA D, et at. Controllably mobile infrastructure for low energy embedded networks[ J]. IEEE Transactions on Mobile Computing, 2006, 8(5): 958-973.
  • 10TORSHA B, DHARMA P. Agrawal, increasing lifetime of wireless sensor networks using controllable mobile cluster heads [ C ]// IEEE Performance Computing and Communication Conference. Austin: IEEE Texas, 2008: 77-84.

共引文献49

同被引文献25

  • 1Cardei M, Wu J. Handbook of sensor networks[M]. Boca Raton: CRC Press, 2005.
  • 2Mulligan R, Ammari H M. Coverage in wireless sensor networks: a survey [J]. NPA, 2010, 2 (2) : 1943.
  • 3Bai X, Kumar S, Xuan D, et al. Deploying wire- less sensors to achieve both coverage and connec- tivity [C] //Proceeding of the 7th ACM interna- tional symposium on Mobile ad hoc networking and computing, Florence, 2006.New York: Associa- tion for Computing Machinery, 2006.
  • 4Bai X L, Xuan D, Yun Z Q, et al. Complete op- timal deployment patterns for full-coverage and k - connectivity (k < 6) wireless sensor networks [C] //Proceedings of the 9th ACM International Symposium on Mobile Ad hoc Networking and Computing. New York: ACM Press, 2008.
  • 5Kumar S, Lai T H, Arora A. Barrier coverage with wireless sensors [C] //Proceedings of the llth annual international conference on Mobile computing and networking, Cologne, 2005. New York: ACM Press, 2005.
  • 6Cheng W F, Li M, Liu K, et al. Sweep cover- age with mobile sensors [C] //Proceedings of IEEE International Symposium on Parallel and Dis- tributed Processing. Miami, Washington DC: IEEE Computer Society, 2008.
  • 7GuY Y, Bozdag D, Brewer R W, et al. Data har- vesting with mobile elements in wireless sensor networks [ J ] Comput Networks, 2006, 50 (17) : 3449.
  • 8Snydera L V, Daskin M S. A random-key genetic algorithm for the generalized traveling salesman problem [J]. EJOR, 2006, 174 (1): 38.
  • 9吴志远,邵惠鹤,吴新余.遗传退火进化算法[J].上海交通大学学报,1997,31(12):69-71. 被引量：46
  • 10王伟,林锋,周激流.Sweep Coverage中的节点移动控制[J].四川大学学报（自然科学版）,2010,47(5):1015-1019. 被引量：5

引证文献4

二级引证文献9

西南交通大学学报
2014年 第1期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部