The unmanned aerial vehicle communication networks (UAVCNs) are composed of vehicles (UAVs) connected in ad hoc mode to facilitate vertical 5G and beyond networks. UAVs operating an operation mostly use reactive routing protocols establish routes the network reduce energy consumption nodes. In this article, a route discovery method is presented overhead faced by during phase. expanding ring sea...

The function F of Dragon plays an important role on both the keystream generation and the internal state update. We analyze the function F of Dragon by linear cryptanalytic methods. Thanks to an efficient algorithm on linear approximations of the modular addition, we observed that there were a large number of approximations with significant correlations in the nonlinear components of the functi...

In this paper, we present a novel algorithm for VANET using cloud computing. We accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. Each car or node is considered a Client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...

A CSP based algorithm for the conformant probabilistic planning problem (CPP) has been presented by Hyafil & Bacchus. Although their algorithm displayed some interesting potential when compared with traditional POMDP algorithms, it was developed using a “flat” representation. In this work we revisit this algorithm and develop a version that utilizes a structured representation. The structured r...

Traditionally, conventional generation unit was used to provide ancillary services e.g. reactive power support, and spinning reserve. Nonetheless, with the emergence of highly penetrated distributed energy resources (DERs) systems and considering how beneficial they can be; it appears reasonable to use them as reactive power providers. Therefore, this paper introduces a new procedure for DERs t...

1 This work is supported in part by matching funds from the National Science Foundation under the National Young Investigator Program under contract number IRI-9357785 and by TTC. Ophir Frieder is currently on leave from the Department of Computer Science at George Mason University. 1. Abstract We present a novel proactive routing algorithm that consistently searches for failures via frequent I...

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

In the railway station signal system, the route searching algorithm is an important software module to realize the function safety of this system. In the paper, the ant colony algorithm is applied to the railway station route searching. Take the specific station route-the Wangzhai Station route for example to search the shortest route. The ideas of the Wangzhai Station route searching are put f...

We introduce a new dual-tier route discovery algorithm for MANETs. The new algorithm uses chase packets to stop the fulfilled route requests in on-demand routing protocols. The algorithm works by including the most likely destinations for a given source node in a local neighbourhood and broadcast route requests with full speed within this region. However, outside such neighbourhood the route re...