Sciweavers

370 search results - page 14 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Distributed Navigation Algorithms for Sensor Networks
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
ESA
2007
Springer
140views Algorithms» more  ESA 2007»
14 years 1 months ago
On Minimum Power Connectivity Problems
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
Yuval Lando, Zeev Nutov
SASN
2005
ACM
14 years 29 days ago
Coordinated sensor deployment for improving secure communications and sensing coverage
Sensor network has a great potential in applications such as habitat monitoring, wildlife tracking, building surveillance, and military combat. The design of a sensor network syst...
Yinian Mao, Min Wu
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
ADHOCNOW
2008
Springer
14 years 1 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov