Routing with Face Traversal and Auctions Algorithms for Task Allocation in WSRN.

Four new algorithms (RFTA1, RFTA2, GFGF2A, and RFTA2GE) handling the event in wireless sensor and robot networks based on the greedy-face-greedy (GFG) routing extended with auctions are proposed in this paper. In this paper, we assume that all robots are mobile, and after the event is found (reported by sensors), the goal is to allocate the task to the most suitable robot to act upon the event, using either distance or the robots' remaining energy as metrics. The proposed algorithms consist of two phases.

Optimization and Communication in UAV Networks.

Nowadays, Unmanned Aerial Vehicles (UAVs) have received growing popularity in the Internet-of-Things (IoT) which often deploys many sensors in a relatively wide region. Current trends focus on deployment of a single UAV or a swarm of it to generally map an area, perform surveillance, monitoring or rescue operations, collect data from ground sensors or various communicating devices, provide additional computing services close to data producers, etc. Applications are very diverse and call for different features or requirements.

Edge Computing Resource Allocation for Dynamic Networks: The DRUID-NET Vision and Perspective.

The potential offered by the abundance of sensors, actuators, and communications in the Internet of Things (IoT) era is hindered by the limited computational capacity of local nodes. Several key challenges should be addressed to optimally and jointly exploit the network, computing, and storage resources, guaranteeing at the same time feasibility for time-critical and mission-critical tasks. We propose the DRUID-NET framework to take upon these challenges by dynamically distributing resources when the demand is rapidly varying.

QoS in Wireless Sensor Networks.

The last decades have witnessed advances in multiple wireless sensor networks in both the academic and industrial world. [..

Multiple Instances QoS Routing in RPL: Application to Smart Grids.

The Smart Grid (SG) aims to transform the current electric grid into a "smarter" network where the integration of renewable energy resources, energy efficiency and fault tolerance are the main benefits. This is done by interconnecting every energy source, storage point or central control point with connected devices, where heterogeneous SG applications and signalling messages will have different requirements in terms of reliability, latency and priority. Hence, data routing and prioritization are the main challenges in such networks.

Alternative Opportunistic Alert Diffusion to Support Infrastructure Failure during Disasters.

Opportunistic communications present a promising solution for disaster network recovery in emergency situations such as hurricanes, earthquakes, and floods, where infrastructure might be destroyed. Some recent works in the literature have proposed opportunistic-based disaster recovery solutions, but they have omitted the consideration of mobile devices that come with different network technologies and various initial energy levels. This work presents COPE, an energy-aware ooperative portunistic alrt diffusion scheme for trapped survivors to use during disaster scenarios to report their position and ease their rescue operation.

Security and privacy in molecular communication and networking: opportunities and challenges.

Molecular Communication (MC) is an emerging and promising communication paradigm for several multi-disciplinary domains like bio-medical, industry and military. Differently to the traditional communication paradigm, the information is encoded on the molecules, that are then used as carriers of information. Novel approaches related to this new communication paradigm have been proposed, mainly focusing on architectural aspects and categorization of potential applications.

Towards a hybrid energy efficient multi-tree-based optimized routing protocol for wireless networks.

This paper considers the problem of designing power efficient routing with guaranteed delivery for sensor networks with unknown geographic locations. We propose HECTOR, a hybrid energy efficient tree-based optimized routing protocol, based on two sets of virtual coordinates. One set is based on rooted tree coordinates, and the other is based on hop distances toward several landmarks.