Deriving the Upper Bound of the Number of Sensors Required to Know All Link Flows in a Traffic Network

It is demonstrated that the minimum number of sensors required to know all link flows in a traffic network can be determined only if path information is available. However, not all paths need to be enumerated but, at most, a small subset defining the rank r of the link-path incidence matrix W. If this rank for a reduced subset of paths is already m - n, where m and n are the number of links and noncentroid nodes, respectively, it can be concluded that m - n sensors are sufficient. It is also shown that the formulas providing the dependent link flows in terms of the independent link flows can be obtained by the node-based or path-based approaches with the same results only when r - m- n. Finally, an algorithm to obtain the small subsets of linearly independent path vectors is given. The methods are shown by a a parallel network example and the Ciudad Real and Cuenca networks, for which the savings in link counts with respect to the m - n bound are larger than 16%. The corresponding savings in path enumeration are larger than 80%.

• Record URL:
  • https://doi.org/10.1109/TITS.2012.2233474
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/41297384
• Supplemental Notes:
  • Abstract reprinted with permission of IEEE.
• Authors:
  • Castillo, Enrique
  • Calviño, Aida
  • Menéndez, José María
  • Jiménez, Pilar
  • Rivas, Ana
• Publication Date: 2013-6

Language

• English

Media Info

• Media Type: Digital/other
• Features: Figures; References; Tables;
• Pagination: pp 761-771
• Serial:
  • IEEE Transactions on Intelligent Transportation Systems
  • Volume: 14
  • Issue Number: 2
  • Publisher: Institute of Electrical and Electronics Engineers (IEEE)
  • ISSN: 1524-9050
  • Serial URL: http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=6979

Subject/Index Terms

• TRT Terms: Algorithms; Location; Methodology; Optimization; Sensors; Traffic flow
• Uncontrolled Terms: Road networks
• Subject Areas: Data and Information Technology; Highways; I71: Traffic Theory; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01524760
• Record Type: Publication
• Files: TLIB, TRIS
• Created Date: May 1 2014 4:36PM