default search action
6. DIAL-M 2002: Atlanta, Georgia, USA
- Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), Atlanta, Georgia, USA, September 28-28, 2002. ACM 2002, ISBN 1-58113-587-4
- Joan Feigenbaum, Scott Shenker:
Distributed algorithmic mechanism design: recent results and future directions. 1-13 - Saurabh Srivastava, R. K. Ghosh:
Cluster based routing using a k-tree core backbone for mobile ad hoc networks. 14-23 - Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger:
Asymptotically optimal geometric mobile ad-hoc routing. 24-33 - Yu Chen, Jennifer L. Welch:
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks. 34-42 - András Faragó:
Scalable analysis and design of ad hoc networks via random graph theory. 43-50 - Hari Balakrishnan:
Energy v. performance in wireless networks. 51 - Hai Huang, Andréa W. Richa, Michael Segal:
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. 52-61 - Xiang-Yang Li, Yu Wang:
Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks. 62-71 - Sandeep K. S. Gupta, Goran Konjevod, Georgios Varsamopoulos:
A theoretical study of optimization techniques used in registration area based location management: models and online algorithms. 72-79
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.