Diverse Path Routing with Interference and Reusability

Abstract Multipath routing has been extensively employed in wireless mesh networks (WMNs) for providing network reliability and survivability, therefore, improves energy consumptions. To provide network survivability, each user should be protected against failures, either node or link failures. For each request, a primary path is set up for normal transmission, and an alternate path (protection path) should also be provided to protect the request in case of network failure. In this paper, we study how to provide survivability using multi-path scheme for dynamic network traffic, where users' requests have random arrival times. Compared with previous work, our scheme considers interference and reusability factors when providing multiple paths for each request. By applying our scheme, the numerical results show that we can accommodate about 17% more requests than previous schemes. Meanwhile, the results show that our scheme not only accommodates more requests, but also takes less running time to find a solution for each request

PPLS: a privacy-preserving location-sharing scheme in mobile online social networks

The recent proliferation of mobile devices has given rise to mobile online social networks (mOSNs), an emerging network paradigm that uses social networks as its main design element. As one of the most critical components in mOSNs, location sharing plays an important role in helping users share information and strengthen their social bonds, which however may compromise users’ privacy, including location information and social relationship details. To address these challenges, some solutions have been proposed. However, none of them considers the privacy of inter-user threshold distance, which effectively can be used to identify users, their friends, and location information, by malicious or undesired elements of the system. To overcome this limitation, we propose a secure distance comparison protocol. Furthermore, we present a privacy-preserving location-sharing scheme (PPLS), which allows users to build more complex access control policies. The safety of our scheme is validated by the security analysis and the experimental results demonstrate the efficiency of PPLS scheme.This work was supported by National Natural Science Foundation of China (Grant Nos. 61972037, 61402037, U1836212, 61872041) and Graduate Technological Innovation Project of Beijing Institute of Technology (Grant No. 2019CX10014)