Cluster overlay-dynamic source routing: highly scalable routing protocol

Authors:
Kwang-Soo Jang;Hyo-Sik Yang;Jong-Myung Rhee
Affiliations:
Department of Computer Engineering, Sejong University;Department of Computer Engineering, Sejong University;Dept. of Communication Engineering, Myongji University
Venue:
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Year:
2009

Citing 10
Cited 0

Location-aided routing (LAR) in mobile ad hoc networks

Wireless Networks
DSR: the dynamic source routing protocol for multihop wireless ad hoc networks

Ad hoc networking
Scalable routing protocol for ad hoc networks

Wireless Networks
DDR: distributed dynamic routing algorithm for mobile ad hoc networks

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Cluster Overlay Broadcast (COB): MANET Routing with Complexity Polynomial in Source-Destination Distance

IEEE Transactions on Mobile Computing
An adaptive clustering routing transition protocol in ad hoc networks

Computer Communications
Ad Hoc Networking

Ad Hoc Networking
A survey of clustering schemes for mobile ad hoc networks

IEEE Communications Surveys & Tutorials
Scalable routing strategies for ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scalable routing is one of the key challenges in designing and operating large scale MANETs. Performance of routing protocols proposed so far is only guaranteed under the various limitation, i.e., dependent of the number of nodes in the network or needs the location information of destination node.Due to the dependency to the number of nodes in the network, as the number of nodes increases the performance of previous routing protocols degrade dramatically. We propose Cluster Overlay Dynamic Source Routing (CODSR) protocol. We conduct performance analysis by means of computer simulation under various conditions-diameter scaling and density scaling.Developed algorithm outperforms the DSR algorithm, e.g., more than 90\% improvement as for the normalized routing load.Operation of CODSR is very simple and we show that the message and time complexity of CODSR is independent of the number of nodes in the network which makes CODSR highly scalable.