The Floyd-Warshall algorithm [Flo62, Roy59, War62] is a classic dynamic programming algorithm to compute the length of all shortest paths between any two vertices in a graph (i.e. to solve the all-pairs shortest path problem, or APSP for short). Given a representation of the graph as a matrix of weights M , it computes another matrix M ′ which represents a graph with the same path lengths and c...

Establishing secret common randomness between two or multiple devices in a network resides at the root of communication security. The problem is traditionally decomposed into a randomness generation stage (randomness purity is subject to employing often costly true random number generators) and a key-agreement information exchange stage, which can rely on public-key infrastructure or on key wra...

Ad hoc routing protocols that use broadcast for route discovery may be inefficient if the path between any pair sourcedestination is frequently broken. In order to efficiently use network resources, this paper proposes to use a controlled flooding (CF) mechanism to replace network-wide broadcast in route discovery procedures. CF is used to build alternative routes around the shortest-path betwe...

Evolving threat situations in a post 9/11 world demand faster and more reliable decisions to thwart the adversary. One critical path to enhanced threat cognizance is through online knowledge discovery based on dynamic, heterogeneous data available from strategically placed wide-area sensor networks. The knowledge discovery process needs to coordinate adaptive predictive analysis with real-time ...

Intelligent energy management is a key challenge in Wireless Sensor Networks. The choice of an appropriate routing algorithm constitutes a critical factor, especially in unstructured networks where, due to their dynamic nature, a reactive routing protocol is necessary. Such networks often favour packet flooding to fulfil this need. One such algorithm is IDEALS, a technique proposed in the liter...

Solution to the safe and collision-free trajectory of the wheeled mobile robot in cluttered environments containing the static and/or dynamic obstacle has become a very popular and challenging research topic in the last decade. Notwithstanding of the amount of publications dealing with the different aspects of this field, the ongoing efforts to address the more effective and creative methods is...

Secure Content Addressable Network (SCAN) is an architecture for service discovery in service centric sensor networks that enables dynamic service composition. This paper proposes two new security mechanisms for SCAN: Single Path Key Exchange (SPX) and Multi Path Key Exchange (MPX). Both security mechanisms allow two arbitrary nodes of SCAN to exchange a symmetric key for secure communication. ...