Zagazig University Digital Repository
Home
Thesis & Publications
All Contents
Publications
Thesis
Graduation Projects
Research Area
Research Area Reports
Search by Research Area
Universities Thesis
ACADEMIC Links
ACADEMIC RESEARCH
Zagazig University Authors
Africa Research Statistics
Google Scholar
Research Gate
Researcher ID
CrossRef
Minimum connected cover of a query region in heterogeneous wireless sensor networks
Faculty
Science
Year:
2013
Type of Publication:
Article
Pages:
153-163
Authors:
Khedr, Ahmed M, Osamy, Walid
DOI:
10.1016/j.ins.2012.09.046
Journal:
INFORMATION SCIENCES ELSEVIER SCIENCE INC
Volume:
223
Research Area:
Computer Science
ISSN
ISI:000312915400009
Keywords :
Arbitrary sensing and communication radii, Distributed algorithm, Minimum connected cover, Query region, Wireless sensor network
Abstract:
Wireless sensor networks are composed of a large number of tiny sensors that have limited resources and yet must form a connected network. The main challenge in the design of sensor networks is the limited battery power of the sensors and the difficulty of replacing and/or recharging these batteries due to the nature of the monitored field. Thus, it is necessary that the sensors be densely deployed and energy-efficient protocols be designed to maximize the network lifetime while meeting the specific application requirements in terms of coverage and connectivity. Given a query over a sensor network the minimum connected sensor cover problem is to select a minimum, or nearly minimum, set of sensors such that the selected sensors cover the query region and form a connected network. In this paper, we propose a new distributed algorithm to find the minimum connected cover of the queried region for heterogeneous sensors, each with arbitrary sensing and transmission radii and different energy levels. Each sensor node in the network determines whether to sense the queried region according to its minimum-weight coverage cost. We provide performance metrics to analyze the performance of our approach and the simulation results show that our approach clearly improves the network lifetime over existing algorithms. (C) 2012 Elsevier Inc. All rights reserved.
Online
PDF
جامعة المنصورة
جامعة الاسكندرية
جامعة القاهرة
جامعة سوهاج
جامعة الفيوم
جامعة بنها
جامعة دمياط
جامعة بورسعيد
جامعة حلوان
جامعة السويس
شراقوة
جامعة المنيا
جامعة دمنهور
جامعة المنوفية
جامعة أسوان
جامعة جنوب الوادى
جامعة قناة السويس
جامعة عين شمس
جامعة أسيوط
جامعة كفر الشيخ
جامعة السادات
جامعة طنطا
جامعة بنى سويف