移动自组织网络中社会关系感知的路由方法

陈轲

doi:10.13718/j.cnki.xsxb.2018.10.017

西南师范大学学报(自然科学版)

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
	姓名不能为空！
邮箱
	邮箱不能为空！非法的邮箱地址。
手机号码
	电话不能为空！请输入有效手机号!
标题
	标题不能为空！
留言内容
	内容不能为空！
验证码
	验证码不能为空！验证码错误！

移动自组织网络中社会关系感知的路由方法

陈轲. 移动自组织网络中社会关系感知的路由方法[J]. 西南师范大学学报(自然科学版), 2018, 43(10): 97-102. doi: 10.13718/j.cnki.xsxb.2018.10.017

引用本文:

陈轲. 移动自组织网络中社会关系感知的路由方法[J]. 西南师范大学学报(自然科学版), 2018, 43(10): 97-102. doi: 10.13718/j.cnki.xsxb.2018.10.017

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

移动自组织网络中社会关系感知的路由方法

陈轲

电子科技大学成都学院计算机系, 成都 610731

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

CHEN Ke

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

摘要: 移动自组织网络是一种移动通信和计算机网络相结合的网络，用户节点可以在网络内随意移动并且保持通信，因此移动自组织网络中节点移动的随意性给研究网络中的路由带来了困难；另一方面，移动自组织网络中节点之间的社会关系对路由过程有直接影响.本文采用最可靠路径的原则来计算移动自组织网络中的最优路径进行路由，该方法通过网络节点之间的邻接可能性来表示最优路径，通过节点的移动方案和与其他节点之间的社会关系强度对邻接可能性进行计算.最后，通过仿真实验，将本文提出的路由方法与常用的最优链路状态路由协议OLSR（Optimized Link State Routing）进行比较分析，结果显示本文提出的方法具有较好的性能.
- 移动自组织网络 /
- 社会关系 /
- 移动方案 /
- 路由方法
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.
- mobile ad-hoc networks /
- social relation /
- mobility plan /
- routing approach .

[1]	王海涛,宋丽华,李建州,等.基于网络分簇和信息摆渡的无线自组应急通信网服务增强方案[J].电信科学,2012,28(4):38-43.
[2]	朱金奇,马春梅,刘明,等.车载自组织网络中基于停车骨干网络的数据传输[J].软件学报,2016,27(2):432-450.
[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.
[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.
[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.
[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.
[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.
[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.
[9]	李献礼.在线社会网络多维度链式信任计算算法[J].西南大学学报(自然科学版),2016,38(8):142-147.
[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.
[11]	李栋,徐志明,李生,等.在线社会网络中信息扩散[J].计算机学报,2014,37(1):189-206.
[12]	林洋,李燕,董玮,等.复杂网络社区的抽样概率分布估计检测算法[J].西南师范大学学报(自然科学版),2016,41(10):96-103.
[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.

计量

文章访问数: 572
HTML全文浏览数: 372
PDF下载数: 27
施引文献: 0

移动自组织网络中社会关系感知的路由方法

陈轲

电子科技大学成都学院计算机系, 成都 610731

收稿日期: 2017-12-25

关键词:

摘要: 移动自组织网络是一种移动通信和计算机网络相结合的网络，用户节点可以在网络内随意移动并且保持通信，因此移动自组织网络中节点移动的随意性给研究网络中的路由带来了困难；另一方面，移动自组织网络中节点之间的社会关系对路由过程有直接影响.本文采用最可靠路径的原则来计算移动自组织网络中的最优路径进行路由，该方法通过网络节点之间的邻接可能性来表示最优路径，通过节点的移动方案和与其他节点之间的社会关系强度对邻接可能性进行计算.最后，通过仿真实验，将本文提出的路由方法与常用的最优链路状态路由协议OLSR（Optimized Link State Routing）进行比较分析，结果显示本文提出的方法具有较好的性能.

English Abstract

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

电子科技大学成都学院计算机系, 成都 610731

Received Date: 2017-12-25

Keywords:

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.