Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network

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

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.

ZhuJi,WeiYuandK.J.RayLiu,Fellow, IEEE Abstract—In self-organized mobile ad hoc networks (MANETs) where each user is its own authority, fully cooperative behaviors, such as unconditionally forwarding packets for each other or honestly revealing its private information, cannot be directly assumed. The pricing mechanism is one way to provide incentives for the users to act cooperatively by awarding some payment for cooperative behaviors. In this paper, we consider efficient routing in self-organized MANETs and model it as multi-stage dynamic pricing games. A game theoretical framework for dynamic pricing-based routing in MANETs is proposed to maximize the sender/receiver’s payoff by considering the dynamic nature of MANETs. Meanwhile, the forwarding incentives of the relay nodes can also be maintained by optimally pricing their packet-forwarding services based on the auction rules and introducing the Cartel Maintenance enforcing mechanism. The simulation results illustrate that the proposed dynamic pricing-based routing approach has significant performance gains over the existing static pricing approaches.

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.

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.

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.

Routing in Mobile Ad Hoc Networks (MANETs) is critical. As such, there are many routing protocols that have been proposed over the years. Each routing protocol has weaknesses and strengths. Currently, much of research on routing protocols in MANETs concentrates on literature reviews, performance comparison and proposition of new protocols. However, there has been very little or no attempt to examine the possibility of combining several routing protocols for effective routing in MANET. By highlighting the characteristics, strengths and weaknesses of eight routing protocols selected from the Flat Routing, Hierarchical/hybrid Routing, and Geographical Position Assisted Routing protocols, this article attempts to establish whether different routing protocols in MANETs can be combined for effective routing. A hypothetical situation that uses a combined Zone Routing Protocol (ZRP) and Location-Aided Routing (LAR) for cluster networking is used for the sake of the proposition. This paper refers to such protocol as ZRP-LAR driven. According to the findings from the literature review on MANETs routing protocols, this study establishes that it is possible to combine more than one routing protocols in MANETs to achieve effectiveness in packets transmission.

Mobile ad-hoc networks (MANETs) are decentralized and self-organizing communication systems. They have become pervasive in the current technological framework. MANETs have become a vital solution to the services that need flexible establishments, dynamic and wireless connections such as military operations, healthcare systems, vehicular networks, mobile conferences, etc. Hence it is more important to estimate the trustworthiness of moving devices. In this research, we have proposed a model to improve a trusted routing in mobile ad-hoc networks by identifying malicious nodes. The proposed system uses Reinforcement Learning (RL) agent that learns to detect malicious nodes. The work focuses on a MANET with Ad-hoc On-demand Distance Vector (AODV) Protocol. Most of the systems were developed with the assumption of a small network with limited number of neighbours. But with the introduction of reinforcement learning concepts this work tries to minimize those limitations. The main objective of the research is to introduce a new model which has the capability to detect malicious nodes that decrease the performance of a MANET significantly. The malicious behaviour is simulated with black holes that move randomly across the network. After identifying the technology stack and concepts of RL, system design was designed and the implementation was carried out. Then tests were performed and defects and further improvements were identified. The research deliverables concluded that the proposed model arranges for highly accurate and reliable trust improvement by detecting malicious nodes in a dynamic MANET environment.

Recently developments in the field of telecommuni-cations and network technology has been formed new paradigm shift in defense weapon system. The military also developing the Tactical Information Communication Network (TICN) system to meet the changing aspects of these wars. To equip its function from the battlefield, TICN system have to be received real-time information from the battlefield troop, and the key technologies that support these features is MANET (Mobile Ad-hoc Network) routing protocol. In this paper, basis on the tactical environment of small combat units, by studying on the MANET routing protocol that can be transmitted in real time & reliable information, suggest efficient routing protocol in tactical MANET that can be applicable to advanced digital battlefield.

The Routing Approaches in Mobile Ad-hoc Network have almost entered the saturated arena. But still there are available options of perfection in this meadow. The task of improving the clustering technique is one of the fields which is under rated as a research topic for further improvement of routing. Clustering based MANET routing protocols, which are popular in terms of efficiency, simplicity and usability mostly use circular based clustering techniques. And the election of cluster head is done through the use conventional approaches. This particular paper is mainly focused to launch a new-fangled clustering technique through which it is possible to improve the routing performance of existing protocols. Another important aspect of this paper is to provide a cluster head selection algorithm which can effectively maintain the clusters and provides more stability. Proposed clustering idea is useful for geographically related nodes effectively in different turf of routing. To maintain the clusters and their stability, it provides a new idea to select cluster head within the cluster, also the election of secondary cluster head for avoiding further election immediately after the unavailability of primary cluster head. This idea is evaluated in network simulator and it outperforms the existing clustering techniques.

Hierarchical multicast techniques and scalability in mobile Ad Hoc networks

?????? ???????????? ?????? ??? ???????????? ????????? ??????????????? ?????? ??????????????? ????????? ???????????? ????????? ???????????????, ???????????? ????????? ??????????????? ????????? ????????? TICN(Tactical Information Communication Network)????????? ??????????????? ???????????? ?????? ?????? ??????. TICN????????? ??? ????????? ????????? ???????????? ????????? ????????? ??????????????? ????????? ?????? ???????????????????????? ?????? ????????? ?????????, ????????? ????????? ????????? ?????? ????????? ???????????? ????????? ?????? MANET(Mobile Ad-Hoc Network) ????????? ??????????????????. ??? ??????????????? ?????? MANET ????????? ?????????????????? ?????? ???????????? ???????????? ?????? ????????? ?????????????????? ????????? ?????? ???????????? ????????????, ????????? ??????????????? ??????????????? ????????????, ?????? ???????????? ????????? ??????, ????????? ?????? ?????? ???????????? ????????? ???????????? ????????? ?????? ????????? ??????????????????, ????????? ?????? ????????? ??????????????? ?????? ?????? ??? ?????? ???????????? ?????? MANET ????????? ??????????????? ????????? ????????? ??????.

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

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.

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.