A NEWLY PROPOSED COMBINED ROUTING ALGORITHM FOR MANET | ||||
| International Journal of Intelligent Computing and Information Sciences | ||||
| Article 1, Volume 15, Issue 2, April 2015, Page 1-14 | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/ijicis.2015.10913 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Hanafy Ali1; B Tawfek2; Adel El-Kabbany3 | ||||
| 1Computers and Systems Engineering Depart.,-Faculty of Engineering, Minia University, El Minia, Egypt | ||||
| 2Faculty of Computer Science Suez Kanal University | ||||
| 3Higher Technology Institute for Engineering in Belbees | ||||
| Abstract | ||||
| The Connected Dominating Set based routing is a promising approach for enhancing the routing efficiency in wireless Ad hoc networks. Two types of constructing connected dominating strategies exist; the first is the constant performance ratio schemes and the second is non-constant performance ratio schemes. The constant performance ratio schemes outperforms the non-constant performance ratio schemes, because non-constant performance ratio schemes cannot guarantee generating connected dominating set of small size. This paper proposes a Combined Routing Algorithm which is the merger between the two algorithms, Level-Based algorithm and marking algorithm. The new routing algorithm takes advantages from both algorithms. It guarantees constructing the connected dominating set of small size using Level-Based algorithm, easily update and maintain it using marking algorithm which is used to update the new network after the random movement. Simulation results have proved that the new proposed combined routing algorithm has average better performance than both algorithms (Level- Based algorithm and Marking algorithm) in all transmission ranges. | ||||
|
Statistics Article View: 187 |
||||
