570 search results - page 42 / 114 » Approximating Some Network Design Problems with Node Costs |
MSN
2005
Springer
14 years 2 months ago
2005
Springer
The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of...
WDAG
2009
Springer
14 years 3 months ago
2009
Springer
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
INTERSENSE
2006
ACM
14 years 2 months ago
2006
ACM
— There is growing interest in the networked sensing community in the technique of macroprogramming, where the end-user can design a system using a high level description without...
ICCCN
2008
IEEE
14 years 3 months ago
2008
IEEE
—Broadcast presents a special challenge for Wireless Sensor Networks (WSNs). In some situation such as time synchronization or building routing path, broadcasting messages must b...