A novel implementation of backpressure algorithm in wireless ad hoc network

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    In the wireless networks, the routing technique is the one of the highest concern and it is the important procedure in the ad hoc networks. To aid this effort, we proposed a new valuation of backpressure appliances for wireless networks. By this proposed system, we will address numerous preparation and routing difficulties and also recover the throughput and delay that are essentially produced by the packets at the node transmission. The Backpressure routing is a dense and enlarged throughput for wireless networks, but endures improved delays. In routing, the backpressure algorithm is known to afford throughput optimality with active traffic. The significant supposition in the backpressure algorithm is that all nodes are kind and detect the algorithm rules leading the information conversation and principal optimization necessities. In the proposed system, we validate that how the node is steady at the backpressure algorithm routing and also by together easing the virtual trust line and the real package queue. The backpressure algorithm not only achieves flexibility, but also stands the throughput performance under safety attacks. This scheme is mostly enhances the node performance at the time of announcement and also it recovers the node security at the time of numerous threats in the wireless requests.


  • Keywords


    Backpressure Algorithm; Throughput Optimality; Dynamic Traffic; Node Transmission.

  • References


      [1] Maglaras, L.A. and Katsaros, D. (2011) Layered backpressure scheduling for delay reduction in ad hoc networks. In World of Wireless, Mobile and Multimedia Networks (WoWMoM), 2011 IEEE International Symposium on a (IEEE): 1-9. https://doi.org/10.1109/WoWMoM.2011.5986388.

      [2] Gupta, G. and Shroff, N. (2009) Delay analysis for multi-hop wireless networks. In INFOCOM 2009, IEEE: 2356-2364. https://doi.org/10.1109/INFCOM.2009.5062162.

      [3] A. Warrier, S. Janakiraman, S. Ha, and I. Rhee, “DiffQ: Practical differential backlog congestion control for wireless networks,” inProc. of IEEE INFOCOM, 2009.

      [4] F. Bao, I.-R. Chen, M. Chang, and J.-H Cho, “Hierarchical trust management for wireless sensor networks and its applications to trust-based routing and intrusion detection,” vIEEE Trans. Network and Service Management, vol. 9, pp. 169–183, Mar. 2012. https://doi.org/10.1109/TCOMM.2012.031912.110179.

      [5] L. Georgiadis, M. J. Neely, and L. Tassiulas, “Resource allocation and cross-layer control in wireless networks,” Foundations and Trends in Networking, vol. 1, pp. 1–144, 2006. https://doi.org/10.1561/1300000001.

      [6] H. Seferoglu and E. Modiano, “Diff-Max: Separation of routingand scheduling in backpressure-based wireless networks,” in Proc.of IEEE INFOCOM, 2013.

      [7] S. Moeller, A. Sridharan, B.Krishnamachari, and O. Gnawali Routing without routes: The backpressure collection protocolProc. 9thACM/IEEE Intl. Conf. on Information Processing in Sensor Networks (IPSN), April 2010.

      [8] L. Huang, S. Moeller, M. J. Neely, and B. Krishnamachari. LIFO-backpressure achieves near optimal utility-delay tradeoff. Proc. WiOpt, May 2011.

      [9] L. Huang, S. Moeller, M. J. Neely, and B. Krishnamachari,“LIFO-backpressure achieves near optimal utility-delay tradeoff,”ACM/IEEE Trans. Networking, pp. 831–844, June 2013.

      [10] L. Bui, R. Srikant, and A. L. Stolyar, “A novel architecture for delay reduction in the back-pressure scheduling algorithm,” IEEE/ACM Trans. Netw., vol. 19, no. 6, pp. 1597–1609, Dec. 2011. https://doi.org/10.1109/TNET.2011.2126593.

      [11] M. Alresaini, M. Sathiamoorthy, B. Krishnamachari, and M. J. Neely,“Backpressure with adaptive redundancy (BWAR),” in Proc. of IEEE INFOCOM, 2012. https://doi.org/10.1109/INFCOM.2012.6195617.

      [12] J. Nunez-Martinez, J. Mangues-Bafalluy, and M. Portoles-Comeras, “Studying practical any-to-any backpressure routing inWi-Fi mesh networks from a Lyapunovoptimization perspective,”in Proc. of IEEE MASS, 2011.

      [13] Bui, L., Srikant, R. and Stolyar, A. (2009) Novel architectures and algorithms for delay reduction in back- pressure scheduling and routing. In INFOCOM 2009, IEEE (IEEE): 2936-2940. https://doi.org/10.1109/INFCOM.2009.5062262.

      [14] B. Radunovic, C. Gkantsidis, D. Gunawardena, and P. Key. Horizon: Balancing TCP over multiple paths in wireless mesh networkACMMobicom, 2008.

      [15] Ying, L., Srikant, R., Towsley, D. and Liu, S.(2011) Cluster-based back-pressure routing algorithm. Networking, IEEE/ACM Transactions on 19(6): 1773-1786. https://doi.org/10.1109/TNET.2011.2141682.

      [16] J.-Y. Yoo, C. Sengul, R. Merz, and J. Kim, “Experimental analysisof backpressure scheduling in IEEE 802.11 wireless meshnetworks,” in Proc. of IEEE ICC, 2011.

      [17] Li, R., Eryilmaz, A. and Li, B. (2013) Throughput optimal wireless scheduling with regulated inter-servicetimes. In INFOCOM, 2013 Proceedings IEEE: 2616-2624. https://doi.org/10.1109/INFCOM.2013.6567069.

      [18] L. Ying, S. Shakkottai, A. Reddy, and S. Liu,“On combiningshortest-path and back-pressure routing over multihop wirelessnetworks,” IEEE/ACM Trans. Networking, vol. 19, Jun 2011. https://doi.org/10.1109/TNET.2010.2094204.

      [19] S. Liu, L. Ying, and R. Srikant,“Throughput-optimal opportunisticscheduling in the presence of flow-level dynamics,” IEEE/ACMTrans. Networking, vol. 19, Aug 2011. https://doi.org/10.1109/TNET.2010.2100826.

      [20] L. Bui, R. Srikant, and A. L. Stolyar, “Optimal resource allocation for multicast flows in multihop wireless networks,” Phil. Trans. Roy. Soc., Ser.A, vol. 366, pp. 2059–2074, 2008.


 

View

Download

Article ID: 9062
 
DOI: 10.14419/ijet.v7i1.2.9062




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.