Abstract | ||
---|---|---|
One of the roles of Intelligent Transportation Systems (ITS) is to collect and disseminate certain information from different locations of the road network. This information can be related to traffic safety (e.g. dangerous situations on the road), to traffic efficiency (e.g. current experienced travel times), or to other information (e.g. parking possibilities) the drivers are interested in. The communication network used for dissemination can be either distributed or centralized or a combination of them. In this paper we focus on optimizing the positions where vehicles along their routes should send query messages in order to collect information about traffic jams. This problem is formulated and solved as an Integer Linear Programming problem. Finally, the numerical results are presented and analyzed. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1016/j.endm.2010.05.152 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
linear and integer programming,intelligent transportation systems,vehicular ad hoc networks,vehicular ad hoc network | Discrete mathematics,Telecommunications network,Computer security,Floating car data,Computer network,Vehicle Information and Communication System,Dissemination,Integer programming,Traffic efficiency,Intelligent transportation system,Accident prevention,Mathematics | Journal |
Volume | ISSN | Citations |
36 | Electronic Notes in Discrete Mathematics | 0 |
PageRank | References | Authors |
0.34 | 6 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Péter Laborczi | 1 | 8 | 1.96 |
Balázs Mezny | 2 | 0 | 0.68 |
Attila Török | 3 | 7 | 2.54 |
Zoltán Ruzsa | 4 | 0 | 0.34 |