Centralized algorithms for maintaining connectivity in a mobile ad hoc network /
This thesis focuses on the problem of maintaining connectivity in a mobile ad hoc network (MANET). In a connected MANET, communication is possible between any pair of nodes. The nodes in a mobile ad hoc network are constantly moving causing frequent topology changes. Hence, the network may not remai...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1999.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | This thesis focuses on the problem of maintaining connectivity in a mobile ad hoc network (MANET). In a connected MANET, communication is possible between any pair of nodes. The nodes in a mobile ad hoc network are constantly moving causing frequent topology changes. Hence, the network may not remain connected at all times. In this thesis, we look at schemes which force nodes to move involuntarily and keep the MANET connected. These algorithms are called forced distance algorithms. We study various types of disconnectivities that can occur due to the movement of one node and schemes which try to maintain connectivity when these disconnectivities occur. This thesis also studies the behaviour of these schemes, since forcing nodes to move, further changes the network topology of an already dynamically changing network. Results generated using an event-based simulator are used to compare the various schemes. |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | ix, 73 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references (leaves 70-72). |