메뉴 건너뛰기




Volumn 4, Issue 4, 2008, Pages 267-278

Improving security and performance of an Ad Hoc network through a multipath routing strategy

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; QUALITY OF SERVICE; SENSOR NETWORKS; SOLUTIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 54849405011     PISSN: 17729890     EISSN: 17729904     Source Type: Journal    
DOI: 10.1007/s11416-007-0072-y     Document Type: Article
Times cited : (13)

References (52)
  • 3
    • 84937578170 scopus 로고    scopus 로고
    • Web MIXes: A system for anonymous and unobservable Internet access
    • Federrath, H. (Eds.)
    • Berthold, O., Federrath, H., Kopsell, S.: Web MIXes: A system for anonymous and unobservable Internet access. In: Federrath, H. (Eds.) DIAU'00, Lecture Notes in Computer Science, vol. 2009, pp. 115-129 (2000)
    • (2000) DIAU'00, Lecture Notes in Computer Science , vol.2009 , pp. 115-129
    • Berthold, O.1    Federrath, H.2    Kopsell, S.3
  • 5
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses, and digital pseudonyms
    • 2
    • D.L. Chaum 1981 Untraceable electronic mail, return addresses, and digital pseudonyms Commun. ACM 24 2 84 88
    • (1981) Commun. ACM , vol.24 , pp. 84-88
    • Chaum, D.L.1
  • 7
    • 35048857309 scopus 로고    scopus 로고
    • Hash-based dynamic source routing
    • IFIP Networking
    • Castelluccia, C., Mutaf, P.: Hash-based dynamic source routing. In: IFIP Networking, LNCS, vol. 3042, pp. 101-223 (2004)
    • (2004) LNCS , vol.3042 , pp. 101-223
    • Castelluccia, C.1    Mutaf, P.2
  • 8
    • 2442551009 scopus 로고    scopus 로고
    • Optimized link state routing protocol (OLSR)
    • Request For Comment 3626, October
    • Clausen, T., Jacquet, P.: Optimized link state routing protocol (OLSR). IETF, Request For Comment 3626, October 2003
    • (2003) IETF
    • Clausen, T.1    Jacquet, P.2
  • 9
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses, and digital pseudonyms
    • February
    • Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Commun. ACM 24(2), February 1981
    • (1981) Commun. ACM , vol.24 , Issue.2
    • Chaum, D.1
  • 12
    • 35048831821 scopus 로고    scopus 로고
    • Reasoning about the anonymity provided by pool mixes that generate dummy traffic
    • Springer Heidelberg
    • Diaz C. and Preneel B. (2004). Reasoning about the anonymity provided by pool mixes that generate dummy traffic. In: Fridrich, J. (eds) Information Hiding LNCS, vol. 3200, pp 309-325. Springer, Heidelberg
    • (2004) Information Hiding LNCS, Vol. 3200 , pp. 309-325
    • Diaz, C.1    Preneel, B.2    Fridrich, J.3
  • 13
    • 84954434858 scopus 로고    scopus 로고
    • The block cipher Rijndael
    • CARDIS 1998
    • Daemen, J., Rijmen, V.: The block cipher Rijndael. CARDIS 1998. LNCS, vol. 1820, pp. 247-256 (2000)
    • (2000) LNCS , vol.1820 , pp. 247-256
    • Daemen, J.1    Rijmen, V.2
  • 15
    • 33746905403 scopus 로고    scopus 로고
    • Computer viruses: From theory to applications
    • Springer, France. ISBN 978-2-287-23939-7
    • Filiol, E.: Computer Viruses: from Theory to Applications. IRIS International Series, Springer, France. ISBN 978-2-287-23939-7 (2005)
    • (2005) IRIS International Series
    • Filiol, E.1
  • 16
    • 54849417266 scopus 로고    scopus 로고
    • Techniques virales aavancées
    • Springer, France. ISBN 978-2-287-33887-8 (An English translation is pending)
    • Filiol, E.: Techniques Virales Avancées. IRIS International Series, Springer, France. ISBN 978-2-287-33887-8 (2007) (An English translation is pending)
    • (2007) IRIS International Series
    • Filiol, E.1
  • 18
    • 0033183669 scopus 로고    scopus 로고
    • Improved decoding of Reed-Solomon and algebraic-geometry codes
    • V. Guruswami M. Sudan 1999 Improved decoding of Reed-Solomon and algebraic-geometry codes IEEE Trans. Inform. Theory 45 1757 1767
    • (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 1757-1767
    • Guruswami, V.1    Sudan, M.2
  • 19
    • 0006238804 scopus 로고    scopus 로고
    • Learning polynomials with queries: The highly noisy case
    • 4
    • O. Goldreich R. Rubinfeld M. Sudan 2000 Learning polynomials with queries: the highly noisy case SIAM J. Discrete Math. 13 4 535 570
    • (2000) SIAM J. Discrete Math. , vol.13 , pp. 535-570
    • Goldreich, O.1    Rubinfeld, R.2    Sudan, M.3
  • 27
    • 0242696170 scopus 로고    scopus 로고
    • ANODR: ANonymous on demand routing with untraceable routes for mobile ad hoc networks
    • Kong, J., Hong, X.: ANODR: ANonymous On demand routing with untraceable routes for mobile ad hoc networks. In: ACM MOBIHOC'03, pp. 291-302 (2003)
    • (2003) ACM MOBIHOC'03 , pp. 291-302
    • Kong, J.1    Hong, X.2
  • 30
    • 84890010554 scopus 로고    scopus 로고
    • Stop-and-go MIXes providing probabilistic security in an open system
    • Second International Workshop on Information Hiding (IH'98)
    • Kesdogan, D., Egner, J., Buschkes, R.: Stop-and-go MIXes providing probabilistic security in an open system. Second International Workshop on Information Hiding (IH'98), Lecture Notes in Computer Science, vol. 1525, pp. 83-98 (1998)
    • (1998) Lecture Notes in Computer Science , vol.1525 , pp. 83-98
    • Kesdogan, D.1    Egner, J.2    Buschkes, R.3
  • 31
    • 84968503742 scopus 로고
    • Elliptic curve cryptosystems
    • N. Koblitz 1987 Elliptic curve cryptosystems Math. Comput. 48 203 209
    • (1987) Math. Comput. , vol.48 , pp. 203-209
    • Koblitz, N.1
  • 33
    • 3142726524 scopus 로고    scopus 로고
    • SPREAD: Improving network security by multipath routing
    • Boston, MA, October
    • Lou, W., Liu, W., Fang, Y.: SPREAD: Improving network security by multipath routing. IEEE Milcom'03. Boston, MA, October 2003
    • (2003) IEEE Milcom'03
    • Lou, W.1    Liu, W.2    Fang, Y.3
  • 36
    • 0002448405 scopus 로고
    • A public-key cryptosystem based on algebraic coding theory
    • Jet Prop. Lab. California Inst. Technol., Pasadena, CA
    • McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab. California Inst. Technol., Pasadena, CA, pp. 114-116 (1978)
    • (1978) DSN Prog. Rep. , pp. 114-116
    • McEliece, R.J.1
  • 39
    • 54849438410 scopus 로고    scopus 로고
    • OMNET++. http://www.omnetpp.org/
  • 42
    • 0742292815 scopus 로고    scopus 로고
    • Ad Hoc on-demand distance vector (AODV) routing
    • July
    • Perkins, C., Belding-Royer, E., Das, S.: Ad Hoc on-demand distance vector (AODV) routing. RFC 3561, July 2003
    • (2003) RFC , vol.3561
    • Perkins, C.1    Belding-Royer, E.2    Das, S.3
  • 47
    • 39049096786 scopus 로고    scopus 로고
    • ODAR: On-demand anonymous routing in Ad Hoc networks
    • Mobile Adhoc and Sensor Systems (MASS) , Vancouver, Canada, October
    • Sy, D., Chen, R., Bao, L.: ODAR: On-demand anonymous routing in Ad Hoc networks. Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference, pp. 267-276, Vancouver, Canada, October 2006
    • (2006) 2006 IEEE International Conference , pp. 267-276
    • Sy, D.1    Chen, R.2    Bao, L.3
  • 48
    • 0037842963 scopus 로고    scopus 로고
    • Strategies for enhancing routing security in protocols for mobile Ad Hoc networks
    • 63.2 (February 2003). Special issue on routing in mobile and wireless Ad Hoc networks . ISSN:0743-7315
    • Venkatraman, L., Agrawal, D.P.: Strategies for enhancing routing security in protocols for mobile Ad Hoc networks. In: Journal of Parallel and Distributed Computing, 63.2 (February 2003). Special issue on routing in mobile and wireless Ad Hoc networks, pp. 214-227 (2003). ISSN:0743-7315
    • (2003) Journal of Parallel and Distributed Computing , pp. 214-227
    • Venkatraman, L.1    Agrawal, D.P.2
  • 52
    • 25844443821 scopus 로고    scopus 로고
    • Anonymous communications in mobile Ad Hoc networks
    • Zhang, Y., Liu, W., Lou, W.: Anonymous communications in mobile Ad Hoc networks. In: IEEE INFOCOM (2005)
    • (2005) IEEE INFOCOM
    • Zhang, Y.1    Liu, W.2    Lou, W.3


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