Main Article Content

Abstract

On wireless ad hoc network (AHN), ad-hoc mode is a method for wireless devices to directly communicate with each other. Since AHNs are dynamic in nature, they require a dynamic routing protocol to send the message from one source node to destination. Several approaches have been proposed for designing multihop routing protocols in wireless AHNs. Flooding is one of them to discover a dynamic routing path. But Flooding of request packet in the route in wireless AHN creates a huge amount of traffic which leads to high probability of packet collisions. Also it causes significant over head in delivering of packet and hence is inappropriate for the dynamic routing. It also causes more time consumption.  In this paper we propose a efficient multi hop routing algorithm to deliver the message using the cache variable for intermediate to reduce a large number of path& hence reducing the traffic generated by normal flooding. We also apply a logic to share the dynamic  routing table between different devices in neighborhood. We also propose a scheme at receiver side to receive only one valid message from the flooded message and discard all other flooded messages.

Article Details

How to Cite
Gupta, G., Gupta, S., Singh, M. K., & Chattaraj, D. (2015). EFFICIENT MULTI HOP ROUTING ALGORITHM FOR BLUETOOTH DEVICES. Students’ Research in Technology & Management, 1(2), 231-241. Retrieved from https://giapjournals.com/ijsrtm/article/view/66

References

  1. Y. Azar, J. Naor, R. Rom. Routing Strategies in Fast Networks IEEE Transactions On Computers,
  2. (2):165-173, 1996.
  3. O. Lesser, R. Rom. Routing by controlled flooding in communication networks in proceeding of
  4. IEEE INFOCOM’90,(San Francisco, CA), pp. 910–917, June 1990.
  5. E. Pagani and G.P. Rossi. Reliable broadcast in mobile multi-hop packet networks. Proceedings
  6. of the third annual ACM/IEEE International Conference on mobile computing and networking
  7. (MOBICOM’97), pp. 34–42, 1997.
  8. M. Satyanarayanan. Fundamental challenges in mobile computing. Submitted paper.
  9. M. Haardt W. Mohr R. Becher, M. Dillinger. Broadband wireless access and futurecommunication
  10. networks. Proceedings of the IEEE, 89(1), 2001.
  11. S. Basagni, I. Chlamtac, V.R. Syrotiuk and B.A. Woodward. A Distance Routing Effect Algorithm for Mobility (DREAM), Proceedings of the fourth Annual mobile
  12. computing and networking, October 1998.
  13. P. Krishna, M. Chatterjee, N.H. Vaidya and D.K. Pradhan. A Cluster-based Approach for
  14. Routing in Ad hoc Networks. In proceedings of Second USENIX Symposium on mobile and Location
  15. Independent Computing, pp. 1–10, January 1996.
  16. S. Murthy and J.J. Garcia–Luna–Aceves. An Efficient Routing Protocol for Wire-Less Networks.
  17. ACM Mobile Networks and Applications, Special Issue on Routing in Mobile Communication
  18. Networks, 1(1):183–197, October 1996.
  19. C.E. Perkins. Ad hoc on-demand distance vector routing, Internet Draft, Internet Engineering
  20. Task Force, work in progress, December 1997.
  21. C.-H. Toh. A novel distributed routing protocol to support ad-hoc mobile computing, Proceeding
  22. of 15th IEEE Annual International Phoenix Conference on Computer Communications, pp. 480–486,