Vehicular Networks
CS 795/895
Dr. Michele
Weigle
mweigle at cs.odu.edu
|
Spring 2008
TR 9:30-10:45 am
E&CS 2120
|
Paper Assignment Notes:
- All assignments must be typed.
- Use only 12 pt Arial or Times font.
- Your name must be at the top of each page.
- All assignments must be completed independently. It is fine, and
even encouraged, for you to discuss the paper with classmates, but it
is not acceptable to discuss answers to the questions.
- All answers must be in your own words. Avoid quoting
excessively from the paper, but if you must quote the authors' words,
put quotation marks around the quoted material.
- Assignments must be submitted using Blackboard and a hardcopy must be submitted in class.
Paper Assignment #2
Assigned: Thurs, Feb 14
Due: Tues, Feb 19 before 11 am
(submit a hard-copy by slipping it under my office door before the
deadline)
[WFG+04] H. Wu, R. Fujimoto, R. Guensler, and M. Hunter, MDDV:
A Mobility-Centric Data Dissemination Algorithm for Vehicular
Networks, Proceedings of ACM VANET, 2004.
Answer the following questions about [WFG+04]:
- Produce examples (including a figure or diagram) that
illustrate the message head candidate transitions (both from message
head candidate to non-candidate and from non-candidate to candidate).
- Describe another localized algorithm that could use the generic
mobile computation approach. Identify what each approach (global
behavior, ideal scenario, approximation) would be for this
algorithm/application (similar to Section 3.3).
- Describe how the approach to data dissemination in MDDV is
different from the other papers we've looked at so far.
- Referring to Figures 5 and 6, why might the maximum delay still
be so high (300 s) with 50% penetration when the delivery ratio at
that level of penetration is close to 1?
- Describe an application that could take advantage of MDDV for
data dissemination. Why would using MDDV be more advantageous than
another method for that particular application?