A game theoretical framework for dynamic pricing-based routing in self-organized MANETs

The system in which wireless device self configure, establish and communicate from one end to the other using wireless channel with no existing fixed network is known as Mobile ad hoc network (MANET). The MANET is another varient of Ad-hoc network, which creates short-lived network using wirelss mobile devices. In ddition to MANET, the behaviour of this kind of temporary networks depends on routing protocols. The large number of routing techniques has been presented in the literature, but it is also been stated that routing is one of the key research issue even till today. This research article examines the performance of nature inspired algorithm such as Petal Ant Routing (PAR) with classical based routing such as Dynamic source routing in MANET. The simulation of both routing is carried using Network Simulator (NS2 version 2.35) and evaluted for different network parameters.

Inter-domain routing is an important component to allow interoperation among heterogeneous network domains operated by different organizations. Although inter-domain routing has been well supported in the Internet, there has been relatively little support to the Mobile Ad Hoc Networks (MANETs) space. In MANETs, the inter-domain routing problem is challenged by: (1) dynamic network topology due to mobility, and (2) diverse intra-domain ad hoc routing protocols. In this paper, we discuss how to enable inter-domain routing among MANETs, and to handle the dynamic nature of MANETs. We first present the design challenges for inter-domain routing in MANETs, and then propose a framework for inter-domain routing in MANETs.

Infrastructure and ad hoc network architectures are the two major architectures that can use wireless networks. Unlike infrastructure architecture using the centralized base station, mobile ad hoc network (MANET) is an infrastructure-less architecture which can be connected without any centralized control. In MANET, a mobile device can be connected with another device within the appropriate radio range that is typically 30 MHz to 5 GHz. Therefore, MANET is considered as a self-organizing network where each node acts as a participant and a router. Sector-based routing is a method in MANET which can be used to separate the positions of every node in a network topology. In addition, a specific node called server node can be assigned among the nodes in each sector. The server node is responsible to reserve the path resources and to maintain the information for its associated nodes and links. The performance of sector-based routing depends on the number of nodes available in the sector. Further, the routing approach in sector-based MANET can be considered in various scenarios using server nodes. Our research in this paper is to evaluate the efficiency of the sector-based routing in MANET considering several scenarios. Further, we address the variation of the performance while the number of nodes changes with several routing methods in sector-based MANET. In this paper, we investigate the detailed simulation experiments on a different number of nodes and various scenarios of sector-based routing in MANET. Our findings are as follows. (1) The average collision rate is significantly lower in sector-based routing when compared to MANET. (2) The resource efficiency in sector-based routing is considerably higher. (3) Unlike in a small number of nodes, the higher number of connections can be allowed in a high number of nodes distributed in a sector.KeywordsMANETSector-based routingServer nodeResource efficiency

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.

Due to the high mobility of nodes in the dynamic topology of Mobile Ad Hoc Networks (MANETs), it is challenging to define the precise position of a node in the network for effective data delivery. The paperproposed a hybrid algorithm for routing in MANETs called Adaptive GPSR with Dynamic Thresholds (AGDT). AGDT is a novel approach that combines the GPSR routing protocol with a dynamic threshold-based approach to increase the enactment of the network. The algorithm employs distance and direction-based thresholds to determine when to switch between GPSR and a perimeter-based approach for routing. The paper discusses the implementation of the algorithm and provides a performance evaluation of its effectiveness in comparison to other present routing algorithms. The results show that AGDT outperforms other protocols in terms of packet delivery ratio, end-to-end delay, and throughput. The paper concludes by highlighting the potential applications and benefits of the AGDT algorithm in MANETs.

MANETs (Mobile ad hoc networks) are overloaded with their heavy usage choking traffic. Recent studies have been attempting to find feasibility of routes in these networks. Most proposed schemes have failed to consider the network traffic or MANET requirements. MANET routing done by RPs (Routing Protocols) would perform better when they adhere to QoS (Quality of Service) or application requirements. As a result, RPs must satisfy numerous QoS metrics at a time where soft computing algorithm based RPs are a solution to QoS routing problems. Evolutionary algorithm based routing do not achieve enough energy efficiency which is a major drawback. To overcome this drawback, this work, proposes Red Deer algorithm (RDA) based energy efficient QoS routing for MANETs called (RDA-EQRP). The proposed RDA based routing algorithm discovers the shortest path from a source to a destination which can consumes less energy while supporting the metrics such of reliability, bandwidth, SRC (Static Resource Capacity), Quality and delay. Simulation results show that proposed rotting scheme RDA-EQRP consumes lesser energy in MANET routing.

Applications of mobile ad hoc networks (MANETs) have gained increasing popularity among different areas of human life and significantly attracted the attention of the researchers in this field. Routing in a MANET plays the vital role in its real-world application. Further, routing in MANET is associated with a set of issues that need to be addressed before its implementation. The issues include satisfaction of specified quality of service (QoS) requirements and security issues. In this paper, we have addressed security issues as our point of focus. Again, security issues can be addressed using various algorithms and out of all, evolutionary technique-based algorithms appear to be more effective for the purpose. Ant colony optimization (ACO) is one of the most popular evolutionary algorithms for optimization. We have carried out an extensive review of ant colony optimization (ACO)-based secure MANET routing protocols and the contents of this paper can help researchers in the field of MANET to devise secure routing protocols, especially using ACO algorithm for addressing the security issues in a MANET.

Mobile ad hoc networks (MANETs) are infrastructureless and distributed communication systems that require sophisticated approaches to routing to cope with node mobility and heterogeneous application requirements. In the past few years, distributed hash table (DHT) has come forth as a useful additional technique to the design and specification of spontaneous and self-organized networks. Researchers have exploited its advantages by implementing it at the network layer and developing scalable routing protocols for MANETs. The implementation of DHT-based routing in a MANET requires different algorithms and specifications compared to routing in the Internet because a MANET has its unique characteristics, such as node mobility, spontaneous networking, decentralized architecture, limited transmission range, dynamic topology, and frequent network partitioning/merging. In this article, we present a comprehensive survey of research related to DHT-based routing that aims at enhancing the scalability of MANETs. We present a vivid taxonomy of DHT-based routing protocols and the guidelines to design such protocols for MANETs. We compare the features, strengths, and weaknesses of existing DHT-based routing protocols and highlight key research challenges that are vital to address. The outcome of the analysis serves as a guide for anyone willing to delve into research on DHT-based routing in MANETs.

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.

Mobile ad hoc networks (MANETs) routing is a very challenging task because of the dynamic nature of the network. The linking of provisional communication assures based on the infrastructure of MANET, however, there is no centralised monitoring process for making the routing in MANETs in terms of trust and security. Therefore, the stability routing is not considered, which may break easily in dynamic MANETs. Thus, this paper introduces a trust-based secure routing protocol using the proposed atom whale optimisation algorithm (AWOA), which is the trust-aware routing protocol. The developed atom whale optimisation is utilised to select the optimal route with respect to the trust factors, like average encounter rate (AER), and successful cooperation frequency (SCF), integrity factor, and the forwarding rate. Moreover, secure routing is performed between the nodes using the proposed AWOA. The AWOA is the integration of atom search optimisation (ASO), and whale optimisation algorithm (WOA) that inherits the faster global convergence. The fitness function is newly modelled considering mobility, and trust factors. The proposed AWOA outperformed other methods with a minimal end-to-end delay of 0.0083 sec, maximal packet delivery ratio (PDR) of 97.73%, and the maximal throughput of 85.05% respectively.

Emergent Intelligence Based QoS Routing in MANET

A mobile ad hoc network (MANET) is a wireless network without any fixed infrastructure or centralised control of homogeneous mobile nodes which are battery powered. In this research paper, we proposed new routing algorithm named energy saver path routing algorithm using optimised link state routing (ESPR-OLSR) protocol for energy efficient routing in MANET. This ESPR-OLSR algorithm takes minimum energy to find the path between source to destination using high potential score edge node selections. This potential score calculation is based on the distance calculation, direction of motion identification and link stability. The same procedure execute until it reaches the destination and also hop1, hop2 and so on. Finally, adjusting the parameter after using ESPR-OLSR algorithm provides better performance compared to ordinary OLSR protocol and also increased throughput with number of node and transmission range also increased, reduced end-to-end delay, reduced transmission power to finding path between source to destination, ESPR-OLSR is reduced overhead with number of node is increased compare to ordinary OLSR and ESPR-OLSR has increased mobility than OLSR.

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.

ViSim: A user-friendly graphical simulation tool for performance analysis of MANET routing protocols

A mobile Ad Hoc network (MANET) is made of mobile nodes connected to each other via wireless links. The nodes function both as routers and as host devices, so routing protocols are necessary. They generate additional stream of control packets - the overhead. It can be reduced by controlling the request and response zones of Ad Hoc network nodes. In this paper, the method for routing in MANET is proposed, which operates by controlling the request and response zones of network nodes during the route search process in order to reduce the routing overhead and network load1. The method consists of Signal level Restricted Flooding (SRF) algorithm, the location-based routing and the Request Zone Minimization (RZM) algorithm. The simulations of the routing algorithms have been performed and the results are presented in the paper.