To Identify Visible or Non-visible-Based Vehicular Ad Hoc Networks Using Proposed BBICR Technique
In vehicular ad-hoc network design, the border node can be select based on one-hop neighbor data using a minimum neighbor based distance concept. Where the different existing approach and various protocols are examined for nodes are located nearest neighbor position lists are follows a distributed network based strategy. Thus, determine which vehicle/nodes share the least number of common neighbors. In this proposed paper, nodes which satisfy present state are typically outermost from next forwarding node of border side of intercommunication system model with border-based routing making hybridization, minimizing end-to-end delay and improving average throughput with our hybrid protocol that is BBICR, using MATLAB 2014Ra version.
KeywordsVANET BBR ICS Packet forwarding Neighbor node
- 1.Latiff, L. et al.: Location-based geocasting and forwarding (LGF) routing protocol in mobile ad hoc network. In: Proceedings of the Advanced Industrial Conference on Telecommunications/Service Assurance with Partial and Intermittent Resources Conference/ELearning on Telecommunications Workshop, IEEEGoogle Scholar
- 3.Hughes, L., Maghsoudlou, A.: An efficient coverage-based flooding scheme for geocasting in mobile ad hoc networks. In: Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA’06), IEEE (2006)Google Scholar
- 4.Ko, Y., Vaidya, N.H.: GeoTORA: a protocol for geocasting in mobile ad hoc networks. In: Proceedings of the 8th International Conference on Network Protocols (2000)Google Scholar
- 7.Kihl, M., Sichitiu, M., Joshi, H.P.: Design and evaluation of two geocast protocols for vehicular ad-hoc networks. Swedish Governmental Agency for Innovation Systems (Vinnova), 28 Feb 2008Google Scholar
- 8.Kihl, M., et al.: Reliable geographical multicast routing in vehicular ad-hoc networks. J. Softw. 9(3), 684–688 (2014)Google Scholar