Content uploaded by I. Sasase
Author content
All content in this area was uploaded by I. Sasase on Apr 07, 2014
Content may be subject to copyright.
A preview of the PDF is not available
Gateway discovery algorithm based on multiple QoS path parameters between mobile node and gateway node
Abstract and Figures
Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with the maximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.
Figures - uploaded by I. Sasase
Author content
All figure content in this area was uploaded by I. Sasase
Content may be subject to copyright.
... Gateway discovery algorithm was proposed (2012) [21] based on several QoS link metrics between the node and gateway. In this algorithm, the route accessibility improved by introducing the feedback system to the updated route dynamics to the traffic source. ...
... A gateway selection structure is suggested that deliberates multiple QoS path constraints such as existing latency and capacity, path availability period, and choosing probable gateway node. This research advances the availability of path, computation accuracy, and the feedback system for rationalized path dynamics to traffic source nodes [9]. Multipath routing is measured to be a hard task and the correspondence between the letdowns of the paths in a path set has to be as minor as possible. ...
MANET is a set of nodes that communicate with each other directly or indirectly. The nodes in MANET can be moved freely. The dynamic nature of the network makes several challenges. One of the challenges in routing is to transfer the data from the start node (source) to the end node (destination). Routing suffers from several metrics such as power-consuming, delay, packet delivery ratio, etc. This paper proposed a new protocol called the Lion Optimization Routing protocol (LORP) based on the lion algorithm and AODV protocol. This protocol uses the Lion Optimization Algorithm to select the optimal path. Firstly, we use lion optimization to select the optimal path using the LOA maximization algorithm depending on three main metrics Power Efficiency, Throughput, and Packet Delivery Ratio. Secondly, we use the LOA minimization algorithm to select the optimal path using two metrics Delay and Short Path. In LOA Maximization algorithm metrics calculated and choose the max path value. The result of this protocol is compared with AODV, DSR, and ANTHOCNET.
... 3) Link duration: L(m, n) represents the link duration between the current OIF node m and the neighbor node n [19]. R represents the transmission range of node. ...
Vehicular named data networking (VNDN) has the data-centric and in-network caching advantages that are in line with the requirements of multi-hop content retrieval in vehicular ad hoc networks (VANETs). Some current restrictive forwarding strategies utilize single-path forwarding to mitigate the Interest broadcast storm in VNDN. However, these strategies do not provide any reliable mechanism for Interest and Data forwarding to address the problem of low performance caused by the dynamic and unreliable VANETs communication environment. In this paper, we propose a packet forwarding strategy based on optimal and backup (PFOB) for VNDN. For Interest, PFOB establishes a single-path forwarding with high reliability and reachability by increasing the signal strength and node-degree criterion and retransmission mechanism. For Data, PFOB provides a reliable multi-path backup forwarding mechanism without additional network overhead. Simulation results show that PFOB can effectively improve the Interest satisfaction ratio, reduce the number of application retransmissions, and reduce the Interest satisfaction delay compared to the current strategies.
... Given S (source node) and D (destination node) in a network G(V, E), in which each link is associated with a 1: P 0 ← Randomly generated initial population 2:P 0 ← φ; κ ← 0 //P 0 is External population 3: if P κ m(i ) ∈ p(m(P κ )) then 4: pos_of_cross ← A random number between 1 & length 10: site_of_cross ← A random number between 1 & 2 11: l ← 0, u ← 0 12: if site_of_cross = 1 then 13: l ← 0, u ← pos_of_cross 14: else 15: l ← pos_of_cross, u ← length 16: end if 17: for j ← l to u do 18 ...
For efficient communication among vehicles or infrastructure, an effective routing protocol for Intelligent Transportation Systems is profoundly required. Because of high mobility and recurrent topology deviations of Vehicular Ad-hoc Networks (VANets), finding a linked route with adequate delay is an important challenge with many limits and hitches. To overcome this, an efficient multimetric routing protocol is proposed here for Intelligent Transportation Systems. The proposed protocol considers five metrics - Link Capacity, Connectivity, Euclidean Distance, Relative Velocity and End-to-End Delay. The aim of the proposed method is maximizing the Packet Delivery Ratio (PDR) while minimizing the delay of the network. It tries to identify the path that has minimum delay, distance and relative velocity with maximum bandwidth and V2V connectivity. For this, the protocol adopts Strength Pareto Evolutionary Algorithm (SPEA) to optimize the five metrics and calculate the fitness value. Then the fitness value is used to find out the optimal path using a novel path finding algorithm for efficient data delivery to the target destination. Extensive simulation outcomes disclose that the proposed strategy shows an improvement of 6% in PDR, 11% in end-to-end delay and 2% improvement in hop-count as compared to the recent similar method.
Vehicular Named Data Networking (V-NDN) is promising to improve the content delivery efficiency in Vehicular Ad Hoc Networks (VANETs). However, the potential broadcast storm caused by Interest packet flooding and return path failures caused by vehicle mobility can significantly degrade the content delivery performance. Existing forwarding strategies based on outdated position information cannot address these issues well. In this paper, we propose a novel
predictive forwarding strategy
(PRFS) for V-NDN. In PRFS, Long Short-Term Memory (LSTM) is employed to amend the NeighBor Table (NBT) for preciser neighboring vehicles' positions. In addition, the next-hop forwarder is selected among the neighbors, taking into account the link reliability and the Distance along the Road (DR) in both directions. Furthermore, a new mechanism is designed to notify the selected next-hop forwarder by embedding the forwarder identity in the Interest packet header, so as to accelerate the forwarding process. Finally, extensive simulations are carried out, and experimental results demonstrate that PRFS can reduce the number of forwarded Interest packets and data packets by 21.29% and 25.75%, respectively, and improve the success ratio of satisfied Interest packets by 35.1% compared to the existing baseline algorithms.
Unmanned Aerial Vehicles (UAV) have been widely used both in military and in civilian applications. However, the cooperation of small and mini drones in a network is capable of further improving both the performance and the coverage area of UAVs. Naturally, there are numerous new challenges to be solved before the wide-spread introduction of multi-UAV based heterogeneous Flying Ad Hoc Networks (FANET), including the formulation of a stable network structure. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
This research aimed at creating robust and efficient operation in mobile ad-hoc networks (MANETs) by incorporating energy efficient routing technique. MANETs are energy constrained. The Energy Skilled Ad-hoc on Demand Distance Vector (ESAODV) with Priority-Based Weighted Fair Queue (PBWFQ) routing scheme was developed and compared with Destination-Sequenced Distance-Vector (DSDV) with First-In-First-Out (FIFO) routing techniques using NS-3 (Network-simulator). WireShark Network Analyzer was used for file tracing and analysis of the simulation results in NS-3. The optimized technique significantly reduced the control traffic and packets congestions by lowering the end-to-end delay to an average of 25 X 10-3 s in a 50-100 nodes MANET. ESAODV-with-PBWFQ maintained throughput of 78.8 X 10 3 pps. The technique met target Packet Delivery Ratio with 98.7% accuracy. ESAODV-with-PBWFQ saved 80-90% energy compared to DSDV-with-FIFO in 80-100 nodes dense MANET. In 50-70 nodes sparse MANET 70-75% less consumption of energy in ESAODV-with-PBWFQ compared to DSDV-with-FIFO.
Mobile Ad-hoc Network (MANET) is a self-configuring network depending upon infrastructure, also is a significant technology which supplies virtual hardware and software resources as per requirement of mobile ad hoc network. The Intrusion Detection System (IDS) has been established to protect Cross Interior (routing) at source to goal from different types of attack. Current IDS approaches can be classified as either anomaly or signature-based methods such as Rule-based expert systems, State transition analysis, Bayesian alarm networks aspects are various challenges with respect to the efficiency as well as performance. The major challenge is the compromise of performance because of unavailable resources with respect to the MANET. To increase the MANET environment’s performance, various techniques are employed for routing, security purpose. An efficient security module requires a routing in terms of packet loss. The Integrated Cross Interior (ICI) structure for Intrusion Detection System (IDS) namely ICIs for IDS are proposed for exactness of black hole attacks detection. The ICIs for IDS performs the task of routing of the mobile nodes. The proposed (ICIs for IDS) produces the enhancement of Intrusion Detection System (IDS) with routing algorithm named as Integrated Cross Interior algorithm that performs maps the security with the secure IDS communication and distributes the packets among different destination, based on priority. This paper proposes a novel Integrated Cross Interior structure for Intrusion Detection System (ICIS for IDS) to secure our network from black hole attacks. This algorithm is proposed for node routing and node security by considering maximum throughput 83.5% with minimum routing cost, response time with 6.3ms. The experimental results specify that ICIs for IDS based security policy effectively minimizes the response time as well as the mobile routing cost, response time of an application with respect to other existing approaches such as IDS with AODV. The proposed algorithm is experimented using Network Simulator-2 and the results demonstrated that the performance of the algorithm is better than other conventional algorithms like IDS with AODV.
A hybrid wired-wireless network comprises a fixed wired backbone network interconnecting wireless ad hoc networks. In such environments with promising potential commercial applications, efficient routing is critical to achieve good performance. Previous research in such hybrid network environment has not taken advantage of research on routing which exploits location information. In this paper, we propose a Link-Connectivity-Prediction-Based Location-Aided Routing (LLR) protocol specially designed for this hybrid network environment. We also propose a gateway discovery algorithm to help build K-hop subnets around gateways, which is fundamental to the proposed routing protocol. The efficiency of our protocol is verified using simulations.
This paper proposes an optimum mechanism to select appropriate gateway based on multiple node metrics: remaining energy, mobility, and number of hops, for interconnected mobile ad hoc network (MANET) with infrastructured network. To choose an optimum gateway node, we use the multiple criteria decision making (MCDM) method called simple additive weighting (SAW) to outrank the optimum gateway node. SAW method calculates the weights of gateway node by considering these three metrics. Node with the highest weight will be selected as a gateway. Simulation results show that our scheme can improve throughput performance, gateway lifetime, and packet delivery ratio of MANET and infrastructured network.
A gateway discovery mechanism is necessary to make possible that wireless nodes in an ad hoc network route their packets towards a fixed network. Real-time applications have quality of service parameters and need a gateway discovery mechanism that helps them to maintain their requirements. In this work we propose a new adaptive gateway discovery scheme that adjusts the frequency of the gateway advertisements dynamically. This protocol is able to differentiate services between applications and it cooperates with real-time flows to maintain the desired quality of service. Simulation results investigate the performance of the proposed adaptive scheme and show the effectiveness of this scheme in comparison with the hybrid mechanism in the simulated scenarios
When an ad hoc network is connected to the Internet, it is important for the mobile nodes to detect available gateways providing access to the Internet. We discuss the problem of interworking and integration between the ad hoc and radio access networks. Furthermore, we propose a signalling mechanism to discover and select the optimum gateway when more than one gateway is available. A gateway is considered to be optimum if the path via this gateway provides better quality of service such as total path bandwidth or overall delay. An optimum gateway selection scheme should consider both the ad hoc and radio access networks to provide better QoS support. To achieve this selection, QoS information from both sides of the network needs to be communicated across the network. Further research is required to adapt the proposed mechanism to be applied for wireless sensor networks
With ubiquitous computing, the interconnection of Mobile Ad Hoc Networks (MANET) to Internet is becoming current topic. There are advantages that MANET could organize an independent network without infra-structures. Accordingly to increase of interests about this MANET, Internet Gateway which provides MANET with the internet services is entering the stage as a new challengeable area. Nodes in the overlapped area owned by different Internet Gateway should solve a problem of the selection which Internet Gateway is used to support the internet services. Some solutions related to this selection problem considering environment of the MANET are not satisfactory. An existing alternative based on only the hop counts to choose its gateway have the drawbacks of an exponential decrease of the throughput, because of the node mobility. In this paper we proposed new scheme considering the specific character of node mobility. This proposed scheme could increase throughput of the whole network.
This paper proposes a scheme to select an appropriate gateway based on
multiple metrics such as remaining energy, mobility or speed, and number
of hops in Mobile Ad Hoc Network (MANET) and the infrastructure network
integration. The Multiple Criteria Decision Making (MCDM) method called
Simple Additive Weighting (SAW) is used to rank and to select the
gateway node. SAW method calculates the weights of gateway node
candidates by considering these three metrics. The node with the highest
weight will be selected as the gateway. Simulation results show that our
scheme can reduce the average energy consumption of MANET nodes, and
improve throughput performance, gateway lifetime, Packet Delivery Ratio
(PDR) of the MANET and the infrastructure network.
In ad hoc networks with Internet connectivity, an Internet gateway (IG) is used to connect ad hoc mobile nodes to the Internet. Multiple Internet gateways may be deployed in order to provide more scalable and robust ubiquitous coverage. In this case, we need to solve the Internet gateway selection problem in order for successful integration of the Internet with mobile ad hoc networks. An ad hoc mobile node first discovers available Internet gateways, and then the node selects a serving gateway among those candidates for optimal performance. In this paper, we propose an adaptive Internet gateway selection scheme using redirecting selection method which is based on QoS attributes such as hop-count and residual capacity. Our objective is to design a selection method for providing enhanced performance. Simulation results show that our adaptive Internet gateway selection scheme achieves better performance as well as better load balancing than existing selection schemes.
Mobile ad hoc networks are autonomous, infrastructureless networks that can establish low cost, limited range networks for the purpose of sharing data between devices. When an ad hoc network is connected to the Internet, it is important for the mobile nodes to detect available gateways providing access to the Internet. Therefore, a gateway discovery mechanism is required. In this paper, we present an adaptive gateway discovery scheme that can change TTL value of agent advertisements according the scale of Internetworking ad hoc networks dynamically. Simulation results with NS2 shows that our approach achieves good connectivity while keeping overhead costs low when connecting various scale ad hoc network to the Internet.
The quality of service (QoS) of wireless Internet access that could be provided to multihop wireless networks, so-called mobile ad hoc networks (MANETs), is highly dependent on the quality of the design of the intermediate facility that will integrate MANET and the Internet. This facility is equipped with a hybrid mechanism being able to fulfill the working requirements of MANET and the Internet so that it can connect to either one of these orthogonal network architectures. The architecture that we propose in order to provide MANET nodes with Internet access utilizes fixed gateways (or access points) and exploits the mobility capability of additional mobile ones. Since Internet access to MANET nodes is provided through mobile gateways, the quality of such service depends on the selection procedure used by MANET nodes to choose the most convenient mobile gateways and register with. In this paper, we suggest to use a hybrid criterion based on the weighted sum of the Euclidean distance between MANET nodes and mobile gateways, and the load of mobile gateways, defined as the number of MANET nodes currently registered with them. Moreover, the sum of the weights is normalized to one, where each weight measures the level of interest of the corresponding criterion in the hybrid one. Simulation results show that the hybrid criterion has an impact on the quality of wireless Internet access service depending on the level of interest assigned to each of the Euclidean distance and load criteria in the weighted sum.
When an ad hoc network is connected to the Internet, it is important for the mobile nodes to detect the available gateways providing access to the Internet. Therefore, a gateway discovery mechanism is required. The two main approaches for discovering Internet gateways are the reactive and the proactive one. This paper compares the performance of these approaches in various scenarios by means of simulation. We show that the proactive approach performs better in the simulated scenario.