Sciweavers

1395 search results - page 172 / 279
» Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Netw...
Sort
View
CCCG
2008
13 years 10 months ago
Memory Requirements for Local Geometric Routing and Traversal in Digraphs
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
Maia Fraser, Evangelos Kranakis, Jorge Urrutia
ISPAN
2002
IEEE
14 years 2 months ago
A Self-Routing Topology for Bluetooth Scatternets
—The emerging Bluetooth standard is considered to be the most promising technology to construct ad-hoc networks. It contains specifications on how to build a piconet but left ou...
Min-Te Sun, Chung-Kuo Chang, Ten-Hwang Lai
SOCIALCOM
2010
13 years 7 months ago
GDC: Group Discovery Using Co-location Traces
Smart phones can collect and share Bluetooth co-location traces to identify ad hoc or semi-permanent social groups. This information, known to group members but otherwise unavailab...
Steve Mardenfeld, Daniel Boston, Susan Juan Pan, Q...
CONEXT
2005
ACM
13 years 11 months ago
The stability of paths in a dynamic network
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...
Fernando A. Kuipers, Huijuan Wang, Piet Van Mieghe...
SAC
2009
ACM
14 years 1 months ago
Autonomous networked robots for the establishment of wireless communication in uncertain emergency response scenarios
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...
Stelios Timotheou, Georgios Loukas