A wireless sensor network consists of geologically distributed autonomous sensors to
monitor and control over physical or environmental conditions, like temperature, sound …

We consider the problem of exploring an anonymous unoriented ring by a team of k
identical, oblivious, asynchronous mobile robots that can view the environment but cannot …

In the graph exploration problem, a team of mobile computational entities, called agents,
arbitrarily positioned at some nodes of a graph, must cooperate so that each node is …

Black hole attacks occur when an adversary captures and re-programs a set of nodes in the
network to block/drop the packets they receive/generate instead of forwarding them towards …

A group of identical mobile agents moving asynchronously among the nodes of an
anonymous network have to gather together in a single node of the graph. This problem …

Current mobile agent algorithms for map** faults in computer networks assume that the
network is static. However, for large classes of highly dynamic networks (eg, wireless mobile …

Almost all the vast literature on graph exploration assumes that the graph is static: its
topology does not change during the exploration, except for occasional faults. To date, very …

One of the recent paradigms in networked distributed computing is the use of mobile agents.
Mobile agents are software robots that can autonomously migrate from node to node within …

Consider a team of (one or more) mobile agents operating in a graph G. Unaware of the
graph topology and starting from the same node, the team must explore the graph. This …

Software defined network (SDN) provides flexible and scalable routing by separating control
plane and data plane. With centralized control, SDN has been widely used in traffic …