Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network
Identifieur interne : 003039 ( Istex/Corpus ); précédent : 003038; suivant : 003040Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network
Auteurs : Kyoung-Sook Kim ; So-Young Hwang ; Ki-Joune LiSource :
- 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 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><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ksookim@pnu.edu</mods:affiliation></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><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: youngox@pnu.edu</mods:affiliation></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><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: lik@pnu.edu</mods:affiliation></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></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><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: ksookim@pnu.edu</mods:affiliation></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><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: youngox@pnu.edu</mods:affiliation></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><mods:affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: lik@pnu.edu</mods:affiliation></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><istex><corpusName>springer</corpusName><author><json:item><name>Kyoung-Sook Kim</name><affiliations><json:string>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</json:string><json:string>E-mail: ksookim@pnu.edu</json:string></affiliations></json:item><json:item><name>So-Young Hwang</name><affiliations><json:string>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</json:string><json:string>E-mail: youngox@pnu.edu</json:string></affiliations></json:item><json:item><name>Ki-Joune Li</name><affiliations><json:string>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</json:string><json:string>E-mail: lik@pnu.edu</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><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.</abstract><qualityIndicators><score>5.908</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>1143</abstractCharCount><pdfWordCount>3736</pdfWordCount><pdfCharCount>22288</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>181</abstractWordCount></qualityIndicators><title>Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network</title><genre.original><json:string>OriginalPaper</json:string></genre.original><chapterId><json:string>19</json:string><json:string>Chap19</json:string></chapterId><genre><json:string>conference [eBooks]</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>New York University, NY, USA</json:string></affiliations></json:item><json:item><name>Dough Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbruecken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2005</copyrightDate></serie><host><editor><json:item><name>Yong-Jin Kwon</name><affiliations><json:string>Department of Telecommunication and Information Engineering, Korea Aerospace University, Koyang, Kyunggi, Korea</json:string><json:string>E-mail: yjkwon@tikwon.hangkong.ac.kr</json:string></affiliations></json:item><json:item><name>Alain Bouju</name><affiliations><json:string>University de La Rochelle, France</json:string><json:string>E-mail: alain.bouju@univ-lr.fr</json:string></affiliations></json:item><json:item><name>Christophe Claramunt</name><affiliations><json:string>Naval Academy Research Institute, Brest Naval, France</json:string><json:string>E-mail: claramunt@ecole-navale.fr</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Multimedia Information Systems</value></json:item><json:item><value>Computer Communication Networks</value></json:item></subject><isbn><json:string>978-3-540-26004-2</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Web and Wireless Geographical Information Systems</title><genre.original><json:string>Proceedings</json:string></genre.original><bookId><json:string>978-3-540-31964-1</json:string></bookId><volume>3428</volume><pages><last>253</last><first>242</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>Book Series</json:string></genre><eisbn><json:string>978-3-540-31964-1</json:string></eisbn><copyrightDate>2005</copyrightDate><doi><json:string>10.1007/b136505</json:string></doi></host><publicationDate>2005</publicationDate><copyrightDate>2005</copyrightDate><doi><json:string>10.1007/11427865_19</json:string></doi><id>7DAC286352F5632AF42B4682D689E4F7BA8C20B0</id><score>1</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/7DAC286352F5632AF42B4682D689E4F7BA8C20B0/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/7DAC286352F5632AF42B4682D689E4F7BA8C20B0/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/7DAC286352F5632AF42B4682D689E4F7BA8C20B0/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>2005</date></publicationStmt><sourceDesc><biblStruct type="inbook"><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><persName><forename type="first">Kyoung-Sook</forename><surname>Kim</surname></persName><email>ksookim@pnu.edu</email><affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</affiliation></author><author><persName><forename type="first">So-Young</forename><surname>Hwang</surname></persName><email>youngox@pnu.edu</email><affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</affiliation></author><author><persName><forename type="first">Ki-Joune</forename><surname>Li</surname></persName><email>lik@pnu.edu</email><affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</affiliation></author></analytic><monogr><title level="m">Web and Wireless Geographical Information Systems</title><title level="m" type="sub">4th International Workshop, W2GIS 2004, Goyang, Korea, November 26-27, 2004, Revised Selected Papers</title><idno type="pISBN">978-3-540-26004-2</idno><idno type="eISBN">978-3-540-31964-1</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/b136505</idno><idno type="BookID">978-3-540-31964-1</idno><idno type="BookTitleID">118248</idno><idno type="BookSequenceNumber">3428</idno><idno type="BookVolumeNumber">3428</idno><idno type="BookChapterCount">19</idno><editor><persName><forename type="first">Yong-Jin</forename><surname>Kwon</surname></persName><email>yjkwon@tikwon.hangkong.ac.kr</email><affiliation>Department of Telecommunication and Information Engineering, Korea Aerospace University, Koyang, Kyunggi, Korea</affiliation></editor><editor><persName><forename type="first">Alain</forename><surname>Bouju</surname></persName><email>alain.bouju@univ-lr.fr</email><affiliation>University de La Rochelle, France</affiliation></editor><editor><persName><forename type="first">Christophe</forename><surname>Claramunt</surname></persName><email>claramunt@ecole-navale.fr</email><affiliation>Naval Academy Research Institute, Brest Naval, France</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2005"></date><biblScope unit="volume">3428</biblScope><biblScope unit="page" from="242">242</biblScope><biblScope unit="page" to="253">253</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>New York University, NY, USA</affiliation></editor><editor><persName><forename type="first">Dough</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation></editor><biblScope><date>2005</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</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></fileDesc><profileDesc><creation><date>2005</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>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.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I18024</label><label>I18032</label><label>I18040</label><label>I18059</label><label>I13022</label><item><term>Computer Science</term></item><item><term>Database Management</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Information Systems Applications (incl.Internet)</term></item><item><term>Multimedia Information Systems</term></item><item><term>Computer Communication Networks</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2005">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-19">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/7DAC286352F5632AF42B4682D689E4F7BA8C20B0/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Dough</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>CA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><City>MA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>New York University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbruecken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-540-31964-1</BookID><BookTitle>Web and Wireless Geographical Information Systems</BookTitle><BookSubTitle>4th International Workshop, W2GIS 2004, Goyang, Korea, November 26-27, 2004, Revised Selected Papers</BookSubTitle><BookVolumeNumber>3428</BookVolumeNumber><BookSequenceNumber>3428</BookSequenceNumber><BookDOI>10.1007/b136505</BookDOI><BookTitleID>118248</BookTitleID><BookPrintISBN>978-3-540-26004-2</BookPrintISBN><BookElectronicISBN>978-3-540-31964-1</BookElectronicISBN><BookChapterCount>19</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2005</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I18024" Priority="1" Type="Secondary">Database Management</BookSubject><BookSubject Code="I18032" Priority="2" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18040" Priority="3" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="I18059" Priority="4" Type="Secondary">Multimedia Information Systems</BookSubject><BookSubject Code="I13022" Priority="5" Type="Secondary">Computer Communication Networks</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Yong-Jin</GivenName><FamilyName>Kwon</FamilyName></EditorName><Contact><Email>yjkwon@tikwon.hangkong.ac.kr</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Alain</GivenName><FamilyName>Bouju</FamilyName></EditorName><Contact><Email>alain.bouju@univ-lr.fr</Email></Contact></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Christophe</GivenName><FamilyName>Claramunt</FamilyName></EditorName><Contact><Email>claramunt@ecole-navale.fr</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Department of Telecommunication and Information Engineering</OrgDivision><OrgName>Korea Aerospace University</OrgName><OrgAddress><City>Koyang, Kyunggi</City><Country>Korea</Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>University de La Rochelle</OrgName><OrgAddress><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgName>Naval Academy Research Institute</OrgName><OrgAddress><City>Brest Naval</City><Country>France</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part6"><PartInfo TocLevels="0"><PartID>6</PartID><PartSequenceNumber>6</PartSequenceNumber><PartTitle>3-D GIS and Telematics</PartTitle><PartChapterCount>3</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Web and Wireless Geographical Information Systems</BookTitle></PartContext></PartInfo><Chapter ID="Chap19" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>19</ChapterID><ChapterDOI>10.1007/11427865_19</ChapterDOI><ChapterSequenceNumber>19</ChapterSequenceNumber><ChapterTitle Language="En">Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network</ChapterTitle><ChapterFirstPage>242</ChapterFirstPage><ChapterLastPage>253</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2005</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>6</PartID><BookID>978-3-540-31964-1</BookID><BookTitle>Web and Wireless Geographical Information Systems</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Kyoung-Sook</GivenName><FamilyName>Kim</FamilyName></AuthorName><Contact><Email>ksookim@pnu.edu</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>So-Young</GivenName><FamilyName>Hwang</FamilyName></AuthorName><Contact><Email>youngox@pnu.edu</Email></Contact></Author><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Ki-Joune</GivenName><FamilyName>Li</FamilyName></AuthorName><Contact><Email>lik@pnu.edu</Email></Contact></Author><Affiliation ID="Aff19"><OrgDivision>Department of Computer Science and Engineering</OrgDivision><OrgName>Pusan National University</OrgName><OrgAddress><City>Pusan</City><Postcode>609-735</Postcode><Country>South Korea</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>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 <Emphasis Type="Italic">on-road routing</Emphasis>, 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 <Emphasis Type="Italic">on-road routing</Emphasis> method compared to LAR-like method. At best, our method reduces about 57 times less messages.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Arrival Time Dependent Shortest Path by On-Road Routing in Mobile Ad-Hoc Network</title></titleInfo><name type="personal"><namePart type="given">Kyoung-Sook</namePart><namePart type="family">Kim</namePart><affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</affiliation><affiliation>E-mail: ksookim@pnu.edu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">So-Young</namePart><namePart type="family">Hwang</namePart><affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</affiliation><affiliation>E-mail: youngox@pnu.edu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Ki-Joune</namePart><namePart type="family">Li</namePart><affiliation>Department of Computer Science and Engineering, Pusan National University, 609-735, Pusan, South Korea</affiliation><affiliation>E-mail: lik@pnu.edu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference [eBooks]" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2005</dateIssued><copyrightDate encoding="w3cdtf">2005</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>Web and Wireless Geographical Information Systems</title><subTitle>4th International Workshop, W2GIS 2004, Goyang, Korea, November 26-27, 2004, Revised Selected Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Yong-Jin</namePart><namePart type="family">Kwon</namePart><affiliation>Department of Telecommunication and Information Engineering, Korea Aerospace University, Koyang, Kyunggi, Korea</affiliation><affiliation>E-mail: yjkwon@tikwon.hangkong.ac.kr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Alain</namePart><namePart type="family">Bouju</namePart><affiliation>University de La Rochelle, France</affiliation><affiliation>E-mail: alain.bouju@univ-lr.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Christophe</namePart><namePart type="family">Claramunt</namePart><affiliation>Naval Academy Research Institute, Brest Naval, France</affiliation><affiliation>E-mail: claramunt@ecole-navale.fr</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="Book Series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2005</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="I18059">Multimedia Information Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic></subject><identifier type="DOI">10.1007/b136505</identifier><identifier type="ISBN">978-3-540-26004-2</identifier><identifier type="eISBN">978-3-540-31964-1</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">118248</identifier><identifier type="BookID">978-3-540-31964-1</identifier><identifier type="BookChapterCount">19</identifier><identifier type="BookVolumeNumber">3428</identifier><identifier type="BookSequenceNumber">3428</identifier><identifier type="PartChapterCount">3</identifier><part><date>2005</date><detail type="part"><title>3-D GIS and Telematics</title></detail><detail type="volume"><number>3428</number><caption>vol.</caption></detail><extent unit="pages"><start>242</start><end>253</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>New York University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dough</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2005</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></relatedItem><identifier type="istex">7DAC286352F5632AF42B4682D689E4F7BA8C20B0</identifier><identifier type="DOI">10.1007/11427865_19</identifier><identifier type="ChapterID">19</identifier><identifier type="ChapterID">Chap19</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2005</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></mods></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003039 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/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= Corpus
|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. |  |