Vehicular Ad-hoc Networks(VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is ...Vehicular Ad-hoc Networks(VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is well known that routing is a challenging problem in VANETs due to the fast-changing network typology caused by high mobility at both ends of transmission. Moreover, under urban environment, there are two non-negligible factors in routing protocol design, the non-uniform vehicle distribution caused by traffic lights, and the network congestion due to high traffic demand in rush hours. In this paper, we propose a greedy traffic light and queue aware routing protocol(GTLQR) which jointly considers the street connectivity, channel quality, relative distance, and queuing delay to alleviate the packet loss caused by vehicle clustering at the intersection and balance the traffic load among vehicles. Through performance evaluation, we show that our proposed protocol outperforms both TLRC and GLSR-L in terms of packet delivery ratio and end-to-end delay.展开更多
The small-cell technology is promising for spectral-efficiency enhancement. However, it usually requires a huge amount of energy consumption. In this paper, queue state information and channel state information are jo...The small-cell technology is promising for spectral-efficiency enhancement. However, it usually requires a huge amount of energy consumption. In this paper, queue state information and channel state information are jointly utilized to minimize the time average of overall energy consumption for a multi-carrier small-cell network, where the inter-cell interference is an intractable problem. Based on the Lyapunov optimization theory, the problem could be solved by dynamically optimizing the problem of user assignment, carrier allocation and power allocation in each time slot. As the optimization problem is NP-hard, we propose a heuristic iteration algorithm to solve it. Numerical results verify that the heuristic algorithm offers an approximate performance as the brute-force algorithm. Moreover, it could bring down the overall energy consumption to different degrees according to the variation of traffic load. Meanwhile, it could achieve the same sum rate as the algorithm which focuses on maximizing system sum rate.展开更多
The concurrent presence of different types of traffic in multimedia applications might aggravate a burden on the underlying data network, which is bound to affect the transmission quality of the specified traffic. Rec...The concurrent presence of different types of traffic in multimedia applications might aggravate a burden on the underlying data network, which is bound to affect the transmission quality of the specified traffic. Recently, several proposals for fulfilling the quality of service(QoS) guarantees have been presented. However, they can only support coarse-grained QoS with no guarantee of throughput, jitter, delay or loss rate for different applications. To address these more challenging problems, an adaptive scheduling algorithm for Parallel data Processing with Multiple Feedback(PPMF) queues based on software defined networks(SDN) is proposed in this paper, which can guarantee the quality of service of high priority traffic in multimedia applications. PPMF combines the queue bandwidth feedback mechanism to realise the automatic adjustment of the queue bandwidth according to the priority of the packet and network conditions, which can effectively solve the problem of network congestion that has been experienced by some queues for a long time. Experimental results show PPMF significantly outperforms other existing scheduling approaches in achieving 35--80% improvement on average time delay by adjusting the bandwidth adaptively, thus ensuring the transmission quality of the specified traffic and avoiding effectively network congestion.展开更多
Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple flames as the payload of a single MAC flame. It is considered as one of the most efficient met...Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple flames as the payload of a single MAC flame. It is considered as one of the most efficient methods to improve the wireless channel utilization and the throughput of wireless networks. The static assignment of frame aggregation parameters can result in delay penalties due to variations in traffic type. We propose a frame aggregation scheme which is based on dyn- amic pricing and queue scheduling for a multi- traffic scenario. The scheme adopts a dynamic differential pricing scheme for different types of traffic. Meanwhile, it polls buffer queues in accordance with the optimal aggregation wei- ght factors to maximise the network revenue. Simulation results indicate that the proposed frame aggregation scheme can effectively improve the network revenue and the average throughput, while guaranteeing the delay requirements of all types of traffic.展开更多
基金supported by the Beijing University of Posts and Telecommunications project No.500418759the State Key Laboratory of Networking and Switching Technology project No.600118124
文摘Vehicular Ad-hoc Networks(VANETs) require reliable data dissemination for time-sensitive public safety applications. An efficient routing protocol plays a vital role to achieve satisfactory network performance. It is well known that routing is a challenging problem in VANETs due to the fast-changing network typology caused by high mobility at both ends of transmission. Moreover, under urban environment, there are two non-negligible factors in routing protocol design, the non-uniform vehicle distribution caused by traffic lights, and the network congestion due to high traffic demand in rush hours. In this paper, we propose a greedy traffic light and queue aware routing protocol(GTLQR) which jointly considers the street connectivity, channel quality, relative distance, and queuing delay to alleviate the packet loss caused by vehicle clustering at the intersection and balance the traffic load among vehicles. Through performance evaluation, we show that our proposed protocol outperforms both TLRC and GLSR-L in terms of packet delivery ratio and end-to-end delay.
基金partially supported by National Basic Research Program of China (2013CB329002)National Natural Science Foundation of China (61631013)+6 种基金The National High Technology Research and Development Program of China(2014AA01A703)Science Fund for Creative Research Groups of NSFC (61321061)National Major Project (2017ZX03001011)International Science and Technology Cooperation Program (2014DFT10320)National Science Foundation of China (61701457 \& 61771286)Tsinghua-Qualcomm Joint Research ProgramHuawei Innovation Research Program
文摘The small-cell technology is promising for spectral-efficiency enhancement. However, it usually requires a huge amount of energy consumption. In this paper, queue state information and channel state information are jointly utilized to minimize the time average of overall energy consumption for a multi-carrier small-cell network, where the inter-cell interference is an intractable problem. Based on the Lyapunov optimization theory, the problem could be solved by dynamically optimizing the problem of user assignment, carrier allocation and power allocation in each time slot. As the optimization problem is NP-hard, we propose a heuristic iteration algorithm to solve it. Numerical results verify that the heuristic algorithm offers an approximate performance as the brute-force algorithm. Moreover, it could bring down the overall energy consumption to different degrees according to the variation of traffic load. Meanwhile, it could achieve the same sum rate as the algorithm which focuses on maximizing system sum rate.
基金supported by National Key Basic Research Program of China(973 Program)under grant no.2012CB315802National Natural Science Foundation of China under grant no.61671081 and no.61132001Prospective Research on Future Networks of Jiangsu Future Networks Innovation Institute under grant no.BY2013095-4-01
文摘The concurrent presence of different types of traffic in multimedia applications might aggravate a burden on the underlying data network, which is bound to affect the transmission quality of the specified traffic. Recently, several proposals for fulfilling the quality of service(QoS) guarantees have been presented. However, they can only support coarse-grained QoS with no guarantee of throughput, jitter, delay or loss rate for different applications. To address these more challenging problems, an adaptive scheduling algorithm for Parallel data Processing with Multiple Feedback(PPMF) queues based on software defined networks(SDN) is proposed in this paper, which can guarantee the quality of service of high priority traffic in multimedia applications. PPMF combines the queue bandwidth feedback mechanism to realise the automatic adjustment of the queue bandwidth according to the priority of the packet and network conditions, which can effectively solve the problem of network congestion that has been experienced by some queues for a long time. Experimental results show PPMF significantly outperforms other existing scheduling approaches in achieving 35--80% improvement on average time delay by adjusting the bandwidth adaptively, thus ensuring the transmission quality of the specified traffic and avoiding effectively network congestion.
基金the National Natural Science Foundation of Chinaunder Grants No.61072068,No.61201137the State Key Program of National Natural Science Foundation of China under Grant No.61231008the National Research Foundation of Korea (NRF) Grant funded by the Korea government (MEST) under Grant No.2010-0018116
文摘Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple flames as the payload of a single MAC flame. It is considered as one of the most efficient methods to improve the wireless channel utilization and the throughput of wireless networks. The static assignment of frame aggregation parameters can result in delay penalties due to variations in traffic type. We propose a frame aggregation scheme which is based on dyn- amic pricing and queue scheduling for a multi- traffic scenario. The scheme adopts a dynamic differential pricing scheme for different types of traffic. Meanwhile, it polls buffer queues in accordance with the optimal aggregation wei- ght factors to maximise the network revenue. Simulation results indicate that the proposed frame aggregation scheme can effectively improve the network revenue and the average throughput, while guaranteeing the delay requirements of all types of traffic.
