We propose a fast generalization method for DQN-Routing, an algorithm based on multi-agent deep reinforcement learning that suffers from problem when introduced to new topologies even if it was trained similar topology. The proposed is the wisdom of crowds and allows distributed routing algorithm, generalize better were not seen before during training. also aims decrease solution search time as...

Wireless Sensor Networks consist of a large population of sensor nodes capable of computation, communication and sensing. Limited energy resource is the inherent limitation of Wireless Sensor Network, Most routing algorithms for Sensor Network focus on energy efficient paths, Due to this, power in the sensor, along the energy efficient paths gets depleted very quickly, and therefore Sensor Netw...

Software Defined Networking (SDN) introduces programability into the network forwarding plane and simultaneously enables architectural refactoring of the routing control plane. In this work, we present two complementary studies leveraging the opportunities presented by SDN. First, in the context of internet router architectures in Section II, we propose leveraging OpenFlow forwarding informatio...

A distributed kinetic spanning tree algorithm is proposed for routing in wireless mobile ad hoc networks. Assuming a piecewise linear motion model for the nodes, the sequence of shortest-path spanning trees is determined, valid until the time of the next node trajectory change. By computing the sequence of trees using one execution of the distributed routing algorithm, in contrast to computing ...

This paper introduces the wireless sensor network routing protocol and its security, and introduces the main several kinds of routing protocols, including the data centric routing protocol, hierarchical routing protocols and location-based routing protocol, finally according to the analysis of routing protocol common attack method. Ant colony algorithm is a distributed parallel algorithm. A sin...

This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem. The vehicle routing problem (VRP) is an NPhard problem and capacitated vehicle routing problem variant (CVRP) is considered here. This problem is one of the NP-hard problems and for this reason many approximate algorithms have been designed for solving it. Distrib...

Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol—one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, w...

Swarm intelligence forms the core of a new class of algorithms inspired by the social behavior of insects that live in swarms. Its attractive features include adaptation, robustness and a distributed, decentralized nature, rendering swarm-based algorithms well-suited for routing in wireless or satellite networks, where it is difficult it implement centralized network control. We propose one suc...

There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or suffer from imbalances in data distribution, routing state, and/or query processing costs. In this position paper, we take a systematic approach that enables the deployment of searchable tree structures in p2p environmen...