THE ABILITY OF THE NETWORK TO RESTRICT NODE COLLAPSE ACROSS THE END-TO-END PATH MEASUREMENTS

Divya Nair, Gunda Hariteja

Abstract


In comparison, it can be the counter-pressure compensation alternative and ensure that the back pressure diversity guides the expected cumulative accumulation of these fixed access rates. It has been shown that D-ORCD is a unique destination to ensure that there is a specific delay for those systems and under any acceptable traffic, as long as the speed of the calculations is fast enough according to the traffic statistics. The clipping guide reduces the results of weak wireless connections by exploiting the nature of the transmission for wireless transmission, as well as the diversity of routes. E-DIVBAR suggests: When choosing the next migration of one of the possible groups of forwarders, E-DIVBAR shows the sum of the cumulative differential, as well as the number of jumps expected to the destination. However, the current property of ignoring the price towards the destination becomes the curse of the approach, resulting in a deficient performance delay in low to medium traffic. The main contribution of the document is to provide a distributed opportunistic routing policy with diversity of congestion, which instead of the simple addition used in E-DIVBAR; the details of the congestion are combined with shorter distributed route calculations. We reveal that similar analytical security can be obtained with respect to the improvement of D-ORCD productivity. In particular, we demonstrate the optimization of D-ORCD by observing the convergence of D-ORCD to a central form of the formula.


Keywords


Stabilizable; congestion measure; Lyapunov analysis; opportunistic routing; queuing stability; routing policy;

References


P. Gupta and T. Javidi, “Towards throughput and delay optimal routing for wireless ad hoc networks,” in Proc. Asilomar Conf., 2007, pp. 249–254.

roughput versus complexity tradeoffs in wireless networks using graph partitioning,” IEEE Trans. Autom. Contr., vol. 53, no. 10, pp. 2307–2323, Nov. 2008.

E. Leonardi, M. Mellia, M. A. Marsan, and F. Neri, “Optimal scheduling and routing for maximum network throughput,” IEEE/ACM Trans. Netw., vol. 15, no. 6, pp. 1541–1554, Dec. 2007.

A. Shaikh, A. Varma, L. Kalampoukas, and R. Dube, “Routing stability in congested networks: Experimentation and analysis,” in Proc. ACM SIGCOMM, 2000, pp. 163–174.

AbhijeetBhorkar, Member, IEEE, Mohammad Naghshvar, Member, IEEE, and Tara Javidi, Senior Member, IEEE, “Opportunistic Routing With Congestion Diversity inWireless Ad Hoc Networks”, ieee/acm transactions on networking, vol. 24, no. 2, april 2016.

L. Ying and S. Shakkottai, “On throughput-optimal scheduling with delayed channel state feedback,” presented at the 2008 Information Theory and Applications Workshop, San Diego, CA, USA, Feb. 2008.

D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris, “A high throughput path metric for multi-hop wireless routing,” in Proc. ACM Mobicom, 2003, pp. 134–146.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2018, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.