Vehicular node positioning needs to be quick and precise on highway for safety considera-tion.In this paper,we present a novel and practical vehicular node positioning method which can achieve a higher accuracy and mo...Vehicular node positioning needs to be quick and precise on highway for safety considera-tion.In this paper,we present a novel and practical vehicular node positioning method which can achieve a higher accuracy and more reliability than the existing global-positioning-system-based po-sitioning solutions by making use of Doppler-shifted frequency measurements taken by vehicular node itself.This positioning method uses infrastructure nodes which are placed on the roadside every several kilometers as radiation sources to estimate the relative distances of vehicle to the infrastructure node.Through coordinate conversion,we get the absolute coordinates of vehicular node based on known absolute coordinates of infrastructure node.We also analyze the optimal distance of neighbor infra-structure nodes in order to ensure a high accuracy.In addition,simulation results demonstrate that the accuracy of our method with Extended Kalman Filtering(EKF) is superior to the method without EKF.展开更多
Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than th...Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than the elements themselves. These constraints follow generalized Kirchhoff＇s laws derived from physical constraints. Once we have a graph; then the working environment becomes the graph-theory. An algorithm derived from graph theory is developed within the paper in order to analyze general networks. The algorithm is based on computing all the spanning trees in the graph G with an associated weight. This weight is the product ofadmittance＇s of the edges forming the spanning tree. In the first phase this algorithm computes a depth first spanning tree together with its cotree. Both are used as parents for controlled generation of off-springs. The control is represented in selecting the off-springs that were not generated previously. While the generation of off-springs, is based on replacement of one or more tree edges by cycle edges corresponding to cotree edges. The algorithm can generate a frequency domain analysis of the network.展开更多
基金Supported by the National Grand Fundamental Research Program of China (973 Program, No.2007CB310606)The National High Technology Research and Development Program of China (863 Program, No.2008AA01Z205)China Postdoctoral Science Foundation funded project
文摘Vehicular node positioning needs to be quick and precise on highway for safety considera-tion.In this paper,we present a novel and practical vehicular node positioning method which can achieve a higher accuracy and more reliability than the existing global-positioning-system-based po-sitioning solutions by making use of Doppler-shifted frequency measurements taken by vehicular node itself.This positioning method uses infrastructure nodes which are placed on the roadside every several kilometers as radiation sources to estimate the relative distances of vehicle to the infrastructure node.Through coordinate conversion,we get the absolute coordinates of vehicular node based on known absolute coordinates of infrastructure node.We also analyze the optimal distance of neighbor infra-structure nodes in order to ensure a high accuracy.In addition,simulation results demonstrate that the accuracy of our method with Extended Kalman Filtering(EKF) is superior to the method without EKF.
文摘Networks are a class of general systems represented by becomes a weighted graph visualizing the constraints imposed their UC-structure. Suppressing the nature of elements the network by interconnections rather than the elements themselves. These constraints follow generalized Kirchhoff＇s laws derived from physical constraints. Once we have a graph; then the working environment becomes the graph-theory. An algorithm derived from graph theory is developed within the paper in order to analyze general networks. The algorithm is based on computing all the spanning trees in the graph G with an associated weight. This weight is the product ofadmittance＇s of the edges forming the spanning tree. In the first phase this algorithm computes a depth first spanning tree together with its cotree. Both are used as parents for controlled generation of off-springs. The control is represented in selecting the off-springs that were not generated previously. While the generation of off-springs, is based on replacement of one or more tree edges by cycle edges corresponding to cotree edges. The algorithm can generate a frequency domain analysis of the network.
