4 October 2017 in IEEE Access
In mobile ad hoc networks (MANETs), if mobile devices frequently leave or join the overlay of MANETs, the communication links between mobile devices or between mobile devices and cloud will lose or reestablish; for searching and routing the needed cloud services again, more energy will be consumed. 5G is the fifth generation mobile communication technology, and fog computing is defined as a distributed computing infrastructure that is able to handle billions of Internet-connected devices. Therefore, combining fog computing with 5G, we present a novel and effective dynamic cloudlet-assisted routing mechanism (DCRM) for MANETs to solve the energy-saving problem of link breakages. First, for every mobile device in MANETs, we build a temporary file to record its identity and route information in a certain time. Moreover, as a key promising technology of 5G, device-to-device is used as the communication way between mobile devices, because it can enhance the communication ability and the information sharing ability between mobile devices. Second, cloudlets can be considered as small data centers, and we set the sharing relation table and the cooperation mechanism between cloudlets. Then, relying on these, mobile devices can quickly route and search the requested services regardless of the frequent movement of mobile devices in MANETs. The experimental results show that DCRM can save more time and several times more energy, and display more advantages than the network model without the proposed mechanism in many ways, consequently enable cloud to provide services that are more realistic for the future mobile network applications.
17 January 2019 in IEEE Access
Social media have become increasingly popular for the sharing and spreading of usergenerated content due to their easy access, fast dissemination, and low cost. Meanwhile, social media also enable the wide propagation of cyber frauds, which leverage fake information sources to reach an ulterior goal. The prevalence of untrustworthy information sources on social media can have significant negative societal effects. In a trustworthy social media system, trust calculation technology has become a key demand for identification of information sources. Trust, as one of the most complex concepts in network communities, has multi-criteria properties. However, existing work only focuses on single trust factor, and does not fully consider the complexity of trust relationships in social computing. In this paper, a multi-criteria trustworthiness calculation mechanism called Info-Trust is proposed for information sources, in which identity-based trust, behavior-based trust, relation-based trust, and feedback-based trust factors are incorporated to present an accuracy-enhanced full view of trustworthiness evaluation of information sources. More importantly, the weights of these factors are dynamically assigned by the ordered weighted averaging and weighted moving average (OWA-WMA) combination algorithm. This mechanism surpasses the limitations of existing approaches in which weights are assigned subjectively. Experimental results based on real-world datasets from SinaWeibo demonstrate that the proposed mechanism achieves greater accuracy and adaptability in trustworthiness identification of network information.
28 May 2019 in IEEE Internet of Things Journal
Data aggregation is a critical operation in wireless sensor networks(WSNs). Many applications have strict requirements for the latency of data aggregation. This paper focuses on the latency problem of data aggregation. Two factors determine the latency of data aggregation. First, because of the existence of interference, efficient collision-free scheduling is crucial for reducing data aggregation latency. Second, the tree structure has an important impact on data aggregation latency. In this paper, we propose a novel approach called distributed and efficient data aggregation scheduling over multi-channel links (DEDAS-MC). DEDAS-MC minimizes the latency in routing the aggregated data to the sink over multi-channel links. In DEDAS-MC, we first present a scheduling algorithm to schedule sensors to avoid interference and minimize the latency of data aggregation on a given tree. Then, a distributed algorithm for constructing minimum-latency data aggregation trees is proposed by employing the Markov approximation method. In DEDAS-MC, the value of β is adaptive. The Markov approximation method based adaptive-β is more flexible and efficient than the single β approximation. Experiments show that DEDAS-MC outperforms the existing competing schemes.
29 November 2018 in IEEE Access
1 January 2018 in IEEE Access
In existing studies, the problem of maximizing aggregation information based on a given particular tree in deadlineand energy-constrained unreliable wireless sensor networks was addressed. However, these studies did not consider the effect of the aggregation tree structure on the maximum available aggregation information, which in this paper is proved to be important. In this paper, we focus on constructing optimal trees for maximizing aggregation information in unreliable sensor networks under a deadline constraint imposed on the sink and the energy constraints of each sensor. First, we propose an adaptive scheduling algorithm that efficiently implements scheduling in a given aggregation tree to maximize aggregation information. Second, we propose a distributed efficient algorithm to construct optimal aggregation trees and describe the design of an efficient state transition method of Markov chain that is implemented in the algorithm. Finally, we verify the performance of our proposed algorithms in a set of representative simulation scenarios. The experimental results show that, as compared with the methods examined in the existing research studies, our proposed algorithms significantly improve the maximum available aggregation information.