Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


9036.pdf (2.9 MB)

ETD Abstract Container

Abstract Header

Performance and Security Mechanisms in Massive Scale Wireless Multi-hop Networks

Pandit, Vaibhav
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1396533120

Abstract Details

2014, PhD, University of Cincinnati, Engineering and Applied Science: Computer Science and Engineering.
The focus of this work is to explore Wireless Multi-hop Networks of massive scale. A growing number of applications are beginning to require large scale deployments, which introduces new challenges and opportunities in the area of Wireless Multi-hop communications. We identify a number of these challenges and make throughput, fairness and security the center of this study. We propose mechanisms to provide fairness and security in Massive Scale Wireless Multi-hop Networks (MS-WMNs), while making minimal compromises on the throughput. We first deal with the issue of fairness and throughput by deriving the optimal session rates that maximizes the proportional fair throughput in the three regular topologies and obtain their closed form expressions. This enables us to identify the optimal sending rates for each type of regular topology of the square, triangular and hexagonal lattice. With this, we compare the strengths and weaknesses of each deployment and make recommendations on the best choice of regular topologies for massive scale networks based on the size of the network. We also observe the variation in proportionally fair throughput on clustered regular topologies at different data event rates. Next, with regard to security in MS-WMNs, we develop a mechanism to counter the adverse affects of malicious Byzantine nodes in MS-WMNs. We identify an inherent security benefit of Analog Network Coding and develop a highly scalable decentralized neighborhood watch dog scheme, where every transmission is locally monitored by non-adjacent watchdog nodes. We analyze the security of our scheme against a host of Byzantine attacks and determine the trade-offs between security and overhead in terms of throughput and energy. In the last part of this work, we merge our frameworks and map our security mechanism to regular and random deployments of MS-WMNs. We study their performance and observe the suitability of each mapping and topology for various MS-WMN scenarios. We also introduce a simple and effective mechanism for creating regular overlays and clusters in completely random deployments, and measure its performance in terms of time, energy and fault tolerance.
Dharma Agrawal, D.Sc. (Committee Chair)
Kenneth Berman, Ph.D. (Committee Member)
Yizong Cheng, Ph.D. (Committee Member)
Chia Han, Ph.D. (Committee Member)
Robert Zierolf, Ph.D. (Committee Member)
139 p.
Computer Science
Multi-hop; Wireless; Regular; Networks; Topology; Security

Recommended Citations

Citations

  • Pandit, V. (2014). Performance and Security Mechanisms in Massive Scale Wireless Multi-hop Networks [Doctoral dissertation, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1396533120

    APA Style (7th edition)

  • Pandit, Vaibhav. Performance and Security Mechanisms in Massive Scale Wireless Multi-hop Networks. 2014. University of Cincinnati, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1396533120.

    MLA Style (8th edition)

  • Pandit, Vaibhav. "Performance and Security Mechanisms in Massive Scale Wireless Multi-hop Networks." Doctoral dissertation, University of Cincinnati, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1396533120

    Chicago Manual of Style (17th edition)

ucin1396533120
280
© 2014, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.