[opensource] REMINDER: Mohomed Gourda Talk

T Cramer cramer.85 at osu.edu
Thu Feb 16 10:31:57 EST 2006


On the Structure of Application Programs in Sensor Networks

--------------------------------------------------------------------------------

Mohamed G. Gouda
Department of Computer Sciences
The University of Texas at Austin

Thursday, Feb 16 2006, 3:30PM
260 Dreese Labs
All interested parties are welcome to attend.
Refreshments will be available immediately preceding the talk.

Abstract:
We propose a novel structure for application programs in sensor 
networks. This structure is based on the well-known paradigm of Remote 
Procedure Calls. According to the proposed structure, an application 
program in a sensor network consists of a main program that executes on 
the base station of the network and several subroutines that reside on 
the different sensors in the network. It is expected that each sensor in 
the network hosts the same set of subroutines. The main program and 
subroutines exchange two types of messages: fore and back. Each fore 
message is sent, via a flood service, from the base station to every 
sensor in the network. The function of each fore message is to invoke a 
specified subroutine in some specified sensors in the network. An 
invoked subroutine usually performs some local operations on its sensor 
and then sends a back message which is forwarded, via a routing service, 
to the main program in the base station. Hence, a fore message can be 
viewed as a subroutine call (which calls the same subroutine in one or 
more sensors) and a back message can be viewed as a subroutine return 
call. We adopt this structure in our presentation of an application 
program to compute the maximum sensed temperature in a sensor network.

Bio:


Professor Gouda currently holds the Mike A. Myers Centennial 
Professorship in Computer Sciences at the University of Texas at Austin.

His research areas are distributed and concurrent computing and network 
protocols. In these areas, he has been working on abstraction, 
formality, correctness, nondeterminism, atomicity, reliability, 
security, convergence, and stabilization. He has published over fifteen 
book chapters, over sixty journal papers, and over ninety conference and 
workshop papers.

Prof. Gouda is the author of the textbook "Elements of Network Protocol 
Design", published by John-Wiley & Sons in 1998. This is the first ever 
textbook where network protocols are presented in an abstract and formal 
setting. He coauthored, with Tommy M. McGuire, the monograph "The Austin 
Protocol Compiler", published by Springer in 2005. He also coauthored, 
with Chin-Tser Huang, the monograph "Hop Integrity in the Internet", 
published by Springer in 2006.

He is the 1993 winner of the Kuwait Award in Basic Sciences. He is also 
the recipient of an IBM Faculty Partnership Award for the academic year 
2000 - 2001 and again for the academic year 2001 - 2002 and became a 
Fellow of the IBM Center for Advanced Studies in Austin in 2002. He won 
the 2001 IEEE Communication Society William R. Bennet Best Paper Award 
for his paper "Secure Group Communications Using Key Graphs", coauthored 
with C. K. Wong and S. S. Lam and published in the February 2000 issue 
of the IEEE/ACM Transactions on Networking (Volume 8, Number 1, Pages 
16-30). In 2004, his paper "Diverse Firewall Design", coauthored with 
Alex X. Liu and published in the proceedings of the International 
Conference on Dependable Systems and Networks, won the William C. Carter 
Award.

For more information, consult the website 
http://www.cs.utexas.edu/users/gouda


Host: Anish Arora


More information about the Opensource mailing list