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
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Article:K-Nodes Multicasting Minimum Cost Spanning Trees in Wireless Mobile Ad Hoc Network(MANET)

by Arun Kumar B. R, Lokanatha C. Reddy, Prakash S. Hiremath, Rajeswari Sheshadri
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 4
Year of Publication: 2010
Authors: Arun Kumar B. R, Lokanatha C. Reddy, Prakash S. Hiremath, Rajeswari Sheshadri
10.5120/110-225

Arun Kumar B. R, Lokanatha C. Reddy, Prakash S. Hiremath, Rajeswari Sheshadri . Article:K-Nodes Multicasting Minimum Cost Spanning Trees in Wireless Mobile Ad Hoc Network(MANET). International Journal of Computer Applications. 1, 4 ( February 2010), 10-14. DOI=10.5120/110-225

@article{ 10.5120/110-225,
author = { Arun Kumar B. R, Lokanatha C. Reddy, Prakash S. Hiremath, Rajeswari Sheshadri },
title = { Article:K-Nodes Multicasting Minimum Cost Spanning Trees in Wireless Mobile Ad Hoc Network(MANET) },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 4 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 10-14 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number4/110-225/ },
doi = { 10.5120/110-225 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:44:07.753462+05:30
%A Arun Kumar B. R
%A Lokanatha C. Reddy
%A Prakash S. Hiremath
%A Rajeswari Sheshadri
%T Article:K-Nodes Multicasting Minimum Cost Spanning Trees in Wireless Mobile Ad Hoc Network(MANET)
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 4
%P 10-14
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mobile Ad-hoc Networks (MANETs) are highly decentralized, independent and self-organizing networks. It is significant to study the cost of the network, to optimize the routing method by means of cross layer interaction across the layers of the network. In this paper, first we generate a minimum cost spanning tree for a given network of N- nodes using an efficient algorithm, Then we study the problem of constructing a K-node Multi cast Minimum Spanning Tree (KMMST) for any given multicasting group with K nodes, where K is less than n. Comparing the cost associated with the minimum spanning tree of the entire network with n nodes and the cost of KMMST, it is found that the cost of KMMST is significantly less compared to cost of the n nodes spanning tree.

References
  1. D. Pan and Y. Yang, “FIFO-Based Multicast Scheduling Algorithm for Virtual Output Queued Packet Switches,” IEEE Trans. Comput., vol. 54, no. 10, pp. 1283–1297, 2005.
  2. D. Johnson, D. Maltz and Y. Hu. The Dynamic Source Routing Protocol for Mobile Ad hoc Networks. Internet Draft: draft-ietf-manet-dsr-09.txt, 2003.
  3. C. Perkins, E. Beldig-Royer and S. Das. Ad hoc on Demand Distance Vector (AODV) Routing. Request for Comments 3561, July 2003.
  4. Z. Haas. A New Routing Protocol for Reconfigurable Wireless Networks.ICUPC 97, 562-566, 1997.
  5. Z. Haas and M. Pearlman. The Performance of Query Control Schemes for the Zone Routing Protocol. IEEE/ACM Transactions on Networking, 9(4):427–438, 2001.
  6. Z. Haas and B. Liang. Ad hoc mobility management with randomized database groups. Proceedings of the IEEE International Conference on Communications, 1756-1762, 1999.
  7. Y. Ko and N. Vaidya. Location-aided Routing (LAR) in Mobile Ad hoc Networks. Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking MOBICOM), 66-75, 1998.
  8. Alpr Jttner and dm Magi. Tree Based Broadcast in Ad hoc Networks. MONET Special Issue on WLAN Optimization at the MAC and Network Levels, 2004.
  9. Zeyad M. Alfawaer, GuiWei Hua, and Noraziah Ahmed, “A Novel Multicast Routing Protocol for Mobile Ad Hoc Networks”, American Journal of Applied Sciences 4 (5): 333-338, 2007, ISSN 1546-9239, 2007 Science Publications.
  10. Penttinen, A et al, “Minimum cost multicast trees in ad hoc networks”, Communications, 2006. ICC '06. IEEE International Conference , pp 3676 – 3681, June 2006.
  11. Blerta Bishaj, “Multicasting in ad hoc networks: Energy efficient”, Helsinki University of Technology.
  12. Chao Gui and Prasant Mohapatra,” Scalable Multicasting in Mobile Ad Hoc Networks”, IEEE INFOCOM 2004.
  13. Arun Kumar B. R, Lokanatha C. Reddy, Rajan and Prakash S. Hiremath,”Route Failure Tolerant Multicast In Mobile Ad Hoc Networks Using Disjoint Minimum Spanning Trees”, the second IEEE ICCSIT 2009, August 8 - 11, 2009, Beijing, China.
Index Terms

Computer Science
Information Sciences

Keywords

K-nodes multicasting cost spanning tree routing

Powered by PhDFocusTM