Search Advanced

Message Board

Dear readers, authors and reviewers,you can add a message on this page. We will reply to you as soon as possible!

2018 Volume 43 Issue 10
Article Contents
Previous Article Next Article

CHEN Ke. A Routing Approach in Mobile Ad-Hoc Networks Considering the Social Relation[J]. Journal of Southwest China Normal University(Natural Science Edition), 2018, 43(10): 97-102. doi: 10.13718/j.cnki.xsxb.2018.10.017
Citation: CHEN Ke. A Routing Approach in Mobile Ad-Hoc Networks Considering the Social Relation[J]. Journal of Southwest China Normal University(Natural Science Edition), 2018, 43(10): 97-102. doi: 10.13718/j.cnki.xsxb.2018.10.017
shu

A Routing Approach in Mobile Ad-Hoc Networks Considering the Social Relation

  • Computer Department, Chengdu College of University of Electronic Science and Technology of China, Chengdu 610731, China

More Information
  • Received Date: 25/12/2017
  • The mobile ad-hoc network is a combination of mobile communication and computer network, in which users can move freely and randomly to maintain communication. The randomness of node mobility in such network brings difficulties to research of routing. On the other hand, the social relations between nodes in the mobile ad-hoc network have a direct impact on the routing process. This paper proposes a novel routing approach, in which the optimal path is calculated based on the predefined principle of most reliable path. The optimal path is represented through the adjacency possibility between the network nodes. Such adjacency possibility is calculated by the mobility of nodes and the social relationship strength with other node. Finally, the routing method proposed in this paper is compared with the traditional optimized link state routing (OLSR) through a simulation experiment. The results show that the proposed method has a better performance.
  • 加载中
  • [1] 王海涛,宋丽华,李建州,等.基于网络分簇和信息摆渡的无线自组应急通信网服务增强方案[J].电信科学,2012,28(4):38-43.

    Google Scholar

    [2] 朱金奇,马春梅,刘明,等.车载自组织网络中基于停车骨干网络的数据传输[J].软件学报,2016,27(2):432-450.

    Google Scholar

    [3] SUBBAIAH K V,NAIDU M M.Cluster Head Election for CGSR Routing Protocol Using Fuzzy Logic Controller for Mobile Ad Hoc Network[J].International Journal of Advanced Networking and Applications,2010,1(4):246-251.

    Google Scholar

    [4] EASLEY D,KLEINBERG J.Networks,Crowds,and Markets:Reasoning about a Highly Connected World[J].KOVALCHIK S.Networks,Crowds,and Markets:Reasoning about a Highly Connected World.Significance,2012(8):43-44.

    Google Scholar

    [5] TSAI T C,ChAN H H,HAN C C,et al.A Social Behavior Based Interest-Message Dissemination Approach in Delay Tolerant Networks[C]//Future Network Systems and Security Second International Conference.Paris,France:FNSS,2016:62-80.

    Google Scholar

    [6] ZHANG L,CAI Z,LU J,et al.Mobility-Aware Routing in Delay Tolerant Networks[J].Personal and Ubiquitous Computing,2015,19(7):1111-1123.

    Google Scholar

    [7] XIA H,JIA Z,LI X,et al.Trust Prediction and Trust-Based Source Routing in Mobile Ad Hoc Networks[J].Ad Hoc Networks,2013,11(7):2096-2114.

    Google Scholar

    [8] YANG Z F,LI G Q,FU G Q,et al.A Routing Algorithm via Constructing the Weighted Minimum Connected Dominating Set in Mobile Adhoc Network[C]//The 7th International Conference on Computer Engineering and Networks.Shanghai,China:CENet,2017:30.

    Google Scholar

    [9] 李献礼.在线社会网络多维度链式信任计算算法[J].西南大学学报(自然科学版),2016,38(8):142-147.

    Google Scholar

    [10] LU Y,LI X,YU Y T,et al.Information-Centric Delay-Tolerant Mobile Ad-Hoc Networks[C]//The Workshop on INFOCOM.Toronto,Canada:IEEE,2014:428-433.

    Google Scholar

    [11] 李栋,徐志明,李生,等.在线社会网络中信息扩散[J].计算机学报,2014,37(1):189-206.

    Google Scholar

    [12] 林洋,李燕,董玮,等.复杂网络社区的抽样概率分布估计检测算法[J].西南师范大学学报(自然科学版),2016,41(10):96-103.

    Google Scholar

    [13] YI J Z,ADNANE A,DAVID S,et al.Multipath Optimized Link State Routing for Mobile Ad Hoc Networks[J].Ad Hoc Networks,2011,9(1):28-47.

    Google Scholar

  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索
Export Citation
PDF
XML

Article Metrics

Article views(786) PDF downloads(115) Cited by(0)

Access History

Other Articles By Authors

A Routing Approach in Mobile Ad-Hoc Networks Considering the Social Relation

  • Received Date: 25/12/2017

Abstract: The mobile ad-hoc network is a combination of mobile communication and computer network, in which users can move freely and randomly to maintain communication. The randomness of node mobility in such network brings difficulties to research of routing. On the other hand, the social relations between nodes in the mobile ad-hoc network have a direct impact on the routing process. This paper proposes a novel routing approach, in which the optimal path is calculated based on the predefined principle of most reliable path. The optimal path is represented through the adjacency possibility between the network nodes. Such adjacency possibility is calculated by the mobility of nodes and the social relationship strength with other node. Finally, the routing method proposed in this paper is compared with the traditional optimized link state routing (OLSR) through a simulation experiment. The results show that the proposed method has a better performance.

    HTML

Reference (13)

Catalog

    Copyright Journal of Southwest China Normal University(Natural Science Edition)

    Address： Tel：023-68252540，68254576，68254478 E-mail：xbbjb@swu.edu.cn

    Supported by:Beijing Renhe Information Technology Co. Ltd

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return