Sciweavers

854 search results - page 139 / 171
» A General Vehicle Routing Problem
Sort
View
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
INFOCOM
2007
IEEE
14 years 1 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...
ICALP
2009
Springer
14 years 8 months ago
Improved Algorithms for Latency Minimization in Wireless Networks
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Alexander Fanghänel, Berthold Vöcking, T...
EDBT
2008
ACM
106views Database» more  EDBT 2008»
14 years 7 months ago
Highly scalable trip grouping for large-scale collective transportation systems
Transportation?related problems, like road congestion, parking, and pollution, are increasing in most cities. In order to reduce traffic, recent work has proposed methods for vehi...
Gyözö Gidófalvi, Torben Bach Pede...
INFOCOM
2009
IEEE
14 years 2 months ago
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype sys...
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun...