International Journal of Computer Trends and Technology- volume3Issue4- 2012

Infallible and upgradable Geo-environment based Multicasting protocol in MANETs

Sheba kunche#1, B. Hanmanthu *2
#Dept of CSE, KITS_kakatiya University
Warangal, Andhra Pradesh, India * Associate professor, Dept of CSE, KITS_kakatiya University Warangal, Andhra Pradesh, India

Abstract With the fast growing technology, man started relying more on fast and measurable computing, such as wireless networks. The usage of wireless networks in local regions and geographic regions using (MANETs) has increased. Mobile Ad-hoc networks are self-configuring infrastructure less network of mobile devices connected by wireless. Generally wireless networks work better in local regions than geographic regions. Multicasting the data in mobile Ad-hoc networks is simpler in local regions whereas the maintenance of multicast structure in dynamic network topology such as geographic regions (large group size networks) is complex since transmission of data in packets is not infallible. Earlier many protocols were tried to transform MANETs into vigorous and measurable form but because of dynamic network topology it was not successful. In this thesis, I propose Infallible and upgradable Geo-environment based multicasting protocol useful for dynamic networks. This is done by using several reflexive architectures to maintain stateless information; free packet delivery without overhead of data, maintenance of membership management is done at local and geographic network levels by using tree-based structures. Tracing the information without flooding by constructing originator is also included in the proposed protocol. When equated to existing mesh based protocols and core-Assisted mesh protocols which do not support infallible network, infallible and upgradable Geoenvironment based multicasting protocol overcomes the problems like overhead in packet delivery of data, maintaining stateless structures, membership management in dynamic networks. This protocol gives MANETs infallible and measurable networks which will simplify the usage of wireless networks at both local and geographic network levels. Keywords: Multicasting, geo-environment multicasting,
Mobile Ad-hoc networks, infallible, upgradable

I.

INTRODUCTION

Wireless networks are useful in different aspects in our daily networks, because of fast computing techniques more and more networks are dependable on wireless networks. If we have seen the transmission of data ,we can done with wired and wireless networks in this scenario of mobiles will always come across the wireless networks which is the basic provider of transmission of data in mobile, this is the one of the reason behind mobile Ad-hoc networks which self-configures and form a network with random topologies. Multicast is a Fundamental service for MANETs by supporting information Exchanges and common task execution among a group of users in a networks. Allowance of multicast in a MANET is a big challenge to design a infallible and measurable multicast routing protocol in the presence of random topologies in dynamic networks. Some of the protocols are also introduced such as tree based protocols and mesh based protocols .Tree based protocol like (Ad hoc Multicast Routing protocol utilizing Increasing id-numbers)it constructs a tree Structure for more effectual multicast packet delivery. However, difficulty of maintaining the tree structure in MANETs because of breakage in tree connections, in mesh based protocol (FORWARDING GROUP MULTICAST PROTOCOL) it incurs high forward packet delivery because of this reasons they were are not under considerate. Location based protocols are used to maintain the membership management in large

ISSN: 2231-2803

http://www.internationaljournalssrg.org

Page 576

International Journal of Computer Trends and Technology- volume3Issue4- 2012

groups, But the header overhead increases significantly as the group size increases In this paper I proposed infallible and upgradable Geo-environment based multicasting protocol (IUGMP) which can measure large group size networks provide upgradable multicast packet transmissions in a dynamic MANET Geo-environment. Upgradable Position-Based Multicast protocol(UPBM) is more related to this work as it share the origin as IUGMP in improving the scalability of location based multicast by using hierarchical group management. IUGMP provides best membership management in large group size networks.

II.

INFALLIBLE AND UPGRADABLE GEO-ENVIRONMENT BASED MULTICASTING PROTOCOL

III.
In this portion, I described the IUGMP protocol in detail. it supports membership management at two levels. At level one, a region structure is built based on position information and a leader is elected on demand when a region has group members. A leader manages the group membership and collects the positions of the member nodes in its region. At the level two, the leaders of the member regions ACCOUNT the region membership to the origins directly along a virtual reverse tree-based structure. With the knowledge of the member regions, a origin forwards data packets to the regions that have group members along the virtual tree rooted at the origin. After the packets arrive at a member region, the leader of the region will further forward the packets to the local members in the region along the virtual tree rooted at the leader.

Infrastructure less distribution schemes are proposed that can control data packets and limitation of messages can be sent along effective reflexive-tree paths without the need of explicitly maintaining a tree structure as in tree-based multicast protocols, which reduces the packet overhead and increase the infallible of protocol

CONSTRUCTING AND MAINTAIN THE

Position information is used to design a upgradable and responsive region-based scheme for effective membership management, which allows a node to quickly join and leave a group in a network. Effective location based search of multicast group members, by adjoining the location service with the membership management to omit the need and overhead of using a independent location server. Originator is introduced to trace the addresses and positions of the origins, to avoid networkwide Periodic flooding of origin information in networks. Some of the Schemes are designed to handle the empty-region problems for both membership regions and the Originators, which are dangerous in designing a region-based protocol.

REGIONS IN GEOGRAPHIC AREAS

In IUGMP, the region structure is reflexive and calculated based on a preexisting point. Therefore, the construction of region structure does not depend on the shape of the network region, and it is very simple to locate and maintain a region. A. Construction of regions: Reflexive regions are used as references for the nodes to find their region positions in the network domain. The region is set relative to a reflexive origin located at (x0, y0), which is set at the network initialization stage as one of the network parameters. The length of a side of the region square is defined as region size. Each region is identified by a region ID (RID). A node can calculate its RID (a, b) from its pos (x, y) as follows: a= [x-x0/region _size], b= [y-y0/region _size].For simplicity, we assume the entire regions IDs are positive. A region ID will help locate a region, and a packet destined to a region will be forwarded toward its center. The center position (xc, yc) of a region

ISSN: 2231-2803

http://www.internationaljournalssrg.org

Page 577

International Journal of Computer Trends and Technology- volume3Issue4- 2012

with RID (a, b) can be calculated as: Xcenter = x0 + (a+0.5)*region_size,, Ycenter = y0 + (b+0.5)*region_size B.Electing the leader for a region: Leader will be elected in a region only when the region has group members in it. When a multicast group member M just moves into a new region, if the region leader (RLdr) is unknown, M queries the neighbor node in the region for the leader. When failing to get the leader information, M will announce itself as a leader by flooding a LEADER message into the region. A region leader floods a LEADER in its region every time interval IntvalASSURE to announce its leadership until the region no longer has any members. If no LEADER message is received within the interval 2*IntvalASSURE, a member node will wait for a random period and then announce itself as the region leader when no other node announces the leadership. packet loss during the moving. For a leader node, if its distance to the region border is shorter than a distance threshold and the region is still a member region, it will hand over its leadership by uncasing a LEADER message (carrying all the current group information) to the neighbor node in its region which is closest to the region center. The LEADER message will continue being forwarded toward the region center until reaching a node which has no neighbor closer to the region center than itself, and the node will take over the leadership and flood a LEADER within the region.

B.Network Level Membership Management

The membership information is in the local region a origin needs to trace the IDs of the member regions that have group members. The leaders of the member regions are Responsible for the sending of the region membership

IV.

MEMBERSHIP

MANAGEMENT

IN

information to the origin. Region leader ACCOUNTs about the membership of the regions A region changes from a member region to a nonmember region of G or vice versa, the region leader sends a ACCOUNT message Immediately to S to notify the change. The leader can obtain the address and position of S.A region leader needs to send ACCOUNT every time interval Intvalregion to S to ASSURE its region membership information. In the case that S is the origin of more than one multicast group, instead of sending a ACCOUNT to S for each group, the leader sends one ACCOUNT carrying all corresponding group IDs. S will remove a member-region record if not ASSURED within 2*Intvalregion. Empty-region handling. Sometimes regions may become vacant when all the nodes move away. When a member region of G is becoming empty, the moving out region leader will notify S Immediately to stop sending packets to the empty region. If the moving out leader fails to notify S (e.g., the leader suddenly dies), the packet forwarded to the empty region will finally be Dropped without being delivered. The node which drops the packet will notify S to delete the region from its region list.

LOCAL AND NETWORK LEVELS

Group membership is managed at two levels. IUGMP takes advantage of the reflexive-region-based structure to efficiently trace the group membership and member positions.

A. Local level membership management:

First Group membership is associated in local region and managed by the region leader. When joining or leaving a Group, a member M sends a message ASSURES (groupIDs, posM) immediately to its region leader to notify its membership change, where posM is its position and groupIDs are the addresses of the groups in which M is a member. M also needs to unicast a ASSURE message to its region leader every time interval IntvalASSURE to update its position and membership information. A member record will be removed by the leader if not ASSURED within 2 * IntvalASSURE.WhenMmoves to a new region, its next periodic ASSURE will be sent to the region leader in the new region. It will announce itself as the leader if the new region does not have one. The moving node will still receive the multicast data packets from the old region before its information is timed out at the leader of the old region, which reduces the

Ensemble of Messages: when local messages are

equated, control messages sent at the network tier would

ISSN: 2231-2803

http://www.internationaljournalssrg.org

Page 578

International Journal of Computer Trends and Technology- volume3Issue4- 2012

generally traverse a longer path. To minimize control overhead, we consider a virtual reverse-tree-based aggregation scheme with which all the control messages sent toward the same destination (e.g., the origin S) will be to further reduce control overhead. Different from other tree based multicast protocols, no explicit tree structure needs to be maintained, which avoids the overhead and improves the robustness. Specifically, the periodic ACCOUNT messages can be and forwarded along the reverse tree. The ASSURE messages sent by member nodes to the region leader can be similarly and sent through the virtual reverse tree. packet to all the member regions, and to the member nodes in its own region through the region leader. For each of the destination, it decides the next node by using the geographic forwarding strategy described in Section 1. After all the next hops are decided, S unicasts to each next-hop node a copy of the packet which carries the list of destinations that must be reached through this hop. Only one copy needs to be sent when packets for different destinations share the same next node. Thus, the packets are forwarded along a tree-like path without the need of building and maintaining the tree in advance. For vigorous transmissions, geographic unicast is used in packet forwarding. The packets can also be sent through broadcast
Initiating groups and Tracing origins:

to further reduce forwarding bandwidth, at the cost.

To enter and exit a multicast group, the nodes which are in the network need to have the origin information. Therefore a origin can move in a MANET, it is dangerous to quickly find the origin when needed and efficiently trace the location of the origin node.

CONCLUSIONS
In this paper, I had designed Infallible and upgradable Geoenvironment based multicasting protocol (IUGMP) for MANETs. After the determinable analysis the results demonstrate IUGMP not only outstands the existing (FORWARDING GROUP MULTICAST PROTOCOL) and widely used multicast protocol (AD HOC

MULTICAST ROUTING PROTOCOL) but can also scale to a large group size, large number of groups, and large network size. To be more specific, IUGMP has much higher packet delivery ratio than (FORWARDING GROUP MULTICAST PROTOCOL) and (Ad hoc Multicast Delivering the packets to multicast the data An origin needs to send the multicast packets reliably to the group members. By membership management, the member regions are recorded by origin S, while the local level group members and their positions are recorded by the region leaders. Multicast packets will be sent along a virtual distribution tree from the origin to the member regions, and then along a virtual distribution tree from the region leader to the group members. A virtual distribution tree is formulated during Routing protocol utilizing Increasing id-numbers) under different moving speeds, node densities, group sizes, number of groups, and network sizes. IUGMP has the lowest control overhead with the support of virtual-regionbased hierarchical membership management, virtual trees for message transmissions, and Originator for tracing the origins. This study indicate that geometric progress and artificial infrastructures can be used together to achieve much more infallible and measurable multicast packet delivery in the presence of static topology change in MANET.

transmission time and guided by the destination positions. The multicast packets are first delivered by S to member regions toward their region centers. S sends a multicast

ISSN: 2231-2803

http://www.internationaljournalssrg.org

Page 579

International Journal of Computer Trends and Technology- volume3Issue4- 2012

REFERENCES
[1] C. Wu, Y. Tay, and C.-K. Toh, Ad Hoc Multicast Routing Protocol Utilizing Increasing Id-Numbers Networks, Computer Networks, vol. 36, nos. 5/6, pp. 659670, Aug. 2001 [5] E.M. Royer and C.E. Perkins, Multicast Operation of the Ad Hoc On-Demand Distance Vector Routing Protocol, Proc. MOBICOM, pp. 207-218, Aug. 1999. [6] R.Beraldi and R. Baldoni,A Caching Scheme for Routing in Mobile Ad-Hoc Networks and Its application to ZRP, IEEE Trans. Computers, vol. 52, no. 8, pp.10511062,Aug.2003. [7] UCLA Parallel Computing Laboratory, GloMoSim, http://pcl.cs.ucla.edu/projects/glomosim/,2010. [8] C. Wu, Y. Tay, and C.-K. Toh, Ad Hoc Multicast Routing Protocol

(AMRIS) Functional Specification, Internet Draft, Nov. 1998 [2] C. Chiang, M. Gerla, and L. Zhang, Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks, Cluster Computing, special issue on mobile computing, vol. 1, no. 2, pp. 187-196, 1998. [3] K. Chen and K. Nahrstedt, Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET, Proc. IEEE INFOCOM, pp. 1180-1189, 2002. [4] S. Basagni, I. Chlamtac, and V.R. Syrotiuk, Location Aware, Dependable Multicast for Mobile Ad Hoc

ISSN: 2231-2803

http://www.internationaljournalssrg.org

Page 580