Sciweavers

1016 search results - page 144 / 204
» Optimized algorithms for multi-agent routing
Sort
View
WCNC
2008
IEEE
15 years 4 months ago
Connectivity-Aware Network Maintenance via Relays Deployment
— In this paper, we address the network maintenance problem, in which we aim to maximize the lifetime of a sensor network by adding a set of relays to it. The network lifetime is...
Ahmed S. Ibrahim, Karim G. Seddik, K. J. Ray Liu
BROADNETS
2005
IEEE
15 years 3 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
ICC
2007
IEEE
168views Communications» more  ICC 2007»
15 years 4 months ago
Energy and QoS Aware Packet Forwarding in Wireless Sensor Networks
— We consider energy efficient packet forwarding with quality-of-service (QoS) guarantee for wireless sensor networks (WSNs). In most existing wireless network protocols, route ...
Rong Yu, Yan Zhang, Zhi Sun, Shunliang Mei
GD
2006
Springer
15 years 1 months ago
Improved Circular Layouts
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...
Emden R. Gansner, Yehuda Koren
FOCS
2000
IEEE
15 years 1 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella