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

A Survey on Optimum Neighbour Discovery Techniques in Mobile Ad-hoc Networks

by Priyanka Agrawal, Anwar Sarkeja
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 162 - Number 12
Year of Publication: 2017
Authors: Priyanka Agrawal, Anwar Sarkeja
10.5120/ijca2017913415

Priyanka Agrawal, Anwar Sarkeja . A Survey on Optimum Neighbour Discovery Techniques in Mobile Ad-hoc Networks. International Journal of Computer Applications. 162, 12 ( Mar 2017), 1-4. DOI=10.5120/ijca2017913415

@article{ 10.5120/ijca2017913415,
author = { Priyanka Agrawal, Anwar Sarkeja },
title = { A Survey on Optimum Neighbour Discovery Techniques in Mobile Ad-hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { Mar 2017 },
volume = { 162 },
number = { 12 },
month = { Mar },
year = { 2017 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume162/number12/27292-2017913415/ },
doi = { 10.5120/ijca2017913415 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:08:48.764616+05:30
%A Priyanka Agrawal
%A Anwar Sarkeja
%T A Survey on Optimum Neighbour Discovery Techniques in Mobile Ad-hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 162
%N 12
%P 1-4
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

There are several issues which are facing by Mobile ad hoc network and mainly it is related to routing and quality of service (QOS), It is happing because of variable nature and limited recourse constraints for real time application. In such type of network, for data transmission effective routing is necessary where each node behaves as a router. So many schemes have been directed in routing to discover route, one of them is flooding. In flooding scheme data packets are moving in whole network infinitely which is consuming resources redundantly such as battery power, bandwidth and cause throughput mortification. On the basis of earlier work the new approach is proposed for controlling flooding operation which removes flooding of routing packets. The work of new approach is to dealing with the discovery of convenient and optimum neighbour of source and all nodes in the network.

References
  1. Talha, “Improving Performance of Mobile Ad-hoc Networks using Efficient Tactical On - Demand Distance Vector (TAODV) Routing Algorithm,” proceeding of International Journal of Innovative Computing, Information and Control, Volume 8, November 6, June 2012 ISSN: 1349- 4198, pp 4375-4389.
  2. Dr. S. S. Dhenakaran and A. Parvathavarthini, “An Overview of Routing Protocols in Mobile Ad-hoc Network,” proceeding of International Journal of Advanced Research in Computer Science and Software Engineering, Volume 3, Issue 2, February 2013, ISSN: 2277-128X, pp. 251-259.
  3. Imrich Chlamtac, Marco Conti and Jennifer J. N. Liu, “Mobile Ad-hoc Networking: Imperatives and Challenges,” proceeding of Science Direct Ad-hoc Networks 1, (2003) pp. 13-64.
  4. Mohit Kumar and Rashmi Mishra, “An overview of MANET: History, Challenges and Applications,” proceeding of Indian Journal of Computer Science and Engineering, Volumes 3, No. 1, Feb-Mar 2012, ISSN: 0976-5166, pp. 121-125.
  5. Sunil Taneja and Ashwani Kush, “A Survey of Routing Protocols in Mobile Ad-hoc Networks,” proceeding of International Journal of Innovation, Management and Technology, Volume 1, No. 3, August 2010, ISSN: 2010-0248, pp. 279-285.
  6. G. S. Mamatha and Dr. S C Sharma, “Analyzing the MANET Variations, Challenges Capacity and Protocol Issues,” proceeding of the International Journal of, Computer Science and Engineering Survey (IJCSES) Volume 1, No. 1, August 2010, pp. 14-21.
  7. Ying Cai, Kien A. Hua, Aaron Phillips ,”Leveraging 1-hop Neighbourhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks ”
  8. S. Ni, Y. Tseng, Y. Chen, and J. Sheu. The Broadcast Storm Problem in a Mobile Ad Hoc Network. In Proc. Of MOBICOM’99, pages 151–162, 1999.
  9. Y. Tseng, S. Ni, and E. Y. Shih. Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Networks. In Proc. of ICDCS’01, pages 481–488, 2001.
  10. Y. Sasson, D. Cavin, and A. Schiper. Probabilistic broad-cast for flooding in wireless mobile ad hoc networks. In Swiss Federal Institute of Technology, Technical Report IC/2002/54, 2002.
  11. H. Lim and C. Kim. Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks. In Proc. of the ACM Int’l Workshop on Modeling, Analysis and Simu- lation of Wireless and Mobile Systems (MSWIM), pages 61–68, August 2000.
  12. W. Lou and J. Wu. On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks. IEEE Transactions on Mobile Computing, 1(2):111–123, 2002.
  13. W. Peng and X. Lu. AHBP: An Efficient Broadcast Protocol for Mobile Ad Hoc Networks. Journal of Science and Technology, Beijing, China, 2002.
  14. A. Laouiti, A. Qayyum, and L. Viennot. Multipoint relaying: An efficient technique for flooding in mobile wireless networks. In 35th Annual Hawaii International Confer- ence on System Sciences (HICSS’2001). IEEE Computer Society, 2001.
Index Terms

Computer Science
Information Sciences

Keywords

MANET Flooding Issues Routing Protocols

Powered by PhDFocusTM