Filters








3,986 Hits in 6.9 sec

The DTN Routing Algorithm Based on Markov Meeting Time Span Prediction Model

En Wang, Yongjian Yang, Bing Jia, Tingting Guo
<span title="">2013</span> <i title="SAGE Publications"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/snvb3djywzbhvjtue42hxtjery" style="color: black;">International Journal of Distributed Sensor Networks</a> </i> &nbsp;
Putting forward an efficient routing algorithm in DTN (delay tolerant network) has become a focus of attention due to the existing phenomena that the connections between nodes in the network change dramatically  ...  In the two phases, spray phase and wait phase, the message is routed according to the utility value. Thus, the routing algorithm based on Markov meeting time span prediction model is provided.  ...  Introduction DTN (delay tolerant network) [1] which is put forward by Fall at the international committee SIGCOMM in 2003 [2] is a kind of challenged network characterized by changing topology and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/736796">doi:10.1155/2013/736796</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/az6wv7rmezb7xkp5jbqskpjmri">fatcat:az6wv7rmezb7xkp5jbqskpjmri</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200710040358/http://downloads.hindawi.com/journals/ijdsn/2013/736796.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/6f/ab/6fabf7a849bde276fb9bcedc4812dae4ccae39af.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/736796"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

Modeling Redundancy-Based Routing in Delay Tolerant Networks

Yong Liao, Kun Tan, Zhensheng Zhang, Lixin Gao
<span title="">2007</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/iziq5tdnabbczezynz7xdk7uma" style="color: black;">2007 4th IEEE Consumer Communications and Networking Conference</a> </i> &nbsp;
However, there lacks a systematical analytic work on modeling the redundancybased routing schemes for delay tolerant networks.  ...  Routing in delay tolerant networks is challenging because many well-known assumptions of traditional networks do not hold in DTNs.  ...  In this paper, we propose a model using continuous time Markov chain with absorbing state to study the performance of redundancy-based routing in delay tolerant networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ccnc.2007.49">doi:10.1109/ccnc.2007.49</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ccnc/LiaoTZG07.html">dblp:conf/ccnc/LiaoTZG07</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n67eoex5njgnlneomf25ctl4ti">fatcat:n67eoex5njgnlneomf25ctl4ti</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070824021720/http://rio.ecs.umass.edu/mnilpub/papers/ccnc07-conference.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a2/3f/a23f9ad53ff63bb6e97d93986bcf6c61b1cef331.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ccnc.2007.49"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Markov Chain-Based Routing Algorithm in Delay-Tolerant Networks

Chenji Pan, Jiaping Gui, Jiaju Yan, Yue Wu
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7rwnrndvivevjogw65pi6sc33m" style="color: black;">2012 IEEE/IPSJ 12th International Symposium on Applications and the Internet</a> </i> &nbsp;
Delay-tolerant networking (DTN) is a type of wireless network architecture that works to determine an approach to address the technical issues in rugged environments, in which routing paths are unstable  ...  This paper proposes MCR, a routing algorithm based on the Markov chain and uses the node's past interactions with others to determine the potential routing.  ...  INTRODUCTION Delay-tolerant networks (DTNs) have the potential to address routing issues and transfer data in situations where no continuous network connectivity exists and current networking technology  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/saint.2012.30">doi:10.1109/saint.2012.30</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/saint/PanGYW12.html">dblp:conf/saint/PanGYW12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mknykgqtwvadddyjnyjjoip3ce">fatcat:mknykgqtwvadddyjnyjjoip3ce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181008144418/http://www-scf.usc.edu:80/~jgui/papers/SAINT2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/76/cc/76cc74a695499e14122445550d2d0654e3e910b9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/saint.2012.30"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Constructing time-varying contact graphs for heterogeneous delay tolerant networks

Xiaoyan Hong, Bo Gu, Yuguang Zeng, Jingyuan Zhang
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lgc2un3ucjf3fgwb7o42q3s7d4" style="color: black;">2012 IEEE Global Communications Conference (GLOBECOM)</a> </i> &nbsp;
Its ability goes beyond simply calculating encounter events, but is well suitable for protocol evaluation in opportunistic networks, mobile social networks and delay tolerant networks.  ...  We further use a Markovian model to describe the time dependency among link delays at each static nodes and use the states to develop a network model for simulation.  ...  Markov chain based network model In order to model the time-dependent links between the message boxes that are formed collectively by the mobile nodes, a Markov chain model is proposed to represent the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/glocom.2012.6503963">doi:10.1109/glocom.2012.6503963</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/globecom/HongGZZ12.html">dblp:conf/globecom/HongGZZ12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/v5shjkhfuzazzbqpa4ev3muvsm">fatcat:v5shjkhfuzazzbqpa4ev3muvsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808224702/http://hong.cs.ua.edu/papers/gc12-p5524-hong.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/99/80/9980becdca82ac86ba8b4150cacf1260f60c7ed2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/glocom.2012.6503963"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Forecasting DTN performance under heterogeneous mobility: The case of limited replication

Andreea Picu, Thrasyvoulos Spyropoulos
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q4aeonhyuffk7bofdphs636qtq" style="color: black;">2012 9th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON)</a> </i> &nbsp;
We propose DTN-Meteo: a new unified analytical model that maps an important class of DTN optimization problems and the respective (greedy) algorithms into a Markov chain traversal over the relevant solution  ...  Opportunistic or Delay Tolerant Networks (DTNs) may be used to enable communication in case of failure or lack of infrastructure (disaster, censorship, remote areas) and to complement existing wireless  ...  For example, in routing, the spread of a message was modeled with a Markov chain, whose states are the number of copies in the network [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/secon.2012.6275828">doi:10.1109/secon.2012.6275828</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/secon/PicuS12.html">dblp:conf/secon/PicuS12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bfvxzdvinvbmzkl7ry4cvodw74">fatcat:bfvxzdvinvbmzkl7ry4cvodw74</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130409165553/http://www.eurecom.fr/en/publication/3752/download/cm-publi-3752.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5c/f0/5cf09ed19fe9487d0662ec39c01630f99a319409.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/secon.2012.6275828"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Improved Routing in MANET with Optimized Multi path routing fine tuned with Hybrid modeling

N.S. Saba Farheen, Anuj Jain
<span title="">2020</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o63dl5tt4rchrgx6avnqabwxd4" style="color: black;">Journal of King Saud University: Computer and Information Sciences</a> </i> &nbsp;
In this work a node location prediction based on the temporal and spatial characteristics with respect to its neighborhood is applied to estimate the probable locations using a hybrid model.  ...  Routing in MANET is very challenging due to movement of nodes. Predicting the node position and routing based on predicted positions helps to establish routing path with much longevity.  ...  The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jksuci.2020.01.001">doi:10.1016/j.jksuci.2020.01.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dj2ijvctfngyrkvlgtwktdnsji">fatcat:dj2ijvctfngyrkvlgtwktdnsji</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210527094756/https://pdf.sciencedirectassets.com/280416/AIP/1-s2.0-S1319157819310304/main.pdf?X-Amz-Security-Token=IQoJb3JpZ2luX2VjEJn%2F%2F%2F%2F%2F%2F%2F%2F%2F%2FwEaCXVzLWVhc3QtMSJHMEUCICGN7DbDM7%2BRkONlaPiMXQx%2BTFuMDQTl1XMGhB%2FkJhA2AiEAhwZElKqRUAAUWcL2GwWN5VfiVyQ4boMBZgWPKawAENgq%2BgMIQhADGgwwNTkwMDM1NDY4NjUiDOHmC7KL5cKhzyerZSrXAxjE2NTRHZxwWFkPTx%2FxWb9d0rhh73a6UEkBuZnQj2vr%2Fhws%2FYHQCYV%2F5RO1XJ9d2I090wIbfuqZ4dr4K4wykqBDcU4v1CcIiVN%2B8te5QKGOqFP25dAWLT8dVoyA4qfnab3ED6E0FmTvh5vnJX%2BPb%2FlrUyglN7uGtJwSwUMpowogbimZ5ilunsiz8J31eksSaIJP1vAX%2Fbh4NucdaZniygfRgB0ic2IOHkfLrbF0wymcucGTHPZvDUcpOu6bdM40U8OADGJvFB4ThiEjeDzTCWgCaSQYejWGLQB9ORfUQ%2FpOswm1MyAeob97e5qKMTnJONWrbT65deYx%2F5sRGkSLNSnGMyy3P9B7nvM7MMeaj%2FUQvxfkc90xbQwXxb2d08ivJ9C4BQaZ6d1ro5BWqZ%2FUm56hCT0KMsulJMnsQ7dYU5O%2BXdquUifHkloK8ikCAdCAPy5wwADhJrZ0QNbIC%2BMK1ojSzyuwXPNa1AF5o9imzRVfTmEJZE4gubOkEmptD2D5MudFdLZnmdGVYLKdiAh6iAnKamC8%2FT%2FnQCJFbP%2FVAACTECIJLZP2YC8VUftDffBiVP166WkGprVFABPzm7cYZSlgTMJNXgC9sVtFtkDijdygsf5AX0VX9jDOsb2FBjqlAcvssxlPT26wS09XLPLDAcwj7WPREG8vj1eIPZSGHDiO%2FgjD5i0FHvyUwDG5NkS3HoYM1LGR5ryZNrHIzUxxfdlgn3Arz4iciSxGM%2B73ywTs73VNvzII3%2Bb5WEWEXl5t9gB8YpK6NnGgwQ9zLYYW6Ax5GReRZWlFxp5Y8G6vo5cx5B5bphmsit%2FA1MWmRQEc%2BXWBJrXGLKEr9%2FbWMSpAFxIaG4aXqw%3D%3D&amp;X-Amz-Algorithm=AWS4-HMAC-SHA256&amp;X-Amz-Date=20210527T094750Z&amp;X-Amz-SignedHeaders=host&amp;X-Amz-Expires=300&amp;X-Amz-Credential=ASIAQ3PHCVTYYIU3JA7Q%2F20210527%2Fus-east-1%2Fs3%2Faws4_request&amp;X-Amz-Signature=b92c1c0743504fddccca3c5786a05d85efada2a0db8a75a90ace20d62ce30090&amp;hash=2c8a150f262b7bbc94d144bfcf36142e935c178d4389af4472da7040836861a8&amp;host=68042c943591013ac2b2430a89b270f6af2c76d8dfd086a07176afe7c76c2c61&amp;pii=S1319157819310304&amp;tid=spdf-324f9620-da88-485d-a0f2-7ffe2309da94&amp;sid=46ecea0c21bd6948f02a9a55f79ea1e2f1dfgxrqa&amp;type=client" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/65/cf/65cf4bc1f51efb6b78b8a7b0fc898db5ea1a4864.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jksuci.2020.01.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Delay management in delay-tolerant networks

Qunwei Zheng, Xiaoyan Hong, Pu Wang, Lei Tang, Jun Liu
<span title="">2008</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ganzg2oa3rhibnm2sevh7uvisa" style="color: black;">International Journal of Network Management</a> </i> &nbsp;
Our results help the management of message delivery for delay tolerant networks, e.g., in selecting a proper time-to-live threshold for a message.  ...  In delay tolerant networks (DTN), nodes explore various opportunities to connect and communicate with each other.  ...  CONCLUSION In summary, we have presented a set of analysis on encounter probability and encounter delay for several mobility models for location-centric delay tolerant networks.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/nem.706">doi:10.1002/nem.706</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tuyeeypazfb45nhp4hjg5uunv4">fatcat:tuyeeypazfb45nhp4hjg5uunv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100611200538/http://cs.ua.edu/%7Ehxy/papers/encounter-CR-final.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ff/81/ff819ea743caf4f8b918cc00083c7e544bc6a870.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/nem.706"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

An analysis of the information spreading delay in heterogeneous mobility DTNs

Andreea Picu, Thrasyvoulos Spyropoulos, Theus Hossmann
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4pfxdmp3urc5rbpwp5xxnz7zve" style="color: black;">2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)</a> </i> &nbsp;
We observe the special properties of a Markov model, describing the epidemic process and use them to derive bounds for the delay (expectation and distribution).  ...  This principle naturally applies to Opportunistic or Delay Tolerant Networks (DTNs), where nodes probabilistically meet their neighbors thanks to mobility.  ...  With Markov models, the spread of a message is modeled with a chain, whose states are the number of copies in the network.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wowmom.2012.6263682">doi:10.1109/wowmom.2012.6263682</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wowmom/PicuSH12.html">dblp:conf/wowmom/PicuSH12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2eimy3t73ba2ngfpmhlmfufrue">fatcat:2eimy3t73ba2ngfpmhlmfufrue</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170819101404/https://www.computer.org/csdl/proceedings/wowmom/2012/1238/00/01RegularAnAnalysisoftheInformationSpreadingDelayi.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/e4/c5e4f72729024c491caf8f4a9334e336736c6937.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/wowmom.2012.6263682"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A routing algorithm on delay-tolerant of wireless sensor network based on the node selfishness

Sai Zou, Wei Wang, Wenyong Wang
<span title="2013-08-23">2013</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/a5gjzjadkzbirdua4xdqipotp4" style="color: black;">EURASIP Journal on Wireless Communications and Networking</a> </i> &nbsp;
We present a delay-tolerant routing algorithm based on the node selfishness (DTSNS). Firstly, we divide the activity area into grids.  ...  According to the problem of the intermittent connectivity of the nodes in the delay-tolerant sensor network, considering that the nodes in the network are of social selfishness, we study how to reduce  ...  For the delay-tolerant network, the movement of nodes in the network meets with the random walk model.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1687-1499-2013-212">doi:10.1186/1687-1499-2013-212</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6dhszdcbtzhsbikwa7oegs6ihm">fatcat:6dhszdcbtzhsbikwa7oegs6ihm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170813005003/https://jwcn-eurasipjournals.springeropen.com/track/pdf/10.1186/1687-1499-2013-212?site=jwcn.eurasipjournals.springeropen.com" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0b/b0/0bb092419b396e82e9c6686a19dc56019af46961.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1687-1499-2013-212"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>

Mobile Vehicular Offloading with Individual Mobility

Meiyi Yang, Nianbo Liu, Weize Wang, Haigang Gong, Ming Liu
<span title="">2019</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/q7qi7j4ckfac7ehf3mjbso4hne" style="color: black;">IEEE Access</a> </i> &nbsp;
Moreover, a mobility-aware routing scheme is developed for inter-vehicle communication.  ...  We build a realistic system to investigate the regularities in people's daily travelling and WiFi usage, analyze individual mobility, and establish a Long Short Term Memory (LSTM) model to predict one's  ...  Compared to previous mobility models based on Markov chain or Hidden Markov Model, we aim to generate accurate prediction of arrival time to support the decision of our collaborate routing.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2019.2956229">doi:10.1109/access.2019.2956229</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jbc4b5tyajbnbkdv2sbzbrezzm">fatcat:jbc4b5tyajbnbkdv2sbzbrezzm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201108073646/https://ieeexplore.ieee.org/ielx7/6287639/8948470/08915851.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/4d/2b/4d2ba76259596cda96d8f0889682cf4921356ada.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/access.2019.2956229"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> ieee.com </button> </a>

DTN Routing with Probabilistic Trajectory Prediction [chapter]

Ionut Cardei, Cong Liu, Jie Wu, Quan Yuan
<span title="">2008</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We describe a technique for contact estimation for mobile nodes that uses a Time Homogeneous Semi Markov model.  ...  In this paper we propose a DTN routing scheme for applications where the node trajectory and the contact schedule can be predicted probabilistically.  ...  To mitigate these issues a new class of Delay Tolerant Networks (DTN) has been defined in [4] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-88582-5_7">doi:10.1007/978-3-540-88582-5_7</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y4rriinr6bhslppt6rrahtbmt4">fatcat:y4rriinr6bhslppt6rrahtbmt4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20090115214134/http://www.cse.fau.edu/~jie/research/publications/Publication_files/wasa2008-auv-routing.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/01/e4/01e4f5fa35af6aa8dec1c21d41d438f977c1fafe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-88582-5_7"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Prediction Model for Offloading in Vehicular Wi-Fi Network

Mahmoud Abdulwahab Alawi, Raed Alsaqour, Elankovan Sundararajan, Mahamod Ismail
<span title="2016-12-25">2016</span> <i title="Insight Society"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/micztizddff3zji5xocudzzx64" style="color: black;">International Journal on Advanced Science, Engineering and Information Technology</a> </i> &nbsp;
This work proposed a prediction model which utilized historical connection pattern, vehicular movement, and driver profile to predict the next available AP.  ...  Though, using IEE802.11 Wi-Fi AP to offload 4G LTE-A network for moving vehicle is a challenging task since it only covers short distance and not well deployed to cover all the roads.  ...  Markov chain model has been studied in [11] , [21] to solve this problem.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18517/ijaseit.6.6.1411">doi:10.18517/ijaseit.6.6.1411</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dlvlf3yg7rf3xkgzofkwrdvotm">fatcat:dlvlf3yg7rf3xkgzofkwrdvotm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180721152439/http://www.insightsociety.org/ojaseit/index.php/ijaseit/article/download/1411/940" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b0/28/b028d897c81cb71bd364615732806e6a36f534d9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.18517/ijaseit.6.6.1411"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

TPR-DTVN: A Routing Algorithm in Delay Tolerant Vessel Network Based on Long-Term Trajectory Prediction

Chao Liu, Yingbin Li, Ruobing Jiang, Yong Du, Qian Lu, Zhongwen Guo, Xiao Zhang
<span title="2021-01-29">2021</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6o4hgxplrbehxg4t53ub7zmfha" style="color: black;">Wireless Communications and Mobile Computing</a> </i> &nbsp;
Delay Tolerant Vessel Networks (DTVNs), which can create low-cost communication opportunities among vessels, have recently attracted considerable attention in the academic community.  ...  To predict accurate future trajectories, we develop a long-term accurate trajectory prediction model by improving the Bidirectional Long-Short Term Memory (Bi-LSTM) model.  ...  For time-series data prediction, some traditional models like Bayes or Markov chain have been applied [17, 18, 20] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/6630265">doi:10.1155/2021/6630265</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bokj6befengyjdnn6rqxkjrvmy">fatcat:bokj6befengyjdnn6rqxkjrvmy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210303084800/https://downloads.hindawi.com/journals/wcmc/2021/6630265.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/9c/89/9c89ffdef79ab2987995f529c95fb28ac2c50ec5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2021/6630265"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a>

On the Delivery Likelihood of Two-Hop Relay MANETs using Erasure Cryptography

Prema Somani, B.M. Patil
<span title="2016-04-20">2016</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
Also we developed finite-state Markov chain model to characterize the complicated message delivery process in the MANETs.  ...  In this proposed method a new routing protocol is Self-Adaptive on demand Geographic routing protocols.  ...  It is shown that the model accurately predicts the message delay for both relay strategies for a number of mobility models.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijca2016909443">doi:10.5120/ijca2016909443</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/f64vzg52offb5ovx2cx2lt56vu">fatcat:f64vzg52offb5ovx2cx2lt56vu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180602194529/https://www.ijcaonline.org/research/volume139/number14/somani-2016-ijca-909443.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/da/c1/dac191fe87a7672481ee12b6590b779f6563bfbc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/ijca2016909443"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Tuning message size in opportunistic mobile networks

John Whitbeck, Vania Conan, Marcelo Amorim
<span title="">2009</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6mtaqkuatjbxjnu4pbbyvwphgi" style="color: black;">Proceedings of the 1st ACM workshop on Networking, systems, and applications for mobile handhelds - MobiHeld &#39;09</a> </i> &nbsp;
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tolerated delay and link stability  ...  Each of the potential N (N −1) 2 links is considered independent and is modeled as a two-state ( ↑ or ↓) Markov chain.  ...  Furthermore we suppose than a mobile application can only tolerate a given delay in message delivery. We note d the maximum delay beyond which a delivery is considered to have failed.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1592606.1592628">doi:10.1145/1592606.1592628</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigcomm/WhitbeckCA09.html">dblp:conf/sigcomm/WhitbeckCA09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6dmzzmoownd65bnzw2rdcwndzi">fatcat:6dmzzmoownd65bnzw2rdcwndzi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150915042438/http://conferences.sigcomm.org/sigcomm/2009/workshops/mobiheld/papers/p75.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/01/01/01015c574118e8d6d45be57dc22c0e4f2d394daf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1592606.1592628"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,986 results