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
A Routing Approach in Mobile Ad-Hoc Networks Considering the Social Relation
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.
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.
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.
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.
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.
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.
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
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