WITHDRAWN: Energy optimization and reliable message communication in mobile adhoc networks using packet shifting

A Mobile Ad Hoc Network (MANET) protocol requires proper settings to perform data transmission optimally. To overcome this problem, it is necessary to select the correct routing protocol and use the routing protocol’s default parameter values. This study examined the effect of route request parameters, such as RREQ_RETRIES and MAX_RREQ_TIMOUT, on the Ad Hoc On-demand Distance Vector (AODV) protocol, which was then compared with the default AODV performance Optimized Link State Routing (OLSR) protocols. The performance metrics used for measuring performance were Packet Delivery Ratio (PDR), throughput, delay, packet loss, energy consumption, and routing overhead. The results show that the OLSR protocol has a smaller delay than the AODV protocol, while in other measurements, the AODV protocol is better than OLSR. By reducing the combination value of RREQ_RETRIES, MAX_RREQ_TIMEOUT in AODV routing to (2, 10 s) and (3, 5 s), the protocol’s performance can be improved. The two combinations result in an average increase in throughput performance of 3.09%, a decrease in delay of 17.7%, a decrease in packet loss of 27.15%, and an increase in PDR of 4.8%. For variations in the speed of movement of nodes, 20 m/s has the best performance, while 5 m/s has the worst performance.

The Ad Hoc On-Demand Distance Vector (AODV) protocol is an on-demand protocol specialized for mobile ad hoc network. Because of node's mobility and limited transmission range, the routes created by original AODV become invalid frequently leading to larger control overhead. In this paper, we propose a new scheme to improve AODV protocol by the concept of reliable distance. The reliable distance, which is always smaller than transmission range, is depended on the node's velocity and direction information attained from Global Positioning System (GPS). By the new mechanism, the routes are more reliable. Performance comparison of optimized AODV with conventional AODV by NS-2 simulator in various conditions shows the performance improvement.

Hybrid Wireless Mesh Networks (HWMNs) based on the IEEE 802.11 are being increasingly deployed as a varied network of Mobile Ad-hoc Network (MANET) to provide users with extended coverage for wireless Internet access. HWAN, however, has a problem of too wide broadcasting of the Route Request (RREQ) in the route discovery of the Ad hoc Ondemand Distance Vector (AODV) protocol. In this paper, to enhance the performance of the AODV protocol, we have transformed it into a multipath protocol and proposed a new protocol that overcomes disadvantage of AODV by composing the neighbor table for overloaded RREQ. The neighbor table is provided in the form of metric using several items including the bandwidth. This can bring the localization effect of the nodes and we can expect a performance improvement by preventing an overloaded RREQ. Through the simulation, we could confirm better performance in packet loss rate, throughput, packet delivery ratio and routing overhead than the DSR protocol and AODV protocol.

Routing protocols are fundamental in establishing linkages and communication amongst nodes in Mobile Ad-hoc Networks (MANET). Since Ad-hoc On-demand Distance Vector (AODV) protocol shuns loops and minimizes route broadcasts its predominantly utilized in MANET. This systematic review sought to uncover approaches employed in extending AODV for performance improvement in MANET, their limitations, and AODV characteristics that are extendable. Barbara Kitchenham's original guidelines (2007) guided the research, while studies were retrieved from IEEE, Science Direct, Wiley, Semantic Scholar, ACM Digital Library, EBSCOhost, and Google Scholar databases. The common approaches employed are consideration of parameters to improve quality of service, artificial intelligence and machine learning, and use of the signal strength. The limitations of the approaches can be optimized for improved performance in terms of reduced control traffic and packet loss, efficient bandwidth and memory utilization, reduced processing costs, and energy consumption. The AODV characteristics commonly extended are route discovery, selection, and maintenance. Future work could investigate clustering and zoning, and caching mechanisms approaches to enrich the reliability, performance, and efficiency of AODV protocol.

The security of wireless networks has been a constant topic in the recent years. With the advance of wireless networks, building reliable and secured communication is becoming extremely important. Wireless security is a mechanism of preventing unauthorized access or damage to computers using wireless networks. A mobile ad-hoc network (MANET) is a self-organizing system of mobile nodes that communicate with each other through wireless links with no fixed infrastructure or centralized administration. This paper presents potential security attacks on Ad-hoc On-demand Distance Vector (AODV) routing protocol and their countermeasure. IETF standardized AODV and considered as one of the most popular and promising on-demand routing protocols because of its lower network overhead and algorithm complexity. AODV protocol does not store all the routing information in its routing table and this causes potential security threat to the wireless networks. In this paper, we consider various known security attacks and in- specific blackhole attack on AODV and propose a countermeasure to thwart blackhole attack.

Now a days, mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Consumer electronic devices have evolved depending on user needs. Users want to use compact and portable devices such as cellular phones, laptop computers, Personal Digital Assistants (PDAs), etc. anywhere and at anytime to download multimedia data or to access realtime traffic. The mobile Ad Hoc networks have several salient characteristics, such as Dynamic topologies, Bandwidth-constrained, Variable capacity links, Energy-constrained operation and Limited physical security. Due to these features, mobile Ad Hoc networks are particularly vulnerable to denial of service attacks launched through compromised node. The communication in mobile AdHoc networks comprises of two phases, the route discovery and the data transmission. In a hostile environment, adversarial nodes can try to disrupt communication in both the two phases. However, consumer electronic devices generally operate on limited battery power and therefore are vulnerable to security threats like data flooding attacks. Flooding attack is a novel and powerful attack against on-demand Ad Hoc routing protocols. At present, FAP (Flooding Attack Prevention) is the single scheme proposed to resist such attack. But it may not give quality of service. In this paper, we present a Period Based Defense mechanism against data flooding attack in wireless AdHoc network. This is the new technique to defend the flooding attack. This scheme is based on the periods and uses a blacklist to efficiently prevent the data flooding attack. The main aim of this paper is to enhance the throughput of burst traffic. As a result of which, many data packets are forwarded at a high rate for the whole duration. The simulation results show that the proposed scheme enhances the throughput of burst traffic.

Mobile ad hoc network (MANET) is lacking infrastructure support, so nodes of MANET are vulnerable to attacks. Denial of Service attacks (DOS) makes network inaccessible to users. Black hole attack is a type of DOS attack, in which mischievous node claims that it has a route towards the destination node. Ad Hoc on Demand Distance Vector (AODV) routing protocol is affected by Black hole attack. The proposed solution is based on first Route Reply (RREP) caching mechanism in AODV protocol. Simulation results show performance improvement in routing protocol.

Quality of service (QoS) and security have been considered as two competent units to govern and administer end-to-end traffic across network. A mobile ad hoc network (MANET) is a type of wireless communication, every node can act as a router or base station. Secure QoS-based routing is an important problem in MANET. A hierarchical key ranking (HKR) model is presented here for secure group communications in MANETs. To enhance the security, one-to-one random mapping is performed using hash-based message authentication code (HashMAC). Due to the dynamic nature and topological changes in MANET, group safeguarding is efficiently accomplished. For secure group communication and efficient QoS routing in MANET, a sector key (SK) is shared among group members to encrypt group messages which is obtained using secured message authenticated code (SMAC). The primary design is to include the group members in sector to vigorously contribute to the security of the multicast group, as a result dropping the communication and calculating load on the source. Experimental evaluation is done to estimate the performance of the proposed secure QoS routing and communication using hierarchical key ranking [SRHKR] in MANET in terms of delivery rate, security level, delay.

Flow control, end-to-end (EED) delay, throughput, and energy consumptions are important factors of real-time and multimedia communication in mobile ad-hoc networks (MANET’s). It has a characteristic of the dynamic flow of data communication among the various users without using wired technologies. Due to this dynamic structure of MANNETS, most of its energy is consumed in route searching and packet retransmission. In addition, a problem of energy consumption may also occur due to network congestion and traffic flow control. In general, UDP is used for real-time communication but this protocol is unable to control the traffic flow properly. Therefore, a new protocol is developed for this purpose called datagram congestion control protocol (DCCP) used in those networks, which has an increasing number of multimedia traffic, and real-time flow. In this research work, major performance metrics with the issue of power usage of the TFRC and TCP like DCCP protocols are evaluated.

Multicast communication in mobile adhoc networks is challenging due to its inherent characteristics of infrastructure-less architecture with lack of central authority, limited resources such as bandwidth, time, energy and power. Many emerging commercial and military applications require secure multicast communication in adhoc environments. Moreover, mobile nodes are often power constrained so that energy conservation is also an important issue on multicast key distribution. This paper evaluates the energy conservation of a new approach of multicast key distribution called cluster based multicast tree algorithm with multicast destination sequenced distance vector routing protocol to provide reliable and efficient energy conservation of multicast key distribution. Simulation results in NS2 accurately predict the performance of proposed scheme in terms of energy consumption and end to end delay rate under varying network conditions.KeywordsMobile Adhoc NetworksMulticastKey DistributionEnergy conservation

Mobile Ad-hoc Networks (MANETs) allow mobile hosts to initiate communications with each other over a network without an established infrastructure or a central network authority. Because of this, MANETs have dynamic topologies because nodes can easily join or leave the network at any time. From a security design perspective, MANETs are vulnerable to various types of malicious attacks. As are result, Ad-hoc On-demand Distance Vector (AODV), which is one of the standard MANET protocols, can be attacked by malicious nodes. A black hole attack is one type of malicious attack that can be easily employed against data routing in MANETs. A black hole node replies to route requests rapidly with the shortest path and the highest destination sequence number. The black hole node does not have an active route to a specified destination associated with it and it drops all of the data packets that it receives. This paper proposes a mechanism that provides Secure Route Discovery for the AODV protocol (SRD-AODV) in order to prevent black hole attacks. This mechanism requires the source node and the destination node to verify the sequence numbers in the Route Request (RREQ) and Route Reply (RREP) messages, respectively, based on defined thresholds before establishing a connection with a destination node for sending the data. The simulation results using the Network Simulator 2 (NS2) demonstrate an improvement in the ratio of packet delivery for three different environments using our mechanism as compared to the standard AODV protocol.

Mobile Ad Hoc Networks (MANETs) require special management when compared to wired networks because of their hardware and energy limitations. A key concept that could help provide this management is Self-organization. Here the concentration is on typical MANET scenarios that depend heavily on the reliability of the network. Reliability is a direct cost of the overall network lifetime, i.e., energy of the nodes. In this paper a Self-Organizing AODV protocol (SO_AODV) has been developed by integrating self-organizing concepts found in Efficient Self-Organization Algorithm (EESOA) and Ad hoc On-demand Distance Vector (AODV) algorithm. SO_AODV has been compared with Traditional AODV and basic EESOA using the following metrics: network lifetime, average end to end delay, delivery ratio and convergence time. In order to appreciate the performance of the proposed SO_AODV algorithm, an implementation in the NS2 simulator is done. The observations from the simulation are: SO_AODV has better network lifetime and end to end delay than Traditional AODV and has better values of convergence time when compared to EESOA.

Vehicular Ad Hoc Networks (VANET) are key to realizing Intelligent Transportation Systems (ITS). Although VANETs belong to the class of Mobile Ad Hoc Networks (MANET), and there are numerous routing protocols for MANETs, none of these protocols are applicable for VANETs. In particular, VANETs are highly dynamic due to high speed mobility of vehicles and traditional routing algorithms for MANETs cannot deal with such dynamicity of network nodes. Several comparative studies have suggested AODV (Ad hoc On-Demand Distance Vector), a well known MANET protocol that is adaptive to dynamic changes in network and makes efficient utilization of network resources, to be the best candidate for dealing with VANETs. However, verbatim adoption of AODV is not an efficient routing solution for VANETs. Recent works therefore proposed various modifications and/or additions to AODV to make it suitable for VANETs. It is particularly important to control congestion in VANETs by efficiently dealing with the AODV "Route Request" (RREQ) packets. In this paper, we propose Pro-AODV (Proactive AODV), a protocol that uses information from the AODV routing table to minimize congestion in VANETs, yet sustains other performance metrics at acceptable levels. The novelty and elegance in Pro-AODV comes from the fact that it does not require the execution of any additional logic, it is sufficient to know only the size of the routing table at each node.

The objective of this study is to enhance the Ad hoc On-demand Distance Vector (AODV) routing protocol, a representative mobile ad hoc network environment routing protocol. In the existing AODV protocol, dynamic topology changes due to node mobility cause frequent route failures and network instability. We herein propose a local repair scheme to re-establish routes when links are broken and a dual-path routing scheme to improve network stability by employing alternate routes. After comparing the total data processing volumes, average packet end-to-end delays, numbers of connection pairs, energy consumptions, and numbers of generated packets of the enhanced AODV protocols, we discuss the optimal operating conditions for each scheme. We also investigated the performance variations resulting from changing the number of nodes and node mobility, using an NS-2 simulator. The results revealed that the dual-path protocol generally performs the best and improves the packet end-to-end delay by up to 45 %.

This paper presents a resilient routing algorithm that is more suitable for a Mobile Ad Hoc Network (MANET) with node quick moving or node sparse, than traditional routing algorithms such as Ad-hoc On-demand Distance Vector (AODV) routing. Since AODV routing in MANETs is known for its advantageous properties, the proposed routing algorithm is based on the AODV, and called RAODV (Resilient AODV). In the route discovery phase, it differs from AODV, which only establishes one routing path from a source node to the destination node, whereas RAODV establishes as many routes as possible. Thus, when the primary route breaks, the node can immediately adopt an alternative route without further route research effort. If no possible alternative route exists, the node will transmit the route break information backward to instruct the previous node on the reverse route to select an alternative one, and so on. The proposed RAODV can reduce the number of route rediscovery procedures, and thus improve the packet loss rate and transmission delay, especially in sparse MANETs. Simulator ns2 was used to evaluate the performance of RAODV. In some cases, the proposed RAODV was able to reduce the packet loss rate by 72.61% compared to traditional AODV.