메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 1507-1513

Efficient and secure indirect-address service discovery in manet

Author keywords

[No Author keywords available]

Indexed keywords

MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; SERVERS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SERVICES;

EID: 33847355556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2005.1605891     Document Type: Conference Paper
Times cited : (4)

References (14)
  • 1
    • 7744235765 scopus 로고    scopus 로고
    • Service discovery in mobile ad hoc networks: An overall perspective on architectural choices and network layer support issues
    • Jan
    • U. C. Kozat and L. Tassiulas, "Service discovery in mobile ad hoc networks: An overall perspective on architectural choices and network layer support issues," Ad Hoc Networks, vol. 2, pp. 23-44, Jan. 2004.
    • (2004) Ad Hoc Networks , vol.2 , pp. 23-44
    • Kozat, U.C.1    Tassiulas, L.2
  • 4
    • 0742321631 scopus 로고    scopus 로고
    • Evaluation of architectures for reliable server pooling in wired and wireless enviroments
    • Jan
    • M. Uyar, J. Zheng, M. A. Fecko, S. Samtani, and P. T. Conrad, "Evaluation of architectures for reliable server pooling in wired and wireless enviroments," IEEE J. Selected Areas in Comm., vol. 22, pp. 164-175, Jan. 2004.
    • (2004) IEEE J. Selected Areas in Comm , vol.22 , pp. 164-175
    • Uyar, M.1    Zheng, J.2    Fecko, M.A.3    Samtani, S.4    Conrad, P.T.5
  • 5
    • 8844284466 scopus 로고    scopus 로고
    • Architecture and applications of dynamic survivable resource pooling in battlefield networks
    • SPIE, Bellingham, WA, pp
    • M. Fecko, U. Kozat, S. Samtani, M. Uyar, and I. Hökelek, "Architecture and applications of dynamic survivable resource pooling in battlefield networks," in Proc. of SPlE, vol. 5441, (SPIE, Bellingham, WA), pp. 204-214, 2004.
    • (2004) Proc. of SPlE , vol.5441 , pp. 204-214
    • Fecko, M.1    Kozat, U.2    Samtani, S.3    Uyar, M.4    Hökelek, I.5
  • 6
    • 1542269184 scopus 로고    scopus 로고
    • Minimum energy disjoint path routing in wireless ad-hoc networks
    • Sep
    • A. Srinivas and E. Modiano, "Minimum energy disjoint path routing in wireless ad-hoc networks," in Proc. of MobiCom03, Sep. 2003.
    • (2003) Proc. of MobiCom03
    • Srinivas, A.1    Modiano, E.2
  • 7
    • 85007005615 scopus 로고    scopus 로고
    • A new approach to on-demand loop-free multipath routing
    • Boston, Massachusetts, Oct
    • J. Raju and J. Garcia-Luna-Aceves, "A new approach to on-demand loop-free multipath routing," in Proc. of IEEE IC3N'99, (Boston, Massachusetts), Oct. 1999.
    • (1999) Proc. of IEEE IC3N'99
    • Raju, J.1    Garcia-Luna-Aceves, J.2
  • 8
    • 0034844688 scopus 로고    scopus 로고
    • Split multipath routing with maximally disjoint paths in ad hoc networks
    • Jun
    • S.-J. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad hoc networks," in Proc. of IEEE Intl' Conf. Comm. (ICC) 2001, vol. 10, pp. 3201-3205, Jun. 2001.
    • (2001) Proc. of IEEE Intl' Conf. Comm. (ICC) 2001 , vol.10 , pp. 3201-3205
    • Lee, S.-J.1    Gerla, M.2
  • 9
    • 0027559367 scopus 로고
    • Distributed algorithms for computing shortest pairs of disjoint paths
    • R. G. Ogier, V. Rutenburg, and N. Shacham, "Distributed algorithms for computing shortest pairs of disjoint paths," IEEE Trans. on Inform. Theory, vol. 39, no. 2, pp. 443-455, 1993.
    • (1993) IEEE Trans. on Inform. Theory , vol.39 , Issue.2 , pp. 443-455
    • Ogier, R.G.1    Rutenburg, V.2    Shacham, N.3
  • 10
    • 0003780715 scopus 로고
    • ADDISON-WESLEY PUBLISHING
    • F. Harary, Graph Theory. ADDISON-WESLEY PUBLISHING, 1969.
    • (1969) Graph Theory
    • Harary, F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.