相关论文: Routing in Wireless Mesh Networks: Two Soft Comput…

Mobile backhaul system based on a wireless mesh network using point-to-point millimetre wave links is a promising solution for dense 5G small cell deployments. While mmW radio technology can provide the sufficient capacity, the management…

This paper studies a fundamental algorithmic problem related to the design of demand-aware networks: networks whose topologies adjust toward the traffic patterns they serve, in an online manner. The goal is to strike a tradeoff between the…

This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann…

In this paper, we consider a multi-user mobile edge computing (MEC) network powered by wireless power transfer (WPT), where each energy-harvesting WD follows a binary computation offloading policy, i.e., data set of a task has to be…

Finding efficient routes for data packets is an essential task in computer networking. The optimal routes depend greatly on the current network topology, state and traffic demand, and they can change within milliseconds. Reinforcement…

We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less even at continental scale. A variety of techniques provide…

The availability of massive vehicle trajectory data enables the modeling of road-network constrained movement as travel-cost distributions rather than just single-valued costs, thereby capturing the inherent uncertainty of movement and…

Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…

It is a critical issue to compute the shortest paths between nodes in networks. Exact algorithms for shortest paths are usually inapplicable for large scale networks due to the high computational complexity. In this paper, we propose a…

There is a rich recent literature on how to assist secure communication between a single transmitter and receiver at the physical layer of wireless networks through techniques such as cooperative jamming. In this paper, we consider how…

In this paper different optimization of Ad-hoc routing algorithm is surveyed and a new method using training based optimization algorithm for reducing the complexity of routing algorithms is suggested. A binary matrix is assigned to each…

Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous…

The wireless backhaul network provides an attractive solution for the urban deployment of fifth generation (5G) wireless networks that enables future ultra dense small cell networks to meet the ever-increasing user demands. Optimal…

Routing is a widespread approach to transfer information from a source node to a destination node in many deployed wireless ad-hoc networks. Today's implemented routing algorithms seek to efficiently find the path/route with the largest…

We present a novel quantum optimization-based route compression technique that significantly reduces storage requirements compared to conventional methods. Route optimization systems face critical challenges in efficiently storing selected…

Computing distances and finding shortest paths in massive real-world networks is a fundamental algorithmic task in network analysis. There are two main approaches to solving this task. On one hand are traversal-based algorithms like…

Motion planning is a key element of robotics since it empowers a robot to navigate autonomously. Particle Swarm Optimization is a simple, yet a very powerful optimization technique which has been effectively used in many complex…

Designing high-performance routing protocols for flying ad hoc networks (FANETs) is challenging due to the diversity of applications and the dynamics of network topology. The existing general-purpose routing protocols for ad hoc networks…

We consider the bi-criteria shortest-path problem where we want to compute shortest paths on a graph that simultaneously balance two cost functions. While this problem has numerous applications, there is usually no path minimizing both cost…

An ad hoc network is an infrastructureless network in which nodes perform terminal as well as routing functions. A routing protocol is the only substitute to complete the communications in the absence of an access point. In spite of that…