Sciweavers

376 search results - page 31 / 76
» Self-Stabilizing Graph Protocols
Sort
View
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 3 months ago
Exploring the Local Connectivity Preference in Internet AS Level Topology
—The Internet AS level topology, upon which BGP4 runs, plays a vital role in the analysis and study of the global routing behavior. However, the study of the topology itself is n...
Guoqiang Zhang, Guoqing Zhang
SEMWEB
2007
Springer
14 years 3 months ago
RDFSync: Efficient Remote Synchronization of RDF Models
In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs...
Giovanni Tummarello, Christian Morbidoni, Reto Bac...
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
14 years 1 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
13 years 10 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...
TSP
2008
100views more  TSP 2008»
13 years 8 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....