Thesis (M.S.)--University of Hawaii at Manoa, 2005. / Includes bibliographical references (leaves 84-86). Also available via World Wide Web.

Thesis (Ph.D.)--University of Central Florida, 2009. / Adviser: Kien A. Hua. Includes bibliographical references (p. 131-138).

No description available.

Thesis (M.S.)--University of Texas at Dallas, 2007. / Includes vita. Includes bibliographical references (leaves 163-166)

Dissertation (Ph.D.)--Auburn University, 2006. / Abstract. Includes bibliographic references (p.93-99).

Thesis (M.E.)--University of Canterbury, 2008. / Typescript (photocopy). "April 2008." Includes bibliographical references (leaves [93]-96). Also available via the World Wide Web.

International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / Sensor network applications typically require continuous monitoring of physical phenomena for extended periods of time under severe energy resource constraints. Accordingly, design considerations for sensor Media Access Control (MAC) protocols depart significantly from those of traditional wireless MAC protocols that largely ignore the energy factor. In this paper, we reexamine the design space of wireless sensor MAC protocols and modify IEEE 802.11 Distributed Coordination Function (DCF) to incorporate energy-adaptive contention mechanisms for prolonging sensor lifetime. Performance of the proposed schemes is evaluated with DCF as a baseline and results indicate the benefits of energy-aware mechanisms for sensor MAC protocols.

No description available.

No description available.

This thesis explores two strategies for supporting the development of network communication software: imposing constraints on protocol design at the specification level, and using a special-purpose language for protocol implementation. It presents a protocol implementation language called Morpheus. Morpheus utilizes the new strategies to provide a higher level of abstraction, finer grain modularity, and greater software reusability than previous approaches. Morpheus is able to provide a high level of abstraction because of built-in knowledge about its problem domain. It has a narrow problem domain--network protocols--that is further narrowed by the application of specification-level constraints. One particular constraint--the shapes constraint, which partitions protocols into three basic kinds--is particularly effective in raising the level of abstraction. Morpheus's support for modularity and, indirectly, software reuse hinges on reducing the performance penalty for layering. When protocol layering entails a high performance cost, developers are motivated to build complex monolithic implementations that are hard to design, implement, debug, modify, and maintain. Morpheus reduces the performance costs of layering by applying optimizations based on common patterns of protocol execution. If the degree of modularity is held fixed, then the optimizations simply improve performance. An optimization based on Integrated Layer Processing is particularly noteworthy for its dramatic contribution to network throughput while preserving modularity.