As more and more compute-intensive and delay-sensitive applications are deployed on smart mobile devices, mobile edge computing is considered an effective way to solve the limited computing ability of smart mobile devices (SMDs). At present, latency has become the most critical indicator of the quality of service (QoS), and more and more studies focus on this aspect. Unlike previous work, our work fully takes into account the limited storage and computing ability of edge servers. To effectively reduce the delay of SMDs and improve QoS, we propose a Delay Control Strategy Joint Service Caching and Task Offloading (DCS-OCTO) in a three-tier mobile edge computing (MEC) system consist of multi-user, multiedge server and remote cloud servers. Some of the key challenges include service heterogeneity, unknown system dynamics, spatial demand coupling, and decentralized coordination. In particular, a very compelling but rarely studied issue is the dynamic service caching in the three-tier MEC system. The DCS-OCTO strategy is proposed based on Lyapunov optimization and Gibbs sampling. It works online without requiring prior information and achieves provable near-optimal performance. Finally, simulation results show that the strategy effectively reduces the overall system delay while ensuring low energy consumption.
Many important information in medical research and clinical diagnosis are obtained from medical images. Among them, digital pathology images can provide detailed tissue structure and cellular information, which has become the gold standard for clinical tumor diagnosis. With the development of neural networks, computer-aided diagnosis presents the identification results of various cell nuclei to doctors, which facilitates the identification of cancerous regions. However, deep learning models require a large amount of annotated data. Pathology images are expensive and difficult to obtain, and insufficient annotation data can easily lead to biased results. In addition, when current models are evaluated on an unknown target domain, there are errors in the predicted boundaries. Based on this, this study proposes a feature alignment-based detail recognition strategy for pathology image segmentation (FASNet). It consists of a preprocessing model and a segmentation network (UNW). The UNW network performs instance normalization and categorical whitening of feature images by inserting semantics-aware normalization and semantics-aware whitening modules into the encoder and decoder, which achieves the compactness of features of the same class and the separation of features of different classes. The FASNet method can identify the feature detail information more efficiently, and thus differentiate between different classes of tissues effectively. The experimental results show that the FASNet method has a Dice Similarity Coefficient (DSC) value of 0.844. It achieves good performance even when faced with test data that does not match the distribution of the training data. Code: https://github.com/zlf010928/FASNet.git.
A large number of routing algorithms in Opportunistic Networks are based on the assumption that nodes are free to help other nodes forward messages. However, when the Opportunistic Network is applied to an urban environment, the nodes will have certain social attributes. In many cases, a node can decide whether to execute the routing policy or not. Due to the limited resources and poor social relationships, nodes may be unwilling to forward messages from other nodes and have strong motivation to implement selfish policies. As a result, increased network latency reduces message delivery rates and affects the overall network performance. In order to solve this problem, we propose a perceptual routing protocol to promote node cooperation from the perspective of game theory. Specifically, We introduce the concept of virtual currency and construct a price function, and nodes can obtain a certain virtual currency through cooperation. In the process of message forwarding, we consider the change of link degree and energy of node (the energy exists in the form of electricity in this article), and use them as factors of the trading node quotation. The trading node finally makes it through the multiple rounds of bargaining games, so that the proposed game between both sides reaches the Nash equilibrium. Experiments show that the algorithm outperforms Epidemic, EPSR, MINEIRO and ICRP algorithms in terms of delivery rate, average latency and energy consumption. According to the simulation experiments, the average delivery ratio of GIR algorithm is 0.68, which is 13% higher than that of the epidemic algorithm. In terms of average delay, 7% is better than ICRP algorithm.
As the society and technology are developing, people tend to spend more time online in daily life frequently, such as shopping, reading novels, sharing files and so on. However, how to guarantee the safety of their online behaviors has been a topic of public concern, and the trust of node behaviors in the network has become one of the significant guarantees. A trust model based on fuzzy similarity is proposed in this article in accordance with the features of node behaviors. Firstly, the evaluation message is given to various nodes, and the theory of fuzzy similarity is applied to process the evaluation message. Through integrating these evaluation message, the rules of node behaviors are obtained, Besides, for the malicious and selfish nodes, the trust update algorithm is proposed. Simulation results show the effectiveness and scientific of the mode proposed.
In Software-defined Wireless Sensor Networks (SDWSNs), sensor nodes can update their functions by receiving new program codes, allowing network updates without hardware modifications. However, the large size of program codes presents a challenge for efficient distribution, especially in low-duty-cycle SDWSNs. This paper proposes a Slot Inserting Opportunistically Broadcasting (SIOB) scheme to achieve low delay and energy-efficient code dissemination. In the SIOB scheme, active slots are inserted into energy-surplus nodes, synchronized with their parent nodes’ active slots. This allows multiple nodes to receive the broadcasted code simultaneously, reducing both the number of broadcasts and the overall broadcasting delay. We detail the active slot selection strategy and the code broadcast algorithm. Through theoretical analysis and experiments, we demonstrate that the SIOB scheme outperforms existing strategies, reducing broadcast frequency by 34.74%, maximum delay by 61.58%, and average delay by 83.34%, while maintaining a comparable network lifetime.