A Connected Dominating Set Routing Protocol for Ad Hoc Networks

• Main Authors: Tzu-Lin Shiu, 徐紫菱
• Other Authors: 劉如生
• Format: Others
• Language: zh-TW
• Published: 2006
• Online Access: http://ndltd.ncl.edu.tw/handle/23258266120685294668

碩士 === 元智大學 === 資訊工程學系 === 94 === In order to transmit the same message information to all the nodes over the network, the routing protocol for discovering the routing path will utilize broadcasting mechanism for Ad hoc network and the blind blooding strategy is usually adopted for broadcast. The blind blooding is a strategy that each node rebroadcasts the packet to other nodes after receiving the packet at the first time. Then, the same packet is transmitted repeatedly and the broadcast storm will happen. In order to solve the broadcast storm problem, some researchers proposed an approach that the dominating set is selected as the forwarding nodes to rebroadcast the packet to control the number of packets effectively. Then, the number of packets transmission, the power consumption, the contention and the collision problem can be reduced. However, their methods may need more overhead for creating the dominating set. This paper will propose an efficient approach to improve the above problem. Basically, we will design an election algorithm to select a connected dominating set from Ad Hoc Networks. The election algorithm is based on the AODV, with which the hello message may contain the election information to select the connected dominating set. In this way, the backbone can be established with the minimum cost. After the backbone is created, the number of rebroadcast packets can be reduced effectively.