The emergence of wireless body area network (WBAN) technology has brought hope and dawn to solve the problems of population aging, various chronic diseases, and medical facility shortage. The increasing demand for real-time applications in such networks, stimulates many research activities. Designing such a scheme of critical events while preserving the energy efficiency is a challenging task, due to the dynamic of the network topology, severe constraints on the power supply, and the limited computation power. The design of routing protocols becomes an essential part of WBANs and plays an important role in the communication stacks and has a significant impact on the network performance. In this paper, we briefly introduce WBAN and focus on the analysis of the routing protocol, classify, and compare the advantages and disadvantages of various routing protocols. Lastly, we put forward some problems and suggestions, which provides ideas for the follow-up routing design.

Wireless body area networks will inevitably bring tremendous convenience to human society in future development, and also enable people to benefit from ubiquitous technological services. However, one of the reasons hindering development is the limited energy of the network nodes. Therefore, the energy consumption in the selection of the next hop must be minimized in multi-hop routing. To solve this problem, this paper proposes an energy efficient routing protocol for reliable data transmission in a wireless body area network. The protocol takes multiple parameters of the network node into account, such as residual energy, transmission efficiency, available bandwidth, and the number of hops to the sink. We construct the maximum benefit function to select the next hop node by normalizing the node parameters, and dynamically select the node with the largest function value as the next hop node. Based on the above work, the proposed method can achieve efficient multi-hop routing transmission of data and improve the reliability of network data transmission. Compared with the priority-based energy-efficient routing algorithm (PERA) and modified new-attempt routing protocol (NEW-ATTEMPT), the simulation results show that the proposed routing protocol uses the maximum benefit function to select the next hop node dynamically, which not only improves the reliability of data transmission, but also significantly improves the energy utilization efficiency of the node and prolongs the network lifetime.

Identifying offline entities corresponding to multiple virtual accounts of users across social networks is crucial for the development of related fields, such as user recommendation system, network security, and user behavior pattern analysis. The data generated by users on multiple social networks has similarities. Thus, the concept of symmetry can be used to analyze user-generated information for user identification. In this paper, we propose a friendship networks-based user identification across social networks algorithm (FNUI), which performs the similarity of multi-hop neighbor nodes of a user to characterize the information redundancy in the friend networks fully. Subsequently, a gradient descent algorithm is used to optimize the contribution of the user’s multi-hop nodes in the user identification process. Ultimately, user identification is achieved in conjunction with the Gale–Shapley matching algorithm. Experimental results show that compared with baselines, such as friend relationship-based user identification (FRUI) and friendship learning-based user identification (FBI): (1) The contribution of single-hop neighbor nodes in the user identification process is higher than other multi-hop neighbor nodes; (2) The redundancy of information contained in multi-hop neighbor nodes has a more significant impact on user identification; (3) The precision rate, recall rate, comprehensive evaluation index (F1), and area under curve (AUC) of user identification have been improved.

Identifying users across social media has practical applications in many research areas, such as user behavior prediction, commercial recommendation systems, and information retrieval. In this paper, we propose a multiple salient features-based user identification across social media (MSF-UI), which extracts and fuses the rich redundant features contained in user display name, network topology, and published content. According to the differences between users’ different features, a multi-module calculation method is used to obtain the similarity between various redundant features. Finally, the bidirectional stable marriage matching algorithm is used for user identification across social media. Experimental results show that: (1) Compared with single-attribute features, the multi-dimensional information generated by users is integrated to optimize the universality of user identification; (2) Compared with baseline methods such as ranking-based cross-matching (RCM) and random forest confirmation algorithm based on stable marriage matching (RFCA-SMM), this method can effectively improve precision rate, recall rate, and comprehensive evaluation index (F1).

The user and data scales of social networks are experiencing rapid expansion, leading to the emergence of diverse across-social network applications. Within this landscape, across-social network user identification has evolved into a popular and growing research area. Current approaches primarily rely on various user data to construct models that portray user profiles, aiming to create solutions for user identification. However, the integration of multi-category user data is constrained by the data sparsity, fragmentation, and asymmetry characteristics, resulting in a limitation to the accuracy of user identification. To this end, we propose OCTOPUS, which consists of three modules: (i) a spatio-temporal extraction module adopts forward and backward LSTM networks to enhance the capacity of characterize spatio-temporal sequences, followed by using an attention mechanism to output complete user spatio-temporal features; (ii) a temporal perception module extracts temporal features from fine-grained and coarse-grained levels; (iii) a spatial location module obtains the spatial distribution of users to output user trajectory pair characteristics from global space. We perform extensive verification on two large public datasets (i.e., Brightkite and Gowalla), and the results show that OCTOPUS is superior to the state-of-the-art methods in terms of accuracy/precision/recall rate, and comprehensive evaluation index (F1).