Sciweavers

2498 search results - page 176 / 500
» Algorithms for the Topological Watershed
Sort
View
INFOCOM
2008
IEEE
16 years 29 days ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
INFOCOM
2008
IEEE
16 years 29 days ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
AINA
2007
IEEE
16 years 27 days ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
WONS
2005
IEEE
16 years 3 days ago
A Partition Prediction Algorithm for Service Replication in Mobile Ad Hoc Networks
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
Abdelouahid Derhab, Nadjib Badache, Abdelmadjid Bo...
PPSN
2004
Springer
15 years 12 months ago
AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...