A wireless ad hoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. A connection is achieved between two nodes through a single hop transmission if they are directly connected or multi-hop transmission if they are not. The wireless networks face challenges to form an optimal routing protocol. Some approaches are based on a dominating set, which has all the nodes either in the set or within its neighborhood. The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. The simulation results from the new algorithm are compared to results from Wu and Li’s algorithm. The simulation results show that the average dominating set of nodes decreased considerable after applying the new algorithm. The decrease in number of dominate set nodes is not very much noticeable in low density space.
Identifer | oai:union.ndltd.org:GEORGIA/oai:digitalarchive.gsu.edu:cs_theses-1028 |
Date | 04 December 2006 |
Creators | Nanuvala, Naresh |
Publisher | Digital Archive @ GSU |
Source Sets | Georgia State University |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | Computer Science Theses |
Page generated in 0.0019 seconds