137 search results - page 20 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
ANSS
2006
IEEE
14 years 1 months ago
2006
IEEE
There has been a lot research effort on developing reactive routing algorithms for mobile ad hoc networks (MANETs) over the past few years. Most of these algorithms consider findi...
ADHOC
2004
13 years 7 months ago
2004
In this paper, we study a new multicast paradigm for large scale mobile ad hoc networks, namely team multicast. In team multicast the multicast group does not consist of individua...
JNW
2008
13 years 7 months ago
2008
Multi-path routing allows building and use of multiple paths for routing between a source-destination pair. This paper investigates the problem of selecting multiple routing paths ...
INFORMATICALT
2006
13 years 7 months ago
2006
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...