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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Smart Route Discovery in MANET using Ordered Walk

by Sivapriya. G, Senthil Kumaran T
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 4
Year of Publication: 2013
Authors: Sivapriya. G, Senthil Kumaran T
10.5120/11952-7772

Sivapriya. G, Senthil Kumaran T . Smart Route Discovery in MANET using Ordered Walk. International Journal of Computer Applications. 70, 4 ( May 2013), 36-41. DOI=10.5120/11952-7772

@article{ 10.5120/11952-7772,
author = { Sivapriya. G, Senthil Kumaran T },
title = { Smart Route Discovery in MANET using Ordered Walk },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 4 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 36-41 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number4/11952-7772/ },
doi = { 10.5120/11952-7772 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:32:00.304784+05:30
%A Sivapriya. G
%A Senthil Kumaran T
%T Smart Route Discovery in MANET using Ordered Walk
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 4
%P 36-41
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The notion of ordered walks is acquaint with a depth-first search (DFS) that does not rely on topographical or virtual coordinate information and is much more efficient than meager random walks. The welfare of using DFS as the building block of the signalling in MANET routing protocols are epitomized by the introduction of the Ordered Walk Search Algorithm (OSA) as a replacement of flooding, which is used as part of the Ordered Walk with Learning (OWL) protocol. Aim to take advantage of the smaller time complexity of BFS and combine it is the low communication complexity of DFS to further improve the efficient of the search through the use of known topology information. The uses of multiple DFS can lead to a quicker discovery of OSA, The present the ordered walks with learning (OWL) routing protocol, which use DFS to establish and repair paths from the sources to the destination with minimal signalling overhead and fast convergence. OWL performs one or multiple ordered walks to search for destination. Simulation experiments are used to compare the delivery and end-to-end delays of OWL and AODV, but with significantly less overhead. The use of ordered walks is a promising tool in achieving limited-signalling routing in MANETs.

References
  1. Dabideen, S. , & Garcia-Luna-Aceves, J. J. Efficient routing in MANETs using ordered walks. Springer Science Business Media, 2011.
  2. Muneer, B. , Sanabel, F. and Ahmed, Y. , "A New Dynamic Counter Based Broadcasting Scheme for Mobile Ad-hoc Networks", Proceedings of Simulation modeling and theory, Elsevier, Vol. 19, No. 1, pp. 553 – 563, 2011.
  3. Muneer, B. , Mustafa, B. and Ahmed, Y. , "A new probabilistic broadcasting scheme for mobile ad hoc on-demand distance vector networks(AODV) routed networks", Journal super computer, Springer, Vol. 53, No. 1, Mar. 2010, pp. 196 – 211.
  4. Dabideen, S. , & Garcia-Luna-Aceves, J. J. OWL: Towards scalable routing in manets using depth-first search on demand. Sixth IEEE international conference on mobile ad-hoc and sensor systems, 2009.
  5. Aminu, M. , OuldKhaoua, M. , Mackenzie, L. M. and Abdulai, J. , "Dynamic probabilistic counter-based broadcasting in mobile ad hoc networks", Proceedings of the 2nd IEEE International Conference on adaptive science and technology, 2009.
  6. Jamal-Deen Abdulai , Mohamed Ould-Khaoua,Lewis M. Mackenzie, 'Adjusted probabilistic route discovery in mobile ad hoc networks', The Journal Computers and Electrical Engineering, vol. 35,Issue. 1, 2008 .
  7. Acer, U. , Kalyanaraman, S. , & Abouzeid, A. A. Weak state routing for large dynamic networks. In Proceedings of MobiCom, September, 2007.
  8. Beraldi, R. , Querzoni, L. , & Baldoni, R A hint based probabilistic protocol for unicast communications in manets. Elsevier Ad Hoc Networks, 4(5), . 2006.
  9. Tian, H. , Shen, H. , & Matsuzawa, T. Random walk routing for wireless sensor networks. In Proceedings of PDCAT, 2005.
  10. Philippe, J. Anis, L. Pascale Minet, and Laurent, V. "Performance of Multipoint Relaying in Ad Hoc Mobile Routing Protocols", Proceedings of 7th International Symposium on Parallel architectures, Algorithms and Networks, pp. 539–543, 2004.
  11. Wu, J. Wei Lou, and Dai, F. "Extended Multipoint Relays to determine Connected Dominating Sets in MANETS", IEEE International Conference on Networking Vol. 1, pp. 100–105, 2004.
  12. Perkins, C. E. , & Royer, E. M. Ad hoc on-demand distance vector routing. IETF Internet draft, October, 2003.
  13. Servetto, S. D. , & Barrenechea, G. Constrained random walks on random graphs: Routing algorithms for large scale wireless sensor networks. Proceedings of WSNA, 2002.
  14. Ni, S. -Y. , Tseng, Y. -C. , Hen, Y. S. V. , & Sheu, J. -P. The broadcast storm problem in mobile ad-hoc networks. In Proceedings of MobiCom, 2001.
  15. Yashar, G. and Abtin Keshavarzian :"Study On Load Balancing in Mobile Ad-hoc Networks", Proceedings of International Conference Communication (ICC'00) Vol. 1,pp. 74-79, 2000.
  16. Wei, C. and Yi Zhang "A Multi-constrained Routing Algorithm Based on Mobile Agent for MANET Networks", IEEE Selected Areas Communication Vol. 17, No. 8, pp. 1369–1379, 1999.
Index Terms

Computer Science
Information Sciences

Keywords

Mobile Ad-hoc Networks Ordered Walk with Learning protocol Ordered walk Search Algorithm Depth First Search

Powered by PhDFocusTM