Mobility-Centric Geocasting For Mobile Partitioned Networks

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Small-scale turbomachinery is increasingly used in carbon-free energy conversion systems, such as commercial or domestic scale heat pumps, fuels cells for transportation and waste heat recovery. The usage of aerodynamic bearings allows the design of compac ...

Software network functions (NFs), such as a network address translator, load balancer, or proxy, promise to bring flexibility and rapid innovation to computer networks and to reduce operational costs. However, continuous updates and flexibility typically c ...

Wireless Sensor Networks (WSNs) are collections of sensing devices using wireless communication to exchange data. In the past decades, steep advancements in the areas of microelectronics and communication systems have driven an explosive growth in the depl ...

Real-time communication over Ethernet is becoming important in various application areas of cyber-physical systems such as industrial automation and control, avionics, and automotive networking. Since such applications are typically time critical, Ethernet ...

Reliable packet delivery within stringent delay-constraints is of paramount importance to mission-critical computer applications with hard real-time constraints. Because retransmission and coding techniques counteract the delay requirements, reliability ma ...

This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a v ...

Traditional electric power grids are currently undergoing fundamental changes: Representative examples are the increase in the penetration of volatile and decentralized renewable-energy sources and the emerging distributed energy-storage systems. These cha ...

The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed ...

Reliable packet delivery within stringent delay constraints is of primal importance to industrial processes with hard real-time constraints, such as electrical grid monitoring. Because retransmission and coding techniques counteract the delay requirements, ...

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Existing loading protocols for quasi-static cyclic testing of structures are based on recordings from regions of high seismicity. For regions of low to moderate seismicity they overestimate imposed cumulative damage demands. Since structural capacities are ...

The MAC layer of the IEEE 1901 standard for power line communications employs a CSMA/CA method similar to, but more complex than, this of IEEE 802.11 for wireless communications. The differences between these protocols raise questions such as which one per ...

We develop a formal framework for the analysis of security protocols in wireless networks. The framework captures characteristics necessary to reason about neighbor discovery protocols, such as the neighbor relation, device location, and message propagatio ...

In sensor networks, a key efficiency measure for routing protocols is the stretch of the computed paths, where the stretch is the ratio of the path length and the Euclidean distance covered. In the literature, many protocols have been evaluated via extensi ...

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

The power consumption of the Internet and datacenter networks is already significant due to a large degree of redundancy and high idle power consumption of the network elements. Therefore, dynamically matching network resources to the actual load is highly ...

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

This thesis addresses the security of two fundamental elements of wireless networking: neighbor discovery and ranging. Neighbor discovery consists in discovering devices available for direct communication or in physical proximity. Ranging, or distance boun ...

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that ad ...

Mobility-Centric Geocasting For Mobile Partitioned Networks

Chat with Graph Search

Numerical and experimental investigation of spiral-grooved gas journal bearings

Verification of Software Network Functions with No Verification Expertise

Routing for Wireless Sensor Networks: From Collection to Event-Triggered Applications

Stability-Aware Integrated Routing and Scheduling for Control Applications in Ethernet Networks

iPRP - the Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation

Dynamic Routing for Flying Ad Hoc Networks

Redundancy in Communication Networks for Smart Grids

Hierarchical Routing Over Dynamic Wireless Networks

iPRP: Parallel Redundancy Protocol for IP Networks

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Loading protocols for European regions of low to moderate seismicity

Fairness of MAC protocols: IEEE 1901 vs. 802.11

Formal Analysis of Secure Neighbor Discovery in Wireless Networks

On the efficiency of routing in sensor networks

Valuable Detours: Least-Cost Anypath Routing

Energy-Proportional and Scalable Networks

Signaling and Reciprocity : Robust Decentralized Information Flows in Social, Communication, and Computer Networks

Secure Neighbor Discovery and Ranging in Wireless Networks

Neighbor discovery with reception status feedback to transmitters

Castor: Scalable Secure Routing for Ad Hoc Networks