無線視覺感測網路(Wireless Visual Sensor Networks，WVSNs)主要由視覺感測節點(Camera Node)所構成，如何以最少的視覺感測節點來共同分擔視覺感測的工作，在近年來已漸漸被研究學者所討論，其共同的目標均在於選擇較少的Camera Node達到目標監控的目的。然而，由於大部份的研究均將研究重心放在Node的選擇，並無考慮鏡頭轉動，這使得選出的Camera Node可能數量過多。本論文針對無線視覺感測網路，將鏡頭轉動納入考量，在給定的轉動延遲時限內，衡量鏡頭轉動對覆蓋所產生的效益，並在轉動效益最大的考量下，嘗試以分散式的方法找出較少的Camera Node來擔負監控工作，並可完整地監控目標區域。實驗結果顯示，本論文所提出之演算法能夠開發鏡頭轉動的效益，減少參與工作的視覺感測節點數量，並有效地監控目標區域。 A Wireless Visual Sensor Networks (WVSNs) is consists of wireless visual sensor nodes called Camera Nodes. In WVSNs, all Camera Nodes are equipped with cameras and responsible for capturing the images of the target. Therefore, coverage problem is one of the most critical issues in WVSNs and has drawn much attention in recent years. The main purpose of coverage issue is to select minimal number of Camera Nodes for full cover the target. The key difference between the WVSNs and traditional WSN is that each Camera Node can rotate its camera and adjust its focus to change the monitoring area. However, most of the previous research doesn’t consider the camera rotation, and thus, always selects too much Camera Node for full cover the object. In this paper, we take the effect of camera rotation and rotation time into consideration. In addition, aims to develop a distributed camera rotation and Camera Nodes selecting mechanism called Decentralized Visual Coverage Algorithm (DVCA) to pick smaller number of Camera Nodes for monitoring the target cooperatively by appropriate camera rotation. The experimental simulation results show that our proposed algorithm can effectively reduce competition and packet collisions, and decrease the packet delay time from camera nodes to sink node.