Sciweavers

528 search results - page 29 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
JCO
2010
182views more  JCO 2010»
13 years 6 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu
BIOWIRE
2007
Springer
14 years 1 months ago
A Circulatory System Approach for Wireless Sensor Networks
Abstract—One of the challenges in a military wireless sensor network is the determination of an information collection infrastructure which minimizes battery power consumption. T...
Vasileios Pappas, Dinesh Verma, Ananthram Swami
WIOPT
2006
IEEE
14 years 1 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
MOBIHOC
2008
ACM
14 years 7 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha...
GLOBECOM
2009
IEEE
13 years 11 months ago
Joint Base Station Placement and Fault-Tolerant Routing in Wireless Sensor Networks
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
Dejun Yang, Satyajayant Misra, Guoliang Xue