MANET- Analysis of routing stability under the Random Direction

Name: N.Personna Balaji Designation: Prof & HOD College: Gurunank Engineering College Email id: gneccsebalaji@gmail.com

Name: K.L.Narsimha Rao Designation: Asst Prof College: Gurunank Engineering College Email id: narasimharaokalahasthi@gmail.com

Name: D. MadhuSudan Reddy Qualification: M.Tech College: Gurunank Engineering College Email id: madhu.dagada@gmail.com

Name: J.Laxaman Kumar Qualification: M.Tech College: Gurunank Engineering College Email id: lkumarj@gmail.com

Abstract - MANETs arising in mobile in mobile ad hoc networks which is the process selection of the optimal path between any
two nodes. A method has been introduced to improve routing efficiency is to select the most stable path as to reduce the latency and the overhead due to route reconstruction. In this work, we study the routing in wireless sensor networks and MANETs architecture model availability and the duration probability of a routing path that link failures caused by node mobility. Through our analysis, paper shows the problem of selecting an optimal route in terms of path availability. Finally concludes with comparative study with existing requirement routing protocols

Keywords Wireless Sensor Networks, MANETs, Routing, Multi-hop.

INTRODUCTION I Wireless Ad Hoc Networks research has been ongoing for decades. The history of wireless ad hoc networks can be traced back to the Defense Advanced Research Project Agency (DAPRPA) packet radio networks (PRNet), which evolved into the survivable adaptive radio networks (SURAD) program [1]. Ad hoc networks have play an important role in military applications and related research efforts, for example, the global mobile information systems (GloMo) program [2] and the nearterm digital radio (NTDR) program [1]. Recent years have seen a new spate of industrial and commercial applications for wireless ad hoc networks, as viable communication equipment and portable computers become more compact and available. There are currently two variations of mobile wireless networks: infrastructured and infrastructureless networks. The infrastructured networks have fixed and wired gateways or the fixed Base-Stations which are connected to other Base-Stations through wires. Each node is within the range of a Base-Station. A Hand-off occurs as mobile host travels out of range of one Base-Station and into the range of another and thus, mobile host is able to continue communication seamlessly throughout the network. Example applications of this type include wireless local area networks and Mobile Phone. A mobile ad-hoc network (MANET) is a network formed without any central administration which consists of mobile nodes that use a wireless interface to send packet data. With current technology and the increasing popularity of notebook computers, interest in ad hoc networks has greatly peaked Future advances in technology will allow us to form small ad hoc networks on campuses, during conferences and even in our own homes. Each MANET node can serve as a router, and may move arbitrary and dynamically connected to form network depending on their positions and transmission range. The topology of the ad hoc network depends on the transmission power of the nodes and the location of the MNs, which may change with time.

The presence of wireless communication and mobility make an ad hoc network unlike a traditional wired network, and requires the routing protocols used in an hoc network based on new and different principles. Routing in ad hoc environment is one of the important issues of the most challenging and interesting research areas in MANET. Since mobile ad hoc network change their topology frequently, routing in such network is a challenging task. Generally, the main function of routing in a network is to detect and maintain the optimal route to send data packets between source and destination via intermediate nodes. Mobile system is characterized by the movement of their constituents. The movement are frequently changing in speed, direction and rate that will be effect on the protocols and system designed to support mobility. In study the new Mobile Ad hoc Network Protocol, it is important to determine the key parameters that effect the performance of that particular protocol. Mobility models is one of the key parameters that researchers have to considered when they want to analyzed the performance of the certain protocol in their simulation environment. The mobility model is designed to describe the movement pattern of mobile user, and how their location, velocity and acceleration change over time. Since mobility pattern may play a significant role in determining the protocol performance, it is desirable for mobility models to emulate the movement pattern of targeted the real life application in a reasonable way. The different selection of mobility model can have a major impact on the selection of a routing scheme and can thus influence performance.

SECTION II 2.1Routing in Wireless Sensor Networks Wireless sensor networks require multi-hop routing algorithms due to limited radio ranges of the individual nodes. According to routing algorithms in WSNs must be designed keeping the following requirements. Power efficiency is the most important consideration due to the limited capacity of a sensor node. The WSN has to be self-organizing. WSNs are mostly data-centric. Position awareness is extremely important in many WSN applications. Data collected by sensor nodes may contain large amounts of redundancy. Therefore, in-network aggregation would have to be performed. Additionally stated that in (3) The large numbers of sensor nodes in typical WSN deployments make it impossible to build a global addressing scheme. Post-deployment, WSN nodes are stationary in most cases. In some applications, however, sensor networks may be allowed to move and change their location (although with low mobility) Furthermore stated in (2) that: Sensor nodes mainly use a broadcast communication paradigm, whereas most ad hoc network routing algorithms use the point-to-point communication paradigm. On the basis of some of the arguments put forth in the two preceding lists, state (2) that protocols and algorithms proposed for traditional wireless ad hoc networks are not well-suited to the unique features and application requirements of sensor networks. 2.1.1 Classification of routing protocols Routing protocols are classified in (15) to be of three types: Proactive routing algorithms: In proactive routing algorithms, each node stores information on routes to every other node in the network. The settling time for a network using an algorithm of this sort is extremely high, and the number of messages exchanged in order to maintain route information can grow large very quickly, limiting the scalability of such algorithms. Reactive routing algorithms: Reactive routing algorithms require each node to store Routes only to its immediate neighbors, and determine multi-hop routes as required. This reduces the routing table maintenance overhead, but increases the time required to send a message as the path has to be determined each time a packet has to be transmitted across multiple hops. Hybrid routing algorithms: Hybrid routing algorithms combine the strengths of both reactive and proactive algorithms, and use a proactive scheme within a given radius, and a reactive scheme to determine routes to nodes outside the radius. The radius may be determined by several metrics, including number of hops. 2.1.2. Classification of WSN routing protocols The classification of WSN routing algorithms, according to (3), can be performed on the following bases: According to network structure: 1) Flat: In a flat network, all the nodes play the same role. 2) Hierarchical: The network is clustered, so that cluster heads do the work. Different nodes can be cluster-heads at different times. 3) Location-Based: Positioning information is used in networks of this nature to relay data to a specific portion/region of the network. 4) Multipath-based 5) Query-based 6) Quality of Service (QoS)- based 7) Coherent-based 2.2. Challenges in Mobile Ad hoc Routing

2.2.1 Handling Outstanding Packets Each packet traversing the packet forwarding function will be matched against the kernel routing table. If no entry matches its destination, the kernel will drop the packet immediately. However, this is not a desirable behavior for on-demand ad-hoc routing. In on-demand ad-hoc routing, not all routes will exist apriori some must be discovered when needed [5]. In such cases, the correct behavior should be to notify the ad hoc routing daemon of a route request, and to withhold the packet until the discovery finishes and route table updated. Unfortunately, there is no mechanism in modern operating systems to support this new packet forwarding behavior, and there is insufficient kernel support to implement tasks like queuing of all outstanding packets. Therefore, the operating system should implement the following functions for on-demand ad-hoc routing: 1. Identify the need for a route request. 2. Notify ad-hoc routing daemon of a route request. 3. Queue outstanding packets waiting for route discovery. 4. Re-inject them after successful route discovery. 2.2.2 Route Cache updating: On-demand routing protocols typically maintain a cache of recently used routes in user space to optimize the route discovery overhead. Each entry in this route cache has an expiration timer, which needs to be reset when the corresponding route is used. The entry should be deleted (both from the user-space route cache and the kernel routing table) when the timer for that entry expires. Therefore, when an entry in the kernel routing table remains unused (i.e., has not been looked up) for a predefined time period, this information should be accessible to the the user-space routing daemon. This is difficult to achieve under the current routing architecture, because no record of route usage in the kernel is available to user-space programs. 2.2.3 Forwarding and Routing Functions: Certain ad-hoc routing protocols do not have a clean separation between the forwarding and routing functions in their design. Many of these protocols are based on the on-demand behavior, where actions are taken only on reaction to data packets [21]. Since there is no periodic activities such as router advertisements, link/neighbor status sensing, or even the timely expirations of unused routing table or cache entries, routing activities must be made part of the forwarding activities. This protocol design presents a big implementation challenge to fit in the current routing architecture. There are two basic implementation approaches. The in-kernel approach typically requires the bulk of their routing logic to be implemented inside the kernel, making it difficult to program and to modify. On the other hand, the user-space approach requires the forwarding action to take place in user space, forcing every packet into user space. In some cases, the principle of separation is violated for subtle optimizations aimed at reducing routing overhead. Such optimizations are usually simple to implement in a simulation environment, but present significant system design challenges. In the course of this study, we have found such examples in protocol design. We will present them in the later sections when we describe our experiences in implementing them. 2.2.4. Novel Routing Models: Some ad-hoc routing protocols adopt unconventional routing models such as source routing ([15]), flow-based forwarding ([13]), etc. These new routing models deviate from the current IP routing architecture and present new challenges in system design. For example, in source routing the entire path that a packet should traverse is determined by the origin of the packet and encoded in the packet header, whereas in traditional IP routing the forwarding decision is made hop-by-hop and driven by the local routing tables. In flow-based forwarding each packet carries a flow id, and each node in the network has a flow table, which maintains the next-hop address and other information for each flow id. The forwarding is driven by table lookup on the flow id, and routing is the process to establish the flow table in each node. Most general purpose operating systems are not flexible enough to provide a blanket support for all these and other new routing models. Implementation of these routing protocols will either modify the kernel IP stack to incorporate new routing architecture, or use kernel extension mechanisms (such as loadable modules) to bypass the IP stack. 2.2.5. Cross-Layer Interactions: The wireless channel presents a lot of opportunities for optimizations through cross-layer interactions. For example, some ad-hoc routing protocols use physical and link layer parameters like signal strength, link status sensing, and link layer supported neighbor discovery, etc., in their routing algorithm. The problem of dealing with cross-layer interactions is a more difficult problem, both at the conceptual level and the implementation level. At the conceptual level, substantial work is needed in laying down guidelines for systematizing cross-layer interactions. This is necessary, since even though cross layer design may provide optimizations, an indiscriminate access to all lower layer parameters would seriously damage the neat architecture which lies at the foundation of all networking. At the implementation level, such cross-layer interactions obviously depend on the hardware capabilities and whether the hardware allows access to that information. It may be possible to provide access to lower layer parameters for some particular hardware, but a general solution for all hardware would require some standardization across the plethora of wireless interface cards and drivers available.

SECTION III 3. MANET Architecture MANETs which preserves the integrity of the IP architecture while allowing for the particularities of MANETs. 3.1. MANET Node Morphology Considers the architecture of MANET nodes as routers with hosts attached, as illustrated in figure. These attached hosts may be external i.e. attached to the router via other network interfaces or internal, however the important observation to make is that the

links between these hosts and the router are classic IP links. This implies that, from the point of view of the hosts, and the applications running on these hosts, connectivity is via a classic IP link. Hosts, and their applications, are not exposed to the specific characteristics of the MANET interfaces and are connected to the MANET via a router, which has one or more MANET interfaces. This is symmetric with how hosts on an Ethernet, such as illustrated in figure 1 are not exposed to the intricacies of what type of connectivity the router has beyond the Ethernet.

Figure 1: MANET node model: (R) is the router, a MANET interface, and is connected, on the bottom, to hosts (H) via classic IP links. Since the hosts in figure are connected to a classic IP link, these hosts are configured and behave as hosts in any other network, and the links to which they are connected have properties identical to those of any other classic IP link. 3.2.Addresses and Prefixes of MANET: If the MANET router is delegated a prefix p, this prefix can be assigned to the classic IP links and hosts can be assigned addresses from within this prefix, and configured with this prefix as illustrated in the next figure. Specifically, the MANET interfaces of the router are not configured with this prefix, the MANET interfaces is not on the same link as the other interfaces with addresses from within this prefix, and so direct communication without crossing a router is not possible. The configuration of MANET interfaces is detailed below. MANET Interface Configuration & Properties

Figure 2 MANET node prefixes: the MANET router (R) is delegated a prefix p, which it assigns to the classic IP links to which the hosts (H) are attached. MANET specific behaviors are exclusively exposed to the MANET interfaces of the routers. This includes MANET routing protocols and interface and link characteristics (asymmetric neighbourhoods, semi-broadcast interfaces, fuzzy neighbor relationships, topology dynamics etc.) The following characteristics deserve particular mention, since they compare 3.3.MANET interfaces and the MANET link model from the classic IP link model: Unique Prefixes MANET interfaces must be configured with unique prefixes, i.e. such that no two MANET interfaces are configured such that they appear within the same IP subnet. Some common ways to achieve this are: unnumbered interfaces (IPv4) [1];Link-Local Addresses (IPv6); /128 (IPv6) or /32 (IPv4) prefixes. However it is worth noting that prefix lengths shorter than /128 (IPv6) or /32 (IPv4) are possible on the MANET interface, so long as the prefixes are unique to a single MANET interface. Link Local Mulitcast/broadcast Scope On a MANET interface, a Link Local multicast or broadcasts reach MANET interfaces of neighbor nodes only, regardless of their configured addresses. A Link Local multicast or broadcast on a MANET interface is, thus, a neighborcast, and is not forwarded nor assumed to be received by all nodes within a MANET. 3.4. MANET Network View MANET with routers and hosts, looks as in figure 9: the inner white cloud represents where MANET interfaces and links form a MANET and the outer gray cloud represents where the classic IP link model.

Figure 3. Network Model MANET, the inner white cloud is where MANET interfaces and links for a MANET are found and MANET specific protocols apply. The outer gray cloud represents where the classic IP link model applications/protocols applies.

SECTION IV 4. Mobile wireless networks are receiving an increasing interest due to the possibility of ubiquitous communications. In particular, mobile ad hoc networks (MANETs) enable users to maintain connectivity to the fixed network or exchange information when no infrastructure, such as a base station or an access point, is available. This is achieved through multi-hop communications, which allow a node to reach far away destinations by using intermediate nodes as relays. The selection and maintenance of a multi-hop path, however, is a fundamental problem in MANETs. Node mobility, signal interference, and power outages make the network topology frequently change, as a consequence, the links along a path may fail and an alternate path must be found. To avoid the degradation of the system performance, several solutions have been proposed, taking into account various metrics of interest. A method that has been advocated to improve routing efficiency is to select the most stable path so as to avoid packet losses and limit the latency and overhead due to path reconstruction. In this work, we focus on the stability of a routing path, which is subject to link failures caused by node mobility. We define the path duration as the time interval from when the route is established until one of the links along the route becomes unavailable, while we say that a path is available at a given time instant t when all links along the path are active at time t. Then, our objective is to derive the probability of path duration till time t and the probability of path availability at time t. The solution proposed system is a fundamental issue arising in mobile ad hoc networks (MANETs) is the selection of the optimal path between any two nodes. A method that has been advocated to improve routing efficiency is to select the most stable path so as to reduce the latency and the overhead due to route reconstruction. 4.1. Networking module. Client-server computing or networking is a distributed application architecture that partitions tasks or workloads between service providers (servers) and service requesters, called clients. Often clients and servers operate over a computer network on separate hardware. A server machine is a high-performance host that is running one or more server programs which share its resources with clients. A client also shares any of its resources; Clients therefore initiate communication sessions with servers which await (listen to) incoming requests. 4.2. Random Direction mobility model. The Random Direction model, i.e., each node alternates periods of movement (move phase) to periods during which it pauses (pause phase); at the beginning of each move phase, a node independently selects its new direction and speed of movement. Speed and direction are kept constant for the whole duration of the node move phase; the durations of move and pause phases are, in general, distributed according to independent random variables. 4.3. Link availability module. We can write an exact expression for the probability of link availability at time t, by using the spatial PDF of nodes moving according to the RD model. Two nodes A and B be the spatial distributions of A at time t in the move and pause phases, respectively, the spatial distributions of B at time t in the move and pause phases, respectively. The probability of link availability between the two nodes. First to numerically evaluate the spatial distribution of nodes A and B at time t through a tri-dimensional inverse transform (two spatial dimensions and one temporal dimension), then to numerically compute the integral in over a fourdimensional domain. 4.4. Multi Hop module. Consider N+1 nodes moving according to an RD motion, then consider the path of n (bidirectional) links obtained traversing the N +1 nodes in sequence.4 since nodes movements are assumed to be independent. 4.5. Optimal path selection module. The parameters of the underlying mobility model of the nodes are given (e.g., obtained through measurements) and that all nodes have a fixed, common radio range R. To introduce the problem of path selection, suppose node A wants to communicate with node B, possibly using intermediate nodes as relays. To maximize the stability of the route in response to node mobility, one can think of two different strategies: 1) a few long hops and 2) many short hops. On the one hand, considering that the entire path fails if just a single link fails and that nodes move independently of each other, it seems better to minimize the number of hops. On the other hand, short links are much more stable than long links.

4.6. Comparative Study: The problem of link and route stability has been widely addressed in the literature. Routing protocols accounting for route stability while selecting the source-destination path can be found , just to name a few. In particular, the work in considers nodes moving along nonrandom patterns and exploits some knowledge of the nodes motion to predict the path duration. Studies on link and path availability and duration are presented. A partially deterministic and a Brownian motion, where nodes start moving from the same location, are considered. We focus on the stability of a routing path, which is subject to link failures caused by node mobility. We define the path duration as the time interval from when the route is established until one of the links along the route becomes unavailable, while we say that a path is available at a given time instant t when all links along the path are active at time t. Then, our objective is to derive the probability of path duration till time t and the probability of path availability at time t.. we have many existing algorithms but which requires more duration and have drawbacks so random direction algorithm has benefits and effective, reliable.

CONCLUSION V The duration and availability probabilities of routing paths in MANETs a fundamental issue to provide reliable routes and disruption times. We focused on the routing in wireless sensor networks mobility model and derived both exact and approximate expressions for the mobile ad hoc probability of path duration and availability. Analysis used to determine the optimal path in terms of route stability in particular some of optimal path provide an approximate accurate expression for the optimal number of hops. Finally the proposed system to find and select routes which accounts for the expected data transfer time over the path and reduce the reactive routing protocols and comparison of our system with existing one.

References [1] J. A. Freebersyser and B. Leinerr, A DoD perspective on mobile ad hoc networks, in Ad Hoc Networking, C. E. Perkin, Ed. Addison-Wesley, 2001, pp. 2951. [2] B. Leiner, R. Ruth, and A. R. Sastry, Goals and challenges of the DARPA GloMo program, IEEE Personal Communications, vol. 3, no. 6, pp. 3443, December 1996. [3] Y.-C. Hu and D. B. Johnson. Implicit source routes for on-demand ad hoc network routing. In Proceedings of the 2001 ACM International Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc01), pages 1 10, Long Beach, California, Oct. 2001. [4] D. Johnson, D. Maltz, Y.-C. Hu, and J. Jetcheva. The dynamic source routing protocol for mobile ad hoc networks (DSR). IETF Internet-Draft, draft-ietf-manet-dsr-07.txt, Feb. 2002. [5] D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In T. Imielinski and H. Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996. [6] D. A. Maltz, J. Broch, J. Jetcheva, and D. B. Johnson. The effects of on-demand behavior in routing protocols for multi-hop wireless ad hoc networks. IEEE Journal on Selected Areas in Communications, 17(8):14391453, August 1999. [7] R. Dube, C.D. Rais, K.-Y. Wang, and S.K. Tripathi, Signal Stability Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks, IEEE Personal Comm., vol. 4, no. 1, pp. 36-45, Feb. 1997. [8] S. Agarwal, A. Ahuja, J.P. Singh, and R. Shorey, Route-Lifetime Assessment Based Routing (RABR) Protocol for Mobile Ad-Hoc Networks, Proc. IEEE Intl Conf. Comm. (ICC 00), pp. 1697-1701, June 2000. [9] W. Su, S.-J. Lee, and M. Gerla, Mobility Prediction and Routing in Ad Hoc Wireless Networks, Intl J. Network Management, vol. 11, no. 1, pp. 3-30, Jan./Feb. 2001. [10] C. Bettstetter, G. Resta, and P. Santi, The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks, IEEE Trans. Mobile Computing, vol. 2, no. 3, pp. 257-269, July-Sept. 2003.

Prof. N Prasanna Balaji, and Head IT has done his B.E in Computer science from Bharathidasan University, completed his M.Tech in IT (Part Time) with distinction from Punjab University Patiala, currently pursuing Ph.D in the topic Enterprise Resource Planning from Kakatiya University, Warangal.. He has 20+ years of teaching, training and Systems Computerization. Mr. Balaji has worked as Associate Professor in CSE dept at Vignan Institute of technology & Science.At Infosys Campus Connect (two weeks residential December 2006) Programme and was recognized as one of the Best Teacher. At Institute of Public Enterprise(IPE) he was the ERPIncharge for Microsoft Business Solutions-Navision, and has organized a National level conference on e-Customer Relationship Management and three Management Development Programmes in Recent Trends in Information Technology, two Management Development Programmes in Enterprise Resource Planning-Navission, and one Management Development Programme in

Network Security for Public Sector executives. He is the co-editor for the proceedings of National level conference on eCustomer Relationship Management. He has published and presented papers in National level Seminars and Journals. His areas of interest are Enterprise Resource Planning, Relational Database Management Design, Artificial Intelligence, Operating Systems, Mobile Computing, and Customer Relationship Management. He has guided many PG level and engineering students. He is also a member on various professional societies like Life Member of Computer Society of India, Indian Society for Technical Education, and a Member of International Electrical and Electronics Engineers and All India Management Association.

K.L.Narsimha Rao Asst Prof at Gurunank College of Engineering B.Tech from Swarnandra College of Engineering & Technology M.Tech from Satyabama University. He had guided many UG&PG students, published journal in National & International research areas include Networks, Intrusion Detection, Data Mining & Data Warehousing.

D.Madhu Sudhan Reddy pursuing M.Tech (IT) at Gurunank College of Engineering, B.Tech from Alfa College of Engineering& Technology. He had attended National Conference on Networks &Workshop on Data Mining research areas are Networks, Data Warehousing & Mining, Security.

J.Laxaman Kumar pursuing M.Tech (IT) at Gurunank College of Engineering, B.Tech from Mother Teresa Institute of Science & Technology. He had attended National Conference on Networks &Workshop on Data Mining research areas are Networks, Data Warehousing & Mining, Security.