Improved Distributed Exploration of Anonymous Networks (2009)
Shantanu Das, Shay Kutten, Ayelet Yifrach
Abstract. The problem of constructing a labeled map of an anonymous and asynchronous network is addressed. We present an algorithm that explores and maps the network by using k identical agents that...
Detecting and Preventing IP-spoofed Distributed DoS Attacks (2008)
Yao Chen, Shantanu Das, Pulak Dhar, Abdulmotaleb El Saddik, Amiya Nayak
In this paper, we explore mechanisms for defending
Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents (2008)
Shantanu Das, Paola Flocchini, Nicola Santoro, Masafumi Yamashita, Submission To Sirocco
The recently established computational equivalence between the traditional message-passing model and the mobile-agents model is based on the existence of a mobile-agents algorithm that simulates the...
Distributed Exploration of Anonymous Graphs by Multiple Agents ∗ (2008)
Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, Nicola Santoro
We consider the problem of exploration and mapping of an unknown environment modelled as a graph, by multiple identical mobile agents that are dispersed among the nodes of the graph. The objective is...
Distributed Exploration of Unlabelled Graphs by Multiple Agents ∗ (2008)
Shantanu Das, Paola Flocchini, Shay Kutten, Amiya Nayak, Nicola Santoro
We consider a distributed version of the typical graph exploration problem where a mobile agent has to traverse the edges of an unlabelled (i.e., anonymous) graph and return to its starting point,...
Rendezvous of mobile agents in unknown graphs with faulty links (2007)
Jérémie Chalopin, Shantanu Das, Nicola Santoro
A group of mobile agents wandering among the nodes of a network have to gather together in a single node of the graph; This problem known as the Rendezvous problem has been studied extensively but...
Effective elections for anonymous mobile agents (2006)
Shantanu Das, Paola Flocchini, Amiya Nayak, Nicola Santoro
Abstract. We present distributed protocols for electing a leader among k mobile agents that are dispersed among the n nodes of a graph. While previous solutions for the agent election problem were...
Thesis (Ph. D.)--Massey University, Palmerston North, 2004.
A Queuing and Statistical Analysis of Freeway Bottleneck Formation (2004)
A modified approach to treat traffic flow parameters (flow, density and speed) has been introduced in this paper. A queuing analysis has been conducted on traffic flow data on Interstate 94 in the...
Wireless Sensor and Actor Networks (1970)
Shantanu Das, Hai Liu, Ajith Kamath, Amiya Nayak, Ivan Stojmenovic
In this paper, we present a novel localized movement control algorithm to form a fault-tolerant bi-connected robotic network topology from a connected network, such that total distance of movement of...
A Queuing and Statistical Analysis of Freeway Bottleneck Formation
A modified approach to treat traffic flow parameters (flow, density and speed) has been introduced in this paper. A queuing analysis has been conducted on traffic flow data on Interstate 94 in the...