Stable and Secured Routing Strategy for MANET with SSRP

A Mobile Adhoc Network (MANET) is characterized by mobile nodes, multihop wireless connectivity, infrastructureless environment and dynamic topology. The adhoc environment is accessible to both legitimate network users and malicious attackers. Moreover, as the wireless links are highly error prone and can go down frequently due to mobility of nodes, therefore, stable and secure routing over MANET is still a very critical task due to highly dynamic environment. In this research paper, a new protocol SSRP (Stable and Secured Routing Protocol) has been proposed. An experimental analysis of proposed protocol (SSRP) and existing protocol (AODV) has been carried out using network simulator ns-2. An effort has been made to perform analysis using random way point mobility model. The results have been derived using a self created network scenarios for varying number of mobile nodes. The same scenario is executed for both the protocols to analyze the performance. The performance metrics used for evaluation are packet delivery ratio, average end to end delay, throughput, normalized routing load and packet loss. Based on the experimental analysis, recommendations have been made about the significance of either protocol in various situations. It has been concluded that the proposed protocol i.e. SSRP provides a robust, stable and secured routing strategy for mobile adhoc networks

On-demand Bandwidth and Stability Based Unicast Routing in Mobile Adhoc Networks

Characteristics of mobile ad hoc networks (MANETs) such as lack of central coordination, dynamic topology and limited resources pose a challenging problem in quality of service (QoS) routing. Providing an efficient, robust and low overhead QoS unicast route from source to destination is a critical issue. Bandwidth and route stability are the major important QoS parameters for applications where long duration connections are required with stringent bandwidth requirements for multimedia applications. This paper proposes an On-demand Bandwidth and Stability based Unicast Routing scheme (OBSUR) in MANET by adding additional QoS features to existing Dynamic Source Routing (DSR) protocol. The objective of the OBSUR is to provide QoS satisfied, reliable and robust route for communicating nodes. The scheme works in following steps. (1) Each node in the network periodically (small regular intervals) estimates bandwidth availability, node and link stability, buffer availability, and stability factor between nodes. (2) Construction of neighbor stability and QoS database at every node which is used in route establishment process. (3) The unicast path is constructed by using route request and route reply packets with the help of route information cache, and (4) route maintenance in case of node mobility and route failures. Simulation results show that there is an improvement in terms of traffic admission ratio, control overhead, packet delivery ratio, end to end delay and throughput as compared to Route Stability Based QoS Routing (RSQR) in MANETs.

Enhanced AODV Routing Protocol Using Leader Election Algorithm

Failure of communication link in mobile ADHOC network is major issue. For the failure of link the performance of network is degraded. Due to mobility of mobile node brake the communication link and path of routing is failed. For the repairing of routing node used various algorithm such as leader election, distributed and selection algorithm. The failure of link decease the performance of routing protocol in mobile ad-hoc network, for the improvement of quality of service in mobile ad-hoc network various authors proposed a different model and method for prediction of link. The prediction of link decreases the failure rate of mobile node during communication. The leader election algorithm plays a major role in link failure prediction algorithm the process of link failure prediction implied in form of distributed node distribution. Proposed a new link stability prediction method based on current link-related or user-related information in shadowed environments. The modified protocol acquired the process of thresholds priority Oder on the basic of neighbor’s node. The selection of neighbor node deepens on the mode operation in three sections. According to order of state create cluster of priority of group. After creation of group calculate average threshold value and compare each group value with minimum threshold value and pass the control message for communication. Through this process mode of activation state of node is minimized the time of route establishment and maintenance. The selection of proper node in minimum time and other node in sleep mode the consumption of power is reduces. We modified SBRP protocol for selection of node during on demand request node according to sleep and activation mode of communication. Each node locally assigned priority value of node. For the evaluation of performance used network simulator NS-2.35. And simulate two protocol one is AODV-LE protocol, these protocol patch are available for the simulation purpose. And another protocol is AODV-LE-ME. AODV-LE-ME protocol is modified protocol of leader election protocol for the selection of mobile node during the communication. DOI: 10.17762/ijritcc2321-8169.15016

Load Balanced Clustering Technique in MANET using Genetic Algorithms

Mobile adhoc network (MANET) has characteristics of topology dynamics due to factors such as energy conservation and node movement that leads to dynamic load-balanced clustering problem (DLBCP). Load-balancing and reliable data transfer between all the nodes are essential to prolong the lifetime of the network. MANET can also be partitioned into clusters for maintaining the network structure. Generally, Clustering is used to reduce the size of topology and to accumulate the topology information. It is necessary to have an effective clustering algorithm for adapting the topology change. In this, we used energy metric in genetic algorithm (GA) to solve the DLBCP. It is important to select the energy- efficient cluster head for maintaining the cluster structure and balance the load effectively. In this work, we used genetic algorithms such as elitism based immigrants genetic algorithm (EIGA) and memory enhanced genetic algorithm (MEGA) to solve DLBCP. These schemes select an optimal cluster head by considering the distance and energy parameters. We used EIGA to maintain the diversity level of the population and MEGA to store the old environments into the memory. It promises the load -balancing in cluster structure to increase the lifetime of the network. Experimental results show that the proposed schemes increases the network lifetime and reduces the total energy consumption. The simulation results show that MEGA and EIGA give a better performance in terms of load-balancing

Power aware routing in ad hoc wireless networks

Development of the efficient power aware protocol is the need of today s adhoc networks. Although developing battery efficient systems that have low cost and complexity, remains a crucial issue. In order to facilitate communication within a mobile adhoc network, an efficient routing protocol is required to discover routes between mobile nodes. Power is one of the most important design criteria for adhoc networks as batteries provide limited working capacity to the mobile nodes. Power failure of a mobile node not only affects the node itself but also its ability to forward packets on behalf of others and hence affects the overall network lifetime. Much research efforts have been devoted to develop energy aware routing protocols. In this paper we propose an efficient algorithm, which maximizes the network lifetime by minimizing the power consumption during the source to destination route establishment. As a case study proposed algorithm has been incorporated along with the route discovery procedure of AODV and by simulation it is observed that proposed algorithm s perperformance is better as compare to AODV and DSR in terms of various energy related parameters like Total Energy Consumption, Average Energy Left Per Alive Node, Node Termination Rate, and Network Lifetime for different network scenarios.Facultad de Informátic