5079 search results - page 255 / 1016 » Hidden-Action in Network Routing |
206
click to vote
IWDC
2005
Springer
16 years 23 days ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
242
click to vote
EUC
2006
Springer
15 years 11 months ago
2006
Springer
In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing...
183
click to vote
COMCOM
2004
15 years 7 months ago
2004
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
218
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—The routing problem in Wireless Mesh Networks is concerned with finding “good” source-destination paths. It generally faces multiple objectives to be optimized, such as i) ...
177
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...