Thesis--Auburn University, 2009. / Abstract. Vita. Includes bibliographical references (p. 61-63).

Thesis (Ph. D.)--Rutgers University, 2008. / "Graduate Program in Computer Science." Includes bibliographical references (p. 121-124).

Dissertation (Ph.D.)--Auburn University, / Abstract. Vita. Includes bibliographic references (p.116-121).

Thesis (M.S.)--Rochester Institute of Technology, 2009. / Typescript. Includes bibliographical references (leaves 70-75).

Thesis (Ph.D)--Electrical and Computer Engineering, Georgia Institute of Technology, 2010. / Committee Chair: Li, Geoffrey Ye; Committee Member: Ma, Xiaoli; Committee Member: Stuber, Gordon; Committee Member: Wardi, Yorai; Committee Member: Yu, Xingxing. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 156-163). Also available in electronic version.

We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example, data might migrate away from failures or toward regions of high demand. The PersistentNode algorithm provides this service robustly, but with limited safety guarantees. We use the RAMBO framework to transform PersistentNode into RamboNode, an algorithm that guarantees atomic consistency in exchange for increased cost and decreased liveness. In addition, a half-life analysis of RamboNode shows that it is robust against continuous low-rate failures. Finally, we provide experimental simulations for the algorithm on 2000 nodes, demonstrating how it services requests and examining how it responds to failures.

Thesis (MScIng)--University of Stellenbosch, 2008. / Bibliography. Also available via the Internet.

Στη διπλωματική εργασία μελετάμε τη δυνατότητα συν-λειτουργίας των HAPs και των ad-hoc δικτύων. Μέσα από τη θεωρητική μελέτη και τις προσομοιώσεις προσπαθούμε να μελετήσουμε τις επιδόσεις ενός τέτοιου υβριδικού συστήματος, όσον αφορά τη δρομολόγηση και την αξιοπιστία στη μετάδοση της πληροφορίας. Αρχικά, προχωράμε σε μια θεωρητική μελέτη των στρατοσφαιρικών πλατφόρμων (HAPs) και των ad-hoc δικτύων. Αναφέρουμε δυνατότητες, τεχνολογίες και εφαρμογές των δύο αυτών τηλεπικοινωνιακών τύπων τεχνολογίας. Στη συνέχεια, παρουσιάζουμε το τηλεπικοινωνιακό σενάριο πάνω στο οποίο στηρίχθηκε η προσομοίωση και, τέλος, παρουσιάζουμε αναλυτικά τα αποτελέσματα που προέκυψαν από την πειραματική διαδικασία με μορφή πινάκων και διαγραμμάτων καθώς και τα συμπεράσματα στα οποία καταλήγουμε βάσει των μετρήσεών μας. / --

Vehicular ad hoc networks (VANETs) provide opportunities to exchange traffic information among vehicles allowing drivers to not only adjust their routes but also prevent possible collisions. Due to the criticality of exchanged information, message authentication which will not expose the privacy of vehicles is required. The majority of current authentication schemes for VANETs depend primarily on public-key cryptography which brings extra overhead in terms of delay and requires infrastructure support for certificate verification. Symmetric-key based techniques can be more efficient, but they introduce significant key maintenance overheads. Herein, by considering the natural group behavior of vehicle communications, we propose an efficient and lightweight symmetric-key based authentication scheme for VANETs based on group communication. Expanding the protocol's flexibility, we also propose an extension which integrates certain benefits of asymmetric-key techniques. We analyze the security properties of our proposed schemes to show there applicability when there is little to no infrastructure support. In addition, the proposed protocol was implemented and tested with real-world vehicle data. Simulation results confirmed the efficiency in terms of delay with respect to other proposed techniques.