Sciweavers

425 search results - page 68 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
SIAMSC
2010
132views more  SIAMSC 2010»
13 years 2 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi
IWCMC
2006
ACM
14 years 1 months ago
TARP: trust-aware routing protocol
Security is a critical issue in a mobile ad hoc network (MANET). In most of the previous protocols security is an added layer above the routing protocol. We propose a TrustAware R...
Loay Abusalah, Ashfaq A. Khokhar, G. BenBrahim, W....
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 24 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
INFOCOM
2005
IEEE
14 years 1 months ago
Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network
— Even though multiple non-overlapped channels exist in the 2.4GHz and 5GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a resul...
Ashish Raniwala, Tzi-cker Chiueh