An Improved Greedy Forwarding Scheme in MANETs

• Autorzy: Mishra P. , Gandhi C. , Singh B.
• Języki publikacji: EN

Abstrakty

EN

Position-based routing protocols are widely accepted efficient solution for routing in MANETs. The main feature of position-based routing protocols is to use greedy forwarding methods to route data. The greedy forwarding methods select a node, either having maximum progress towards destination (distance-based principle) or minimum deviation with line between source and destination (direction-based strategy). The first method minimizes the hopcount in a path and on the other hand, second method minimizes the spatial distance between source and destination. The distance-based routing has a great impact on the selection of reliable node and the direction based routing plays a major role to increase the stability of route towards destination. Therefore, in this paper authors propose a weighted forwarding method, which combines both the selection, schemes to select an optimal next forwarding node in a range. The simulation results show that the proposed scheme performs better than existing position-based routing protocols.

Słowa kluczowe

EN

MANET; distance-based routing; direction-based routing; greedy forwarding

• Wydawca: Instytut Łączności - Państwowy Instytut Badawczy
• Czasopismo: Journal of Telecommunications and Information Technology
• Rocznik: 2017
• Tom: nr 1
• Strony: 50--55
• Opis fizyczny: Bibliogr. 18 poz., rys., tab.

Twórcy

autor

Mishra P.

• Department of Computer Science and Information Technology JAYPEE Institute of Information Technology, University A-10 Sector 62 Noida, India

autor

Gandhi C.

• Department of Computer Science and Information Technology JAYPEE Institute of Information Technology, University A-10 Sector 62 Noida, India

autor

Singh B.

• Department of Computer Science and Information Technology School of Computer and System Sciences in Jawaharlal Nehru University New Delhi, India

Bibliografia

• [1] C. Perkins, E. Belding-Royer, and S. Das, “Ad hoc on-demand distance vector (AODV) routing”, RFC 3561, IETF, 2003 [Online]. Available: http://www.ietf.org/rfc/rfc3561.txt
• [2] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks”, in Mobile Computing, T. Imielinski and H. F. Korth, Eds. The Kluwer International Series in Engineering and Computer Science, vol. 353, pp. 153–181. Springer, 1996.
• [3] H. Takagi and L. Klienrock, “Optimal transmission ranges for randomly distributed packet radio terminals”, IEEE Trans. on Commun., vol. Com-32, no. 3, pp. 246–257, 1984 (doi: 10.1109/TCOM.1984.1096061).
• [4] I. Stojmenovic and X. Lin, “Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks”, IEEE Trans. on Parallel and Distrib. Syst., vol. 12, no. 10, pp. 1023–1032, 2001.
• [5] R. S. Raw and D. K. Lobiyal, “ B-MFR routing protocol for vehicular ad hoc networks”, in Proc. Int. Conf. on Netw. and Inform. Technol. ICNIT 2010, Manila, Philippines, 2010, pp. 420–423.
• [6] V. Raji and N. Mohan Kumar, “Void aware position based opportunistic routing for QoS in mobile ad hoc networks”, Circuits and Syst., vol. 7, pp. 1504–1521, 2016 (doi: 10.4236/cs.2016.78132).
• [7] E. Kranakis, H. Singh, and J. Urrutia, “Compass routing on geometric networks”, in Proc. 11th Canadian Conf. on Comput. Geometry CCCG 1999, Vancouver, Canada, 1999, pp. 51–54.
• [8] L. A. Latiff, N. Fisal, S. A. Arifin, and A. A. Ahmed, “Directional routing protocol in wireless mobile ad hoc network”, in Trends in Telecommunications Technologies, C. J. Bouras. Ed. InTech, 2010 (doi: 10.5772/8486).
• [9] P. Bose and P. Morin, “Online routing in triangulations”, in Proc. 10th Ann. Int. Symp. Algorithms & Computation ISAAC 1999, Chennai, India, 2010, pp. 113–122.
• [10] P. R. Morin, “On line routing in geometric graphs”, Ph.D. Thesis, School of Computer Science, Carleton University, 2001.
• [11] W.-H. Liao, J.-P. Sheu, and Y.-C. Tseng, “GRID: A fully locationaware routing protocol for mobile ad hoc networks”, Telecommun. Syst., vol. 18, no. 1, pp. 37–60, 2001 (doi: 10.1023/A:1016735301732).
• [12] V. Giruka and M. Singhal, “Angular routing protocol for mobile adhoc networks”, in Proc. 25th IEEE Int. Conf. on Distrib. Comput. Syst. Worksh. ICDCSW’05, Columbus, OH, USA, 2005, pp. 551–557 (doi: 10.1109/ICDCSW.2005.42).
• [13] M. Chen, V. Leung, S. Mao, Y. Xiao, and I. Chlamtac, “Hybrid geographic routing for flexible energy-delay tradeoff”, IEEE Trans. on Veh. Technol., vol. 58, no. 9, pp. 4976–4988, 2009.
• [14] Y. Cao and S. Xie, “A position based beaconless routing algorithm for mobile ad hoc networks”, in Proc. Int. Conf. on Commun., Circ. & Syst. ICCCAS 2005, Hong Kong, China, 2005, vol. 1, pp. 303–307.
• [15] K. Z. Ghafoor et al., “Fuzzy logic-assisted geographical routing over vehicular ad hoc networks”, Int. J. of Innov. Comput., Inform. & Control, vol. 8, no. 7, pp. 5095–5120, 2012.
• [16] P. Mishra, S. K. Raina, and B. Singh, “Effective fuzzybased location-aware routing with adjusting transmission range in MANET”, Int. J. of Syst., Control & Commun., vol. 7, no. 4, pp. 360–379, 2016 (doi: 10.1504/IJSCC.2016.079432).
• [17] R. S. Raw, Vikas Toor, and N. Singh, “Estimation and analysis of path duration in vehicular ad hoc networks using position-based routing protocol”, Special Issue of Int. J. of Comp. Appl. on Int. Conf. on Issues and Challenges in Networking, Intelligence and Computing Technol. ICNICT 2012, no. 3, pp. 39–39, 2012.
• [18] J. RejinaParvin and C. Vasanthanayaki, “Particle swarm optimization-based clustering by preventing residual nodes in wireless sensor networks”, IEEE Sensors J., vol. 15, no. 8, pp. 4264–4274, 2015 (doi: 10.1109/JSEN.2015.2416208).

Uwagi

Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).