Flight-schedule using Dijkstra's algorithm with comparison of routes findings

<span>The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.</span>

LT Codes with Double Encoding Matrix Reorder Physical Layer Secure Transmission

In traditional wireless sensor networks, information transmission usually uses data encryption methods to prevent information from being stolen illegally. However, once the encryption methods are leaked, eavesdropping nodes can easily obtain information. LT codes are rateless codes; if it is attacked by random channel noise, the decoding process will change and the decoding overhead will also randomly change. When it is used for physical layer communication of wireless sensor networks, it ensures that the destination node recovers all the information without adding the key, while the eavesdropping node can only obtain part of the information to achieve wireless information security transmission. To reduce the intercept efficiency of eavesdropping nodes, a physical layer security (PLS) method of LT codes with double encoding matrix reorder (DEMR-LT codes) is proposed. This method performs two consecutive LT code concatenated encoding on the source symbol, and part of the encoding matrix is reordered according to the degree value of each column from large to small, which reduces the probability of eavesdropping nodes recovering the source information. Experimental results show that compared with other LT code PLS schemes, DEMR-LT codes only increase the decoding overhead by a small amount. However, it can effectively reduce the intercept efficiency of eavesdropping nodes and improve information transmission security.

Mobile Ad-hoc Networks: A Survey on multipath routing protocols

A Mobile Ad Hoc Network (MANETs) connects mobile nodes without any base station. These nodes in the network can change the topology dynamically and transfer the data among themselves. The nodes in the MANET are categorized based on the resource factors like memory, computation, and power levels. The dynamic change in route makes the connection of the destination node more complex. Sometimes, it results in link failure, and hence the primary route is failed, which means an alternative route is required to transmit the packets. It required multiple paths from the source node to destination node with a stable path connecting the source node. This issue makes MANET routing a crucial task. To address these problems, multipath routing in MANET is discussed in this paper. Multipath routing provides various paths for a single source node to a single destination node. It is more important to consider load balancing and fault tolerance when establishing the multipath routing mechanism. This paper describes the various type of challenges along with their respective multipath routing protocols in MANETs.

Robust and Secure Data Transmission Using Artificial Intelligence Techniques in Ad-Hoc Networks

The paper presents a new security aspect for a Mobile Ad-Hoc Network (MANET)-based IoT model using the concept of artificial intelligence. The Black Hole Attack (BHA) is considered one of the most affecting threats in the MANET in which the attacker node drops the entire data traffic and hence degrades the network performance. Therefore, it necessitates the designing of an algorithm that can protect the network from the BHA node. This article introduces Ad-hoc On-Demand Distance Vector (AODV), a new updated routing protocol that combines the advantages of the Artificial Bee Colony (ABC), Artificial Neural Network (ANN), and Support Vector Machine (SVM) techniques. The combination of the SVM with ANN is the novelty of the proposed model that helps to identify the attackers within the discovered route using the AODV routing mechanism. Here, the model is trained using ANN but the selection of training data is performed using the ABC fitness function followed by SVM. The role of ABC is to provide a better route for data transmission between the source and the destination node. The optimized route, suggested by ABC, is then passed to the SVM model along with the node’s properties. Based on those properties ANN decides whether the node is a normal or an attacker node. The simulation analysis performed in MATLAB shows that the proposed work exhibits an improvement in terms of Packet Delivery Ratio (PDR), throughput, and delay. To validate the system efficiency, a comparative analysis is performed against the existing approaches such as Decision Tree and Random Forest that indicate that the utilization of the SVM with ANN is a beneficial step regarding the detection of BHA attackers in the MANET-based IoT networks.

Developing of Bluetooth mesh flooding between source-destination linking of nodes in wireless sensor networks

Bluetooth uses 2.4 GHz in ISM (industrial, scientific, and medical) band, which it shares with other wireless operating system technologies like ZigBee and WLAN. The Bluetooth core design comprises a low-energy version of a low-rate wireless personal area network and supports point-to-point or point-to-multipoint connections. The aim of the study is to develop a Bluetooth mesh flooding and to estimate packet delivery ratio in wireless sensor networks to model asynchronous transmissions including a visual representation of a mesh network, node-related statistics, and a packet delivery ratio (PDR). This work provides a platform for Bluetooth networking by analyzing the flooding of the network layers and configuring the architecture of a multi-node Bluetooth mesh. Five simulation scenarios have been presented to evaluate the network flooding performance. These scenarios have been performed over an area of 200×200 meters including 81 randomly distributed nodes including different Relay/End node configurations and source-destination linking between nodes. The results indicate that the proposed approach can create a pathway between the source node and destination node within a mesh network of randomly distributed End and Relay nodes using MATLAB environment. The results include probability calculation of getting a linking between two nodes based on Monte Carlo method, which was 88.7428 %, while the Average-hop-count linking between these nodes was 8. Based on the conducted survey, this is the first study to examine and demonstrate Bluetooth mesh flooding and estimate packet delivery ratio in wireless sensor networks

Energy-Efficient and Disjoint Multipath Using Face routing in Wireless Sensor Networks

In WSNs, multipath is well-known as a method to improve the reliability of packet delivery by making multiple routes from a source node to a destination node. To improve reliability and load-balancing, it is important to ensure that disjoint characteristics of multipath do not use same nodes during path generation. However, when multipath studies encounter a hole area from which is hard to transmit data packets, they have a problem with breaking the disjoint features of multipath. Although existing studies propose various strategies to bypass hole areas, they have side effects that significantly accelerate energy consumption and packet transmission delay. Therefore, to retain the disjoint feature of multipath, we propose a new scheme that can reduce delay and energy consumption for a node near a hole area using two approaches—global joint avoidance and local avoidance. This scheme uses global joint avoidance to generate a new path centered on a hole area and effectively bypasses the hole area. This scheme also uses local joint avoidance that does not select the same nodes during new path generation using a marking process. In simulations, the proposed scheme has an average 30% improvement in terms of average energy consumption and delay time compared to other studies.

Effective Routing in Vehicular Adhoc Network (VANET) using an Bio-inspired Algorithm: Enhanced Deep Reinforcement Learning (EDRL) for Secure Wireless Communication

For improving the performance of city wide-ranging lane networks through the optimized control signal, we proposed a framework in Vehicular Adhoc Network (VANET). Node which reduces the traffic efficiency drastically is identified as critical node, with the help of defined framework. Tripartite graph is used for identifying critical node through vehicle trajectory in the over-all viewpoint. Enhanced Deep Reinforcement Learning (EDRL) method is introduced to control the traffic signal and gives appropriate decision for routing the data from Road Side Unit (RSU) to intermediate or destination node. Various experiments were done with proposed model and the result shows considerable efficiency in delay and travelling time of the node in VANET.

Energy-Efficient Enhancement for the Prediction-Based Scheduling Algorithm for the Improvement of Network Lifetime in WSNs

In wireless sensor networks, due to the restricted battery capabilities of sensor nodes, the energy issue plays a critical role in network efficiency and lifespan. In our work, an upgraded long short-term memory is executed by the base station to frequently predict the forecast positions of the node with the help of load-adaptive beaconing scheduling algorithm. In recent years, new technologies for wireless charging have offered a feasible technique in overcoming the WSN energy dilemma. Researchers are deploying rechargeable wireless sensor networks that introduce high-capacity smartphone chargers for sensor nodes for charging. Nearly all R-WSN research has focused on charging static nodes with relativistic routes or mobile nodes. In this work, it is analysed how to charge nondeterministic mobility nodes in this work. In this scenario, a new mechanism is recommended, called predicting-based scheduling algorithm, to implement charging activities. In the suggested technique, it directs them to pursue the mobile charger and recharge the sensor, which is unique for the present work. The mobile charger will then choose a suitable node, utilizing a scheduling algorithm, as the charging object. A tracking algorithm based on the Kalman filter is preferred during energy transfer to determine the distance needed for charging between the destination node & mobile charger. Here, the collecting & processing of data are performed through the big data collection in WSNs. The R-WSN charging operations of nondeterministic mobility nodes will be accomplished using the proposed charging strategy.

Routing in Opportunistic Networks: Implementation and Research Challenges

Opportunistic Networks can be defined as Delay Tolerant Network, which are formed dynamically with participating nodes’ help. Opportunistic Networks follows Store-Carry-Forward principle to deliver/route the data in the network. Routing in Opportunistic Network starts with the Seed Node (Source Node) which delivers the data with the help of Intermediate nodes. Intermediate nodes store the data while roaming in the network until it comes in contact with appropriate forwarding node (relay node) or destination node itself. An extensive literature survey is performed to analyse various routing protocols defined for Opportunistic Network. With mobility induced routing, establishing and maintaining the routing path is a major challenge. Further, Store-Carry-Forward routing paradigm imposes various challenges while implementing and executing the network. Due to the unavailability of the suitable relay node, data needs to be stored within the Node’s Memory, imposes buffer storage issues at the node level. Also, uncontrolled flooding may impose link-level Congestion and treated as overhead to maintain the network. Another major challenge can be maintaining the energy level of the nodes in the network. Recently developed ONE (Opportunistic Network Environment) Simulator is used to simulate and emulate the environment required by Opportunistic Network. Along with the extensive literature survey of the protocols, few of the existing protocols viz. Direct Delivery, ProPHET, Epidemic and Spray & Wait Routing are implemented using ONE Simulator to analyse their performance while in execution. Results are being compared, and the researchers’ future direction is identified to address the open problems and challenges in Opportunistic Network.

Age of Information Based URLLC-enabled UAV Wireless Communications System

<div>This paper considers an unmanned aerial vehicles (UAV) communication network, where UAV operate as an aerial mobile relay between a source and a destination of the network. To capture the “timeliness” of the received information at the destination node, a new performance metric named age of information (AoI) is considered. In addition, a short packet communication scheme maintains low latency in the proposed UAV wireless communication system. The finite block-length theory investigates the performances of short packet communications scheme in the UAV-assisted wireless communications system. In this paper, the Average Age of Information (AAoI) is estimated by applying the Stochastic Hybrid Systems (SHS) model. The SHS model comprises discrete states represents events that reset the AoI process and continuously dynamics that represent linearly growing age processes. Finally, a closed-form expression for the AAoI of the proposed UAV wireless communication system is derived and it can be used to estimate the optimal altitude, block length and other parameters.</div>