Routing in a many-to-one communication scenario in a realistic VDTN

被引:13
作者
Bylykbashi, Kevin [1 ]
Spaho, Evjola [2 ]
Barolli, Leonard [3 ]
Xhafa, Fatos [4 ]
机构
[1] Polytech Univ Tirana, Fac Informat Technol, Mother Teresa Sq 4, Tirana, Albania
[2] Polytech Univ Tirana, Fac Informat Technol, Dept Elect & Telecommun, Mother Teresa Sq 4, Tirana, Albania
[3] Fukuoka Inst Technol FIT, Dept Informat & Commun Engn, Higashi Ku, 3-30-1 Wajiro Higashi, Fukuoka 8110295, Japan
[4] Tech Univ Catalonia, Dept Languages & Informat Syst, C Jordi Girona 1-3, Barcelona 08034, Spain
关键词
Opportunistic network; DTN; VDTN; routing protocol; ONE Simulator;
D O I
10.3233/JHS-180584
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.
引用
收藏
页码:107 / 118
页数:12
相关论文
共 19 条
  • [1] [Anonymous], 2012, DELAY DISRUPTION TOL
  • [2] Burgess J., 2006, P IEEE INFOCOM IEEE
  • [3] Cerf V., 2004, DELAY TOLERANT NETWO
  • [4] Demmer M., 2007, P 2007 WORKSH NETW S, V2007, P6
  • [5] Fall K, 2003, ACM SIGCOMM COMP COM, V33, P27
  • [6] Ilham A. A., 2012, P FORTEI IND U JAK, P24
  • [7] Ishikawa S., 2014, P CISIS 2014
  • [8] Routing in a delay tolerant network
    Jain, S
    Fall, K
    Patra, R
    [J]. ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (04) : 145 - 157
  • [9] Keranen A., 2009, SIMUTOOLS 2009
  • [10] Laoutaris N, 2009, PERF E R SI, V37, P229