Efficient Route Planning for Real-Time Demand-Responsive Transit

Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of dynamicvehicle scheduling and real-time route planning in urban public transportation systems, with a focus on busservices. It addresses the limitations of current shared mobility routing algorithms, which are primarily designedfor simpler, single origin/destination scenarios, and do not meet the complex demands of bus transit systems. Theresearch introduces an route planning algorithm designed to dynamically accommodate passenger travel needsand enable real-time route modifications. Unlike traditional methods, this algorithm leverages a queue-based,multi-objective heuristic A∗ approach, offering a solution to the inflexibility and limited coverage of suburbanbus routes. Also, this study conducts a comparative analysis of the proposed algorithm with solutions based onGenetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), focusing on calculation time, routelength, passenger waiting time, boarding time, and detour rate. The findings demonstrate that the proposedalgorithmsignificantly enhances route planning speed, achieving an 80–100-fold increase in efficiency over existingmodels, thereby supporting the real-time demands of Demand-Responsive Transportation (DRT) systems. Thestudy concludes that this algorithm not only optimizes route planning in bus transit but also presents a scalablesolution for improving urban mobility.

A Cooperative Distributed System for Real-Time Route Guidance

This paper describes a cooperative decentralized architecture for reactive real-time route guidance. The architecture is cooperative in the sense that it allows adjacent local controllers to exchange information regarding the traffic conditions in their territories. A set of local decision rules and associated heuristic functions to support the cooperative architecture are specified. A protocol governing the knowledge exchange among local adjacent controllers is developed. A simulation-assignment modeling framework is used for assessing the effectiveness of this cooperative architecture under various levels of controller knowledge and network traffic congestion. The cooperative decentralized system is tested under various scenarios of knowledge and cooperation and network traffic demand levels. The cooperative system is compared against the shortest path algorithm as a benchmark.

If real-time route and high-speed data is important, GoTa is vital.

GoTa TM from ZTE is the world’s first CDMA-based system. Now, ZTE proudly introduces its third-generation digital trunking system featuring

If real-time route and high-speed data is important,GoTa is vital.

GoTaTM from ZTE is the world’s first CDMA-based system. Now, ZTE proudly introduces its third-generation digital trunking system featuring a centralized dispatch,

If real-time route and high-speed data is important, GoTa is vital.

Go Tafrom ZTE is the world’s first CDMA-based system. Now, ZTE proudly introduces its third-generation digital trunking system featuring a centralized dispatch,

Application Research of an Intelligent Detection Algorithm for Vehicle Trajectory Route Deviation

In the vehicle trajectory application system, it is often necessary to detect whether the vehicle deviates from the specified route. Trajectory planning in the traditional route deviation detection is defined by the driver through the mobile phone navigation software, which plays a more auxiliary driving role. This paper presents a method of vehicle trajectory deviation detection. Firstly, the manager customizes the trajectory planning and then uses big data technologies to match the deviation between the trajectory planning and the vehicle trajectory. Finally, it achieves the supervisory function of the manager on the vehicle track route in real-time. The results show that this method could detect the vehicle trajectory deviation quickly and accurately, and has practical application value.

Contention-Based Beaconless Real-Time Routing Protocol for Wireless Sensor Networks

This paper presents a novel real-time routing protocol, called CBRR, with less energy consumption for wireless sensor networks (WSNs). End-to-End real-time requirements are fulfilled with speed or delay constraint at each hop through integrating the contention and neighbor table mechanisms. More precisely, CBRR maintains a neighbor table via the contention mechanism being dependent on wireless broadcast instead of beacons. Comprehensive simulations show that CBRR can not only achieve higher performance in static networks, but also work well for dynamic networks.

Quality of Service Aware Cluster Routing in Vehicular Ad Hoc Networks

In vehicular ad hoc networks(VANETs),the topology information(TI)is updated frequently due to vehicle mobility.These frequent changes in topology increase the topology maintenance overhead.To reduce the control message overhead,cluster-based routing schemes are proposed.In clusterbased routing schemes,the nodes are divided into different virtual groups,and each group(logical node)is considered a cluster.The topology changes are accommodated within each cluster,and broadcasting TI to the whole VANET is not required.The cluster head(CH)is responsible for managing the communication of a node with other nodes outside the cluster.However,transmitting real-time data via a CH may cause delays in VANETs.Such real-time data require quick service and should be routed through the shortest path when the quality of service(QoS)is required.This paper proposes a hybrid scheme which transmits time-critical data through the QoS shortest path and normal data through CHs.In this way,the real-time data are delivered efciently to the destination on time.Similarly,the routine data are transmitted through CHs to reduce the topology maintenance overhead.The work is validated through a series of simulations,and results show that the proposed scheme outperforms existing algorithms in terms of topology maintenance overhead,QoS and real-time and routine packet transmission.

Performance Tradeoff with Routing Protocols for Radio Models in Wireless Sensor Networks

In this paper, we have simulated and evaluated the performance tradeoff with routing protocols: Constrained Flooding, the Real-Time Search and the Adaptive Tree on MICA and MICAz platform with different radio models using PROWLER for wireless sensor networks. The simulation results establish that the MICAz motes give low latency, high throughput, high energy consumption, low efficiency but better lifetime while the MICA motes give high success rate and less loss rate. It has been, thus, concluded that in case of all the radio models the MICAz is preferably better than MICA in applications where energy is a constraint. Moreover, use of MICAz motes increases the network lifetime in comparison to MICA for the radio models. Further, the AT protocol can be applied to achieve better energy consumption, efficiency and lifetime in real time for wireless sensor networks.

Rainfall-runoff simulation and flood forecasting for Huaihe Basin

The main purpose of this study was to forecast the inflow to Hongze Lake using the Xin＇anjiang rainfall-runoff model. The upper area of Hongze Lake in the Huaihe Basin was divided into 23 sub-basins, including the surface of Hongze Lake. The influence of reservoirs and gates on flood forecasting was considered in a practical and simple way. With a one-day time step, the linear and non-linear Muskingum method was used for channel flood routing, and the least-square regression model was used for real-time correction in flood forecasting. Representative historical data were collected for the model calibration. The hydrological model parameters for each sub-basin were calibrated individually, so the parameters of the Xin＇anjiang model were different for different sub-basins. This flood forecasting system was used in the real-time simulation of the large flood in 2005 and the results are satisfactory when compared with measured data from the flood.

HierTrack:an energy-efficient cluster-based target tracking system for wireless sensor networks

Target tracking is a typical and important application of wireless sensor networks(WSNs).Existing target tracking protocols focus mainly on energy efficiency,and little effort has been put into network management and real-time data routing,which are also very important issues for target tracking.In this paper,we propose a scalable cluster-based target tracking framework,namely the hierarchical prediction strategy(HPS),for energyefficient and real-time target tracking in large-scale WSNs.HPS organizes sensor nodes into clusters by using suitable clustering protocols which are beneficial for network management and data routing.As a target moves in the network,cluster heads predict the target trajectory using Kalman filter and selectively activate the next round of sensors in advance to keep on tracking the target.The estimated locations of the target are routed to the base station via the backbone composed of the cluster heads.A soft handoff algorithm is proposed in HPS to guarantee smooth tracking of the target when the target moves from one cluster to another.Under the framework of HPS,we design and implement an energy-efficient target tracking system,HierTrack,which consists of 36 sensor motes,a sink node,and a base station.Both simulation and experimental results show the efficiency of our system.