Event-driven sensor deployment using self-organizing maps Online publication date: Sun, 25-May-2008
by Cris Koutsougeras, Yi Liu, Rong Zheng
International Journal of Sensor Networks (IJSNET), Vol. 3, No. 3, 2008
Abstract: Coverage is an important optimization objective in pre and post-deployment stage of a Wireless Sensor Network (WSN). In this paper, we address the issue of placing a finite set of sensors to cover an area of arbitrary geometry. Unlike many existing works concerned with uniform coverage of a target area, we take into account the realistic consideration of the probability density for events to be sensed, termed as event-driven coverage. The objective is to distribute sensors so that the distribution density of the sensors matches that of the probability density of events to be sensed. The expected event distribution is assumed to be stationary and known a priori, directly or indirectly, in the form of sample maps. In this context we explore and evaluate the concept of Self-Organizing Maps (SOMs) and its derivative variants to address the coverage problem. Various forms of SOMs methods as well as the known methods of Virtual Fields are also compared via experimentation.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook