PODC Archives

ACM PODC Participants List

PODC@LISTSERV.ACM.ORG

Options: Use Classic View

Use Proportional Font
Show Text Part by Default
Condense Mail Headers

Topic: [<< First] [< Prev] [Next >] [Last >>]

Print Reply
Content-Type: multipart/mixed; boundary="------------DB9907B352464E1639B05A29"
Sender: ACM PODC Participants List <[log in to unmask]>
From: Eric Fleury <[log in to unmask]>
Date: Mon, 2 Sep 2002 16:48:33 +0200
MIME-Version: 1.0
Reply-To: Eric Fleury <[log in to unmask]>
Parts/Attachments: text/plain (4 kB) , Eric.Fleury.vcf (4 kB)
-----------------------------------------------------------------------
               Please could you broadcast this message.

          Please Accept Our Sincere Apologies Should you Receive

                        Multiple Copies of this CFP
-----------------------------------------------------------------------



                    _____________________________
             C A L L   F O R   P A R T I C I P A T I O N
                    -----------------------------

                         DIAL M for Mobility
                         ___________________
                                
                    6th International Workshop on

                 Discrete Algorithms and Methods for
                 Mobile Computing and Communications

                         September, 28, 2002

                        Atlanta, Georgia, USA
               (In conjunction with ACM  MobiCom 2002)

                      Sponsored by ACM Sigmobile

                      http://dialm.insa-lyon.fr/




SCOPE

Mobile  computing and   communications  such as  portable   phones and
Personal Digital Assistants will have an  enormous impact on all of us
over the next several decades.   The introduction of mobility raises a
number  of new research questions. For  many of them, approaches based
on the continuous case  are not satisfactory,  and discrete models and
algorithms are required in order to deal with real applications.

The workshop DIAL M for Mobility is devoted to discrete algorithms and
discrete modelling in the context of mobile and wireless computing and
communications. It is  intended to be a  lively meeting, covering many
of the   algorithmic and discrete  aspects  of this  field  going from
operations   research  to radio engineering  problems.     It aims, in
particular, at   fostering  the  cooperation  among practitioners  and
theoreticians of the field.  Following  the success the first workshop
held jointly with Mobicom 97 in Budapest,  DIAL M for Mobility will be
co-located  with   ACM/IEEE  MobiCom  98 and    will  be   composed of
contributed and invited talks.


                          FINANCIAL SUPPORT

A limited support is available  for students to attend the conference.
Please send an  email to one of  the Program Chairs to  obtain further
information. We encourage the students to apply as soon as possible.


                          TENTATIVE PROGRAM
                 http://dialm.insa-lyon.fr/program.html
(The times might change slightly in order to coordinate with othe
workshops)



SESSION ONE

8.50-9.00 a.m. Welcome and Opening Remarks

9.00-10.00 a.m.

INVITED TALK:
Distributed Algorithmic Mechanism Design: Recent Results and Future 
Directions
Professor  Joan Feigenbaum,  Dept. Computer Science, Yale University.
joint work with Dr. Scott Shenker, ICSI

Coffee Break 10.00 - 10.30 a.m.


SESSION TWO 10.30-12.20 p.m.

Title: Asymptotically Optimal Geometric Mobile Ad-Hoc Routing
Author: Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger

Title: Cluster Based Routing Using a k-Tree Core Backbone for Mobile Ad 
hoc Networks
Authors: Saurabh Srivastava, Ratan K. Ghosh

Title: A Theoretical Study of Optimization Techniques USed in
Resgistration
Area Based Location Mangement: Models and Online Algorithms
Authors: Sandeep Gupta, Goran Konjevod, Georgios Varsamopoulos.

Title: Self-Stabilizing Mutual Exclusion Using Tokens in Mobile Ad Hoc 
Networks
Authors: Yu Chen, Jennifer L. Welch


Lunch 12.20 - 1.30 p.m.


SESSION THREE 1.40-2.40 p.m.

INVITED TALK:
Energy v/s Performance in Wireless Networks
Professor Hari Balakrishnan Laboratory of Computer Science MIT

Coffee Break 2.40-3.00 p.m.


SESSION 3:

3.00-4.15 p.m.

Title: Scalable Analysis and Design of Ad Hoc Networks via Random Graph 
Theory
Authors: Andras Farago

Title: Approximation Algorithms for the Mobile Piercing Set Problem
with Applications to Clustering in Ad-hoc Networks
Authors: Hai Huang, Andrea W. Richa, Michael Segal

Title: Simple Heuristics and PTASs for Intersection Graphs in Wireless 
Ad Hoc Networks
Authors: Xiang-Yang Li, Yu Wang


                             ORGANIZATION

CONFERENCE CHAIRS

Éric FLEURY
CITI/INRIA Rhône-Alpes
Domaine Scientifique de la Doua - INSA de Lyon
Bât. Léonard de Vinci - 21 av. Jean Capelle
F-69621 Villeurbanne Cedex
France
Work Phone: +33 472 434 421
Fax Number: +33 472 436 227
Email: [log in to unmask]

Madhav MARATHE
Los Alamos National Laboratory
P.O. Box 1663
Los Alamos, NM 87545
USA
Work Phone: +1 505 667 8010
Fax Number: +1 505 665 6474
Email: [log in to unmask]


TECHNICAL PROGRAM COMMITTEE

P. Agarwal, Duke University, USA
A. Bar-Noy, CUNY -- Brooklyn College, USA
P. Crescenzi, U. Firenze, Italia
B. Ducourthial, UTC, France
M. Gerla, UCLA, USA
P. Jacquet, INRIA, France
S. Krumke, ZIB Berlin, Germany
J-Y. Leboudec, EPFL, Switzerland
G. R. Mateus, UFMG, Brasil
M. Morvan, ENS-Lyon, France
S. Naor, Technion, Israel
D. Peleg, Weizmann Institute, Israel
C. Phillips, Sandia National Laboratories, USA
A. Richa, ASU, USA
B. Schieber, IBM Watson, USA
M. Steenstrup, BBN, USA
A. Srinivasan, University of Maryland, USA
P. Widmayer, ETH Zurich, Switzerland

STEERING COMMITTEE

Ian Akyildiz, Georgia Tech, USA
Maurizio Bonuccelli, University of Pisa, Italy
Afonso Ferreira, CNRS - I3S - INRIA - Sophia Antipolis, France
Errol Lloyd, University of Delaware, USA
Arunabha Sen, Arizona State University, USA.

ATOM RSS1 RSS2