Email this article A Distributed Opportunistic Routing Policy With Congestion Diversity
Abstract
Every packet transmission can be caught by an irregular subset of recipient nodes among which the following hand-off is chosen deftly. The primary test in the outline of least deferral steering strategies is adjusting the exchange off between directing the parcels along the most limited ways to the goal and conveying the movement as indicated by the greatest backpressure. Consolidating essential parts of most limited way and backpressure directing, this paper gives a deliberate improvement of a dispersed pioneering steering approach with clog differing qualities (D-ORCD). D-ORCD utilizes a measure of depleting time to astutely distinguish and course parcels along the ways with a normal low general blockage. D-ORCD with single goal is demonstrated to guarantee a limited expected postponement for all systems and under any permissible activity, insofar as the rate of calculations is adequately quick in respect to movement measurements
References
P. Larsson, “Selection diversity forwarding in a multihop packet radio network with fading channel and capture,” ACM SIGMOBILE MobileComput. Commun. Rev., vol. 5, no. 4, pp. 47–54, Oct. 2001.
M. Zorzi and R. R. Rao, “Geographic random forwarding (GeRaF) for Ad Hoc and sensor networks: Multihop performance,” IEEE Trans.Mobile Comput., vol. 2, no. 4, 2003.
S. Biswas and R. Morris, “ExOR: Opportunistic multi-hop routing for wireless networks,” ACM SIGCOMMComput. Commun. Rev., vol. 35, pp. 33–44, Oct. 2005.
C. Lott and D. Teneketzis, “Stochastic routing in ad hoc networks,” IEEE Trans. Autom. Contr., vol. 51, pp. 52–72, Jan. 2006.
S. Jain and S. R. Das, “Exploiting path diversity in the link layer in wireless ad hoc networks,” in Proc. WoWMoM, 2005, pp. 22–30.
P. Gupta and T. Javidi, “Towards throughput and delay optimal routing
for wireless ad hoc networks,” in Proc. Asilomar Conf., 2007, pp. 249–254.
M. J. Neely and R. Urgaonkar, “Optimal backpressure routing for wireless networks with multi-receiver diversity,” Ad Hoc Networks, vol. 7, no. 5, pp. 862–881, Jul. 2009.
L. Tassiulas and A. Ephremides, “Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks,” IEEE Trans. Autom. Contr., vol. 37, no. 12, pp. 1936–1949, Aug. 1992.
S. Sarkar and S. Ray, “Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning,” IEEE Trans.Autom. Contr., vol. 53, no. 10, pp. 2307–2323, Nov. 2008.
Y. Xi and E. M. Yeh, “Throughput optimal distributed control of stochastic wireless networks,” in Proc. 4th Int. Symp. Modeling and Optimizationin Mobile, Ad Hoc, and Wireless Networks (WiOpt), 2006, pp. 1–10.
B. Smith and B. Hassibi, “Wireless erasure networks with feedback,” arXiv: 0804.4298v1, 2008.
Y. Yi and S. Shakkottai, “Hop-by-hop congestion control over a wireless multi-hop network,” IEEE/ACM Trans. Netw., vol. 15, no. 1, pp. 133–144, Feb. 2007.
L. Huang, S. Moeller, M. J. Neely, and B. Krishnamachari, “LIFObackpressure achieves near optimal utility-delay tradeoff,” in Proc. 9thInt. Symp.Modeling and Optimization inMobile, Ad Hoc, andWireless Networks (WiOpt), 2011, pp. 70–77.
L. Ying, S. Shakkottai, A. Reddy, and S. Liu, “On combining shortest-path and back-pressure routing over multihop wireless networks,” IEEE/ACM Trans. Netw., vol. 19, no. 3, pp. 841–854, Jun. 2011.
E. Leonardi, M. Mellia, M. A. Marsan, and F. Neri, “Optimal scheduling and routing for maximum network throughput,” IEEE/ACMTrans. Netw., vol. 15, no. 6, pp. 1541–1554, Dec. 2007.
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.