Energy Efficient Location Aided Routing Protocol for Wireless MANETs

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation results show that EELAR protocol makes an improvement in control packet overhead and delivery ratio compared to AODV, LAR, and DSR protocols.Comment: 9 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact factor 0.423, http://sites.google.com/site/ijcsis

Cluster Based Geo-Routing Protocol

This paper addresses the problem of the overhead resulting from flooding the control packets in mobile ad hoc networks in searching for routes between the source and destination. We propose a location enhanced routing protocol for clustered MANETs based on the cluster based routing protocol (CBRP). Our protocol employs local position information obtained by smart antennas to discover routes and make routing decisions for the clustered MANETs. One of the CHs, named general manager (GM), is assigned the responsibility to maintain the local positions of the other nodes. The GM divides the space into four quarters and periodically sends HELLO messages that reach all the nodes. Then each node sends its location information to the GM when this information is changed. Also, the GM has the responsibility to route data from the source to the destination. Simulation results show enhancing the performance of clustered MANETs by decreasing the control packets overhead

Self-pruning broadcasting for mobile ad hoc networks

The IEEE Global Telecommunications Conference (GLOBECOM 2009), Honolulu, HI., 30 November-4 December 2009, p. 1-6Broadcasting is a process of delivering a message to all nodes in a network. While it is important to ensure that all nodes get a copy of the broadcast message, minimizing the number of sending nodes is equally important especially in resource-constrained wireless networks. Existing broadcasting protocols based on self-pruning are ineffective in achieving these objectives. Therefore this paper proposes two protocols based on simple timer mechanisms to prioritize broadcasting of messages such that node with most uncovered neighbors rebroadcast first. Additionally a timer suppression mechanism is proposed to further enhance the effectiveness of the broadcasting protocol. Compared with an existing protocol, extensive simulation experiments confirm that the proposed protocols achieve better performance.published_or_final_versio

Service Provisioning through Opportunistic Computing in Mobile Clouds

Mobile clouds are a new paradigm enabling mobile users to access the heterogeneous services present in a pervasive mobile environment together with the rich service offers of the cloud infrastructures. In mobile computing environments mobile devices can also act as service providers, using approaches conceptually similar to service-oriented models. Many approaches implement service provisioning between mobile devices with the intervention of cloud-based handlers, with mobility playing a disruptive role to the functionality offered by of the system. In our approach, we exploit the opportunistic computing model, whereby mobile devices exploit direct contacts to provide services to each other, without necessarily go through conventional cloud services residing in the Internet. Conventional cloud services are therefore complemented by a mobile cloud formed directly by the mobile devices. This paper exploits an algorithm for service selection and composition in this type of mobile cloud environments able to estimate the execution time of a service composition. The model enables the system to produce an estimate of the execution time of the alternative compositions that can be exploited to solve a user's request and then choose the best one among them. We compare the performance of our algorithm with alternative strategies, showing its superior performance from a number of standpoints. In particular, we show how our algorithm can manage a higher load of requests without causing instability in the system conversely to the other strategies. When the load of requests is manageable for all strategies, our algorithm can achieve up to 75% less time spent in average to solve requests

Context and resource awareness in opportunistic network data dissemination

Opportunistic networks are challenging mobile ad hoc networks characterised by frequent disconnections and partitioning. In this paper we focus on data-dissemination services, i.e. cases in which data should be disseminated in the network without a priori knowledge about the set of intended destinations. We propose a general autonomic datadissemination framework that exploits information about the users\u27 context and social behaviour, to decide how to replicate and replace data on nodes\u27 buffers. Furthermore, our data-dissemination scheme explicitly takes into account resource constraints, by jointly considering the expected utility of data replication and the associated costs. The results we present show that our solution is able to improve data availability, provide fairness among nodes, and reduce the network load with respect to reference proposals available in the literature

Avoiding Network Performance Degradation Problem in Zigbee

ABSTRACT: Zigbee is Associate in Nursing communication customary that is intended for Associate in Nursing low rate wireless personal space network, it's less price, less complexness and low power consumption in mobile device. Among the zigbee topologies, tree topologies are appropriate for low power and low price detector network as a result of is supports for power saving operation and even for the sunshine weight routing. Zigbee tree routing is IEEE 802.15.4 customary that is employed in several resources, applications and even within the restricted device. Zigbee tree routing doesn't offer any routing table and route discovery to send the packet from supply to the destination. In Zigbee tree routing, packet follows the tree topology that because the basic limitation and it doesn't offer the optimal(correct) routing path to destination .In this paper ,we planned the road tree routing(STR) protocol to decrease the routing price of ZTR with facilitate of neighbor table and conjointly scale back the overhead. The most plan is by employing a hierarchic addressing theme, the road tree routing calculate the remaining hops from discretionary supply to destination. By victimization mathematically analysis, prove that the one hop neighbor info increase overall network performance by requiring the routing path expeditiously and distributing the traffic load targeting the tree links

Reliable on-demand routing protocols for mobile ad-hoc networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.Mobile Ad-Hoc Network (MANET) facilitates the creation of dynamic reconfigurable networks, without centralized infrastructure. MANET routing protocols have to face high challenges like link instability, node mobility, frequently changing topologies and energy consumption of node, due to these challenges routing becomes one of the core issues in MANETs. This Thesis mainly focuses on the reactive routing protocol such as Ad-Hoc On-Demand Distance Vector (AODV) routing protocol. Reliable and Efficient Reactive Routing Protocol (RERRP) for MANET has been proposed to reduce the link breakages between the moving nodes. This scheme selects a reliable route using Reliability Factor (RF); the RF considers Route Expiration Time and Hop Count to select a routing path with high reliability and have less number of hops. The simulation result shows that RERRP outperforms AODV and enhance the packet delivery fraction (PDF) by around 6% and reduces the network routing load (NRL) by around 30%. Broadcasting in MANET could cause serious redundancy, contention, and collision of the packets. A scheme, Effective Broadcast Control Routing Protocol (EBCRP) has been proposed for the controlling of broadcast storm problem in a MANET. The EBCRP is mainly selects the reliable node while controlling the redundant re-broadcast of the route request packet. The proposed algorithm EBCRP is an on-demand routing protocol, therefore AODV route discovery mechanism was selected as the base of this scheme. The analysis of the performance of EBCRP has revealed that the EBCRP have controlled the routing overhead significantly, reduces it around 70% and enhance the packet delivery by 13% as compared to AODV. An Energy Sensible and Route Stability Based Routing Protocol (ESRSBR) have also been proposed that mainly focuses on increasing the network lifetime with better packet delivery. The ESRSBR supports those nodes to participate in the data transfer that have more residual energy related to their neighbour nodes. The proposed protocol also keeps track of the stability of the links between the nodes. Finally, the ESRSBR selects those routes which consist of nodes that have more residual energy and have stable links. The comparative analysis of ESRSBR with AODV and recently proposed routing protocol called Link Stability and Energy Aware (LSEA) routing protocol revealed that the proposed protocol ESRSBR has a significantly affect the network lifetime, increases it around 10% and 13% as compared to LSEA and AODV protocols respectively. The ESRSBR also decreases the routing overhead by 22% over LSEA and by 38% over AODV.Higher Education Commission of Pakistan and NED University of Engineering and Technology Karach