Distributed algorithms for mobile computing systems /
Mobile computers are characterized by the potential to periodically or continually change physical location. Mobility is the unifying characteristic of the two systems being studied: 1) wireless ad hoc networks of mobile processors and 2) self-reconfigurable, self-propelled modular robots. First,...
| Main Author: | |
|---|---|
| Format: | Thesis Book |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
2000.
|
| Subjects: | |
| Online Access: | http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=727853501&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD |
| Summary: | Mobile computers are characterized by the potential to periodically or continually change physical location. Mobility is the unifying characteristic of the two systems being studied: 1) wireless ad hoc networks of mobile processors and 2) self-reconfigurable, self-propelled modular robots. First, distributed algorithms are presented that are designed to adapt dynamically to processor movement in ad hoc networks of mobile processors. A mobility adaptable mutual exclusion algorithm and an extension of this mutual exclusion algorithm to the k-exclusion case is presented. Secondly, the distributed motion planning problem for self-reconfigurable robotic systems is discussed and distributed motion planning algorithms for the reconfiguration of straight chains of modular, self-reconfigurable robots are presented. These straight chain reconfiguration algorithms are used as building blocks for algorithms to reconfigure a straight chain to an arbitrary shape. |
|---|---|
| Item Description: | Vita. "Major Subject: Computer Science". |
| Physical Description: | xiii, 165 leaves : illustrations ; 28 cm. Issued also on microfiche from University Microfilm Inc. |
| Bibliography: | Includes bibliographical references (leaves 159-164). |