Cluster-Based DSDV Routing Protocol in Mobile Ad Hoc Networks 


Vol. 32,  No. 6, pp. 617-623, Jun.  2007


PDF
  Abstract

A novel c-DSDV routing protocol is proposed in clustered mobile ad hoc networks. Clusterheads that manage members in their own cluster construct a higher layer backbone to which the DSDV concept is applied. Each clusterhead maintains its own global routing table by exchanging Update Request (UREQ) messages with its neighboring clusterheads. A number of entries in the table is as small as a number of clusterheads unlike a number of nodes in DSDV. Since a UREQ message travels from one clusterhead to all its neighboring clusterheads that are at most 3 hops away, the topology convergence range by each UREQ message is at least 9 times as wide as that of DSDV and CGSR, greatly improving accuracy of routing information. However, overhead in c-DSDV is similar to that of DSDV because only clusterheads initiate UREQ messages. Delivery ratio increases by about 32~50%.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Oh, "Cluster-Based DSDV Routing Protocol in Mobile Ad Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 6, pp. 617-623, 2007. DOI: .

[ACM Style]

Hoon Oh. 2007. Cluster-Based DSDV Routing Protocol in Mobile Ad Hoc Networks. The Journal of Korean Institute of Communications and Information Sciences, 32, 6, (2007), 617-623. DOI: .

[KICS Style]

Hoon Oh, "Cluster-Based DSDV Routing Protocol in Mobile Ad Hoc Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 32, no. 6, pp. 617-623, 6. 2007.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880