ASSURING K-COVERAGE IN VISUAL SENSOR NETWORKS IN THE PRESENCE OF ENERGY CONSTRAINTS

摘要：

Visual Sensor Networks (VSNs) are special kind of Wireless Sensor Networks (WSNs) that monitors an environment by camera devices.WSNs are constrained by limited energy.On the other hand, unlike most sensors, cameras are directional in their field of view (FOV).If a target is out of the FOV of a camera, it needs to spend some energy and turn to the target to cover it.The problem of covering known location targets in an area with at least k sensors in the networks while keeping energy consumption minimum, is an NP-hard problem.In this paper we applied the Harmony Search (HS) to overcome the problem.The proposed algorithm fulfills the two objectives.The first objective is the k-coverage satisfaction, and the second one is to minimize the sum of rotations of all sensors.

关键词： Visual sensor networks k-coverage Harmony search

作者: MOHAMMAD AMIN ZARE SOLTANI ABOLFAZL TOROGHI HAGHIGHAT HASSAN RASHIDI TAHERE GODARZVAND CHEGINI

作者单位: Department of Computer,Qazvin Branch,Islamic Azad University,Qazvin,Iran Department of Computer,Allameh Tabatabai University,Tehran,Iran Department of Computer,Amir Kabir University of Technology,Tehran,Iran

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer Technology and Development(2011第三届计算机技术与发展国际会议 ICCTD2011)

会议地点: 成都

会议语种:英文

页码: 1675-1680

在线出版日期: 2011-11-25（万方平台首次上网日期，不代表论文的发表时间）