Virtual Gradient based Back-Pressure Scheduling in Wireless Multi-Hop Networks

被引:0
作者
Zhou, Meng [1 ]
Jiao, Zhenzhen [2 ]
Gong, Wei [2 ]
Li, Cheng [3 ]
Zhang, Baoxian [2 ,4 ]
机构
[1] China Mobile, Dept Technol, Beijing 100033, Peoples R China
[2] Univ Chinese Acad Sci, Res Ctr Ubiquitous Sensor Networks, Beijing 100049, Peoples R China
[3] Mem Univ, Fac Engn & Appl Sci, St John, NF A1B 3X5, Canada
[4] Jiangsu Internet Of Things Res & Dev Ctr, Wuxi 214135, Jiangsu, Peoples R China
来源
2015 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2015年
关键词
backpressure based scheduling; delay reduction; wireless multi-hop networks; BACKPRESSURE;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
In this paper, we study how to effectively reduce the average end-to-end (E2E) packet delay in backpressure based scheduling in wireless multi-hop networks. We accordingly propose a virtual gradient based back-pressure scheduling algorithm, referred to as VBR. In VBR, intentional virtual queue, whose length (called virtual gradient) depends on the distance to destination, is first built at nodes in a network in the network configuration phase. In this way, virtual gradient is established at nodes in the network. In the network operation phase, the scheduling decision at each node needs to jointly consider both real queue length and virtual queue length. Simulation results show that VBR can obtain significant performance improvement on back-pressure based routing and scheduling, in terms of packet delivery ratio and average E2E delay.
引用
收藏
页码:3281 / 3286
页数:6
相关论文
共 21 条
[1]  
Alresaini M, 2012, IEEE INFOCOM SER, P2300, DOI 10.1109/INFCOM.2012.6195617
[2]  
[Anonymous], P IEEE INFOCOM
[3]  
[Anonymous], 2011, P IEEE INT S WORLD W
[4]   Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks [J].
Athanasopoulou, Eleftheria ;
Bui, Loc X. ;
Ji, Tianxiong ;
Srikant, R. ;
Stolyar, Alexander .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2013, 21 (01) :244-257
[5]   A Novel Architecture for Reduction of Delay and Queueing Structure Complexity in the Back-Pressure Algorithm [J].
Bui, Loc X. ;
Srikant, R. ;
Stolyar, Alexander .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2011, 19 (06) :1597-1609
[6]   Backpressure-based Routing Protocol for DTNs [J].
Dvir, Amit ;
Vasilakos, Athanasios V. .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2010, 40 (04) :405-406
[7]  
Eryilmaz A, 2005, IEEE INFOCOM SER, P1794
[8]  
Ji B, 2013, IEEE INFOCOM SER, P1528
[9]  
Ji B, 2011, IEEE INFOCOM SER, P2579, DOI 10.1109/INFCOM.2011.5935084
[10]  
Jiao Z, 2014, P IEEE ICC 2014 JUN, P2815