Routing in large-scale buses ad hoc 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.

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 ...

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

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 ...

Software packet-processing platforms- - network devices running on general-purpose servers-- are emerging as a compelling alternative to the traditional high-end switches and routers running on specialized hardware. Their promise is to enable the fast dep ...

Compared to Application-Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) provide reconfigurablity at the cost of lower performance and higher power consumption. Exploiting a large number of programmable switche ...

Recent research has studied the existence and the properties of a macroscopic fundamental diagram (MFD) for large urban networks. The MFD should not be universally expected as high scatter or hysteresis might appear for some type of networks, like heteroge ...

Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when ...

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

What are the social impacts of a new, less efficient public transport system in a city that is known for its inequality concerning access to daily activities and participation in urban life? More precisely, what are the implications of a re-regulated trans ...

The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not exceed the shortest distance from the child's home to ...

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 ...

At EPFL, a strategy for organising scientific outreach activities has been developed and a programme comprising various measures and actions elaborated to promote science and technology among youngsters, especially young girls. As part of this programme, w ...

Routing in large-scale buses ad hoc networks

Chat with Graph Search

Dynamic Routing for Flying Ad Hoc Networks

Space lower bounds for low-stretch greedy embeddings

Hierarchical Routing Over Dynamic Wireless Networks

Building Evolvable Networks : Flexible and Predictable Packet Processing

A Study on Buffer Distribution for RRAM-based FPGA Routing Structures

A three-dimensional macroscopic fundamental diagram for mixed bi-modal urban networks

Stable Routing And Unique-Max Coloring On Trees

Rate allocation and optimized decoding in inter-session network coding

Public Urban Transport, Mobility Patterns and Social Exclusion : The Case of Santiago de Chile

The School Bus Problem on Trees

On the efficiency of routing in sensor networks

Promotion of Science among Youngsters: Chemistry Outreach Initiatives at EPFL