k-AnycastRoutingSchemesforMobileAdHocNetworks指导.ppt

k-Anycast Routing Schemes for Mobile Ad Hoc Networks 指導老師 : 黃鈴玲 教授 學生 : 李京釜 Author Source Author : Bing Wu; Jie Wu Source :Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International 25-29 April 2006 Page(s):10 pp. Digital Object Identifier 10.1109/IPDPS.2006.1639365 Outline Introduction Three k-anycast approaches k-anycast routing schemes Simulation Conclusion Different types of communication services Introduction The potential advantages of this scheme are fault tolerance, load balancing, security, and improvement in system performance. In mobile ad hoc networks (MANETs), anycast can provide easier service in a dynamic and distributed environment. Introduction In a network configuration where any threshold number of servers can provide particular services, a user needs to locate any k servers out of a server group and efficient k-anycast protocols are necessary to realize such needs. Introduction The first scheme is called controlled flooding. The increase in flooding radius is based on the number of responses. The second scheme is to form multiple components such that each component has at least k members. The third scheme also maintains components, however, each component can have number of members less than threshold k. Controlled Flooding Whenever a node needs to contact any k servers out of a server group, it floods the request. This can be done through the traditional linear or exponential expanding ring searching approach to limit the scope of flooding. A controlled flooding scheme by adjusting the flooding scope according to the number of responses for a request. Two multicomponent schemes First scheme is to form multiple components with each component maintaining at least k members. Whenever a node demands service, it can contact any one of these components. Second scheme, components may have less than k members maintained. During service request, the service from multiple components could be aggregated instead of forc