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

An Efficient Network Discovery in MANETs

by Ajay Agarwal, Bijendra N. Jain
journal cover thumbnail
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 20
Year of Publication: 2010
Authors: Ajay Agarwal, Bijendra N. Jain
10.5120/423-624

Ajay Agarwal, Bijendra N. Jain . An Efficient Network Discovery in MANETs. International Journal of Computer Applications. 1, 20 ( February 2010), 48-51. DOI=10.5120/423-624

@article{ 10.5120/423-624,
author = { Ajay Agarwal, Bijendra N. Jain },
title = { An Efficient Network Discovery in MANETs },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 20 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 48-51 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number20/423-624/ },
doi = { 10.5120/423-624 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:47:58.446364+05:30
%A Ajay Agarwal
%A Bijendra N. Jain
%T An Efficient Network Discovery in MANETs
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 20
%P 48-51
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Determining network topology in mobile ad hoc networks (MANETs) is the most difficult, if not impossible, since it is not known a-priori to any node. An alternative way is to identify some or all loop free paths between a pair of nodes. In this paper we develop a heuristic, in the form of a protocol, which helps discover a large portion of the network topology (in form of loop-free paths from source S to destination D), while keeping the control overhead small (as verified by simulations). The latter measured in term of number of control packets, limits power consumption and bandwidth utilization. If, however, there is no constraint on the control overhead then (using suitable parametric values in the heuristic) one may even attempt to discover all possible paths between a given pair of nodes.

References
  1. D. B. Johnson and D. A. Maltz, Ad Hoc Networking. Addison Wesley, 2001, ch. 5, pp. 139.172.
  2. C. Zhu and M. S. Corson, QoS Routing for Mobile Ad Hoc Networks, In Proceedings of IEEE INFOCOM, New York, NY, pp. 3.10, June 2002.
  3. Q. Xue and A. Ganz, Ad Hoc QoS On-demand Routing, AQOR, in Mobile Ad Hoc Networks, Journal of Parallel and Distributed Computing, pp. 154.165, Feb. 2003.
  4. S. Chen and K. Nahrstedt, Distributed quality-of-service routing in ad hoc networks, IEEE Journal on Selected Areas in Communications, vol. 17, no. 8, pp. 1488.1505, Aug. 1999.
  5. A. M. Abbas and B. N. Jain, Path diminution in disjoint multipath routing for mobile ad hoc networks, Proceedings of the 15th IEEE International Symposium on Personal, Indoor, and Mobile Radio Communication (PIMRC), pp. 130.134, Sept. 2004.
  6. K. Fall and K. Varadhan, ns Notes and Documentation, The VINT Project, UC Berkely, LBL, USC/ISI, et. al. http://www.isi.edu/nsnam/ns/ns-documentation.html, Nov. 1997.
Index Terms

Computer Science
Information Sciences

Keywords

ad hoc networks network topology

Powered by PhDFocusTM