Authors:
N Rashmitha,M Susmitha,DOI NO:
https://doi.org/10.26782/jmcms.2020.02.00016Keywords:
Accumulative,Multi-hop,Multi-path routing,Cross layer approach,Load balancing,Energy efficiency,Abstract
It can be easily understood that every relay node in traditional multi-hop (TM) communication networks only attends the previous node that is near to it, which is the difficulty in routing. Using directed graphs, the modeling of these networks is performed well in order to achieve the routing. In the networks of accumulative multi-hop (AM) communication, the routing problem is far-off from understanding and yet rather interested in it. The received data energy from earlier relay transmissions can be acquired by numerous relay nodes that assist communication between a single source and a single destination in the accumulative multi-hop network which is a simple one. At this point, in single-source single-destination accumulative multi-hop networks, the difficulty in finding the optimum paths is studied. A method of Load Balanced Energy efficient cross layer based Routing protocol for accumulative networks are implemented in this paper. The end-to-end network connectivity is enhanced as well as the faults at link or/and node level is reduced in this method. Using an energy efficient neighbor node choosing method, the establishment of a set of various paths is done from the source to the destination. Efficient load balancing is offered at the node and a constant route is discovered between the source and destination that meets the delay requirement. With respect to end to end delay, throughput, and energy consumption, the proposed system is outperformed which is demonstrated in the results of simulation.Refference:
I. A. 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.
II. Agbaria, A.; Gershinsky, G.; Naaman N. &Shagin, K. Extrapolation-based and QoS-aware real-time communication in wireless mobile ad hoc networks. In the 8th IFIP Annual Mediterranean Adhoc Networking Workshop, Med-Hoc-Net 2009. pp.21-26. doi: 10.1109/MEDHOCNET.2009.5205201.
III. Ahmed, M.; Elmoniem, Abd; Ibrahim, Hosny M.; Mohamed, Marghny H. &Hedar, Abdel Rahman. Ant colony and load balancing optimizations for AODV routing protocol. Int. J. Sensor Networks Data Commun., 2012, 1. doi: doi:10.4303/ijsndc/X110203.
IV. Cai, X., Duan, Y., He, Y., Yang, J., Li, C.: Bee-Sensor-C: an energy-efficient and scalable multipath routing protocol for wireless sensor net-works. Int. J. Distrib. Sensor Netw. 26 (2015).
V. 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.
VI. J. Castura and Y. Mao, “Rateless coding over fading channels,” IEEE Commun. Lett., vol. 10, no. 1, pp. 46–48, Jan. 2006.
VII. 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.
VIII. J. Gómez-Vilardebó, “Routing in Accumulative Multi-Hop Networks,” in IEEE/ACM Transactions on Networking, vol. 25, no. 5, pp. 2815-2828,Oct. 2017. doi: 10.1109/TNET.2017.2703909.
IX. J. Gomez-Vilardebo, “Heuristic routing algorithms for minimum energy cooperative multi-hop wireless networks,” in Proc. 20th Eur. Wireless Conf., May 2014, pp. 1–5.-12
X. J. Gomez-Vilardebo, “Routing in accumulative multi-hop networks,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Apr. 2015, pp. 1814–1821.
XI. L. Sobrinho, “An algebraic theory of dynamic network routing,” IEEE/ACM Trans. Netw., vol. 13, no. 5, pp. 1160–1173, Oct. 2005.
XII. Mohapatra, S., Siddappa, M.: Improvised routing using Border Cluster Node for Bee-AdHoc-C: an energy-efficient and systematic routing protocol for MANETs. In: International Conference On Advances in Computer Applications, IEEE ICACA-2016 (2016).
XIII. R. Yim, N. Mehta, A. F. Molisch, and J. Zhang, “Progressive accumulative routing in wireless networks,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Nov. 2006, pp. 1–6.
XIV. S. C. Draper, L. Liu, A. F. Molisch, and J. S. Yedidia, “Cooperative transmission for wireless networks using mutual-information accumulation,” IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5151–5162, Aug. 2011.
XV. Saleem, M., Farooq, M.: Beesensor: a bee-inspired power aware routing protocol for wireless sensor networks. In: Workshops on Applications of Evolutionary Computation, pp. 81–90. Springer Berlin Heidelberg (2007).
XVI. Siva, K. & P. Duraiswamy, K. A QoS routing protocol for mobile ad hoc networks based on the load distribution. In the IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), 2010, pp.1-6. doi: 10.1109/ICCIC.2010.5705724.
XVII. Srivastava, S.; Daniel, A.K.; Singh, R. &Saini, J.P. Energyefficient position based routing protocol for mobile ad hoc networks. In the IEEE International Conference on Radar Communication and Computing (ICRCC), 2012, pp.18- 23. doi: 10.1109/ICRCC.2012.6450540.
XVIII. T. Girici and A. C. Kazez, “Energy efficient routing with mutual information accumulation,” in Proc. 10th Int. Symp. Modeling Optim. Mobile, Ad Hoc Wireless Netw. (WiOpt), May 2012, pp. 425–430.
XIX. Y. Yang and J. Wang, “Design guidelines for routing metrics in Multi-hop wireless networks,” in Proc. IEEE INFOCOM, Apr. 2008, pp. 1615–1623.
XX. Yu, J.Y., Chong, P.H.J.: A survey of clustering schemes for mobile ad hoc networks. IEEE Commun. Surv. Tutorials 7(1), 32–48 (2005).
XXI. 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.
View Download