CS GZ06/4038: Mobile and Adaptive Systems


Steve Hailes s.hailes@cs.ucl.ac.uk 7.19 MPEB
Brad Karp 7.05 MPEB
Cecilia Mascolo c dot mascolo at cs dot ucl dot ac dot uk 7.18 MPEB

Meeting Times

UCL Term 2, Weeks 20-24 (8th January, 2007 - 9th February, 2007)

  • Monday 10 AM - 11 AM, MPEB 1.02
  • Monday 3 PM - 4 PM, MPEB 1.20
  • Tuesday 1 PM - 2 PM, MPEB 1.03
  • Wednesday 9 AM - 10 AM, Tottenham (188) SB4
  • Wednesday 10 AM - 11 AM, MPEB 1.20
  • Thursday 10 AM - 11 AM, MPEB 1.02
  • Friday noon - 1 PM, MPEB 1.20
  • N.B. that the above times sum to seven hours per week, but the course will typically meet six hours per week. Students should refer to the detailed calendar below throughout the term to ensure they are up-to-date on meeting times.

    Detailed Course Calendar

    Each paper appears in the calendar below on the day when it will be covered in lecture. Students will find they get the most out of lecture by far when they read papers before they are covered, and are strongly encouraged to do so. Papers marked Pre-Reading: must be read before the day on which they appear in the calendar.

    N.B. that all assigned readings (including those presented by students at the end of the course) are examinable.

    Monday Tuesday Wednesday Thursday Friday

    8th Jan



    9th Jan


    Introduction to Sensor Nets

    Pre-Reading: SensorNet survey


    10th Jan


    Security for sensor nodes

    Pre-Reading: SPINS

    Pre-Reading: Key distribution

    11th Jan


    Security: DoS, Trust

    Pre-Reading: DoS


    12th Jan


    Cancelled (or overrun)

    15th Jan


    Pre-Reading: Simulation1

    Pre-Reading: Simulation2

    16th Jan

    Geographic Routing

    Lecture Notes:
    Reading Critically, GPSR

    Pre-Reading: GPSR

    17th Jan

    Geographic Routing, revisited

    Lecture Notes: CLDP

    Pre-Reading: CLDP

    18th Jan

    Data-Centric Storage

    Lecture Notes: DCS/GHT

    Reading: GHT

    19th Jan

    Wireless LAN MACs

    Lecture Notes: MACAW and Wireless MACs

    Pre-Reading: MACAW

    22nd Jan

    Mesh Networks

    Lecture Notes: Roofnet

    Pre-Reading: Roofnet

    23rd Jan

    Distributed Hash Tables (DHTs)

    Lecture Notes: DHTs and Chord

    Pre-Reading: Chord

    24th Jan


    9 - 10 AM:
    No lecture!

    10 - 11 AM:
    Distributed Hash Tables (DHTs) (cont'd)

    Lecture Notes: (continuation of 23rd Jan slides)

    25th Jan


    Lecture Notes: XORs Slides

    Reading: XORs

    26th Jan


    Lecture Notes: Zebra Slides

    Pre-Reading: Zebranet

    29th Jan


    Lecture Notes: Cartel Slides

    Reading: Cartel


    Lecture Notes: Costa-Picco

    Pre-Reading: Semi-Prob. Pub-Sub

    30th Jan

    Sensor Programming

    Lecture Notes: Abstract Regions Slides

    Reading: Abstract Regions

    31st Jan

    Service Composition and Reputation

    Lecture Notes: Mobile Bazaar

    Reading: Mobile Bazaar

    1st Feb

    Reality Mining

    Lecture Notes: Reality Mining Slides

    Reality Mining

    2nd Feb

    No lecture!

    5th Feb

    10 AM:
    Reading: Providing Robust and Ubiquitous Security Support for Wireless Mobile Networks

    3 PM:
    Reading: Ariadne

    6th Feb

    Reading: An Agent-Based Trust and Reputation Management Scheme for Wireless Sensor Networks

    7th Feb

    9 AM:
    Reading: Island Hopping

    10 AM:
    Reading: i3 (Internet Indirection Infrastructure)

    8th Feb

    Reading: Ivy

    9th Feb

    No lecture!

    Assigned Readings (to be covered in lectures and discussions)

    Steve Hailes:

  • General introduction to sensornets:
    Akyildiz, I., Su, W., Sankarasubramaniam, Y., and Cayirci, E., A survey on sensor networks, in IEEE Commun. Mag., 40 (8), (2002), 102--114. html
  • Security in mote-based sensornets:
    Perrig, A., Szewczyk, R., Wen, V., Culler, D., and Tygar, J. D., SPINS: Security protocols for sensor networks, in Proceedings of MobiCom 2001. html
  • More security for sensornets:
    Chan, H., Perrig, A., and Song, D., Random Key Predistribution Schemes for Sensor Networks, in Proc. of the IEEE Symposium on Security and Privacy (Oakland 2003). html
  • DoS in sensornet context:
    Wood, A.D. and Stankovic, J.A., Denial of Service in Sensor Networks, in IEEE Computer, Oct 2002. html
  • Simulation and its problems:
    Cavin, D., Sasson, Y., and Schiper, A., On the accuracy of MANET simulators, in Proceedings of the ACM Workshop on Principles of Mobile Computing (POMC '02), Oct. 2002, pp. 38--43. html
  • D. Kotz, C. Newport, R. Gray, J. Liu, Y. Yuan, and C. Elliott, "Experimental evaluation of wireless simulation assumptions," in Int'l Workshop Modeling Analysis and Simulation of Wireless and Mobile Systems (MSWiM 04). ACM Press, New York, Oct. 2004. html
  • Brad Karp:

  • Geographic routing (scalable routing in multi-hop wireless networks):
    Karp, B. and Kung, H.T., GPSR: Greedy Perimeter Stateless Routing for Wireless Networks, in Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000), Boston, MA, August, 2000, pp. 243-254. .ps.gz
  • Geographic routing, revisited (on arbitrary topologies):
    Kim, Y.-J., Govindan, R., Karp, B., and Shenker, S., Geographic Routing Made Practical, in the Proceedings of the Second USENIX/ACM Symposium on Networked System Design and Implementation (NSDI 2005), Boston, MA, May, 2005. pdf
  • Data-centric storage (scalable storage for power-constrained sensornets):
    Ratnasamy, S., Karp, B., Shenker, S., Estrin, D., Govindan, R., Yin, L., and Yu, F., Data-Centric Storage in Sensornets with GHT, A Geographic Hash Table, in Mobile Networks and Applications (MONET), Special Issue on Wireless Sensor Networks, 8:4, Kluwer Academic Publishers, August, 2003, pp. 427-442. pdf
  • The "classic" wireless MAC layer:
    Bharghavan, V., Demers, A., Shenker, S., and Zhang, L., MACAW: A Media Access Protocol for Wireless LANs, in ACM SIGCOMM 1994. ps.gz
  • A real, built mesh network:
    Bicket, J., Aguayo, D., Biswas, S., and Morris, R., Architecture and Evaluation of an Unplanned 802.11b Mesh Network, in MobiCom 2005, August 2005. pdf
  • One of the original Distributed Hash Table (DHT) overlay proposals:
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., and Balakrishnan, H., Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications, in ACM SIGCOMM 2001, San Diego, CA, USA, August 2001, pp. 149-160. pdf
  • Cecilia Mascolo:

  • XORs in the air: Practical wireless network coding:
    Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard and Jon Crowcroft. In Proceedings of SIGCOMM 2006., Sept. 2006, Pisa, Italy. ACM. pdf
    Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L., and Rubenstein, D., Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with zebranet, in ASPLOS 2002, San Jose, CA, October 2002. html
  • Bret Hull, Vladimir Bychkovsky, Yang Zhang, Kevin Chen, Michel Goraczko, Allen K. Miu, Eugene Shih, Hari Balakrishnan, Samuel Madden:
    CarTel: A Distributed Mobile Sensor Computing System. In Proceedings of SenSys, Boulder, CO, November 2006. pdf
  • Publish-Subscribe on Ad Hoc Networks:
    Costa, P., and Picco, G.P., Semi-probabilistic Content-Based Publish- Subscribe, in Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), June 6-19, Columbus (OH, USA), pp. 575-585, IEEE Computer Society Press. pdf
  • , Matt Welsh and Geoff Mainland:
    Programming Sensor Networks Using Abstract Regions. In Proceedings of NSDI'04. pdf
  • Service Composition and Reputation:
    Chakravorty, R., Agarwal, S., Banerjee, S., and Pratt, I., MoB: A Mobile Bazaar for Wide-area Wireless Services, in Proceedings of MobiCom 2005. pdf
  • N. Eagle and A. Pentland:
    Reality Mining: Sensing Complex Social Systems. Personal and Ubiquitous Computing. Vol 10, #4, 2006. pdf

  • Presentation Papers (to be presented by student groups)

    N.B. that papers in red have been claimed by groups for their presentations.

    Steve Hailes:

  • Performance evaluation of ad hoc routing
    J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In Proc. of the ACM/IEEE MobiCom, October 1998. html
  • Security in mobile networks:
    Kong, J., Zerfos, P., Luo, H., and Lu, S., Providing Robust and Ubiquitous Security Support for Wireless Mobile Networks, in ICNP 2001. html
  • Emulation for mobile systems:
    Noble, B., Satyanarayanan, M., Nguyen, G., and Katz, R., Trace-Based Mobile Network Emulation, in ACM SIGCOMM 1997. html
  • Secure routing for ad hoc networks
    Y.-C. Hu, A. Perrig, and D. B. Johnson, Ariadne: A secure on-demand routing protocol for ad hoc networks, in The 8th ACM International Conference on Mobile Computing and Networking, September 2002. html
  • Trust management
    Boukerche, A. and Li, X., An agent-based trust and reputation management scheme for wireless sensor networks, in Global Telecommunications Conference, 2005 (GLOBECOM '05). pdf
  • Brad Karp:

  • A read-write filesystem atop a DHT, based on logs:
    Muthitacharoen, A., Morris, R., Gil, T., and Chen, B., Ivy: A Read/Write Peer-to-peer File System, in ACM/USENIX OSDI 2004. pdf
  • The nature of congestion in sensornets, and how to control it:
    Rangwala, S., Gummadi, R., Govindan, R., and Psounis, K., Interference-Aware Fair Rate Control in Wireless Sensor Networks, in SenSys 2006. pdf
  • Synopsis Diffusion: how to aggregate measurements in a sensornet robustly, without duplicating values (!):
    Nath, S., Synopsis Diffusion for Robust Aggregation in Sensor Networks, in SenSys 2004. pdf
  • DHT lookup as rendezvous primitive for multicast, anycast, and mobility support:
    Stoica, I., Adkins, D., Zhuang, S., Shenker, S., and Surana, S., Internet Indirection Infrastructure, in ACM SIGCOMM 2002. pdf
  • Routing for mesh networks using a DHT-style structure:
    Caesar, M., Castro, M., Nightingale, E., O'Shea, G., and Rowstron, A., Virtual Ring Routing: Network Routing Inspired by DHTs, in ACM SIGCOMM 2006. pdf
  • Cecilia Mascolo:

  • N. Sarafijanovic-Djukic, M. Piorkowski, and M. Grossglauser. Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks. In Proceedings of IEEE SECON 2006, Reston, VA, September 2006. pdf.
  • Shah, R.C. Roy, S. Jain, S. Brunette, W. Data MULEs: modeling a three-tier architecture for sparse sensor networks. In Proceedings of IEEE Workshop on Sensor Network Protocols and Applications. May 2003. Seattle, WA. pdf
  • A. Seth, D. Kroeker, M. Zaharia, S. Guo, S. Keshav. Low-cost Communication for Rural Internet Kiosks Using Mechanical Backhaul. In Proceedings MOBICOM 2006, September 2006. pdf
  • A Unifying Link Abstraction for Wireless Sensor Networks. J. Polastre et al. In Proceedings of International Conference On Embedded Networked Sensor Systems (Sensys05). San Diego, CA. 2005. pdf
  • Lindgren, A., Doria, A., and Schelen, O., Probabilistic Routing in Intermittently Connected Networks, in Proceedings of the The First International Workshop on Service Assurance with Partial and Intermittent Resources (SAPIR 2004), August 2004, Fortaleza, Brazil. pdf

  • GZ06/4038 Presentation Guidelines


    Your coursework is a group exercise, in which you and your fellow group members prepare and deliver a presentation.

    All groups will be listed here once groups have been formed.

    Presentation Schedule

    Each presentation will take place during a one-hour lecture slot for GZ06/4038 during the last week of the half-term (5th February, 2007 - 9th February, 2007, inclusive). Your group will have 30 minutes for its presentation and 20 minutes for questions from students and staff. Please be prompt!

    The paper to be presented by each group and the schedule for presentations will appear in the course calendar once papers have been assigned to groups.

    Submission of Presentations Materials

    A single electronic version of your slides (PDF or gzip'ed PostScript) should be sent as an email attachment no later than:

         10 AM Monday, 5th February 2007

    to all course staff:

         S.Hailes@cs.ucl.ac.uk           C dot Mascolo at cs dot ucl dot ac dot uk

    What you send us is what we expect you to use during your presentation timeslot.

    Presentation Format

    Most groups in recent years have used a laptop to project slides; you may also use overhead projector slides, if you so desire, and any other appropriate materials or aids.

    Each group member should take a turn to speak, and all group members should speak for about the same amount of time.

    Each group's presentation should include:

    1. a summary of the work/experiments in the paper
    2. the main conclusions drawn and why the work is important
    3. a critical appraisal of the work
    4. a summary and appraisal of relevant/similar work in the area


    At least two members of staff will be present for presentations. You will be assesed on [% of marks]:

    1. presentation structure and delivery [10%]
    2. a summary of the work in the paper and the main conclusions (a and b) [10%]
    3. a critical appraisal of work in the paper (c) [15%]
    4. a summary and appriasal of some relevant/similar work (d) [15%]
    5. responses to questions [10%]
    6. a short individual report (3 pages of A4 maximum, plus references) discussing the main issues with respect to future development and application of the particular technology/system you have presented. This should be a personal viewpoint backed-up by references to literature in support of the statements in your discussion. [40%]

    The marksheet that the assessors will be using for the presentations can be found here.

    Note that:

    Each student must submit his individual report by:

         Friday, 16th February, 2007

    You will be required to submit the individual report both electronically and on paper; you will be sent further instructions by email concerning how and when you should do so.