|Table of Contents|

k-Anycast Routing Protocol Based on Component and Mobile Agents

《南京理工大学学报》（自然科学版）[ISSN:1005-9830/CN:32-1397/N]

Issue:
2010年02期
Page:
232-237
Research Field:
Publishing date:

Info

Title:
k-Anycast Routing Protocol Based on Component and Mobile Agents
Author(s):
XU Xin1; 2; GU Yun-li1; 2; QIAN Huan-yan1
1.School of Computer Science and Technology,NUST,Nanjing 210094,China;2.School of Computerand Software,Nanjing University of Information Science and Technology,Nanjing 210044,China
Keywords:
k-Anycast;  mobile agents;  components;  routing protocols
PACS:
TP393.04
DOI:
-
Abstract:
In k-Anycast communication methods,flooding method and centralized k-Anycast routing protocols have poor performances in term of communication cost,time delay and scalability.A k-Anycast routing protocol based on component and mobile agent is proposed.The protocol forms multiple components and each component has at least k members.Thus,the protocol has characteristics of distribution management and multipath routing because k-Anycast routing problem can be distributed to each component.Moreover,mobile agents which fit for distributed management are applied to initiate or manage components and routing table.Compared with flooding method and centralized k-Anycast routing protocols,simulation experiment results show that the performances of the proposed protocol are improved in terms of communication cost,time delay and scalability.

References:

[1]Xuan D, JiaW, TuW Q, e t a .l D istr ibuted adm issioncontro l for anycast flow s[ J]. Transac tions on Para llel and D istributed Sy stem s, 2004, 15( 8): 673- 686.
[2] Avram opoulos I, SucharaM. Pro tecting the DNS from routing attacks: Two a lternative anycast im plem entations[ J]. IEEE Secur ity and Pr ivacy, 2009, 7 ( 5): 14- 20.
[3] Do i S, A ta S, K itamuraH, et a.l IPv6 anycast for simp le and e ffective serv ice-or iented commun ications[ J]. IEEE Communications M agazine, 2004, 42 ( 5 ): 163- 171.
[4] 王晓喃, 唐振民, 钱焕延. 基于移动IPv6的MANET 中Anycast服务的设计与实现[ J]. 南京理工大学 学报( 自然科学版), 2009, 33( 2): 188- 193.
[5] W u B, W u J, Eduardo E B, et a.l Secure and eff-i c ient keym anagem ent in mob ile ad hoc ne tw orks[ J]. Journa l of Netw ork and Compu terApplications, 2007, 30( 3): 937- 954.
[6] W ang X N. Ana lysis and design o f a k-Anycast communication m ode l in IPv6[ J]. Compu ter Communications, 2008, 31( 10): 2071- 2077.
[7] W ang W, L iX Y, Fr iede rO. k-Any cast gam e in se l-f ish ne tw orks[ A]. Proceedings o f the 13th In ternational Computer Communications and Ne tw orks[ C] . Ch-i cago, USA: IEEE, 2004: 289- 294.
[8] Wu B, Wu J. k-Anycast routing schem es for m ob ile Ad H oc netwo rks[ A] . The 20th Inte rnational Para llel and Distributed Processing Sym pos ium [ C ]. Rhodes Island, Greece: IEEE, 2006.
[9] Liang S, Zinc ir A N, H eywoodM I. Adding m ore intelligence to the network routing prob lem: antnet and GA-agents[ J]. App lied So ft Computing, 2006, 6( 3): 244- 257.

Memo

Memo:
-
Last Update: 2010-04-30