ACCUMNET : Optimal Routing Algorithms for Multi-Channel Multi-Hop Networks

Authors

  • Mrs. B.Arulmozhi  Head of the Department (BCA), Dept. of Computer Science and Applications, D.K.M College for Women (Autonomous), Vellore, Tamilnadu, India
  • Ms .P.Agalya  Research Scholar, Dept. of Computer Science and Applications, D.K.M College for Women (Autonomous), Vellore, Tamilnadu, India
  • Ms. A. Sivasankari  Head of the Department (CS), Dept. of Computer Science and Applications, D.K.M College for Women (Autonomous), Vellore, Tamilnadu, India

Keywords:

Accumulative Multi-Hop, Energy Accumulation, Minimum Energy, Route discovery, Route selection, Route representation, Data forwarding, Route maintenance, Route energy efficiency

Abstract

In this paper, we tend to gift a routing and channel assignment protocol for multi-channel multi-hop wireless networks. We tend to contemplate a multi-hop network, wherever a mobile host might connect with associate access purpose victimization multi-hop wireless routes, via alternative mobile hosts or wireless routers. In addition, we tend to take into account a multi-channel network wherever multiple non-overlapping (orthogonal) channels area unit on the market, and every host or router will dynamically choose a channel to enhance performance. During this system, we tend to investigate the optimum routing downside in signal transmission from supply to destination for the multi-hop network. We tend to use the technique of rate less code that is employed to accumulate the information with every packet within the transmission. This could decrease the entire energy; scale back delays in transmission for transmission information from the supply to the destination. Proposed system allows vital performance through the shortest path routing victimization Floyd-Warshall algorithmic rule.

References

  1. J. L. Sobrinho, “An algebraic theory of dynamic network routing,” IEEE/ACM Trans. Netw., vol. 13, no. 5, pp. 1160–1173, Oct. 2005.
  2. Y. Yang and J. Wang, “Design guidelines for routing metrics in multihop wireless networks,” in Proc. IEEE INFOCOM, Apr. 2008, pp. 1615–1623.
  3. I. Maric and R. D. Yates, “Cooperative multihop broadcast for wireless networks,” IEEE J. Sel. Areas Commun., vol. 22, no. 6, pp. 1080–1088, Aug. 2004.
  4. J. Chen, L. Jia, X. Liu, G. Noubir, and R. Sundaram, “Minimum energy accumulative routing in wireless networks,” in Proc. IEEE INFOCOM, vol. 3. Mar. 2005, pp. 1875–1886.
  5. I. Molisch, N. Mehta, J. Yedidia, and J. Zhang, “Cooperative relay networks using fountain codes,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Nov. 2006, pp. 1–6.
  6. J. Castura and Y. Mao, “Rateless coding over fading channels,” IEEE Commun. Lett, vol. 10, no. 1, pp. 46–48, Jan. 2006.
  7. Z. Yang and A. Høst-Madsen, “Routing and power allocation in asynchronous Gaussian multiple-relay channels,” EURASIP J. Wireless Commun. Netw., vol. 2006, no. 2, p. 35, 2006.
  8. R. Urgaonkar and M. J. Neely, “Optimal routing with mutual information accumulation in wireless networks,” IEEE J. Sel. Areas Commun., vol. 30, no. 9, pp. 1730–1737, Oct. 2012.
  9. R. Yim, N. Mehta, A. F. Molisch, and J. Zhang, “Progressive accumulative routing in wireless networks,” in Proc. IEEE Global
  10. Commun. Conf. (GLOBECOM), Nov. 2006, pp. 1–6. A. S. Avestimehr, S. N. Diggavi, and D. N. C. Tse, “Wireless network information flow: A deterministic approach,” IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1872–1905, Apr. 2011

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-02-09

Issue

Volume 4, Issue 3, January-February-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Mrs. B.Arulmozhi, Ms .P.Agalya, Ms. A. Sivasankari, " ACCUMNET : Optimal Routing Algorithms for Multi-Channel Multi-Hop Networks, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 3, pp.01-06, January-February-2018.