Sciweavers

13214 search results - page 317 / 2643
» Pseudorandomness for network algorithms
Sort
View
143
Voted
MOBIHOC
2003
ACM
16 years 6 months ago
Worst-Case optimal and average-case efficient geometric ad-hoc routing
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger
200
Voted
INFOCOM
2007
IEEE
16 years 1 months ago
Network Coding-Based Broadcast in Mobile Ad-hoc Networks
Abstract— Broadcast operation, which disseminates information network-wide, is very important in multi-hop wireless networks. Due to the broadcast nature of wireless media, not a...
Erran L. Li, Ramachandran Ramjee, Milind M. Buddhi...
FODO
1993
Springer
147views Algorithms» more  FODO 1993»
15 years 11 months ago
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
Abstract. DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discove...
Robert Devine
GLOBECOM
2009
IEEE
15 years 10 months ago
A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model
—In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...
Dejun Yang, Xi Fang, Nan Li, Guoliang Xue
IPPS
1993
IEEE
15 years 11 months ago
Mapping Interconnection Networks into VEDIC Networks
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
Vipin Chaudhary, Bikash Sabata, Jake K. Aggarwal