Sciweavers

173 search results - page 30 / 35
» A Geometric Routing Protocol in Disruption Tolerant Network
Sort
View
ICDCS
2007
IEEE
15 years 3 months ago
Protocol Design for Dynamic Delaunay Triangulation
Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to const...
Dong-Young Lee, Simon S. Lam
93
Voted
CCCG
2010
14 years 11 months ago
3d local algorithm for dominating sets of unit disk graphs
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
SIGCOMM
2010
ACM
14 years 9 months ago
Greening backbone networks: reducing energy consumption by shutting off cables in bundled links
In backbone networks, the line cards that drive the links between neighboring routers consume a large amount of energy. Since these networks are typically overprovisioned, selecti...
Will Fisher, Martin Suchara, Jennifer Rexford
WOWMOM
2006
ACM
137views Multimedia» more  WOWMOM 2006»
15 years 3 months ago
Evaluating Context Information Predictability for Autonomic Communication
Delay tolerant and mobile ad hoc networks, present considerable challenges to the development of protocols and systems. In particular, the challenge of being able to cope with the...
Mirco Musolesi, Cecilia Mascolo
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
14 years 11 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...