The Tea-Horse Trade Route, spanning the Yunnan-Guizhou and Qinghai-Tibet Plateaus, went from the Tibetanhinterland to South Asian countries such as India, Nepal and Bhutan. Along the route were many townsinvolved in b...The Tea-Horse Trade Route, spanning the Yunnan-Guizhou and Qinghai-Tibet Plateaus, went from the Tibetanhinterland to South Asian countries such as India, Nepal and Bhutan. Along the route were many townsinvolved in border trade; one such is Yadong County, Shigatse Prefecture.展开更多
Many vehicle platoons are interrupted while traveling on roads,especially at urban signalized intersections.One reason for such interruptions is the inability to exchange real-time information between traditional huma...Many vehicle platoons are interrupted while traveling on roads,especially at urban signalized intersections.One reason for such interruptions is the inability to exchange real-time information between traditional human-driven vehicles and intersection infrastructure.Thus,this paper develops a Markov chain-based model to recognize platoons.A simulation experiment is performed in Vissim based on field data extracted from video recordings to prove the model’s applicability.The videos,recorded with a high-definition camera,contain field driving data from three Tesla vehicles,which can achieve Level 2 autonomous driving.The simulation results show that the recognition rate exceeds 80%when the connected and autonomous vehicle penetration rate is higher than 0.7.Whether a vehicle is upstream or downstream of an intersection also affects the performance of platoon recognition.The platoon recognition model developed in this paper can be used as a signal control input at intersections to reduce the unnecessary interruption of vehicle platoons and improve traffic efficiency.展开更多
Opportunistic routing(OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks.However,little research focuses on transmission efficiency.Thus,an analytical model based on open queu...Opportunistic routing(OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks.However,little research focuses on transmission efficiency.Thus,an analytical model based on open queuing network with Markov chains was proposed to evaluate the efficiency.By analyzing two typical ORs,we find duplicate transmission and collision avoidance overhead are the root reasons behind inefficiency.Therefore,a new scheme called dual priority cooperative opportunistic routing(DPCOR) was proposed.In DPCOR,forwarding candidates are configured with dual priority,which enables the network to classify forwarding candidates more effectively so as to reduce the back-off time and obtain more diversity gain.Theoretical analysis and simulation results show DPCOR achieves significant performance improvement with less time overhead compared with traditional routings and typical ORs.展开更多
In this paper, a distributed muting strategy based on simplified topology （DRBST） was proposed for LEO satellite networks. The topology of LEO satellite networks was simplified aiming at minimizing intersatellite li...In this paper, a distributed muting strategy based on simplified topology （DRBST） was proposed for LEO satellite networks. The topology of LEO satellite networks was simplified aiming at minimizing intersatellite links handover number. To optimize the route based on the simplified topology, we considered not only the transmission delay but also the queuing delay and the processing delay, which were analyzed using Markov chain and determined using a novel methodology. The DRBST algorithm was simulated in a LEO satellite networks model built using OPNET. The simulation results demonstrate that the low complexity DRBST algorithm can guarantee end-to-end delay bound. Moreover, the muting protocol cost is much less than traditional algorithms.展开更多
This paper considers an efficient priority service model with two-level-polling scheme which the message packets conform to the discrete-time Geom/G/1 queue with multiple vacations and bulk arrival. By the embedded Ma...This paper considers an efficient priority service model with two-level-polling scheme which the message packets conform to the discrete-time Geom/G/1 queue with multiple vacations and bulk arrival. By the embedded Markov chain theory and the probability generating function method, we set up the mathematics functions and give closed form expressions for obtaining the mean cyclic period （MCP）, the mean queue length （MQL） and the mean waiting time （MWT） characteristics, the analytical results are also verified through extensive computer simulations. The performance analysis reveals that this priority polling scheme can gives better efficiency as well as impartiality in terms of system characteristics, and it can be used for differentiating priority service to guarantee better QoS and system stability in design and improvement of MAC protocol.展开更多
The remain passenger problem at subway station platform was defined initially,and the period variation of remain passenger queues at platform was investigated through arriving and boarding analyses.Taking remain passe...The remain passenger problem at subway station platform was defined initially,and the period variation of remain passenger queues at platform was investigated through arriving and boarding analyses.Taking remain passenger queues at platform as dynamic stochastic process,a new probabilistic queuing method was developed based on probabilistic theory and discrete time Markov chain theory.This model can calculate remain passenger queues while considering different directions.Considering the stable or variable train arriving period and different platform crossing types,a series of model deformation research was carried out.The probabilistic approach allows to capture the cyclic behavior of queues,measures the uncertainty of a queue state prediction by computing the evolution of its probability in time,and gives any temporal distribution of the arrivals.Compared with the actual data,the deviation of experimental results is less than 20%,which shows the efficiency of probabilistic approach clearly.展开更多
文摘The Tea-Horse Trade Route, spanning the Yunnan-Guizhou and Qinghai-Tibet Plateaus, went from the Tibetanhinterland to South Asian countries such as India, Nepal and Bhutan. Along the route were many townsinvolved in border trade; one such is Yadong County, Shigatse Prefecture.
基金Project(71871013)supported by the National Natural Science Foundation of China。
文摘Many vehicle platoons are interrupted while traveling on roads,especially at urban signalized intersections.One reason for such interruptions is the inability to exchange real-time information between traditional human-driven vehicles and intersection infrastructure.Thus,this paper develops a Markov chain-based model to recognize platoons.A simulation experiment is performed in Vissim based on field data extracted from video recordings to prove the model’s applicability.The videos,recorded with a high-definition camera,contain field driving data from three Tesla vehicles,which can achieve Level 2 autonomous driving.The simulation results show that the recognition rate exceeds 80%when the connected and autonomous vehicle penetration rate is higher than 0.7.Whether a vehicle is upstream or downstream of an intersection also affects the performance of platoon recognition.The platoon recognition model developed in this paper can be used as a signal control input at intersections to reduce the unnecessary interruption of vehicle platoons and improve traffic efficiency.
基金supported by the National Science and Technology Major Projects under Grant No.2011ZX03001-007-03
文摘Opportunistic routing(OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks.However,little research focuses on transmission efficiency.Thus,an analytical model based on open queuing network with Markov chains was proposed to evaluate the efficiency.By analyzing two typical ORs,we find duplicate transmission and collision avoidance overhead are the root reasons behind inefficiency.Therefore,a new scheme called dual priority cooperative opportunistic routing(DPCOR) was proposed.In DPCOR,forwarding candidates are configured with dual priority,which enables the network to classify forwarding candidates more effectively so as to reduce the back-off time and obtain more diversity gain.Theoretical analysis and simulation results show DPCOR achieves significant performance improvement with less time overhead compared with traditional routings and typical ORs.
基金Supported by the National Science Foundation of China （No. 60873219）.
文摘In this paper, a distributed muting strategy based on simplified topology （DRBST） was proposed for LEO satellite networks. The topology of LEO satellite networks was simplified aiming at minimizing intersatellite links handover number. To optimize the route based on the simplified topology, we considered not only the transmission delay but also the queuing delay and the processing delay, which were analyzed using Markov chain and determined using a novel methodology. The DRBST algorithm was simulated in a LEO satellite networks model built using OPNET. The simulation results demonstrate that the low complexity DRBST algorithm can guarantee end-to-end delay bound. Moreover, the muting protocol cost is much less than traditional algorithms.
基金Supported by the National Natural Science Foundation of China （No. 69862001, F0424104, 60362001 and 61072079）.
文摘This paper considers an efficient priority service model with two-level-polling scheme which the message packets conform to the discrete-time Geom/G/1 queue with multiple vacations and bulk arrival. By the embedded Markov chain theory and the probability generating function method, we set up the mathematics functions and give closed form expressions for obtaining the mean cyclic period （MCP）, the mean queue length （MQL） and the mean waiting time （MWT） characteristics, the analytical results are also verified through extensive computer simulations. The performance analysis reveals that this priority polling scheme can gives better efficiency as well as impartiality in terms of system characteristics, and it can be used for differentiating priority service to guarantee better QoS and system stability in design and improvement of MAC protocol.
基金Project(2011BAG01B01) supported by the Major State Basic Research and Development Program of ChinaProject(RCS2012ZZ002) supported by the State Key Lab of Rail Traffic Control and Safety,China
文摘The remain passenger problem at subway station platform was defined initially,and the period variation of remain passenger queues at platform was investigated through arriving and boarding analyses.Taking remain passenger queues at platform as dynamic stochastic process,a new probabilistic queuing method was developed based on probabilistic theory and discrete time Markov chain theory.This model can calculate remain passenger queues while considering different directions.Considering the stable or variable train arriving period and different platform crossing types,a series of model deformation research was carried out.The probabilistic approach allows to capture the cyclic behavior of queues,measures the uncertainty of a queue state prediction by computing the evolution of its probability in time,and gives any temporal distribution of the arrivals.Compared with the actual data,the deviation of experimental results is less than 20%,which shows the efficiency of probabilistic approach clearly.
