Rank Based Multicast Geo Routing For Adaptive Service Provisioning In Manet

Abstract

In an adhoc network mobile nodes communicate with each other newlinein a wireless transmission without using any infrastructure Identifying route newlinepath to reach the destination in Mobile Ad hoc NETwork MANET is a newlinetedious process because of the nodes in the networks will move freely In a newlineMANET group communication is possible ie one source node can send a newlinepacket to numerous number of destination nodes in a network using a single newlinegroup of address This is termed as multicasting The applications of this newlinemulticasting are applicable in video conferencing interactive television newlineprovisional offices and net gaming newlineFor an efficient routing routing protocols have been developed to newlineimprove the efficiency of the routing scheme The MANET uses topology newlinebased routing which results in the increase of overhead when the number of newlinenodes in the network increases In an adhoc network the topology of the newlinenetwork will change frequently since the nodes in the network moves often newlineFor this problem the adhoc network will use a leader election algorithm newlinewhich describes the process of designating a single process as the controller newlineof some task distributed among several nodes If the created network topology newlinemodifies some node within the network might be unsuccessful to newlinecommunicate with the preceding node such as in the multicasting adhoc newlinenetwork Therefore there is a great extent to shape a leader so that the newlinenetwork would be maintained such as controlling the clock synchronization newlinewithin the network or selecting a new coordinator when the group newlinemembership changes in the group communication protocols If partition newlinehappens the algorithm assures that the network has a unique leader inside the newlinepartition If the network merges there must be only one leader based on the newlinenode IDentity ID newlineAnother method named zone ID based election algorithm which newlinedefines two levels of election ie node level and zone level A node level newlinetopology provides how nodes of a zone are linked to each other physically newlineZone level topology gives how zones are linked together But this a