POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India

Delay Tolerant Networks (DTN) has been widely used in challenge networks as an emerging network architecture. Among all studies , routing mechanism is the key problem in DTN. Because of high latency and low data rate, the traditional network routing algorithm can not apply to DTN. This paper proposed a DTN routing mechanism based on area dipartition. The mechanism divided the space into several regions, and calculated the probability of occurrence of each node in each region to determine data transfer path according to the probability. Finally, the simulation results show that the mechanism can significantly enhance the message delivery probability and reduce the packet loss rate.

Download Full-text

Validation of Fuzzy-Based Routing Algorithm for DTN

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.644-650.1931 ◽

2014 ◽

Vol 644-650 ◽

pp. 1931-1934

Author(s):

Fan Yang ◽

Jia Zhe Lai ◽

Ming Zhe Li

Keyword(s):

Routing Algorithm ◽

Simulation Software ◽

Delay Tolerant Network ◽

Research Issue ◽

Network Environment ◽

Opportunistic Network ◽

Dtn Routing ◽

Delay Tolerant ◽

Spray And Wait

In the research of Delay Tolerant Network (DTN), DTN routing algorithm is a key research issue. The performance of a non-flooding routing algorithm is verified in our paper. The verified algorithm is an Adaptive Priority Routing Algorithm (APRA) which is based on fuzzy strategies. Firstly, we introduce the principle of APRA, then using Opportunistic Network Environment (ONE) -simulation software to compare the performance of Epidemic algorithm, Spray and Wait algorithm, PRoPHET algorithm and APRA. By comparing overhead of netword, rate of messages delivered and average dealy, it finds that the APRA performs better. At last, the weaknesses of this paper and further improvement are also discussed.

Download Full-text

PERFORMANCE EVALUATION OF MULTICAST WORMHOLE ROUTING IN 2D-TORUS MULTICOMPUTERS

Parallel Processing Letters ◽

10.1142/s0129626492000283 ◽

1992 ◽

Vol 02 (02n03) ◽

pp. 161-170

Author(s):

C. S. YANG ◽

Y. M. TSAI ◽

C. Y. LIU

Keyword(s):

Multicast Routing ◽

Routing Algorithm ◽

Wormhole Routing ◽

Multicast Communication ◽

Message Routing ◽

Routing Scheme ◽

Communication Traffic ◽

Multicast Routing Algorithm ◽

New Generation ◽

2D Torus

Most recently, multicast communication has been included in multicomputer systems. Multicast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. The performance of multicomputers is highly dependent on the message routing scheme and the communication mechanism. Wormhole routing is the most promising switching technique used in the new generation multicomputers. In this paper, we propose a multicast wormhole routing algorithm for 2D-torus multicomputers. The multicast routing algorithm is based on a path-like routing scheme and offers deadlock-free routing. Our simulation which compared the 2D-mesh multicomputers shows that the multipath routing algorithm for 2D-torus multicomputers can reduce the communication traffic and the maximum distance in multicast communication.

Download Full-text