Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network
Identifieur interne : 003039 ( Istex/Curation ); précédent : 003038; suivant : 003040Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network
Auteurs : Kyoung-Sook Kim [Corée du Sud, États-Unis] ; So-Young Hwang [Corée du Sud, États-Unis] ; Ki-Joune Li [Corée du Sud, États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: Arrival time dependent shortest path finding is an important function in the field of traffic information systems or telematics. However large number of mobile objects on the road network results in a scalability problem for frequently updating and handling their real-time location. In this paper, we propose a query processing method in MANET(Mobile Ad-hoc Network) environment to find an arrival time dependent shortest path with a consideration of both traffic and location in real time. Since our method does not need a centralized server, time dependent shortest path query is processed by in-network way. In order to reduce the number of messages to forward and nodes to relay, we introduce an on-road routing, where messages are forwarded to neighboring nodes on the same or adjacent road segments. This routing method allows to collect traffic information in real time and to reduce the number of routing messages. Experiments show that the number of forwarded messages is reduced in an order of magnitude with our on-road routing method compared to LAR-like method. At best, our method reduces about 57 times less messages.
Url:
DOI: 10.1007/11427865_19
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003039
Links to Exploration step
ISTEX:7DAC286352F5632AF42B4682D689E4F7BA8C20B0Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network</title><author><name sortKey="Kim, Kyoung Sook" sort="Kim, Kyoung Sook" uniqKey="Kim K" first="Kyoung-Sook" last="Kim">Kyoung-Sook Kim</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: ksookim@pnu.edu</mods:affiliation><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Hwang, So Young" sort="Hwang, So Young" uniqKey="Hwang S" first="So-Young" last="Hwang">So-Young Hwang</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: youngox@pnu.edu</mods:affiliation><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Li, Ki Joune" sort="Li, Ki Joune" uniqKey="Li K" first="Ki-Joune" last="Li">Ki-Joune Li</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lik@pnu.edu</mods:affiliation><country wicri:rule="url">États-Unis</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7DAC286352F5632AF42B4682D689E4F7BA8C20B0</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11427865_19</idno><idno type="url">https://api.istex.fr/document/7DAC286352F5632AF42B4682D689E4F7BA8C20B0/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">003039</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003039</idno><idno type="wicri:Area/Istex/Curation">003039</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network</title><author><name sortKey="Kim, Kyoung Sook" sort="Kim, Kyoung Sook" uniqKey="Kim K" first="Kyoung-Sook" last="Kim">Kyoung-Sook Kim</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: ksookim@pnu.edu</mods:affiliation><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Hwang, So Young" sort="Hwang, So Young" uniqKey="Hwang S" first="So-Young" last="Hwang">So-Young Hwang</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: youngox@pnu.edu</mods:affiliation><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Li, Ki Joune" sort="Li, Ki Joune" uniqKey="Li K" first="Ki-Joune" last="Li">Ki-Joune Li</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lik@pnu.edu</mods:affiliation><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">7DAC286352F5632AF42B4682D689E4F7BA8C20B0</idno><idno type="DOI">10.1007/11427865_19</idno><idno type="ChapterID">19</idno><idno type="ChapterID">Chap19</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Arrival time dependent shortest path finding is an important function in the field of traffic information systems or telematics. However large number of mobile objects on the road network results in a scalability problem for frequently updating and handling their real-time location. In this paper, we propose a query processing method in MANET(Mobile Ad-hoc Network) environment to find an arrival time dependent shortest path with a consideration of both traffic and location in real time. Since our method does not need a centralized server, time dependent shortest path query is processed by in-network way. In order to reduce the number of messages to forward and nodes to relay, we introduce an on-road routing, where messages are forwarded to neighboring nodes on the same or adjacent road segments. This routing method allows to collect traffic information in real time and to reduce the number of routing messages. Experiments show that the number of forwarded messages is reduced in an order of magnitude with our on-road routing method compared to LAR-like method. At best, our method reduces about 57 times less messages.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003039 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 003039 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:7DAC286352F5632AF42B4682D689E4F7BA8C20B0
|texte= Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network
}}
| This area was generated with Dilib version V0.6.31. |  |