Some of the material in is restricted to members of the community. By logging in, you may be able to gain additional access to certain collections or items. If you have questions about access or logging in, please use the form on the Contact Page.
In this dissertation we study the security and survivability of wireless mobile network systems in two distinct threat models: the Byzantine threat model and the sel¯sh node threat model. Wireless mobile networks are collections of self-organizing mobile nodes with dynamic topologies and have no ¯xed infrastructure. Because of their dynamic ad hoc nature, these networks are particularly vulnerable to security threats. The security of such systems is, to a large extent, based on trust associations. There are several ways in which trust can be supported in a network system. The way we adopt is to establish a secure public key management infrastructure (PKI). This enables basic cryptographic functionalities, such as integrity, privacy, etc. However, due to the dynamic character of a wireless mobile network and its ad hoc topology changes, the trust associations cannot depend on any pre-established trust relations and must support a °exible, uncertain and incomplete trust model. One of our main goals in this dissertation is to analyze the distributed nature of trust in wireless mobile networks and to consider approaches that manage trust based only on locally available information. In our analysis for this problem we use the traditional Byzantine attack model. After reviewing the trust models proposed in the literature we propose an extension that supports a distributed trust management infrastructure. In this model the trust is distributed horizontally via multiple disjoint trust °ows. Compared to the traditional hierarchical trust distribution, our approach is appropriate for dynamic wireless systems for which there are no central trust authorities. A second goal is to manage trust based on the good behavior of nodes. Mobile wireless networks rely heavily on node collaboration. However, since the nodes are often battery xi powered, they may behave sel¯shly to preserve power. The threat model for this application is restricted to sel¯sh node attacks. We present a simple and e±cient reputation system, Locally Aware Reputation System (LARS) that mitigates sel¯sh node behavior. We explore methods that stimulate node cooperation in mobile wireless networks, and analyze the reputation systems proposed in the literature. The performance of LARS is evaluated in terms of its packet delivery ratio, its end-to-end delay and its overhead, and compared to the other reputation systems proposed in the literature. Finally, to enhance the security and survivability of wireless mobile networks against sel¯sh threats, we propose a mechanism that will trace sel¯sh node behavior. Chapter 4, 5 and 6 are the main contribution of the dissertation.
Wireless Network, Mobile Network, Network Security
Date of Defense
March 29, 2007.
A Dissertation submitted to the Department of Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy.
Includes bibliographical references.
Mike Burmester, Professor Directing Dissertation; Washington Mio, Outside Committee Member; Lois W. Hawkes, Committee Member; Alec Yasinsac, Committee Member; Zhenhai Duan, Committee Member; Breno de Medeiros, Committee Member.
Florida State University
Use and Reproduction
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). The copyright in theses and dissertations completed at Florida State University is held by the students who author them.