- Email: [email protected]
A Message Matching Routing Algorithm Based on Node Sociality in Opportunistic Networks
Available online at www.sciencedirect.com Available online at www.sciencedirect.com
Available online at www.sciencedirect.com
ScienceDirect
Procedia Computer Science 00 (2018) 000–000 Procedia Computer Science (2018) 000–000 Procedia Computer Science 12900 (2018) 175–177
www.elsevier.com/locate/procedia www.elsevier.com/locate/procedia
2017 International Conference on Identification, Information and Knowledge in the Internet of 2017 International Conference on Identification, Information and Knowledge in the Internet of Things Things
A A Message Message Matching Matching Routing Routing Algorithm Algorithm Based Based on on Node Node Sociality Sociality in Opportunistic Networks in Opportunistic Networks b,∗ Nan Zhaoaa , Feng Zenga,∗ a,∗, Wenjia Lib,∗ Nan Zhao , Feng Zeng , Wenjia Li a
School of Software, Central South University, Changsha, China
a School of Software, Central South University, Changsha, China b Department of Computer Science New York Institute of Technology, New York, b Department of Computer Science New York Institute of Technology, New York,
USA USA
Abstract Abstract Inspired by the importance of grouping in the communication networks such as Facebook, Twitter, Wechat, we choose appropriate Inspired by channels the importance of grouping communication networks Facebook, Twitter, Wechat, we choose appropriate forwarding for different types in ofthe messages in order to improvesuch the as rate of message success forwarding, while reducing forwarding channels for different types of messages in order to improve the rate of message success forwarding, while network overhead and addressing the problem of network congestion. In this paper, we put forward the concept of circle ofreducing friends network overheadclassification and addressing the problem network In this we put forward thetoconcept circle ofoffriends and an effective method to assignofthe circle congestion. of friends that the paper, node belongs according social of attributes node. and an effective classification method to(MMAR) assign theis circle of friends the node belongs to social of node. A message matching routing algorithm designed to helpthat messages forward, in according which nodes select attributes the corresponding A message matching (MMAR) designed to help show messages in which nodes select the corresponding circle of friends basedrouting on the algorithm type of message. Theissimulation results that forward, the proposed routing algorithm based on sociality circle of friends based on therouting type ofalgorithms message. The simulationrate, results show the proposed is superior to other classical in forwarding delay andthat routing overhead.routing algorithm based on sociality is superior to other classical routing algorithms in forwarding rate, delay and routing overhead. c 2018 Copyright 2018 Elsevier Elsevier Ltd. Ltd. All All rights rights reserved. reserved. Copyright © c 2018 Copyright Elsevierunder Ltd. All rights reserved. Selection and and peer-review Selection peer-review under responsibility responsibility of of the the scientific scientific committee committee of of the the 2017 2017 International International Conference Conference on on Identification, Identification, Selection andand peer-review under responsibility of the (IIKI2017). scientific committee of the 2017 International Conference on Identification, Information Knowledge in the Internet of Things (IIKI2017). Information and Knowledge in the Internet of Things (IIKI2017). Keywords: social attributes, circle of friends, routing algorithms; Keywords: social attributes, circle of friends, routing algorithms;
1. Introduction 1. Introduction The appearance of new wireless technologies has revolutionized the way people communicate and share their The appearance of opportunistic new wirelessnetworks technologies has revolutionized thecan way peopleinformation communicate share content. In particular, (Oppnets) in which nodes forward onlyand when theytheir are content. In particular, opportunistic networks (Oppnets) in which nodes can forward information only when they are in a determined communication range of each other have opened a new and exciting avenue for communication in in determined communication range In of an each other have opened new and exciting avenue for in theaemerging mobile ad hoc network. Oppnet, the nodes areaoften mobile, the contacts are communication intermittent. That the emerging mobile ad hoc network. In an Oppnet, the nodes are often mobile, the contacts are intermittent. That means, there are no complete end-to-end paths from the source to destination. The new working mechanism for routing means, are no complete end-to-end paths from the source to known destination. Theprotocols new working mechanism routing messagethere in Oppnets is ”Store-Carry-Forward” [1]. Thus, most of routing for MANETs failfor to operate message in Oppnets is ”Store-Carry-Forward” [1]. Thus, most of known routing protocols for MANETs fail to operate in Oppnets. It is necessary to design the routing algorithms which are suitable for the Oppnets. in Oppnets. It is necessary to design the routing algorithms suitable for the Oppnets. We put forward the concept of circle of friends, peoplewhich own are circle of friends and have a close social relations We put forward the concept of circle of friends, people own circle of friends and haverelationship, a close social with the members of this circle, social relation is measured by both implicit and explicit butrelations there is with the members of this circle, social relation is measured by both implicit and explicit relationship, but there is ∗ ∗
Corresponding author. Corresponding E-mail address:author. [email protected]; [email protected] E-mail address: [email protected]; [email protected] c 2018 Elsevier Ltd. All rights reserved. 1877-0509 Copyright c 2018 1877-0509and Copyright Elsevier Ltd. Allof rights scientific reserved. committee of the 2017 International Conference on Identification, Information and Selection peer-review under responsibility 1877-0509 Copyright © 2018 Elsevier Ltd. Allthe rights reserved. Selection and responsibility of the scientific committee of the 2017 International Conference on Identification, Information and Knowledge in peer-review the Internet under of Things (IIKI2017). Selection and peer-review under responsibility of the scientific committee of the 2017 International Conference on Identification, Information Knowledge in theinInternet of Things (IIKI2017). and Knowledge the Internet of Things (IIKI2017). 10.1016/j.procs.2018.03.068
176 2
Nan Zhao et al. / Procedia Computer Science 129 (2018) 175–177 Author name / Procedia Computer Science 00 (2018) 000–000
no classification of friends circles. Like sending messages on online social software(e.g. Facebook, Wechat), when we cannot send work message directly to a work partner, we usually only send the message to the workgroup which contains the destination node, rather than sending it towards a group of relative. Based on this situation, we design a classification and matching routing algorithm based on social relations. Each person comes with a set of specific social attributes, e.g. work and education, living location and relative, hobby of interests. According to these social profiles, everyone maintains a series of different circles of friends. At the same time, each message to be sent has a specific attribute. 2. Proposed Scheme In this section, we will discuss the proposed scheme in detail. Everyone comes with a personal social profile which includes a series of social attributes (e.g.name, sex, work, education, nationality, hobby,..., etc.). It is generally true that users with similarity of social profiles tend to cluster into a circle of friend. In real life, because of different categories of social relationship, we often have a number of different circles of friends.(e.g. work circle, hobby circle, relatives circle and classmates circle,...,etc. ). As with sending messages in social software, if the message is no way to directly transfer to the destination node, we usually forward message to the corresponding group according to the type of message, we propose a message matching routing algorithm (MMRA) to solve the message forwarding in this paper. 2.1. Circle of Friends classification As mentioned above, we usually gather people who have frequent contacts and specific social relationship with ourselves into circle of friends. It is can’t negligible that circles of friends have different categories due to social attributes. To follow this idea, we can define social profiles for the classification of circle of friends purpose so as to identify better forward ways to transfer data packets. In order to quantify the social profiles of node for analysis, let Ai be a finite of social meta information contained in node i. Then, Ai can be denoted as formula 1. It is supposed that each node has a social profiles table, which stores the node’s social attributes, for example, identification number, name, sex, work, hobby, relative, school and many more. (1) Ai = a1i , a2i , ..., ali , ..., am i , i ∈ [1, N]
Where ali is l-th attribute of the node i, there are m attributes in the social profile of each node. N is the total number of nodes in the network. In our scheme, for simulation purposes, we assume that each node has five types of circle of friends, such as strangers circle, work circle, classmates circle, hobby circle, relative circle. Each attribute corresponds to a type of circle of friends except stranger circle, so here m = 4, and each social attribute has a value. For node i, there will be five tables for storing nodes in the corresponding circle of friends, such as S C i , WC i , CC i , HC i ,RC i ,and an encounter information table ET i which includes encounter node’s ID and encounter frequency,a circles of friends information table FT i contains friend nodes’ ID and the type of friends circle that friend nodes belong to, the purpose is to quickly identify the type of friends circles where the encounter nodes are located and improve the message forwarding efficiency. Initially, all of these tables are empty. When node i encounter node j, node i check the record of node j in encounter information table ET i , if contact times between node i and node j not exceeds a given threshold ω , node j will be joined into strangers circle S C i , which shows that the social relationship between the two nodes is weak and should not be added to circle of friends of each other. Otherwise, node i will have a view of j’s social profiles table A j and contrast the social attributes value of the two nodes in turn. At last, node i join j to the appropriate circle of friends based on the social attributes, node j also do so.At the same time, recording the ID of new friends and the type of friends circles joined in their respective circles of friends information table. Through this process, each node has a set of different type of circles of friends, as show in Fig1 . 2.2. Messages classification Similar with the above, we also categorize messages and the type of message corresponds to the type of circle of friends, we suppose the message can be roughly divided into the following categories. Work messages about work
Author name / Procedia Computer Science 00 (2018) 000–000
Nan Zhao et al. / Procedia Computer Science 129 (2018) 175–177
3
177
Fig. 1. The Friends of circles of Nodes.
contents which will send to work partner, some news about interest, messages want to send to relatives, messages need send to classmates, some news have no clear purpose. Each message has a category label, when the message is generated, the message class is assigned. 2.3. Message matching algorithm In real life, we will select the appropriate channel based on the type of messages when we send the messages. For instance, there is such a phenomenon in the real world: Node A cannt send a job message directly to destination node B. Obviously, A will send job message to its workgroups that contain work partners, not its group of relatives. It is efficiency for different types of messages to forward through the corresponding groups. If the message is forwarded to all groups, it will undoubtedly increase the network load, increase the resources occupied by the message, inhibit more messages forwarding. In the above section, we present the concept of a circle of friends and group the circle of friends, while marking the type of message. In order to improve the efficiency of message forwarding, we propose a message matching routing algorithm(MMRA). In this scheme, when two nodes encounter each other, they update their encounter table ET and encounter information which includes node ID and encounter times between the two nodes. When contacts times of two nodes exceeds the given threshold, it is proved that the two nodes have certain social relations. At the same time, they get each other’s social profiles. Based on their own social attributes to determine the type of circle of friends they need to join. Through the above process, each node in the network has a series of different types of friends circles. It is supposed that source node s encounters node e, and node s has messages to forward. If there are messages which the destination is node e in the message queue of node s, then those messages are forwarded to node e and the copies of delivered messages are deleted. If the node e is not the destination node of messages stored in the node s, the following procedure is executed for all messages in the node s message queue. First, the privacy of the message is obtained, and the appropriate forwarding mode is selected according to the privacy degree of the message and the type of the message. Conclusions In this paper, we are committed to improving the data transfer rate and design a reasonable algorithm to address network congestion and reduce network load. We put forward an effective classification method for circles of friends in mobile opportunistic networks, and propose a message matching forwarding routing scheme. In our scheme, each message has labels that are used to mark the type. A message matching routing algorithm (MMAR) is designed to help message forward, in which node selects the corresponding forwarding method according to the type of message. Simulations have been done, and the results show that the proposed solution outperforms the other two classic routing algorithms, and also show the effectiveness of the proposed message matching forwarding routing scheme. References [1] FLilien, Leszek and Kamal, Zille Huma and Bhuse, Vijay and Gupta, Ajay. (2006) “Opportunistic networks: the concept and research challenges in privacy and security.”.
Available online at www.sciencedirect.com
ScienceDirect
Procedia Computer Science 00 (2018) 000–000 Procedia Computer Science (2018) 000–000 Procedia Computer Science 12900 (2018) 175–177
www.elsevier.com/locate/procedia www.elsevier.com/locate/procedia
2017 International Conference on Identification, Information and Knowledge in the Internet of 2017 International Conference on Identification, Information and Knowledge in the Internet of Things Things
A A Message Message Matching Matching Routing Routing Algorithm Algorithm Based Based on on Node Node Sociality Sociality in Opportunistic Networks in Opportunistic Networks b,∗ Nan Zhaoaa , Feng Zenga,∗ a,∗, Wenjia Lib,∗ Nan Zhao , Feng Zeng , Wenjia Li a
School of Software, Central South University, Changsha, China
a School of Software, Central South University, Changsha, China b Department of Computer Science New York Institute of Technology, New York, b Department of Computer Science New York Institute of Technology, New York,
USA USA
Abstract Abstract Inspired by the importance of grouping in the communication networks such as Facebook, Twitter, Wechat, we choose appropriate Inspired by channels the importance of grouping communication networks Facebook, Twitter, Wechat, we choose appropriate forwarding for different types in ofthe messages in order to improvesuch the as rate of message success forwarding, while reducing forwarding channels for different types of messages in order to improve the rate of message success forwarding, while network overhead and addressing the problem of network congestion. In this paper, we put forward the concept of circle ofreducing friends network overheadclassification and addressing the problem network In this we put forward thetoconcept circle ofoffriends and an effective method to assignofthe circle congestion. of friends that the paper, node belongs according social of attributes node. and an effective classification method to(MMAR) assign theis circle of friends the node belongs to social of node. A message matching routing algorithm designed to helpthat messages forward, in according which nodes select attributes the corresponding A message matching (MMAR) designed to help show messages in which nodes select the corresponding circle of friends basedrouting on the algorithm type of message. Theissimulation results that forward, the proposed routing algorithm based on sociality circle of friends based on therouting type ofalgorithms message. The simulationrate, results show the proposed is superior to other classical in forwarding delay andthat routing overhead.routing algorithm based on sociality is superior to other classical routing algorithms in forwarding rate, delay and routing overhead. c 2018 Copyright 2018 Elsevier Elsevier Ltd. Ltd. All All rights rights reserved. reserved. Copyright © c 2018 Copyright Elsevierunder Ltd. All rights reserved. Selection and and peer-review Selection peer-review under responsibility responsibility of of the the scientific scientific committee committee of of the the 2017 2017 International International Conference Conference on on Identification, Identification, Selection andand peer-review under responsibility of the (IIKI2017). scientific committee of the 2017 International Conference on Identification, Information Knowledge in the Internet of Things (IIKI2017). Information and Knowledge in the Internet of Things (IIKI2017). Keywords: social attributes, circle of friends, routing algorithms; Keywords: social attributes, circle of friends, routing algorithms;
1. Introduction 1. Introduction The appearance of new wireless technologies has revolutionized the way people communicate and share their The appearance of opportunistic new wirelessnetworks technologies has revolutionized thecan way peopleinformation communicate share content. In particular, (Oppnets) in which nodes forward onlyand when theytheir are content. In particular, opportunistic networks (Oppnets) in which nodes can forward information only when they are in a determined communication range of each other have opened a new and exciting avenue for communication in in determined communication range In of an each other have opened new and exciting avenue for in theaemerging mobile ad hoc network. Oppnet, the nodes areaoften mobile, the contacts are communication intermittent. That the emerging mobile ad hoc network. In an Oppnet, the nodes are often mobile, the contacts are intermittent. That means, there are no complete end-to-end paths from the source to destination. The new working mechanism for routing means, are no complete end-to-end paths from the source to known destination. Theprotocols new working mechanism routing messagethere in Oppnets is ”Store-Carry-Forward” [1]. Thus, most of routing for MANETs failfor to operate message in Oppnets is ”Store-Carry-Forward” [1]. Thus, most of known routing protocols for MANETs fail to operate in Oppnets. It is necessary to design the routing algorithms which are suitable for the Oppnets. in Oppnets. It is necessary to design the routing algorithms suitable for the Oppnets. We put forward the concept of circle of friends, peoplewhich own are circle of friends and have a close social relations We put forward the concept of circle of friends, people own circle of friends and haverelationship, a close social with the members of this circle, social relation is measured by both implicit and explicit butrelations there is with the members of this circle, social relation is measured by both implicit and explicit relationship, but there is ∗ ∗
Corresponding author. Corresponding E-mail address:author. [email protected]; [email protected] E-mail address: [email protected]; [email protected] c 2018 Elsevier Ltd. All rights reserved. 1877-0509 Copyright c 2018 1877-0509and Copyright Elsevier Ltd. Allof rights scientific reserved. committee of the 2017 International Conference on Identification, Information and Selection peer-review under responsibility 1877-0509 Copyright © 2018 Elsevier Ltd. Allthe rights reserved. Selection and responsibility of the scientific committee of the 2017 International Conference on Identification, Information and Knowledge in peer-review the Internet under of Things (IIKI2017). Selection and peer-review under responsibility of the scientific committee of the 2017 International Conference on Identification, Information Knowledge in theinInternet of Things (IIKI2017). and Knowledge the Internet of Things (IIKI2017). 10.1016/j.procs.2018.03.068
176 2
Nan Zhao et al. / Procedia Computer Science 129 (2018) 175–177 Author name / Procedia Computer Science 00 (2018) 000–000
no classification of friends circles. Like sending messages on online social software(e.g. Facebook, Wechat), when we cannot send work message directly to a work partner, we usually only send the message to the workgroup which contains the destination node, rather than sending it towards a group of relative. Based on this situation, we design a classification and matching routing algorithm based on social relations. Each person comes with a set of specific social attributes, e.g. work and education, living location and relative, hobby of interests. According to these social profiles, everyone maintains a series of different circles of friends. At the same time, each message to be sent has a specific attribute. 2. Proposed Scheme In this section, we will discuss the proposed scheme in detail. Everyone comes with a personal social profile which includes a series of social attributes (e.g.name, sex, work, education, nationality, hobby,..., etc.). It is generally true that users with similarity of social profiles tend to cluster into a circle of friend. In real life, because of different categories of social relationship, we often have a number of different circles of friends.(e.g. work circle, hobby circle, relatives circle and classmates circle,...,etc. ). As with sending messages in social software, if the message is no way to directly transfer to the destination node, we usually forward message to the corresponding group according to the type of message, we propose a message matching routing algorithm (MMRA) to solve the message forwarding in this paper. 2.1. Circle of Friends classification As mentioned above, we usually gather people who have frequent contacts and specific social relationship with ourselves into circle of friends. It is can’t negligible that circles of friends have different categories due to social attributes. To follow this idea, we can define social profiles for the classification of circle of friends purpose so as to identify better forward ways to transfer data packets. In order to quantify the social profiles of node for analysis, let Ai be a finite of social meta information contained in node i. Then, Ai can be denoted as formula 1. It is supposed that each node has a social profiles table, which stores the node’s social attributes, for example, identification number, name, sex, work, hobby, relative, school and many more. (1) Ai = a1i , a2i , ..., ali , ..., am i , i ∈ [1, N]
Where ali is l-th attribute of the node i, there are m attributes in the social profile of each node. N is the total number of nodes in the network. In our scheme, for simulation purposes, we assume that each node has five types of circle of friends, such as strangers circle, work circle, classmates circle, hobby circle, relative circle. Each attribute corresponds to a type of circle of friends except stranger circle, so here m = 4, and each social attribute has a value. For node i, there will be five tables for storing nodes in the corresponding circle of friends, such as S C i , WC i , CC i , HC i ,RC i ,and an encounter information table ET i which includes encounter node’s ID and encounter frequency,a circles of friends information table FT i contains friend nodes’ ID and the type of friends circle that friend nodes belong to, the purpose is to quickly identify the type of friends circles where the encounter nodes are located and improve the message forwarding efficiency. Initially, all of these tables are empty. When node i encounter node j, node i check the record of node j in encounter information table ET i , if contact times between node i and node j not exceeds a given threshold ω , node j will be joined into strangers circle S C i , which shows that the social relationship between the two nodes is weak and should not be added to circle of friends of each other. Otherwise, node i will have a view of j’s social profiles table A j and contrast the social attributes value of the two nodes in turn. At last, node i join j to the appropriate circle of friends based on the social attributes, node j also do so.At the same time, recording the ID of new friends and the type of friends circles joined in their respective circles of friends information table. Through this process, each node has a set of different type of circles of friends, as show in Fig1 . 2.2. Messages classification Similar with the above, we also categorize messages and the type of message corresponds to the type of circle of friends, we suppose the message can be roughly divided into the following categories. Work messages about work
Author name / Procedia Computer Science 00 (2018) 000–000
Nan Zhao et al. / Procedia Computer Science 129 (2018) 175–177
3
177
Fig. 1. The Friends of circles of Nodes.
contents which will send to work partner, some news about interest, messages want to send to relatives, messages need send to classmates, some news have no clear purpose. Each message has a category label, when the message is generated, the message class is assigned. 2.3. Message matching algorithm In real life, we will select the appropriate channel based on the type of messages when we send the messages. For instance, there is such a phenomenon in the real world: Node A cannt send a job message directly to destination node B. Obviously, A will send job message to its workgroups that contain work partners, not its group of relatives. It is efficiency for different types of messages to forward through the corresponding groups. If the message is forwarded to all groups, it will undoubtedly increase the network load, increase the resources occupied by the message, inhibit more messages forwarding. In the above section, we present the concept of a circle of friends and group the circle of friends, while marking the type of message. In order to improve the efficiency of message forwarding, we propose a message matching routing algorithm(MMRA). In this scheme, when two nodes encounter each other, they update their encounter table ET and encounter information which includes node ID and encounter times between the two nodes. When contacts times of two nodes exceeds the given threshold, it is proved that the two nodes have certain social relations. At the same time, they get each other’s social profiles. Based on their own social attributes to determine the type of circle of friends they need to join. Through the above process, each node in the network has a series of different types of friends circles. It is supposed that source node s encounters node e, and node s has messages to forward. If there are messages which the destination is node e in the message queue of node s, then those messages are forwarded to node e and the copies of delivered messages are deleted. If the node e is not the destination node of messages stored in the node s, the following procedure is executed for all messages in the node s message queue. First, the privacy of the message is obtained, and the appropriate forwarding mode is selected according to the privacy degree of the message and the type of the message. Conclusions In this paper, we are committed to improving the data transfer rate and design a reasonable algorithm to address network congestion and reduce network load. We put forward an effective classification method for circles of friends in mobile opportunistic networks, and propose a message matching forwarding routing scheme. In our scheme, each message has labels that are used to mark the type. A message matching routing algorithm (MMAR) is designed to help message forward, in which node selects the corresponding forwarding method according to the type of message. Simulations have been done, and the results show that the proposed solution outperforms the other two classic routing algorithms, and also show the effectiveness of the proposed message matching forwarding routing scheme. References [1] FLilien, Leszek and Kamal, Zille Huma and Bhuse, Vijay and Gupta, Ajay. (2006) “Opportunistic networks: the concept and research challenges in privacy and security.”.