Conference Proceeding

Shortest path routing with reliability requirement in delay tolerant networks

Dept. of Comput. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
11/2009; DOI:10.1109/ICFIN.2009.5339556 pp.292 - 297 In proceeding of: Future Information Networks, 2009. ICFIN 2009. First International Conference on
Source: IEEE Xplore

ABSTRACT The topology of a delay tolerant network (DTN) over time has been modeled by a space-time graph. However, the mobility of nodes, such as buses, may not be completely predictable due to factors such as traffic load, road condition, the number of passengers getting on and off the buses, and the operations of traffic lights. In this paper, we adapt the space-time graph by augmenting each horizontal edge with a direct contact probability to model the uncertainty of connectivity. With such an augmented space-time graph, our goal is to compute a shortest routing path satisfying a given end-to-end delivery reliability in a DTN. To facilitate such computation, we adapt the Floyd-Warshall algorithm to compute the maximum contact probability matrix at each time interval. By using an iterative matrix multiplication scheme on a maximum contact matrix, we can compute the shortest path satisfying the reliability constraint. Simulation results validate the performance of our solution which achieves a good balance between delay and reliability.

0 0
 · 
0 Bookmarks
 · 
19 Views
  • Source
    Article: Look-Ahead Strategies Based on Store-Carry and Forward Relaying for Energy Efficient Cellular Communications
    Kolios Panayiotis, Friderikos Vasilis, Papadaki Katerina
    [show abstract] [hide abstract]
    ABSTRACT: With the increasing availability of Internet type services on mobile devices and the attractive flat rate all-you-can-eat billing system, cellular telecommunication networks are experiencing a tremendous growth in data usage demand. However, there are increasing concerns that current network deployment trends (including more efficient radio access techniques and increased spectrum allocation strategies), will be unable to support the increased Internet traffic in a sustainable way. The delay tolerant nature of mobile Internet traffic allows for a large degree of flexibility in optimizing network performance to meet different design objectives and it’s a feature that has mostly gone unexplored by the research community. In this paper, we introduce a novel message forwarding mechanism in cellular networks that benefits from the inherent delay tolerance of Internet type services to provide flexible and adjustable forwarding strategies for efficient network operation while guaranteeing timely deliveries. By capitalizing on the elasticity of message delivery deadlines and the actual mobility of nodes inside the cell, considerable performance gains can be achieved by physically propagating information messages within the network.
    Future Internet. 01/2010;
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

augmented space-time graph
 
buses
 
computation
 
delay tolerant network
 
direct contact probability
 
Floyd-Warshall algorithm
 
given end-to-end delivery reliability
 
good balance
 
horizontal edge
 
iterative matrix multiplication scheme
 
maximum contact matrix
 
maximum contact probability matrix
 
path satisfying
 
reliability
 
reliability constraint
 
shortest path satisfying
 
space-time graph
 
time interval
 
traffic lights
 
traffic load