Joint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-hop Wireless Networks
Graph Chatbot
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.
Sensor networks are large scale networks of low-power devices that collaborate in order to perform a given task. The sensors are limited in battery energy, capacity and computational power. In recent years, researchers have proposed several protocols for s ...
We consider the question of what performance metric to maximize when designing adhoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...
We present a new scheme that mimics pattern formation in biological systems to create transmission patterns in multi-hop ad hoc networks. Our scheme is decentralized and relies exclusively on local interactions between the network nodes to create global tr ...
We consider data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information, collected by the nodes, to the sink node. This problem requires a joint ...
This paper provides a short review of recent results on synchronization in small-world dynamical networks of coupled oscillators. We also propose a new model of small-world networks of cells with a time-varying coupling and study its synchronization proper ...
We consider the joint optimization of sensor placement and transmission structure for data gathering, where a given number of nodes need to be placed in a field such that the sensed data can be recon structed at a sink within specified distortion bounds wh ...
The traditional layered networking approach is not efficient in ad-hoc net-works. We are interested in finding a jointly optimal scheduling, routing and power control that achieves max-min fair rate allocation in a multi-hop wireless network. This is a hig ...
We give a lower bound of Ω(n) rounds for broadcasting in a mobile ad hoc network, where n is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Brus ...
Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile. Terminode routin ...
We consider the question of what performance metric to maximize when designing ad-hoc wireless network protocols such as routing or MAC. We focus on maximizing rates under battery lifetime and power constraints. Commonly used metrics are total capacity (in ...
