A REVIEW OF DISRUPTION MANAGEMENT IN VEHICLE ROUTING PROBLEM (VRP), TRANSPORT DESIGN AND SCHEDULING

In the case of an unexpected occurrence, disruption management is a method of rescheduling activities and it has been used in a variety of fields, including organized carrier scheduling and project management. The purpose of this review is to examine Ant Colony Optimization (ACO), the problems of Heuristics for Delivery Waste Collection (VRP), ARC Routing, Node Routing, and Container/skip. Other issues and problems examined in the paper were Non-Skip, Algorithms for the VRP, Improvement Algorithms, Simulated Annealing, and ACO for Capacitated Vehicle Routing, Clustering Analysis, and Probabilistic-D Cluster Analysis. It covers the fundamental characteristics of disruption management as well as the related goals and kinds of disruption that may occur in this setting. The various formulations and solution techniques are discussed in facets. A collection of relevant articles has been summarized and categorized according to the kind of disruption problem being addressed, the relevant goals, and the solution method used to resolve the problem. Vehicles must be emptied at a trash disposal facility before they may be used to collect garbage from further clients. The growing amount of solid waste generated as a result of p

Host based Detection and Prevention of Black Hole attacks by AODV-ICCSO Algorithm for security in MANETs

Background: Mobile Ad-hoc Networks (i.e.) MANETs are gaining rapid fame in recent days and are considered as very significant because of their easier implementation and growing property. Various types of attacks are prone to damage the networks due to the elastic property possessed by the network. And among different categories of attacks that can affect MANETs, black hole attack is considered as the commonly occurring one within a MANET. Chicken Swarm Optimization (CSO) algorithm is one among the technique used for the detection of black hole attacks occurring in the MANETs. But the CSO algorithm possesses some disadvantages and necessity rises for overcoming the weakness in the CSO algorithm. Objective: Therefore, in this research paper, to address the black hole attack in MANET, an Improved Crossover Chicken Swarm Optimization (ICCSO) algorithm and the concept of Enhanced Partially-Mapped Crossover operation proposed and the best fitness values obtained. Methods: In ICCSO algorithm, parameter initialization is carried out in step 1 of the algorithm, where the attacked nodes and non-attack nodes are created separately with the aid of parameters like PDR (i.e.) Packet Delivery Ratio and RSSI (i.e.) Received Signal Strength Indicator. Further, If the node is affected by any attack, then the nodes are discarded and the data is transmitted through the non-attacked node. Routing is carried by a protocol of AODV.Results: The effectiveness of the algorithm proposed in the work is evaluated using various performance measures like packet delivery ratio (PDR), end-to-end delay (EED) and throughput. The performance measures are compared with a different state of the art routing protocols and it can be inferred that the proposed methodology comes up with improved results.

Lifetime Maximization for 5G Mobile Networks using Secured and Finest Optimal Routing Protocol

Enhancing the network lifetime is mandate since to increase the efficiency of the network and to improve their performance. However reliable routing in wireless mobile network is the most significant problem that exists. Therefore offering mobility characteristic to each and every node’s in the networks requires a new meaning for the lifetime of network. In this research article, joint optimization mechanism called Secured and Finest Optimal Routing (SFOR) protocol is proposed. When the mobile node’s routing is indefinite or unidentified in Software Defined Network (SDN) then the three cases of routing problem is formulated for deriving secured and finest optimal routing which aims in lifetime maximization. All the three cases may be modelled as linear programming (LP) problems which can be solved as the source node routing progresses. Further for mobile node’s routing which is definite or precise, the reference energy value is set to balance the network lifetime. The proposed SFOR protocol is simulated and the performance is compared with the existing scheme. From the performance analysis it is observed that the proposed SFOR protocol enhance the network lifetime 50% and 16% as compared with Route Selection based on Connectivity, Delay, and Trust (RSCDT) and Virtual Ad hoc Routing Protocol (VARP) respectively.

Movable Platform-Based Topology Detection for a Geographic Routing Wireless Sensor Network

With the increasing adoption of the Internet-of-Things (IoT), the wireless sensors network (WSN), as an underlying application of IoT, has attracted increasing attention. Topology, the working structure used to observe WSN, is the most instinctive form in troubleshooting and has great significance to WSN management and safety. To this end, it is imperative to recover WSN topology for the purpose of network management and non-cooperative network detection. Traditional network topology recovery mainly relies on the monitoring modules installed in nodes, or an extra network attached. However, these two approaches have several limitations, such as high energy consumption for monitoring nodes, time synchronization problems, reuse failure, limitation to specific targeted networks and high cost. In this paper, we present a new approach to recover the topology of WSN that adopts location-based routing protocols, based on movable platforms. Our observation is that the network topology is consistent with the node routing, as the nodes choose the next hop according to the geological position of neighbor nodes. Hence, we calculate the cost parameters of choosing routing nodes for the targeted network according to the partial connection of the nodes. Based on those cost parameters, we can determine the topology of the whole network. More specifically, by collecting the geological position and data packets of the nodes from movable platforms, we are able to infer the topology of the WSN according to the recovered partial connection of nodes. Our approach can be easily adopted to many scenarios, especially for non-cooperative large-scale networks. The evaluation of 30 simulations shows that the accuracy of recovery is above 90%.

Cluster-Fault Tolerant Routing in a Torus

The number of Internet-connected devices grows very rapidly, with even fears of running out of available IP addresses. It is clear that the number of sensors follows this trend, thus inducing large sensor networks. It is insightful to make the comparison with the huge number of processors of modern supercomputers. In such large networks, the problem of node faults necessarily arises, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. Furthermore, thanks to its advantageous topological properties, the torus interconnection network has been adopted by the major supercomputer manufacturers of the recent years, thus proving its applicability. Acknowledging and embracing these two technological and industrial aspects, we propose in this paper a node-to-node routing algorithm in an n -dimensional k -ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. The described algorithm selects a fault-free path of length at most n ( 2 k + ⌊ k / 2 ⌋ − 2 ) with an O ( n 2 k 2 | F | ) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters.

Multimedia Independent Multipath Routing Algorithms for Internet of Things Based on a Node Hidden Communication Model

In order to achieve a multi-path routing algorithm with time delay and energy consumption balance to alleviate the energy holes around a sink, a multimedia independent multipath routing algorithm for internet of things (IoT) based on node hidden communication model is proposed in this paper. On the premise of satisfying the application delay, a multi-source multi-path routing algorithm is proposed by using the idea of software definition and fitting multiple curves to form independent multi-path routing. Through a sink node centralized programming control source node routing, according to the priority of the source node, the dynamic angle of the source node can be allocated, which effectively reduces the energy consumption of the network. In addition, considering that the Internet of Things has more perceptive nodes, limited computing and storage capacity, frequent joining and exiting operations and other factors, a hidden communication model of nodes is designed for the IoT. It is helpful to improve the level of privacy protection in the IoT, and to effectively improve the ability of nodes to resist attacks in the IoT. The experimental results show that the proposed algorithm avoids the interference between paths and various network attacks to the greatest extent, and the energy consumption is relatively low under the requirement of quality of service (QoS) delay.

Achieving Source Location Privacy Protection in Monitoring Wireless Sensor Networks through Proxy Node Routing

Achieving high source location privacy is critical when Wireless Sensor Networks (WSNs) are used in sensitive applications such as in asset or battlefield monitoring. Due to the sensitivity of information in these applications, it is important to ensure the flow of data between sensor nodes is secure and it does not expose any information about the monitored assets to an adversary. This paper proposes a routing scheme with stronger source location privacy than the privacy of traditional routing schemes. The paper addresses some limitations of four existing schemes by providing highly random routing paths between the source nodes and sink node. The scheme randomly sends packet to the sink node through tactically positioned proxy nodes to guarantee the routes are highly befuddling to the adversary. To achieve high privacy, the proposed scheme uses a randomizing factor to generate a new random route for every successive packet. Simulation results demonstrate that the proposed scheme provides longer safety period and stronger privacy to outperform other schemes. Furthermore the scheme provides stronger privacy against both, patient and cautious adversary models.