Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can mov...Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can move freely and organize themselves arbitrarily.Routing in these environments is difficult for the reason of the rapid changes of the social relationship graph's topology.Meanwhile,the social ties among nodes change overtime.Therefore,an efficient data forwarding mechanism should be considered over the temporal weighted relationship graph.In this paper,an Advanced routing Protocol based on Parameters Optimization in the Weighted mobile social network(APPOW) is proposed to improve the delivery success ratio and reduce the cost of exchanging information.APPOW combines the normalized relative weights of three local social metrics,i.e.,LinkRank,similarity and contact strength,to select the next relay node.The weights of the three metrics are derived by pair-wise learning algorithm.The result shows that APPOW outperforms the state-ofthe-art SimBet Routing in delivering message and significantly reduces the average hops.Additionally,the delivery performance of APPOW is close to Epidemic Routing but without message duplications.展开更多
Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performa...Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing algorithms.Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications.Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives.Devices carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data transmission.In this paper,we conduct a comparative survey on routing algorithms in OMSNs.We first analyze routing algorithms based on three social features.Since node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive mechanism.To assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation result.Finally,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.展开更多
The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and coopera...The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.展开更多
In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-...In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-based threshold signature which allows mobile nodes to jointly generate and distribute the secrets for social attributes in a totally self-organized way without the need of any centralized authority.New joining nodes can reconstruct their own social attribute signatures by getting enough partial signature services from encounter opportunities with the initial nodes.Mobile nodes need to testify whether the neighbors can provide valid attribute signatures for their routing advertisements in order to resist potential routing attacks.Simulation results show that:by implementing our security scheme,the network delivery probability of the social context-based routing protocol can be effectively improved when there are large numbers of compromised nodes in opportunistic networks.展开更多
The two-phase replication-based routing has great prospects for Delay Tolerant Mobile Sensor Network (DTMSN) with its advantage of high message delivery ratio, but the blind spraying and the low efficiency forwarding ...The two-phase replication-based routing has great prospects for Delay Tolerant Mobile Sensor Network (DTMSN) with its advantage of high message delivery ratio, but the blind spraying and the low efficiency forwarding algorithm directly influences the overall network performance. Considering the characteristic of the constrained energy and storage resources of sensors, we propose a novel two-phase multi-replica routing for DTMSN, called Energy-Aware Sociality-Based Spray and Search Routing (ESR), which implements the quota-style message replication mechanism by utilizing the energy and speed information of sensors. In addition, based on the difference of history encounters, a sociality metric is defined to improve the forwarding efficiency in search phase. Simulation experiments show that ESR can reduce the message delay and improve the resource utilization while maximizing the message delivery ratio compared with the exiting popular two-phase routing protocols.展开更多
The lack of continuous connectivity and a complete path from source to destination makes node communication quite difficult in Delay-Tolerant Networks(DTNs). Most studies focus on routing problems in idealized network...The lack of continuous connectivity and a complete path from source to destination makes node communication quite difficult in Delay-Tolerant Networks(DTNs). Most studies focus on routing problems in idealized network environments without considering social properties. Communication devices are carried by individuals in many DTNs; therefore, DTNs are unique social networks to some extent. To design efficient routing protocols for DTNs, it is important to analyze their social properties. In this paper, a more accurate and comprehensive metric for detecting the quality of the relationships between nodes is proposed, by considering the contact time, contact frequency, and contact regularity. An overlapping hierarchical community detection method is designed based on this new metric, and a tree structure is built. Furthermore, we exploit the overlapping community structure and the tree structure to provide message-forwarding paths from the source node to the destination node.The simulation results show that our Routing method based on Overlapping hierarchical Community Detection(ROCD) achieves better delivery rate than SimBet and Bubble Rap, the classic routing protocols, without affecting the average delay.展开更多
As an extension of wireless ad hoc and sensor networks, wireless mesh networks(WMNs) are employed as an emerging key solution for wireless broadband connectivity improvement. Due to the lack of physical security guara...As an extension of wireless ad hoc and sensor networks, wireless mesh networks(WMNs) are employed as an emerging key solution for wireless broadband connectivity improvement. Due to the lack of physical security guarantees, WMNs are susceptible to various kinds of attack. In this paper, we focus on node social selfish attack, which decreases network performance significantly. Since this type of attack is not obvious to detect, we propose a security routing scheme based on social network and reputation evaluation to solve this attack issue. First, we present a dynamic reputation model to evaluate a node's routing behavior, from which we can identify selfish attacks and selfish nodes. Furthermore, a social characteristic evaluation model is studied to evaluate the social relationship among nodes. Groups are built based on the similarity of node social status and we can get a secure routing based on these social groups of nodes. In addition, in our scheme, nodes are encouraged to enter into multiple groups and friend nodes are recommended to join into groups to reduce the possibility of isolated nodes. Simulation results demonstrate that our scheme is able to reflect node security status, and routings are chosen and adjusted according to security status timely and accurately so that the safety and reliability of routing are improved.展开更多
Most of our learning comes from other people or from our own experience. For instance, when a taxi driver is seeking passengers on an unknown road in a large city, what should the driver do？ Alternatives include crui...Most of our learning comes from other people or from our own experience. For instance, when a taxi driver is seeking passengers on an unknown road in a large city, what should the driver do？ Alternatives include cruising around the road or waiting for a time period at the roadside in the hopes of finding a passenger or just leaving for another road enroute to a destination he knows （e.g., hotel taxi rank）？ This is an interesting problem that arises everyday in cities all over the world. There could be different answers to the question poised above, but one fundamental problem is how the driver learns about the likelihood of finding passengers on a road that is new to him （as he has not picked up or dropped off passengers there before）. Our observation from large scale taxi driver trace data is that a driver not only learns from his own experience but through interactions with other drivers. In this paper, we first formally define this problem as socialized information learning （SIL）, second we propose a framework including a series of models to study how a taxi driver gathers and learns information in an uncertain environment through the use of his social network. Finally, the large scale real life data and empirical experiments confirm that our models are much more effective, efficient and scalable that prior work on this problem.展开更多
Mobile social sensing network is one kind of emerging networks in which sensing tasks are performed by mobile users and sensing data are shared and collected by leveraging the intermittent inter-contacts among mobile ...Mobile social sensing network is one kind of emerging networks in which sensing tasks are performed by mobile users and sensing data are shared and collected by leveraging the intermittent inter-contacts among mobile users. Traditional ad hoc routing protocols are inapplicable or perform poorly for data collection or data sharing in such mobile social networks because nodes are seldom fully connected. In recent years, many routing protocols （especially social-based routing） are proposed to improve the delivery ratio in mobile social networks, but most of them do not consider the load of nodes thus may lead to unbalanced energy consumption among nodes. In this paper, we propose a simple Energy Efficient framework for Social-based Routing （EE-SR） in mobile social sensing networks to balance the load of nodes while maintaining the delivery ratio within an acceptable range by limiting the chances of forwarding in traditional social-based routing. Furthermore, we also propose an improved version of EE-SR to dynamically adjust the controlling parameter. Simulation results on real-life mobile traces demonstrate the efficiency of our proposed framework.展开更多
基金supported by NSFC (Grant No. 61172074, 61471028, 61371069, and 61272505)Fundamental Research Funds for the Central Universities under Grant No. 2015JBM016+1 种基金the Research Fund for the Doctoral Program of Higher Education of China under Grant No.20130009110015the financial support from China Scholarship Council
文摘Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can move freely and organize themselves arbitrarily.Routing in these environments is difficult for the reason of the rapid changes of the social relationship graph's topology.Meanwhile,the social ties among nodes change overtime.Therefore,an efficient data forwarding mechanism should be considered over the temporal weighted relationship graph.In this paper,an Advanced routing Protocol based on Parameters Optimization in the Weighted mobile social network(APPOW) is proposed to improve the delivery success ratio and reduce the cost of exchanging information.APPOW combines the normalized relative weights of three local social metrics,i.e.,LinkRank,similarity and contact strength,to select the next relay node.The weights of the three metrics are derived by pair-wise learning algorithm.The result shows that APPOW outperforms the state-ofthe-art SimBet Routing in delivering message and significantly reduces the average hops.Additionally,the delivery performance of APPOW is close to Epidemic Routing but without message duplications.
基金This work was supported by National Natural Science Foundation of China(No.61672106)Natural Science Foundation of Beijing,China(L192023).
文摘Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing algorithms.Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications.Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives.Devices carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data transmission.In this paper,we conduct a comparative survey on routing algorithms in OMSNs.We first analyze routing algorithms based on three social features.Since node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive mechanism.To assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation result.Finally,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.
基金Projects(61202488, 61070199, 61103182) supported by the National Natural Science Foundation of China
文摘The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant networks (DTN). In particular, the existence of malicious node aggravates this contradiction. To resolve this contradiction, social relationship theory and group theory of social psychology were adopted to do an in-depth analysis. The concrete balancing approach which leveraged Nash equilibrium theory of game theory was proposed to resolve this contradiction in reality. Thus, a new congestion control routing algorithm for security defense based on social psychology and game theory (CRSG) was put forward. Through the experiment, this algorithm proves that it can enhance the message successful delivery ratio by more than 15% and reduce the congestion ratio over 15% as well. This algorithm balances the contradiction relationship between the two key performance targets and made all nodes exhibit strong cooperation relationship in DTN.
基金the Major national S&T program under Grant No. 2011ZX03005-002National Natural Science Foundation of China under Grant No. 60872041,61072066the Fundamental Research Funds for the Central Universities under Grant No. JY10000903001,JY10000901034
文摘In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-based threshold signature which allows mobile nodes to jointly generate and distribute the secrets for social attributes in a totally self-organized way without the need of any centralized authority.New joining nodes can reconstruct their own social attribute signatures by getting enough partial signature services from encounter opportunities with the initial nodes.Mobile nodes need to testify whether the neighbors can provide valid attribute signatures for their routing advertisements in order to resist potential routing attacks.Simulation results show that:by implementing our security scheme,the network delivery probability of the social context-based routing protocol can be effectively improved when there are large numbers of compromised nodes in opportunistic networks.
基金supported by National Natural Science Foundation of China under Grant No.60802016, 60972010 and No.61100217by China Fundamental Research Funds for the Central Universities under Grant No. 2011JBM002,2011YJS017
文摘The two-phase replication-based routing has great prospects for Delay Tolerant Mobile Sensor Network (DTMSN) with its advantage of high message delivery ratio, but the blind spraying and the low efficiency forwarding algorithm directly influences the overall network performance. Considering the characteristic of the constrained energy and storage resources of sensors, we propose a novel two-phase multi-replica routing for DTMSN, called Energy-Aware Sociality-Based Spray and Search Routing (ESR), which implements the quota-style message replication mechanism by utilizing the energy and speed information of sensors. In addition, based on the difference of history encounters, a sociality metric is defined to improve the forwarding efficiency in search phase. Simulation experiments show that ESR can reduce the message delay and improve the resource utilization while maximizing the message delivery ratio compared with the exiting popular two-phase routing protocols.
基金supported by the Youth Sci-Tech innovation leader and team project of Jilin Province of China (No. 20170519017JH)the National Science-Technology Support Project (No. 2014BAH02F02)the Graduate Innovation Fund of Jilin University (No. 2016031)
文摘The lack of continuous connectivity and a complete path from source to destination makes node communication quite difficult in Delay-Tolerant Networks(DTNs). Most studies focus on routing problems in idealized network environments without considering social properties. Communication devices are carried by individuals in many DTNs; therefore, DTNs are unique social networks to some extent. To design efficient routing protocols for DTNs, it is important to analyze their social properties. In this paper, a more accurate and comprehensive metric for detecting the quality of the relationships between nodes is proposed, by considering the contact time, contact frequency, and contact regularity. An overlapping hierarchical community detection method is designed based on this new metric, and a tree structure is built. Furthermore, we exploit the overlapping community structure and the tree structure to provide message-forwarding paths from the source node to the destination node.The simulation results show that our Routing method based on Overlapping hierarchical Community Detection(ROCD) achieves better delivery rate than SimBet and Bubble Rap, the classic routing protocols, without affecting the average delay.
基金supported in part by National Natural Science Foundation of China(Grant Nos.61302071,61471109,61502075)Fundamental Research Funds for the Central Universities(Grant Nos.N150404015,DUT15QY06,DUT15RC(3)009)+2 种基金China Postdoctoral Science Foundation Funded Project(Grant No.2015M580224)Liaoning Province Doctor Startup Fund(Grant No.201501166)State Key Laboratory for Novel Software Technology,Nanjing University(Grant No.KFKT2015B12)
文摘As an extension of wireless ad hoc and sensor networks, wireless mesh networks(WMNs) are employed as an emerging key solution for wireless broadband connectivity improvement. Due to the lack of physical security guarantees, WMNs are susceptible to various kinds of attack. In this paper, we focus on node social selfish attack, which decreases network performance significantly. Since this type of attack is not obvious to detect, we propose a security routing scheme based on social network and reputation evaluation to solve this attack issue. First, we present a dynamic reputation model to evaluate a node's routing behavior, from which we can identify selfish attacks and selfish nodes. Furthermore, a social characteristic evaluation model is studied to evaluate the social relationship among nodes. Groups are built based on the similarity of node social status and we can get a secure routing based on these social groups of nodes. In addition, in our scheme, nodes are encouraged to enter into multiple groups and friend nodes are recommended to join into groups to reduce the possibility of isolated nodes. Simulation results demonstrate that our scheme is able to reflect node security status, and routings are chosen and adjusted according to security status timely and accurately so that the safety and reliability of routing are improved.
基金This research was supported by the T-SET Univer- sity Transportation Center sponsored by the US Department of Transporta- tion （DTRT12-G-UTCll）, and Huawei Corporation （YBCB2009041-27）, and the Singapore National Research Foundation under its International Re- search Centre @ Singapore Funding Initiative and administered by the IDM Programme Office. This research was supported in part by the National Basic Research Program of China （973 Program） （2012CB316400）, in part by the National Natural Science Foundation of China （Grant No. 61303160）, and in part by China Postdoctoral Science Foundation （2013M530739）.
文摘Most of our learning comes from other people or from our own experience. For instance, when a taxi driver is seeking passengers on an unknown road in a large city, what should the driver do？ Alternatives include cruising around the road or waiting for a time period at the roadside in the hopes of finding a passenger or just leaving for another road enroute to a destination he knows （e.g., hotel taxi rank）？ This is an interesting problem that arises everyday in cities all over the world. There could be different answers to the question poised above, but one fundamental problem is how the driver learns about the likelihood of finding passengers on a road that is new to him （as he has not picked up or dropped off passengers there before）. Our observation from large scale taxi driver trace data is that a driver not only learns from his own experience but through interactions with other drivers. In this paper, we first formally define this problem as socialized information learning （SIL）, second we propose a framework including a series of models to study how a taxi driver gathers and learns information in an uncertain environment through the use of his social network. Finally, the large scale real life data and empirical experiments confirm that our models are much more effective, efficient and scalable that prior work on this problem.
基金supported by the National Natural Science Foundation of China (Nos. 61370192, 61432015, 61428203, and 61572347)the US National Science Foundation (Nos. CNS-1319915 and CNS-1343355)
文摘Mobile social sensing network is one kind of emerging networks in which sensing tasks are performed by mobile users and sensing data are shared and collected by leveraging the intermittent inter-contacts among mobile users. Traditional ad hoc routing protocols are inapplicable or perform poorly for data collection or data sharing in such mobile social networks because nodes are seldom fully connected. In recent years, many routing protocols （especially social-based routing） are proposed to improve the delivery ratio in mobile social networks, but most of them do not consider the load of nodes thus may lead to unbalanced energy consumption among nodes. In this paper, we propose a simple Energy Efficient framework for Social-based Routing （EE-SR） in mobile social sensing networks to balance the load of nodes while maintaining the delivery ratio within an acceptable range by limiting the chances of forwarding in traditional social-based routing. Furthermore, we also propose an improved version of EE-SR to dynamically adjust the controlling parameter. Simulation results on real-life mobile traces demonstrate the efficiency of our proposed framework.
