Sciweavers

298 search results - page 42 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
PODC
2003
ACM
15 years 2 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
74
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
Minimum-Energy Broadcast Using Practical Directional Antennas in All-Wireless Networks
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
Sabyasachi Roy, Y. Charlie Hu, Dimitrios Peroulis,...
WAOA
2005
Springer
142views Algorithms» more  WAOA 2005»
15 years 3 months ago
On the Minimum Load Coloring Problem
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Ales P...
INFOCOM
2002
IEEE
15 years 2 months ago
A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast
—Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. ...
Ariel Orda, Alexander Sprintson
BROADNETS
2004
IEEE
15 years 1 months ago
Structures for In-Network Moving Object Tracking in Wireless Sensor Networks
One important application of wireless sensor networks is tracking moving objects. The recent progress has made it possible for tiny sensors to have more computing power and storag...
Chih-Yu Lin, Yu-Chee Tseng