Sciweavers

425 search results - page 38 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 10 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
AINA
2005
IEEE
14 years 2 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
14 years 2 months ago
Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
Karol Kowalik, Martin Collier
GCC
2005
Springer
14 years 2 months ago
A Routing Protocol Based on Trust for MANETs
Abstract. Ad hoc network is a peer-to-peer grid system. The combination of the Knowledge Grid and ad hoc network could have a great effect on the future interconnection environment...
Cuirong Wang, Xiaozong Yang, Yuan Gao
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 6 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...