|
October 23 |
13.15-17.00 |
Keynote addresses (Lecture hall E3, KTH) |
|
|
|
Three algorithmic problems in mobile wireless networking
Dr. Matthias Grossglauser, EPFL/Nokia Research
Mobile wireless networks are different. They possess hyperlinks rather than point-to-point links, because of the broadcast nature of wireless transmission. Their topology is dynamic rather than fixed, because of mobility. And they may be partitioned rather than connected, because of heterogeneous node distributions and radio environments. In this talk, we discuss three models to capture each of these features, and three novel algorithms derived from these models for message routing and forwarding.
First, we show how to compute optimal opportunistic routes in a hypergraph model of a fixed wireless network. Second, we give an algorithm able to compute constant-stretch routes in mobile networks, while incurring low control overhead. Third, we discuss heuristic algorithms to route messages in partitioned clustered networks.
|
|
|
|
Distributed resource sharing in wireless
networks
Dr. Alexandre Proutiere, Microsoft Research
Distributed scheduling algorithms have played an increasingly important role in the development of cellular and mesh wireless networks, and yet the performance of even the simplest of these algorithms, such as Aloha or (non-) adaptive CSMA, are still not well understood. In particular, it is rather unclear whether current scheduling schemes manage to share radio resources fairly and efficiently, or whether more elaborated algorithms could provide significant improvement in performance.
(i) In the first part of the talk, we provide a general and accurate method to analyze the performance of random adaptive or non-adaptive CSMA algorithms. We apply this method to characterize the stability region of non-adaptive CSMA systems, a problem that has been open since the 70's and the first analysis of random MAC protocols. We also apply the analysis to predict the performance of adaptive CSMA schemes, e.g. the exponential back-off algorithm, and to quantify how unfair these algorithms can be.
(ii) In the second part of the talk, we analyze a family of distributed adaptive CSMA algorithms that do not rely on message passing, but yet are able to achieve throughput-optimality or to maximize a certain notion of network utility (hence guaranteeing fairness and efficiency). These algorithms have been independently introduced by various authors over the last year, and are actually based on simulated annealing methods proposed by Hajek in 1988 to solve the maximum weight matching problem. We provide a formal proof of their optimality, and further analyze the trade-off between short-term fairness and long-term efficiency that emerges with these algorithms.
|
|
|
|
IP for sensor networks
Dr. Adam Dunkels, SICS/IPSO Alliance
The application space for sensor networks and other smart objects is quickly growing in such diverse areas as home automation, improved agriculture, industrial monitoring, and oceanography. These emerging applications require scalable and interoperable communication mechanisms that support future innovation as the application space continue to grow. Until recently, Internet Protocol (IP) was considered too heavyweight and power-hungry to run on low-cost, battery-operated sensor networks and other wireless embedded devices.
With the Contiki operating system and the uIP TCP/IP stack, we have made IP lightweight and power-efficient enough to be used in wireless sensor networks and other embedded smart objects. IP has proven itself a long-lived, stable, and highly scalable communication technology that supports both a wide range of applications, devices, and underlying communication technologies. IP-based sensor networks enables seamless integration of sensor networks and other IP-based networks, but opens up new challenges in routing, network configuration, and network architecture. In this talk, I show how we map the IP architecture onto low-power wireless through leveraging clean-slate algorithms and mechanisms developed for sensor networks.
|
|
|
|
|
|
18.30-23.00 |
Guided tour of the Museum of National Art
followed by dinner at Stallmastaregarden |
|
|
|
October 24 |
08.30-10.00 |
Technical session I |
|
|
|
"New networking paradigms applied to vehicular ad
hoc networks"
Oscar Trullos-Cruces, Julian Morillo-Pozo, Jose Barcelo-Ordinas and
Jorge Garcia-Vidal |
|
|
|
"Mobility models for pedestrian content
distribution networks"
Vladimir Vukandinovic and Gunnar Karlsson |
|
|
|
"Virtual base stations in vehicular ad hoc networks"
Diego Borsetti, Marco Fiore, Claudio Casetti and Carla-Fabiana
Chiasserini |
|
|
10.30-12.30 |
Technical session II |
|
|
|
"Enhanced spatial reuse in multi-cell WLANs"
Thomas Bonald, Ali Ibrahim and James Roberts |
|
|
|
"Patterns in network utility maximization"
Bjorn Johansson, Jianwei Huang, Helen Li, Mung Chiang and Mikael
Johansson |
|
|
|
"Towards practical cross-layer optimal protocols
for wireless networks"
Pablo Soldati, Marco Belleschi, Lapo Belucanti, Mikael Johansson and
Andrea Abrardo |
|
|
|
"On transmit power allocation in OFDM networks"
Mikael Fallgren |
|
|
12.30-13.30 |
Lunch |
|
|
13.30-15.00 |
Technical session III |
|
|
|
"An 802.1x-based security architecture for MIP"
Rudolphe Marques, Helio Araujo and Andre Zuquete |
|
|
|
"QoS architecture in ad hoc networks: sensitivity
analysis of the admission control"
Tor K. Moseng and Oivind Kure |
|
|
|
"Towards a framework of network selection in
heterogeneous wireless networks"
Lusheng Wang, Daniel Kofman and David Binet |
|
|
15.30-17.00 |
Technical session IV |
|
|
|
"Seamless roaming: developments and challenges"
Adrian Popescu, Davird Erman, Dragos Ilie, Markus Fiedler,
Alexandru Popescu and Karel de Vogeleer |
|
|
|
"Beaconing in wireless mobile networks"
Abbas Nayebi and Gunnar Karlsson |
|
|
|
"A lookahead strategy for movement-based location
update in
wireless cellular networks"
Vicente Casares-Giner and Pablo Garcia-Escalle |