In today’s vertiginous business landscape, organizations are constantly looking at ways of introducing agility and cost efficiencies.

Recently, the University of Leon with the support of the Spanish National Institute of Cybersecurity has established the Research Institute of Applied Sciences in Cybersecurity (RIASC). This new institute has three main missions: research, education and transfer technology in cybersecurity. In this framework, RIASC has launched (jointly with other national and international institutions) the research Project MITHRA – “Multi-distributed Intelligence Towards Higher Resilience Assets”. 

Today the Internet, as we know it, stands as an increasingly important element in every societal domain. Never before have people (and machines) had such an amount of potential content at their fingertips (or interfaces), and different ways to share it.

Mobile robots collaborate in order to solve efficiently the central problems in algorithmics of distributed computing like searching/exploration, rendez-vous or pattern formation. 

Many data collection protocols have been proposed to cater for the energy-efficient flow of sensor data from distributed sources to a sink node. However, the transmission of control commands from the sink to one or only a small set of nodes in the network is generally unsupported by these protocols.

Traditional distance vector routing and efficient flooding-based routing can be considered the two ends of the routing continuum in wireless sensor networks. The former uses a graph metaphor to find the best paths between the end-points in a network.

Networking research and development is an important field in information technology and its importance grows with the rise of the Internet and the ubiquity of worldwide communication.

Information overload has become an ubiquitous problem in modern society. Social media users and microbloggers receive an endless flow of information, often at a rate far higher than their cognitive abilities to process the information.

The Internet's Transport Layer has been defined by TCP and UDP for the last 30 years. The minimal functionality of UDP enables application developers to develop their own proprietary protocols - there are plenty of examples.

This paper presents a simple framework, called WalkAbout, to infer a coarse view of connectivity in very large graphs; that is, identify well-connected “regions" with different edge densities and determine the corresponding inter- and intra- region connectivity.