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

Adaptive Position based Reliable Routing Protocol (APBRRP) for Mobile Ad Hoc Networks

by B. Narasimhan, R. Vadivel
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 52 - Number 14
Year of Publication: 2012
Authors: B. Narasimhan, R. Vadivel
10.5120/8273-1844

B. Narasimhan, R. Vadivel . Adaptive Position based Reliable Routing Protocol (APBRRP) for Mobile Ad Hoc Networks. International Journal of Computer Applications. 52, 14 ( August 2012), 43-46. DOI=10.5120/8273-1844

@article{ 10.5120/8273-1844,
author = { B. Narasimhan, R. Vadivel },
title = { Adaptive Position based Reliable Routing Protocol (APBRRP) for Mobile Ad Hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 52 },
number = { 14 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 43-46 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume52/number14/8273-1844/ },
doi = { 10.5120/8273-1844 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:52:15.774174+05:30
%A B. Narasimhan
%A R. Vadivel
%T Adaptive Position based Reliable Routing Protocol (APBRRP) for Mobile Ad Hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 52
%N 14
%P 43-46
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Routing packets in mobile ad hoc networks has been considered to a great extent, even though the hypothesis on full connectivity is generally not valid in a real time system which means that a practical routing protocol ought to handle intermittent connectivity and the absence of end-to-end connections. In this paper, we propose a location aware routing mechanism called adaptive position based routing protocol for mobile ad hoc networks, which is enhanced with a positioning service which well suits real time mobile ad hoc networks. In order to achieve low overhead, APBRRP uses a beaconless strategy combined with a position-based resolution during forwarding packets. Also the proposed protocol is combined with a local database holding mechanism which is updated using route overhearing. The proposed routing protocol APBRRP is compared with the reactive AODV routing protocol by performance metrics delay, overhead and delivery ratio. By the extensive simulation results using NS2 the results proved that our proposed APBRRP outperforms AODV.

References
  1. S. M. Das, H. Pucha, and Y. C. Hu, "Performance comparison of scalable location services for geographic ad hoc routing," in Proc. IEEE 24th Annu. Joint Conf. IEEE Comput. Commun. Soc. , 2005, pp. 1228–1239.
  2. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Spray and wait: An efficient routing scheme for intermittently connected mobile networks," in Proc. ACM SIGCOMM Workshop Delay-Tolerant Netw. , 2005,pp. 252–259.
  3. V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, and H. Weiss, Delay-tolerant networking architecture. RFC 4838. [Online]. Available: ftp://ftp. rfc-editor. org/in-notes/rfc4838. txt
  4. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: The single-copy case," IEEE/ACM Trans. Netw. , vol. 16, no. 1, pp. 63–76, Feb. 2008.
  5. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks," Duke Univ. , Durham, NC, Tech. Rep. CS-2000-06, 2000.
  6. R. Bruno and M. Nurchis, "Survey on diversity-based routing in wireless mesh networks: Challenges and solutions," Comput. Commun. , vol. 33, no. 3, pp. 269–282, Feb. 2010.
  7. H. Füler, J. Widmer, M. Käsemann, M. Mauve, and H. Hartenstein, "Contention-based forwarding for mobile ad hoc networks," Ad Hoc Netw. , vol. 1, no. 4, pp. 351–369, Nov. 2003.
  8. M. Heissenbüttel, T. Braun, T. Bernoulli, and M. Wälchi, "BLR: Beaconless routing algorithm for mobile ad hoc networks," Comput. Commun. , vol. 27, no. 11, pp. 1076–1086, Jul. 2004.
  9. R. R. Choudhury, "Brownian gossip: Exploiting node mobility to diffuse information in ad hoc networks," in Proc. Int. Conf. Collaborative Comput. : Netw. , Appl. Worksharing, 2005, pp. 1–5.
  10. T. Hara and S. K. Madria, "Consistent Management Strategies for Data Replication in Mobile Ad hoc Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 7, July 2009, pp. 950-967.
  11. N. Aschenbruck, E. Gerhards-Padilla, and P. Martini, "Modeling mobility in disaster area scenarios," Perform. Eval. , vol. 66, no. 12, pp. 773–790, Dec. 2009.
  12. M. Asplund and S. Nadjm-Tehrani, "A partition-tolerant manycast algorithm for disaster area networks," in Proc. 28th Int. Symp. Reliable Distrib. Syst. , 2009, pp. 156–165.
  13. M. B. Donley and N. A. Schwartz, United States Air Force Unmanned Aircraft Systems Flight Plan 2009–2047, 2009. [Online]. Available: http://handle. dtic. mil/100. 2/ADA505168
  14. P. -C. Cheng, K. C. Lee, M. Gerla, and J. Härri, "GeoDTN +Nav: Geographic DTN routing with navigator prediction for urban vehicular environments," Mobile Netw. Appl. , vol. 15, no. 1, pp. 61–82, Feb. 2010.
  15. J. LeBrun, C. Chuah, D. Ghosal, and M. Zhang, "Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks," in Proc. IEEE 61st Veh. Technol. Conf. , 2005, pp. 2289–2293.
  16. S. M. Das, H. Pucha, and Y. C. Hu, "Performance comparison of scalable location services for geographic ad hoc routing," in Proc. IEEE 24th Annu. Joint Conf. IEEE Comput. Commun. Soc. , 2005, pp. 1228–1239.
Index Terms

Computer Science
Information Sciences

Keywords

APBRRP Mobile Ad Hoc Networks

Powered by PhDFocusTM