Distributed fair scheduling and optimal routing protocols for wireless ad hoc and sensor networks
"This thesis presents a novel distributed fair scheduling and routing protocols for wireless ad hoc and sensor networks. Since fairness is an important issue when the wireless nodes access a shared channel, the proposed adaptive and distributed fair scheduling (ADFS) scheme allocates the channel bandwidth in proportion to the weight of the packet flows...In addition, a novel optimized energy-delay routing (OEDR) protocol is presented, which generates routes based on delay, energy efficiency and state of the radio channel."--Abstract, page iii.
Electrical and Computer Engineering
M.S. in Computer Engineering
University of Missouri--Rolla
x, 86 pages
© 2004 Niranjan Regatte, All rights reserved.
Thesis - Citation
Wireless communication systems
Computer network protocols -- Design
Routers (Computer networks)
Print OCLC #
Link to Catalog Record
Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.http://laurel.lso.missouri.edu/record=b5283962~S5
Regatte, Niranjan, "Distributed fair scheduling and optimal routing protocols for wireless ad hoc and sensor networks" (2004). Masters Theses. 2647.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.