Relay Node Placement in Vehicular Delay-Tolerant Networks

Delay-tolerant networking (DTN) is an architecture to enable data communications between isolated or remote regions, where long delays and intermittent connectivity can be tolerated. An emerging class of DTN, called vehicular DTNs (VDTN), exploits transportation systems as the transport layer to transfer data. In these networks, vehicles (e.g., busses, boats, trains) act as mobile nodes and carry data messages around. Mobile nodes can exchange data messages using devices called relay nodes. Relay nodes, placed in strategic positions along vehicle routes, have the capability to download, store, and upload the data messages from/to the mobile nodes. An important issue in VDTN is the optimal placement of the relay nodes such that delay-tolerant connectivity in VDTN is ensured at minimum cost. In this paper we show that the problem of optimal relay node placement is an NP-hard problem. Other contributions of this paper are the formulation of the relay node placement problem using ILP and the proposal of heuristic algorithms solving the optimization problem. Using simulation results, we compare the performance of each algorithm under different network constraints, such as node storage capability and network topology.

[1]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Vinton G. Cerf,et al.  Delay-Tolerant Networking Architecture , 2007, RFC.

[3]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[4]  Srinivasan Keshav,et al.  Low-cost communication for rural internet kiosks using mechanical backhaul , 2006, MobiCom '06.

[5]  T. Carpenter,et al.  Maximizing the transparency advantage in optical networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[6]  Andrea Fumagalli,et al.  Regenerator Placement with Guaranteed Connectivity in Optical Networks , 2007, ONDM.

[7]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[8]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[9]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[10]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

[11]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[12]  Chen-Nee Chuah,et al.  Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks , 2005, 2005 IEEE 61st Vehicular Technology Conference.