By Topic

Algorithms for the Base Node Location Problem in the Virtual Segment Method in Store-Carry-Forward Routing Schemes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ryohei Dou ; Grad. Sch. of Sci. & Technol., Kwansei Gakuin Univ., Sanda, Japan ; Fujihara, A. ; Miwa, H.

The message deliveries based on the store-carry-forward routing schemes, such as epidemic spraying, Message Ferrying and so on, are one of the fundamental and useful methods for establishing communications under Delay/Disruption/Disconnect Tolerant Networking (DTN) environments. However, these methods for message deliveries commonly have their own limitations in reach ability of message to destinations and scalability of networking. For example, the propagation delay of message between source and destination nodes generally becomes longer as the distance to the destination increases and as the density of nodes covering an area decreases. To overcome these problems, Yamamura et al. proposed the method of Virtual Segment (VS) which combined the epidemic routing and the Message Ferrying with multiple base nodes (BN) connected with a wired/wireless high-speed core network. They showed experimentally that the method improved both the reach ability and the scalability as well. However, their study didn't mention how to locate base nodes in the Virtual Segments for achieving efficient message delivery. In this paper, we consider the Base Node Location Problem (BNLP) to find the optimal solution of locating base nodes in the Virtual Segments. We propose two heuristic algorithms to approach this problem and show the effectiveness of them by numerical simulations.

Published in:

Intelligent Networking and Collaborative Systems (INCOS), 2010 2nd International Conference on

Date of Conference:

24-26 Nov. 2010