dc.creator | Chandra, Rajan | |
dc.date.accessioned | 2013-02-22T20:40:40Z | |
dc.date.available | 2013-02-22T20:40:40Z | |
dc.date.created | 2003 | |
dc.date.issued | 2013-02-22 | |
dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-2003-Fellows-Thesis-C422 | |
dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
dc.description | Includes bibliographical references (leaves 27-29). | en |
dc.description.abstract | As mobile networking advances, there is a need for services such as clock synchronization that improve performance and support the development of higher-level applications. This can be achieved by adapting existing algorithms (such as the Network Time Protocol) used in wired networks (e.g. Internet) to Mobile Ad Hoc Networks (MANets). It may also be achieved by developing other algorithms that achieve clock synchronization and may be suitable for MANets. Using the Network Time Protocol (NTP) as a basis, an algorithm was developed for clock synchronization in Mobile Ad Hoc Networks. NTP is the Internet standard for clock synchronization and has been designed for wired networks. Since mobile ad hoc networks are inherently different from wired networks, which are static, several components of NTP were analyzed and modified in developing the algorithm for MANets. Simulations were performed for testing a basic version of the algorithm using Network Simulator 2, a discrete event simulator widely used in research for simulating mobile ad hoc networks. Simulation results reveal interesting information about how the tested algorithm performed. Possible ways to improve the algorithm are also discussed. Another approach to achieve clock synchronization uses MANet specific communication primitives with Minimum Connected Dominating Set (MCDS) approximation algorithms. This involves using a subset of nodes in the network to broadcast clock information to neighboring nodes. Several MCDS approximation algorithms have been developed and it is important to analyze their strengths to determine how suitable they are for clock synchronization in mobile ad hoc networks. A few such algorithms are discussed. This work may encourage further research in improving the proposed algorithm or in the development of NTP based clock synchronization algorithms. Finally, it may contribute to the implementation and advancement of clock synchronization in mobile ad hoc networks. | en |
dc.format.medium | electronic | en |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.publisher | Texas A&M University | |
dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
dc.subject | computer engineering. | en |
dc.subject | Major computer engineering. | en |
dc.title | Clock synchronization for mobile ad hoc networks | en |
thesis.degree.department | computer engineering | en |
thesis.degree.discipline | computer engineering | en |
thesis.degree.name | Fellows Thesis | en |
thesis.degree.level | Undergraduate | en |
dc.type.genre | thesis | en |
dc.type.material | text | en |
dc.format.digitalOrigin | reformatted digital | en |