You are here

FAU Collections » FAU Research Repository » FAU Theses and Dissertations

Range assignment problem and security in wireless networks

Download pdf | Full Screen View

Date Issued:
2006
Summary:
This thesis considers two important issues in wireless networks. In first part, we address Energy-Efficient Range Assignment in Heterogeneous Wireless Sensor Networks (HRA) and in second part, we present a survey on security attacks in ad hoc wireless networks. We address the HRA problem by selecting the transmission range for each energy-constraint sensor node such that a multi-hop communication path exists between each sensor' node and a resource-rich supernode while maximum power required is minimized. This is the first work to address this problem. We propose several solutions: an Integer Programming approach, a distributed greedy protocol, and a minimum spanning tree protocol based on clustering. In second part of this thesis, a survey is carried out on security attacks on routing protocols in ad hoc wireless network. We examine and classify major routing attacks and present a comprehensive survey on the state-of-the-art mechanisms and solutions designed to defeat such attacks.
Title: Range assignment problem and security in wireless networks.
90 views
26 downloads
Name(s): Pervaiz, Mohammad O.
Florida Atlantic University, Degree grantor
Cardei, Mihaela, Thesis advisor
College of Engineering and Computer Science
Department of Computer and Electrical Engineering and Computer Science
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 2006
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 110 p.
Language(s): English
Summary: This thesis considers two important issues in wireless networks. In first part, we address Energy-Efficient Range Assignment in Heterogeneous Wireless Sensor Networks (HRA) and in second part, we present a survey on security attacks in ad hoc wireless networks. We address the HRA problem by selecting the transmission range for each energy-constraint sensor node such that a multi-hop communication path exists between each sensor' node and a resource-rich supernode while maximum power required is minimized. This is the first work to address this problem. We propose several solutions: an Integer Programming approach, a distributed greedy protocol, and a minimum spanning tree protocol based on clustering. In second part of this thesis, a survey is carried out on security attacks on routing protocols in ad hoc wireless network. We examine and classify major routing attacks and present a comprehensive survey on the state-of-the-art mechanisms and solutions designed to defeat such attacks.
Identifier: 9780542576164 (isbn), 13341 (digitool), FADT13341 (IID), fau:10191 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (M.S.)--Florida Atlantic University, 2006.
Subject(s): Wireless communication systems--Security measures
Sensor networks
Wireless LANs--Security measures
Power resources--Efficiency
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/13341
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.