Brief announcement: An efficient communication strategy for Ad-hoc mobile networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 320-322

  Chatzigiannakis, I ^a   Nikoletseas, S ^a   Spirakis, P ^a  

^a University of Patras and Computer Technology Institute   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MARKOV PROCESSES; NETWORK PROTOCOLS; THEOREM PROVING; WIDE AREA NETWORKS;

AD-HOC MOBILE NETWORKS; REGULAR SPANNING GRAPH; RELATIVE MOTION SPACE SIZE;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 0034772469     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Efficient communication strategies for Ad-Hoc wireless networks
2. Reversible Markov chains and random walks on graphs
3. Analysis and experimental evaluation of an innovative and efficient routing approach for Ad-hoc mobile networks
4. An efficient routing protocol for hierarchical Ad-Hoc mobile networks
5. An efficient communication strategy for Ad-hoc mobile networks
6. Fundamental control algorithms in mobile networks
7. Location-aided routing (LAR) in mobile Ad-hoc networks
8. Sending messages to mobile users in disconnected Ad-hoc wireless networks
9. Temporally-ordered routing algorithms (TORA) version 1 functional specifićation
10. Distributed reconfiguration of metamorphic robot chains