The precision of the conventional user identification algorithm is not satisfactory because it ignores the role of user-generated data in identity matching. In this paper, we propose a frequent pattern mining-based cross-social network user identification algorithm that analyzes user-generated data in a personalized manner. We adopt the posterior probability-based information entropy weight allocation method that improves the precision rate and recall rate compared to the empirical weight allocation method. The extensive simulations are provided to demonstrate that the proposed algorithm can enhance the precision rate, recall rate, as well as the F-Measure (F1).INDEX TERMS User identification, frequent pattern, cross-social network, information entropy.
A novel, non‐coherent bit‐level detection scheme is proposed to compensate for the frequency offset efficiently in IEEE 802.15.4 binary phase shift keying (BPSK) receivers. In the proposed scheme, the frequency‐offset estimation process only requires comparison, division, and addition operations. The proposed scheme first creates a suitable estimation‐region division, thus the mathematical approximation tan−1(x) ≈ x is efficiently utilised to simplify the conventional optimal estimation. The frequency offset and signal‐to‐noise ratio conditions do not need a priori knowledge. Simulations demonstrate that the proposed scheme is as reliable as the conventional optimal algorithm, but with a significant reduction of complexity.
In this paper, we propose an adaptive single differential coherent detection (SDCD) scheme for the binary phase shift keying (BPSK) signals in IEEE 802.15.4 Wireless Sensor Networks (WSNs). In particular, the residual carrier frequency offset effect (CFOE) for differential detection is adaptively estimated, with only linear operation, according to the changing channel conditions. It was found that the carrier frequency offset (CFO) and chip signal-to-noise ratio (SNR) conditions do not need a priori knowledge. This partly benefits from that the combination of the trigonometric approximation sin−1(x)≈x and a useful assumption, namely, the asymptotic or high chip SNR, is considered for simplification of the full estimation scheme. Simulation results demonstrate that the proposed algorithm can achieve an accurate estimation and the detection performance can completely meet the requirement of the IEEE 802.15.4 standard, although with a little loss of reliability and robustness as compared with the conventional optimal single-symbol detector.
With the development of Unmanned Air Vehicle (UAV) communication, Flying Ad Hoc Network (FANET) has become a hot research area in recent years, which is widely used in civil and military fields due to its unique advantages. FANET is a special kind of networks which are composed of UAV nodes, and can be used to implement data transfer in certain unique scenarios. To achieve reliable and robust communication among UAVs, a routing algorithm is the key factor and should be designed elaborately. Because of its importance and usefulness, this topic has attracted many researchers, and various routing protocols have also been put forward to improve the quality of data transmission in FANETs. Thus, in this paper, we give a survey on the state-of-the-art of routing protocols proposed in recent years. First, an in-depth research of the routing in FANETs recently has been brought out by absolutely differentiating them based on their routing mechanism. Then, we give a comparative analysis of each protocol based on their characteristics and service quality indicators. Finally, we propose some unsolved problems and future research directions for FANET routing.
In recent years, with the emergence of UAVs(Unmanned Aerial Vehicles) in military and civil applications, the FANETs(Flying Ad-Hoc Networks) composed of multiple UAVs has attracted extensive attention from researchers. As a new type of airborne self-organizing network, the particularity in FANETs such as time-varying network topology and dynamic link makes it difficult to maintain continuous communication when performing tasks. Therefore, it is challenging to design a routing protocol for FANETs to guarantee the quality of data transmission and make communication more effective. In this paper, we propose a new opportunistic routing protocol based on trajectory prediction, named EORB-TP. To be specific, we first predict the position of nodes in three-dimensional space and solve the problem of uncertainty of node contact in opportunistic communication. Secondly, we define the node's trajectory metric value to measure the node's trajectory characteristics and effectively avoid the excessive consumption of edge nodes. In addition, when choosing relay nodes, an energy-saving data forwarding strategy is designed to deal with the limited energy resources and storage space of UAVs. Simulation results show that compared with the state-of-the-art protocols, our protocol can increase the delivery rate by approximately 40% at best and can reduce the delay by approximately 80%.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.