CSE 535: Mobile Computing (Spring 2006)

Lecture T, TH 1:40 P.M. - 2:55 P.M. BYAC 240
Course Line No 19834
Instructor Sandeep Gupta
Office BY522
Email Sandeep.Gupta@asu.edu
Office Hours T, TH 10:30 A.M. - 12 P.M.

Course Description

The need for information anywhere anytime has been a driving force for the increasing growth in Web and Internet technology, wireless communication, and portable computing devices. The field of mobile computing is the merger of these advances in computing and communication with the aim of providing seamless and ubiquitous computing environment for mobile users. Mobile computing environments are characterized by severe resource constraints and frequent changes in operating conditions. This has led to many new and challenging problems which span several areas of computer science such as incorporation of support for mobility in network protocols, development of efficient and adaptive resource management techniques for wireless bandwidth and battery power, predicting mobility patterns, performance modeling and simulation of mobile applications, and supporting mobile real-time multimedia applications.

The goal of this course is to provide an in depth understanding of the fundamental problems in the area of mobile computing and study the existing and proposed solutions for these problems from both research and development perspective. Several topics including wireless communication, location management and mobility tracking, location-aware information services, and mobile agents will be covered in this course. The course will be mostly self contained and will cover any required background material. Course work will involve programming and homework assignments, exams/quizzes, and term project.

  • Undergraduate students can take this course with instructors permission

Reference Textbooks
  • Fundamentals of Mobile and Pervasive Computing by S. K. S. Gupta, F. Adelstein, G. Richard and L. Schweibert

Grading Criteria:

Assignment Points Date Assigned Due Date
Classwork 20
Homework 40
Paper presentation 40
Total 100


Lecture notes
Date Topic Synopsis Material
01/17/06 Introduction Lecture notes
01/19/06 Data Dissemination & Management (Ch3) Lecture notes
01/24/06 Mobile data access & dissemination
  • Exploit wireless broadcast medium
  • Save energy
  • Tradeoff between energy and latency
  • Mobile data caching
  • Reference:
Lecture notes
01/26/06 Data Dissemination & Management (Ch3) Lecture notes
01/31/06 Data Caching
  • Data caching
  • Cache consistency protocol
Lecture notes
02/02/06 Research methodology
  • Technical paper reading and various resources
Lecture notes
02/07/06 Emerging technologies Lecture notes
02/09/06 Paper review Lecture notes
02/14/06 Paper discussion: MAX Lecture notes
02/16/06 Paper presentation
  • Search-related issues in MAX
  • Harvey's presentation: A quantitative comparison of ad hoc routing protocols with and without channel adaptation (slides)
Lecture notes
02/21/06 Paper presentation
  • Peyman's presentation: Reliable transfer on wireless sensor networks (slides)
  • Reliability mechanisms in TCP
  • TCP is not efficient in sensor networks
Lecture notes
02/23/06 Paper presentation
  • Rob's presentation: Towards resilient security in wireless sensor networks (slides)
  • Security issues in WSN
Lecture notes
02/28/06 Paper presentation
  • Bing's presentation: Maximum lifetime routing in wireless sensor networks (slides)
Lecture notes
03/02/06 Paper presentation
  • Zhiqiang's presentation: An energy-efficient MAC protocol for wireless sensor networks (slides)
Lecture notes
03/07/06 Paper presentation Lecture notes
03/09/06 Mobile adaptive computing
  • Distinguishing from traditional distributed system (DS)
  • Adaptive to the changing environment
    • Types of adaptation schemes:
      • Static (compile/design time)
      • Dynamic (runtime)
    • What to adapt:
      • Functionality
      • Data
Lecture notes
03/21/06 CH2: Mobility management Lecture notes
03/23/06 CH2: Mobility management (Cont.)
03/28/06 Location Mangement
03/30/06 Location Mangement
  • Next (several classes): Information theory and its application to location management
    • Lezi-Update: an information-theoretic framework for personal mobility tracking in PCS networks, A. Bhattacharya and S.K. Das, Wireless Networks 8, 121-135, 2002
  • Lazy caching
Lecture notes
04/04/06 Information Theory Introduction
  • What is information?
  • Quantity information
  • Entropy
  • Source coding techniques
  • Desirable properties of codes
Lecture notes
04/06/06 Information Theory
  • Properties
  • Entropy & coding efficiency
    • Huffman code
    • Properties of Huffman code
    • Characteristics of Huffman code
Lecture notes
04/11/06 Information Theory
  • Finals May 4 12:20-2:10PM
  • Source coding
  • Coding procedure
  • Detection procedure
Lecture notes
04/13/06 Game Theory and its Application to Mobile Computing
  • The tradedy of the commons by Garrett Hardin
Lecture notes, Game Theory Slides No.1, Game Thoery Slides No.2
04/18/06 Paper Persentation
Lecture notes
04/20/06 Paper Persentation
Lecture notes
04/25/06 Research Persentation
  • Security for service discovery protocols in pervasive computing (slides)
  • Criticality control
  • Remote healthcare
  • Localization in wireless sensor networks (slides and demo)
  • Thermal management of datacenter (slides)
  • Multicast lifetime in WANETs (slides)

Homework Date assigned Due date
Assignment #1 02/07/06 02/09/06
Assignment #2 02/14/06 02/21/06
Assignment #3 03/09/06 03/21/06

Reading List:

Paper Presentation Schedule
Presenter Paper Date
Harvey X-H. Lin and V.K.N. Lau, A quantitative comparison of ad hoc routing protocols with and without channel adaptation, IEEE Transactions on Mobile Computing, Vol. 4, No. 2, 2005 02/16/06
Peyman S. Kim, R. Fonseca and D. Culler, Reliable transfer on wireless sensor networks, IEEE SECON 2004 02/21/06
Rob H. Yang, F. Ye, Y. Yuan, S. Lu and W. Arbaugh, Towards resilient security in wireless sensor networks, MobiHoc 2005 02/23/06
Bing J-H Chang and L Tassiulas, Maximum lifetime routing in wireless sensor networks, IEEE Trans. on Networking 02/28/06
Zhiqiang W. Ye, J. Heidemann and D. Estrin, An energy-efficient MAC protocol for wireless sensor networks, INFOCOM 2002 03/02/06

Policy on Cheating:

Any incidence of cheating in this class will be severely dealt with. This applies to homework assignments, programming assignments, quizzes and tests. The minimum penalty for cheating will be that the student will not obtain any credit for that particular assignment. (This means that if in a test and/or assignment a student is found have cheated, he/she will obtain zero in that test and/or assignment.) For the homework and the programming assignments students may discuss the problems with others, but one is expected to turn in the results of one's own effort (not the results of a friend's efforts). One tends to get very suspicious if two identically wrong results show up in the homework assignment and/or tests. The names of the offenders will be maintained in the departmental files. The repeat offenders may be debarred from the University.

Home | Projects | People | Publications | Courses | Resources | Contact