Universidade Federal do Rio de Janeiro COPPE

Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia

Instituto de Matemática

 
Visualizar Meses
Visualizar Meses
Visualizar Flat
Visualizar Flat
Visualizar Semanas
Visualizar Semanas
Visualizar Dias
Visualizar Dias
Categorias
Categorias
Procurar
Procurar

Evento: 'Seminário: Prof. Don Towsley (UMass) '

Eventos PESC (Palestras, Seminários, etc.)
Palestras, Seminários, etc. do PESC/COPPE/UFRJ.
Data: Friday, August 16, 2013 At 11:00
Duração: 2 Horas

O Prof. Don Towsley, da Universidade de Massachusetts Amherst (UMass), EUA, estará (mais uma vez) visitando o LAND-PESC/COPPE a partir da próxima semana. Apesar de atuar na área de Redes, seu trabalho de pesquisa é bem abrangente, e ele é um dos autores mais citados da Computação, além de ter recebido prêmios renomados da IEEE e ACM por excelência acadêmica. Ele irá proferir uma palestra no dia 16/8 (sexta), às 11h, na sala H-324B (ver detalhes abaixo).

----

Title:
Efficient Algorithms for Neighbor Discovery in Wireless Networks

Abstract:
Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of nodes, we propose a ALOHA-like neighbor discovery algorithm when nodes cannot detect collisions, and an order-optimal receiver feedback-based algorithm when nodes can detect collisions. Our algorithms neither require nodes to have a priori estimates of the number of neighbors nor synchronization between nodes. Our algorithms allow nodes to begin execution at different time instants and to terminate neighbor discovery upon discovering all their neighbors. We finally show that receiver feedback can be used to achieve a running time, even when nodes cannot detect collisions. We then analyze neighbor discovery in a general multihop setting. We establish an upper bound of on the running time of the ALOHA-like algorithm, where denotes the maximum node degree in the network and the total number of nodes. We also establish a lower bound of on the running time of any randomized neighbor discovery algorithm. Our result thus implies that the ALOHA-like algorithm is at most a factor worse than optimal.

Biography:
Don Towsley holds a B.A. in Physics (1971) and a Ph.D. in Computer Science (1975) from University of Texas. He is currently a Distinguished Professor at the University of Massachusetts in the School of Computer Science. He has held visiting positions at numerous universities and research labs. His research interests include networks and performance evaluation.

He has served as Editor-in-Chief of IEEE/ACM Transactions on Networking and on numerous other editorial boards. He has served as Program Chair or Co-chair of several conferences including INFOCOM 2009.

He has received several achievement awards including the 2007 IEEE Koji Kobayashi Award and the 2011 INFOCOM Achievement Award. He has received numerous paper awards including the 2012 ACM SIGMETRICS Test-of-Time Award and a 2008 SIGCOMM Test-of-Time Paper Award, and the 1998 IEEE Communications Society William Bennett Best Paper Award. Last, he has been elected Fellow of both the ACM and IEEE.


Procurar no Calendário

Powered by ExtCalendar 2

© 2017 PESC/COPPE - Programa de Engenharia de Sistemas e Computação

Cidade Universitária, Centro de Tecnologia, Bloco H, Sala 319
Caixa Postal: 68511 CEP: 21941-972 Fones: +55 21 3938-8672 / +55 21 3938-8673 Fax: +55 21 3938-8676
Rio de Janeiro - RJ - Brasil
Horário de atendimento da Secretaria: 2a. a 6a. de 7:00 às 16:00 horas (exceto feriados escolares)