| The performance of query control schemes for the zone routing protocol |
| Full text |
Pdf
(768 KB)
|
| Source
|
Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications
archive
Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
table of contents
Seattle, Washington, United States
Pages: 23 - 29
Year of Publication: 1999
ISBN:1-58113-174-7
|
|
Authors
|
|
Zygmunt J. Haas
|
School of Electrical Engineering, Cornell University, Ithaca, NY
|
|
Marc R. Pearlman
|
School of Electrical Engineering, Cornell University, Ithaca, NY
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 10, Citation Count: 3
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Deng, J. and Haas, Z.J., "Dual Busy Tone Multiple'Access (DBTMA): A New Medium Access Control for Packet Radio Networks," IEEE ICUPC'98, Florence, italy, Oct. 5-9, 1998.
|
| |
2
|
Pearlman, M.R. and Haas, Z.J., "Determining the Optimal Configuration of the Zone Routing Protocol," to appear in IEEE JSAC, vol. 17, num. 6, June 1999.
|
| |
3
|
Haas, Z.J. and Pearlman, M.R., "The Zone Routing Protocol (ZRP) for Ad-Hoc Networks," IETF MANET working group, Internet Draft, June 1999.
|
| |
4
|
Jacquet, P., Muhlethaler, P, and Qayyum A., "Optimized Link State Routing Protocol," IETF MANET working group, Internet Draft, Nov. 1998.
|
| |
5
|
Johnson, D.B., and Maltz, D.A., "Dynamic Source Routing in Ad-Hoc Wireless Networking," in Mobile Computing, T. Imielinski and H. Korth, editors, Kluwer Academic Publishing, 1996.
|
| |
6
|
Johnson, D.J., "Approximation Algorithms for Combinatorial Problems," J. of Computer and System Sciences, vol. 9, pp. 256-278.
|
| |
7
|
Malkin, G., "RIP version 2," IETF RFC 2453, Nov. 1998.
|
| |
8
|
Moy, J., "OSPF version 2," IETF RFC 2328, April 1998.
|
| |
9
|
|
| |
10
|
|
 |
11
|
|
| |
12
|
|
|