358 search results - page 36 / 72 » A Computational Study of Routing Algorithms for Realistic Tr... |
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
WOWMOM
2005
ACM
14 years 2 months ago
2005
ACM
— Message ferrying (MF) [2], a viable solution for routing in highly partitioned ad-hoc networks, exploits message ferries to transfer packets between disconnected nodes. This pa...
WONS
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we describe AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the Nature-inspired Ant Colony Optimization framework. The algorithm co...
NETCOOP
2007
Springer
14 years 2 months ago
2007
Springer
Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 8 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...