Email this article Efficient enhanced routing algorithm to find Optimal path in multi-hop network
Abstract
ABSTRACT:
We consider a single source that imparts to a single goal helped by a few transfers through various hops. At each hop, just a single node transmits, while the various nodes get the transmitted flag, and store it subsequent to processing/decoding and blending it with the signs got in past hops. That is, we think about that terminals utilize propelled energy gathering transmission/gathering procedures, for example, maximal proportion joining gathering of redundancy codes, or data collection with rateless codes. Aggregate strategies increment correspondence dependability, diminish energy utilization, and abatement inertness. We examine the properties that a directing measurement must fulfill in these collective networks to ensure that ideal ways can be processed with Dijkstra's algorithm. We display the issue of directing in collective multi-hop networks, as the issue of steering in a hypergraph. We demonstrate that optimality properties in a conventional multi-hop organize (monotonicity and isotonicity) are never again valuable and determine another arrangement of adequate conditions for optimality.
References
REFERENCES:
J. L. Sobrinho, “An algebraic theory of dynamic network routing, IEEE/ACM Trans. Netw., vol. 13, no. 5, pp. 1160–1173, Oct. 2005.
Y. Yang and J. Wang, “Design guidelines for routing metrics inmultihop wireless networks,” in Proc. IEEE INFOCOM, Apr. 2008,pp. 1615–1623.
I. Maric and R. D. Yates, “Cooperative multi-hop broadcast for wireless networks,” IEEE J. Sel. Areas Commun., vol. 22, no. 6, pp. 1080–1088,Aug. 2004.
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.
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–6.
J. Castura and Y. Mao, “Rate less coding over fading channels,” IEEECommun.Lett., vol. 10, no. 1, pp. 46–48, Jan. 2006.
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.
Z. Yang and A. Høst-Madsen, “Routing and power allocation in asynchronous Gaussian multiple-relay channels,” EURASIP J. WirelessCommun.Netw., vol. 2006, no. 2, p. 35, 2006.
T. Girici and A. C. Kazez, “Energy efficient routing with mutual information accumulation,” in Proc. 10th Int. Symp.ModelingOptim.Mobile, Ad Hoc Wireless Netw. (WiOpt), May 2012, pp. 425–430.
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.
T. Cover and J. A. Thomas, Elements of Information Theory. New York,NY, USA: Wiley, 1991.
J. Gomez-Vilardebo, “Routing in accumulative multi-hop networks, “in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Apr. 2015,pp. 1814–1821.
J. Gomez-Vilardebo, “Heuristic routing algorithms for minimum energy cooperative multi-hop wireless networks,” in Proc. 20th Eur. WirelessConf., May 2014, pp. 1–5.
M. Thakur and R. Tripathi, “Linear connectivity problems in-directed hypergraphs,” Theor.Comput. Sci., vol. 410, pp. 2592–2618,Jun. 2009. [Online]. Available:http://www.sciencedirect.com/science/article/pii/S0304397509002011
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.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.