CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Weighted Cluster based Distributed Spanning Tree Routing Protocol for Mobile Ad-hoc Networks

by Poonam Pahuja, Tarun Shrimali
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 74 - Number 20
Year of Publication: 2013
Authors: Poonam Pahuja, Tarun Shrimali
10.5120/13026-0196

Poonam Pahuja, Tarun Shrimali . Weighted Cluster based Distributed Spanning Tree Routing Protocol for Mobile Ad-hoc Networks. International Journal of Computer Applications. 74, 20 ( July 2013), 19-23. DOI=10.5120/13026-0196

@article{ 10.5120/13026-0196,
author = { Poonam Pahuja, Tarun Shrimali },
title = { Weighted Cluster based Distributed Spanning Tree Routing Protocol for Mobile Ad-hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { July 2013 },
volume = { 74 },
number = { 20 },
month = { July },
year = { 2013 },
issn = { 0975-8887 },
pages = { 19-23 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume74/number20/13026-0196/ },
doi = { 10.5120/13026-0196 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:42:49.683414+05:30
%A Poonam Pahuja
%A Tarun Shrimali
%T Weighted Cluster based Distributed Spanning Tree Routing Protocol for Mobile Ad-hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 74
%N 20
%P 19-23
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

MANETs do not have any fixed infrastructure and consist of wireless mobile nodes that perform various data communication tasks. Mobile ad hoc networks (MANETs) are collection of distributed nodes which communicate using multi-hop wireless links with frequent node mobility. The frequent mobility of nodes leads network partition and futile communication. So, there need an interconnection technique that should guarantee network connectivity, efficient routing and maintain network performance in MANET. Clustering has become an important approach to manage MANETs. This paper proposed Weighted Cluster Based Distributed Spanning Tree (WCBDST) routing technique to form better MANETs interconnections. WCBDST is an interconnection technique in which nodes of MANETs are made to form a forest of spanning tree with root node as cluster head in a distributed fashion which improved routing, network connectivity and maintains network performances.

References
  1. S. Corson, J. Macker, "Mobile Ad hoc Networking (MANET), Internet Draft, Oct. 1998.
  2. S. Lee, J. Hsu, R. Hayashida, M. Gerla, and R. Bagrodia, "Selecting a Routing Strategy for Your Ad hoc Network," Special issue on Advances in Computer Communications and Networks: Algorithms and Applications, vol. 26, no. 7, pp. 723-733, May 2003.
  3. C. Perkins and P. Bhagwat, "Highly Dynamic Destination Sequenced Distance Vector Routing (DSDV) for Mobile Computers," in ACM SIGCOMM, pp. 112-120 Oct. 1994.
  4. David B. Johnson, David A. Maltz, and Josh Broch, "DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks," in Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5, pp. 139-172, Addison-Wesley, 2001.
  5. C. Perkins, E. Belding-Royer, and S. Das, "Ad Hoc On Demand Distance Vector (AODV)", 2003
  6. P. H. J. (2005), "A Survey of Clustering Schemes for Mobile Ad Hoc Networks", IEEE Communications Surveys and Tutorials, Vol. 7, No. 1, pp. 32-48. Routing," IETF RFC3561, July 2003.
  7. Yu . J. P. & Chong P. H. J. (2005) , "A Survey of Clustering Schemes for Mobile Ad Hoc Networks", IEEE Communications Surveys and Tutorials, Vol. 7, No. 1, pp. 32-48.
  8. Deniz Cokuslu Kayhan Erciyes and Orhan Dagdeviren, "A Dominating Set Based Clustering Algorithm for Mobile Ad hoc Networks", Springer Computational Science – ICCS (2006).
  9. P. Victer Paul, T. Vengattaraman, P. Dhavachelvan & R. Baskaran, "Improved Data Cache Scheme Using Distributed Spanning Tree in Mobile Ad-hoc Network", International Journal of Computer Science & CommunicationVol. 1, No. 2, July-December (2010).
  10. G. N. Purohit and Usha Sharma, "Constructing Minimum Connected Dominating Set Algorithmic approach", International journal on applications of graph theory in wireless ad hoc networks and sensor networks GRAPHHOC (2010).
Index Terms

Computer Science
Information Sciences

Keywords

MANET WCBDST DST Cluster Head Mobile Node NS2

Powered by PhDFocusTM