z-logo
open-access-imgOpen Access
N-Queens-based Algorithm for Moving Object Detection in Distributed Wireless Sensor Networks
Author(s) -
Biljana L. Stojkoska,
Dančo Davčev,
Vladimir Trajkovik
Publication year - 2008
Publication title -
cit. journal of computing and information technology/journal of computing and information technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.169
H-Index - 27
eISSN - 1846-3908
pISSN - 1330-1136
DOI - 10.2498/cit.1001401
Subject(s) - computer science , bottleneck , wireless sensor network , node (physics) , wireless , energy (signal processing) , constraint (computer aided design) , algorithm , energy consumption , key distribution in wireless sensor networks , object detection , sensor node , real time computing , image processing , wireless network , object (grammar) , image (mathematics) , computer network , artificial intelligence , embedded system , telecommunications , pattern recognition (psychology) , mechanical engineering , ecology , statistics , mathematics , structural engineering , engineering , biology
The main constraint of wireless sensor networks (WSN) in enabling wireless image communication is the high energy requirement, which may exceed even the future capabilities of battery technologies. In this paper we have shown that this bottleneck can be overcome by developing local in-network image processing algorithm that offers optimal energy consumption. Our algorithm is very suitable for intruder detection applications. Each node is responsible for processing the image captured by the video sensor, which consists of NxN blocks. If an intruder is detected in the monitoring region, the node will transmit the image for further processing. Otherwise, the node takes no action. Results provided from our experiments show that our algorithm is better than the traditional moving object detection techniques by a factor of (N/2) in terms of energy savings

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here