Maximum lifetime routing in wireless ad-hoc networks

In this paper, we address the problem of multicast routing in mobile ad-hoc networks from the viewpoint of energy efficiency. In an ad-hoc wireless network, each node runs on a local energy source which has a limited energy life span. Thus, energy conservation is a critical issue in mobile ad-hoc networks. One approach for energy conservation is to establish routes that require lowest total energy consumption. This optimization problem is referred as the minimum-energy multicast routing problem (MEMRP). In this paper, propose new efficient heuristic algorithms for the construction of energy-efficient multicast routes in mobile ad-hoc networks. These algorithms exploit the broadcast nature of the wireless channel, and address the need for energy-efficient operations. Empirical studies show that our algorithms are able to achieve better performance than algorithms that have been developed for MEMRP.

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

Link state has been the dominating IGP routing technology in IP networks for more than a decade. With the advent of wireless ad-hoc networking, the need for light, efficient and robust routing makes it a good candidate to be also used in this constrained environment. One of the key issue in ad-hoc networking is the lack of bandwidth. Thus, in this paper we examine the overhead due to link state routing in an ad-hoc network. More precisely we study the classic link-state protocol OSPF and OLSR, a link state protocol that was developed specifically for ad-hoc networks. Further, we study how this overhead evolves when the node density increases. The last part of the paper presents directions towards extending OSPF for wireless and ad-hoc networks, which would make it a favorite to seamlessly unify wired and mobile IP networks.

A mobile ad hoc network (MANET) consists of a group of mobile nodes (MNs) that communicate with each other without the presence of infrastructure. The wireless mobile hosts communicate in a multihop fashion. In multi-hop wireless ad-hoc networks, designing energy-efficient routing protocols is critical since nodes have very limited energy, computing power and communication capabilities. For such protocols to scale to larger ad-hoc networks, localized algorithms need to be proposed that completely depend on local information. Hence, here introduce a protocol to handle multihop situations known as Energy Efficient Location Based Routing Protocol for MANETs (EELBR) that is based on Location Aided Routing. EELBR 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 are significantly reduced. Developing a method to adaptively use one of the forwarding methods of the position-based routing protocol based on the surrounding environments, and dividing the network into a number of areas that varies dynamically based on the node mobility pattern. Then, show through analysis and implementation that it outperforms most of other protocols currently used in practice under various networks.

The unique characteristics of a mobile ad hoc network (MANET), such as dynamic topology, shared wireless medium and open peer-to-peer network architecture, pose various security challenges. This paper compares three routing protocols, DSDV, DSR, and AODV under security attack where two types of node misbehaviour have been investigated. Network performance is evaluated in terms of normalized throughput, routing overhead, normalized routing load, and average packet delay, when a percentage of nodes misbehave. Simulation results show that although the performance of all three routing protocols degrades, DSDV is the most robust routing protocol under security attacks. This reveals that a proactive routing protocol has the potential of excluding misbehaving nodes in advance and reducing the impact of security attack.

Worldwide Interoperability for Microwave Access (Wimax) is power station through which mobile network, commonly known as A Mobile Ad-hoc Network (MANET) is used by the people. A MANET can be described as an infrastructure-less and self-configure network with autonomous nodes. Participated nodes in MANETs move through the network constantly causing frequent topology changes. Designing suitable routing protocols to handle the dynamic topology changes in MANETs can enhance the performance of the network. In this regard, this paper proposes four algorithms for the routing problem in MANETs. First, we propose a new method called Classical Logic-based Routing Algorithm for the routing problem in MANETs. Second is a routing algorithm named Fuzzy Logic-based Routing Algorithm (FLRA). Third, a Reinforcement Learning-based Routing Algorithm is proposed to construct optimal paths in MANETs. Finally, a fuzzy logic-based method is accompanied with reinforcement learning to mitigate existing problems in FLRA. This algorithm is called Reinforcement Learning and Fuzzy Logic-based (RLFLRA) Routing Algorithm. Our proposed approaches can be deployed in dynamic environments and take four important fuzzy variables such as available bandwidth, residual energy, mobility speed, and hop-count into consideration. Simulation results depict that learning process has a great impact on network performance and RLFLRA outperforms other proposed algorithms in terms of throughput, route discovery time, packet delivery ratio, network access delay, and hop-count.

Mobile ad hoc networks (MANETs) are dynamic wireless networks that have no fixed infrastructures and do not require predefined configurations. In this infrastructure-less paradigm, nodes in addition of being hosts, they also act as relays and forward data packets for other nodes in the network. Due to limited resources in MANETs such as bandwidth and power, the performance of the routing protocol plays a significant role. A routing protocol in MATET should not introduce excessive control messages to the network in order to save network bandwidth and nodes power. In this paper, we propose a probabilistic approach based on Bayesian inference to enable efficient routing in MANETs. Nodes in the proposed approach utilize the broadcast nature of the wireless channel to observe the network topology by overhearing wireless transmissions at neighboring nodes in a distributed manner, and learn from these observations when taking packet forwarding decision on the IP network layer. Our simulation results show that our routing approach reduces the number of control message (routing overhead) by a ratio up to 20 % when the network size is 60 nodes, while maintaining similar average route establishment delay as compared to the ad-hoc on demand routing protocol.

Mobile Ad hoc Networks (MANETs) is a type of wireless ad-hoc network which is a self-arranging network of mobile nodes connected by wireless links which creates a discretionary topology. The mobile nodes are free to move randomly and to arrange themselves in a random manner. Thus, the wireless ad hoc network topology may expand rapidly and unpredictably. In Mobile Adhoc networks, the routing protocol plays an important role in improving Quality of Service (QoS). There are many different types of routing protocols such as reactive, proactive and hybrid. The AODV is a reactive routing protocol which establishes routes on-demand, as they are needed. In this paper, we described a new protocol based on the AODV which gives better performance than the original AODV routing protocol with respect to set of performance metric such as a packet delivery ratio, throughput, energy consumption and overhead, under different conditions. The proposed routing protocol Modified Ad-Hoc On-Demand Distance Vector (M-AODV) describes that the new operation for routing path reconstruction should be made from the source. It also explains a new method for identifying multiple disjoint routes. Performance analysis of routing protocol designed for wireless networks has been very challenging. Hence, simulations are always utilized to obtain the desired performance results. Simulations were performed by Network Simulator (NS2).

In recent years, with the increasing popularity of Internet technology and the advent of the 5G communication era, the applications related to mobile IoT have exploded, and wireless Ad Hoc network has received more and more attention. In traditional Ad Hoc networks, data are often transmitted between nodes in the form of "multi-hops", and the transmission range and available energy of nodes are limited. Thus, in Ad Hoc networks, a reliable and energy-efficient data transmission protocol is needed. In this paper, we studied the existing multipath routing protocols and proposed a multiple performances based routing protocol E <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> LR, ( residual Energy, Energy consumption, Loop, Routing protocol ) for the shortcomings of Ad Hoc networks. This protocol has the following improvements to the existing multi-path routing protocols: (1) In the route discovery process, depending on the energy level of the nodes, the nodes make three different decisions on the received RREQ packets: discard, randomly delayed forwarding, and immediate forwarding, to filter out the nodes with lower energy and thus improve the network performance. (2) When selecting available paths, try to select nodes whose lifetime are close to each other. This can reduce the number of interruptions in the transmission path and improve the stability of the transmission path during data transmission. (3) When transmitting data, multiple paths stored in the source node are recycled to transmit data, thus balancing the node energy. Simulation results show that the E2LR routing protocol can effectively reduce the frequency of route initiation, shorten the data transmission delay, reduce the packet loss rate in the network compared with existing multipath routing protocols.

An ad-hoc Wireless Local Area Network (WLAN) is a network without infrastructure connectivity where different types of hosts (nodes) exist; such as PDAs (personal digital assistants), laptops and cellular phones. These nodes are equipped with short range transmitters and receivers, and antennas which may be Omni directional (broadcast), highly directional (Point-to-point), or a combination of the two. A Mobile Ad hoc Network (MANET) is a collection of mobile hosts that move in different directions and speeds without the need to maintain connectivity with existing network infrastructure. Different routing protocols have been designed since the existence of ad hoc networks. This work presented below proposes a new routing protocol for ad hoc networks which aims to reduce network overhead, power consumption, Multi-user Interference (MUI), and provide link reliability. In recent years, a vast research has been seen going on in the field of Mobile Ad Hoc Networks (MANETs). Due to limited resources in MANETs, to design an efficient and reliable routing strategy is still a challenge. An intelligent routing strategy is required to efficiently use the limited resources. Also the algorithms designed for traditional wired networks such as link-state or distance vector, does not scale well in wireless environment

Power-aware routing has proven to be effective in maximizing the life time of ad-hoc networks. However, all the previous research focused on the power-aware routing algorithms in a cooperative network, where all the nodes honestly report battery usage. However, selfish nodes in ad-hoc networks have incentives to misreport lower residual energy to maximize their own usage. In this paper, we first show that it is a dominant strategy for a selfish node to report lower residual energy in a power-aware ad-hoc network, which diminishes the benefits of power-aware routing algorithms. We then propose a novel power-aware reputation system (PARS), to stimulate cooperation on power-aware routing in ad-hoc networks. Analysis and simulation results show that PARS is effective in supporting power-aware routing in selfish ad-hoc networks.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Many existing studies just considered that nodes in a Mobile Ad Hoc NETwork (MANET) would fully cooperate to forward packets for one another. However, this assumption does not hold in many scenarios. The node selfishness in relay cooperation will certainly influence the overall performance of routing in MANETs. In this work, we investigate the energy-aware routing problem in MANETs with nodes' selfishness. We model the situation of node cooperation in energy-aware routing by using game theory. We consider the competitive and cooperative relationship between the nodes to formulate the game for MANETs. An incentive mechanism is given in order to encourage forwarding cooperation during energy-aware routing. Nodes are encouraged to forward more data packets for others in order to acquire more services from others. We also carry out a simulation for the proposed method and perform detailed analysis in this work. From the results of the simulation, we argue that it's possible to find out a suitable configuration for a MANET to support more efficient energy-aware routing through our method.

The year 2005 witnesses the third occasion that the Wireless Personal Area and Ad-hoc Networks minitrack is part of the annual HICSS conference. This year there was a substantial increase in submissions (thus a substantial decrease in the acceptance rate), indicating the growing importance of research in this area. The minitrack is also focused on fundamental challenges and issues arising in wireless sensor networks and their applications. Wireless sensor networks differ from other wireless networks in the need for unattended and very low-energy operation, in the possibility of collaboration and distributed sensor calibration, and in the mission oriented nature of most sensor networks. Thus our mini track looks at two very important streams of research. After a strict review process nine papers were selected to be included in the program of the minitrack. The first paper is titled “BT-Crowds: Crowds-style Anonymity with Bluetooth and Java,” presenting an interesting idea on how anonymity can be achieved when sending messages in WPAN environments. Our second paper revisits scatternet formation issues of Bluetooth based ad hoc networks thus the title: “A Dynamic and Distributed Scatternet Formation Protocol for Real-life Bluetooth Scatternets.” The third paper is titled “Secure Dynamic Source Routing” and presents a new variant of the DSR routing protocol with special emphasis on security. In the fourth paper, the discussion concerns “Routing Based Feedback towards Applications in Mobile Ad Hoc Networks,” where routing notifications are relayed via event channels. “A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks” is the title of the fifth paper in the minitrack. It presents some innovative ideas on how location information can be managed for multicast communications in ad-hoc networks. In the sixth paper, “Sliding Window Protocol for Secure Group Communication in Ad Hoc Networks,” the authors propose a sliding window protocol for determining multiple routes in a multi-communications environment. In the seventh paper titled “Ad Hoc Routing Protocol Avoiding Route Breaks Based on AODV,” the authors propose improvements to the well-known AODV ad hoc routing protocol The eight paper, “Joint Scheduling and Routing Algorithm for Ad Hoc Wireless,” presents an innovative and interesting idea wrapped around an iterative algorithm on power control. In the final paper of the minitrack, “Performance Issues of Ad Hoc Routing Protocols in a Network Scenario used for VideoPhone Applications,” the authors present a simulation based performance analysis of different ad hoc routing protocols using the application pointed to in the title. These papers highlight some of the issues and work towards solutions in Personal Area and ad hoc networks which are among the most active research fields in wireless networking. We believe that the papers will provide opportunities for researchers to come together and discuss and debate the results of the interesting experiments that are described in the papers. We are confident that the minitrack will achieve its goal of bringing together leading researchers, to present new results and discuss synergies between the two areas. We also take this opportunity to thank all the reviewers for their valuable and professional work as well as all the authors who submitted papers and thus helped us to create such a strong minitrack. We would also like to express our sincere gratitude to the conference organizers for their hard work and help.

Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. There are two types of MANET, homogeneous and heterogeneous MANET. An architecture has been designed in previous work to model these two types of MANET. Three scenarios have been defined from this architecture: scenario I (communication entirely within MANET, homogeneous MANET), scenario II (communication between MANET and wireless LAN, heterogeneous MANET) and scenario III (communication between MANET with wireless LAN and wired LAN, heterogeneous MANET). MANET has its own routing protocols which can compromised with frequent route exchange, dynamic topology, bandwidth constraint and multi-hop routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET. The aim of this research is to assess the effects of different packet size with the implementation of AODV routing protocols in homogeneous and heterogeneous MANET through the simulation method. The three scenarios above have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned, throughput and packet delivery ratio (PDR). The tests show that the increase of throughput and PDR performance was parallel with the increase of packet size. From the test also, we can conclude that the performance due to the packet size effect in homogeneous MANET is better than in heterogeneous MANET.