You are here

FAU Collections » FAU Research Repository » FAU Theses and Dissertations

Energy-efficient routing in ad hoc wireless networks

Download pdf | Full Screen View

Date Issued:
2003
Summary:
The ad hoc wireless network is an infrastructureless network, where mobile stations are typically powered by batteries. Energy conservation has therefore becomes a very important issue. In this thesis, we discuss our work on several problems in energy-efficient routing. Chapter 3 focuses on how to compute the minimum uniform broadcast transmission power in an ad hoc wireless network. Several algorithms are proposed and their running time compared through simulation. It is shown that Prim's Minimum Spanning Tree (MST) has better performance than Kruskal's MST and the two binary search algorithms. In the following two chapters, routing algorithms are studied for specific situations, when directional antenna is used (Chapter 4) or when partial signal could be collected, stored and integrated (Chapter 5). Different algorithms are discussed and their energy performance illustrated by simulation study. Their application and limitation are also discussed in the thesis.
Title: Energy-efficient routing in ad hoc wireless networks.
103 views
36 downloads
Name(s): Dai, Qing.
Florida Atlantic University, Degree grantor
Wu, Jie, Thesis advisor
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 2003
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 92 p.
Language(s): English
Summary: The ad hoc wireless network is an infrastructureless network, where mobile stations are typically powered by batteries. Energy conservation has therefore becomes a very important issue. In this thesis, we discuss our work on several problems in energy-efficient routing. Chapter 3 focuses on how to compute the minimum uniform broadcast transmission power in an ad hoc wireless network. Several algorithms are proposed and their running time compared through simulation. It is shown that Prim's Minimum Spanning Tree (MST) has better performance than Kruskal's MST and the two binary search algorithms. In the following two chapters, routing algorithms are studied for specific situations, when directional antenna is used (Chapter 4) or when partial signal could be collected, stored and integrated (Chapter 5). Different algorithms are discussed and their energy performance illustrated by simulation study. Their application and limitation are also discussed in the thesis.
Identifier: 9780496219155 (isbn), 13077 (digitool), FADT13077 (IID), fau:9941 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (M.S.)--Florida Atlantic University, 2003.
Subject(s): Wireless communication systems
Routers (Computer networks)
Electronic digital computers--Power supply
Mobile computing
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/13077
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.