Sciweavers

225 search results - page 35 / 45
» Privacy-enhanced social network routing in opportunistic net...
Sort
View
MP
2010
119views more  MP 2010»
14 years 8 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
MOBICOM
2006
ACM
15 years 3 months ago
OURS: optimal unicast routing systems in non-cooperative wireless networks
We propose novel solutions for unicast routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic i...
Weizhao Wang, Xiang-Yang Li, Stephan Eidenbenz, Yu...
97
Voted
CIKM
2009
Springer
15 years 4 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...
60
Voted
ATAL
2007
Springer
15 years 3 months ago
Information searching and sharing in large-scale dynamic networks
Finding the right agents in a large and dynamic network to provide the needed resources in a timely fashion, is a long standing problem. This paper presents a method for informati...
George A. Vouros
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 3 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud