For Libraries For Publication Open Access Downloads About Us Contact Us
Paper Titles
Research on P2P Network Resource Search Method
p.206
Robustness of Autocatalytic Set in a Model of Evolving Network
p.212
Routing Methods and Scheduling Patterns in MIMO WMN Virtual Model
p.216
Research on MANET-Based Reliable Zone Routing Protocol
p.222
Research on Improved Floyd Routing Algorithm in Opportunistic Networks
p.227
Research and Realization of Custom Form Realization Method Based on HTML and XML Technology
p.231
Research of Improved Network Access Authorization Mechanism Based on Elliptic Curve
p.236
Friend-Based Prediction Routing Protocol in Socially-Aware Opportunistic Networks
p.241
Identifying High-Distributed Low-Rate QoS Violation Based on Multi-Stream Fused HMM
p.245

Research on Improved Floyd Routing Algorithm in Opportunistic Networks

Article Preview

Abstract:

According to the traditional shortest path algorithm is not suitable for the routing choice in community model of Opportunistic Networks, we propose an improved Floyd shortest path algorithm. This improved algorithm not only considers the space factor between the nodes in opportunistic networks, but also takes into account the time factor of the wireless links.The simulation results show that, compared with the existing FC(First Contact), DD(Direct Delivery) routing algorithm, this improved algorithm can more effectively get the shortest delay paths in opportunistic networks.

You might also be interested in these eBooks
Computer and Information Technology View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 519-520)

Pages:

227-230

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.519-520.227

Citation:

Cite this paper

Online since:

February 2014

Authors:

Sui Lin*, Yuang Li, Pei Shan Chen

Keywords:

Community Model, Floyd, Opportunistic Network

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

References

[1] Yun Li, Xiaoyin Wang, Zhanjun Liu, Yahui Zhou: Journal of communication. 2003, 31(9) , P. 232-235.

Google Scholar

[2] Yuan Gao, Yintao Wang, Yufei Huang: Computer application. 2013, 33(4),P. 919.

Google Scholar

[3] YongPing Xiong, LiPing Sun, Jianwei Niu: Journal of software. 2009, 20(1),P. 125.

Google Scholar

[4] Peizhi Fei. In: Graph and network and its application , edited by Sichuan University press(2004),P. 194-199.

Google Scholar

[5] JONES E, WARD P: Submitted to ACM Computer Communication Review(2006).

Google Scholar

[6] JAIN S, FALL K, PATRA R: Routing in a delay tolerant network(2004).

Google Scholar

[7] JINDAL A, PSOUNIS K: Contention-ware analysis of routing schemes for mobile opportunistic networks(2007),P. 1-8.

DOI: 10.1145/1247694.1247696

Google Scholar

© 2025 Trans Tech Publications Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For open access content, terms of the Creative Commons licensing CC-BY are applied.
Scientific.Net is a registered trademark of Trans Tech Publications Ltd.