Sciweavers

3319 search results - page 505 / 664
» The topology of dark networks
Sort
View
ADHOC
2006
116views more  ADHOC 2006»
15 years 6 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
CCR
2004
168views more  CCR 2004»
15 years 6 months ago
Coping with irregular spatio-temporal sampling in sensor networks
Wireless sensor networks have attracted attention from a diverse set of researchers, due to the unique combination of distributed, resource and data processing constraints. Howeve...
Deepak Ganesan, Sylvia Ratnasamy, Hanbiao Wang, De...
WWW
2003
ACM
16 years 7 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
INFOCOM
2008
IEEE
16 years 28 days ago
Randomized 3D Geographic Routing
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
Roland Flury, Roger Wattenhofer
INFOCOM
2005
IEEE
16 years 3 days ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...