Please use this identifier to cite or link to this item:
The Lusus Protocol
|uhm_ms_3996_r.pdf||Version for non-UH users. Copying/Printing is not permitted||2.83 MB||Adobe PDF||View/Open|
|uhm_ms_3996_uh.pdf||Version for UH users||2.83 MB||Adobe PDF||View/Open|
|Title:||The Lusus Protocol|
|Authors:||Morton, Daniel H.|
|Issue Date:||Aug 2005|
|Abstract:||Wireless sensor networks are groups of nodes which sample data from one or more attached sensors and cooperate via wireless links to transmit this data to a destination. This document introduces Lusus, a new protocol designed to operate wireless sensor networks for ecological monitoring. Unlike other protocols with a more general design focus, Lusus assumes that the vast majority of information travels towards a central point. This allows Lusus to use specific routes in an efficient manner since the only route a node need know is the next hop towards the center of the network. Lusus uses a limited form of route discovery transmitted periodically from the center of the network and relayed by each node in the network. This periodic route discovery flood is done on the order of hours to save bandwidth. The routing overhead in Lusus is significantly less than in other protocols. Lusus assumes that data items are small (several bytes) in size. Furthermore Lusus is designed to optimize transferring small units of data. Individual pieces of data in a Lusus network are packaged within self-contained units. Because of this, nodes are allowed to combine the data from multiple separate packets into a single outgoing packet. This allows Lusus networks to save on overhead and thus increase their efficiency. This combining of data results in an overhead of 27% per piece of data whereas without combining the overhead is 85%. To help ensure data reception, Lusus uses hop-by-hop acknowledgments. This type of acknowledgment is necessary to support the data combining feature of Lusus. This document describes the operation of Lusus and offers an analysis of its performance for large and for dense networks.|
|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. - Information and Computer Sciences|
Please contact email@example.com if you need this content in an alternative format.
Items in ScholarSpace are protected by copyright, with all rights reserved, unless otherwise indicated.