Sciweavers

229 search results - page 5 / 46
» A Distributed Greedy Algorithm for Connected Sensor Cover in...
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 29 days ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
ICUMT
2009
13 years 5 months ago
Coverage and adaptive scheduling algorithms for criticality management on video wireless sensor networks
In WSN-based surveillance systems power conservation is an important issue but one must also ensure that the application's objectives are met. In this paper, we jointly addres...
Abdallah Makhoul, Rachid Saadi, CongDuc Pham
ICC
2008
IEEE
14 years 1 months ago
Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks
— We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowi...
Ji Li, Chuan Heng Foh, Lachlan L. H. Andrew, Moshe...
MOBICOM
2009
ACM
14 years 2 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar
ADHOC
2007
108views more  ADHOC 2007»
13 years 7 months ago
Hop-distance based addressing and routing for dense sensor networks without location information
One of the most challenging problems in wireless sensor networks is the design of scalable and efficient routing algorithms without location information. The use of specialized ha...
Serdar Vural, Eylem Ekici