Please use this identifier to cite or link to this item:
Broadcast routing and scheduling of ad hoc networks
|uhm ms 3790 uh.pdf||Version for UH users||4.88 MB||Adobe PDF||View/Open|
|uhm ms 3790 r.pdf||Version for non-UH users. Copying/Printing is not permitted||4.88 MB||Adobe PDF||View/Open|
|Title:||Broadcast routing and scheduling of ad hoc networks|
|Contributors:||Sasaki, Galen H (advisor)|
Electrical Engineering (department)
|Date Issued:||Aug 2003|
|Publisher:||University of Hawaii at Manoa|
|Abstract:||In this thesis, we propose our approach to the problem of energy-efficient routing. Instead of considering the case when broadcast sessions are processed one by one in the order of their requests, we study the case when all the session requests are processed together. This type of traffic pattern can be found in some sensor networks, where many sensors are set up together to broadcast their information periodically over a long period of time. A simple method to set up the broadcasts is to sequence the broadcast requests in some arbitrary order, and then to route the requests, one by one, in their order. A natural question is whether the exact order can make a difference in performance and or cost. If it can then the next question is what are orders that lead to good performance and or cost. We refer to the problem of finding good orders as the problem of sequence control routing (SCR). By definition, sequence control routing means that session requests are processed according to some intelligent sorting schemes. We use the three heuristics introduced in  as broadcast tree construction algorithms. Our main contribution is to formulate the sequence control routing problem, propose the schemes determine the sequence and compare the performance when different broadcast tree construction algorithms are implemented.|
|Description:||vii, 49 leaves|
|Rights:||All UHM dissertations and theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission from the copyright owner.|
|Appears in Collections:||
M.S. - Electrical Engineering|
Please email firstname.lastname@example.org if you need this content in ADA-compliant format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.