Green and Sustainable Cloud of Things: Enabling Collaborative Edge Computing

Ning, Zhaolong; Kong, Xiangjie; Xia, Feng; Hou, Weigang; Wang, Xiaojie

doi:10.1109/mcom.2018.1700895

Cited by 123 publications

(56 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the future, we will focus on dynamic motif clustering for real-time network management (Ning et al, 2018;Ning, Huang & Wang, 2019;Wang et al, 2018a). In addition, network security (Wang et al, 2018b and crowdsourcing based methods (Ning et al, 2019a(Ning et al, , 2019b) also deserve to be investigated.…”

Section: Resultsmentioning

confidence: 99%

COMICS: a community property-based triangle motif clustering scheme

Feng

Zhang

et al. 2019

PeerJ Computer Science

Self Cite

View full text Add to dashboard Cite

With the development of science and technology, network scales of various fields have experienced an amazing growth. Networks in the fields of biology, economics and society contain rich hidden information of human beings in the form of connectivity structures. Network analysis is generally modeled as network partition and community detection problems. In this paper, we construct a community property-based triangle motif clustering scheme (COMICS) containing a series of high efficient graph partition procedures and triangle motif-based clustering techniques. In COMICS, four network cutting conditions are considered based on the network connectivity. We first divide the large-scale networks into many dense subgraphs under the cutting conditions before leveraging triangle motifs to refine and specify the partition results. To demonstrate the superiority of our method, we implement the experiments on three large-scale networks, including two co-authorship networks (the American Physical Society (APS) and the Microsoft Academic Graph (MAG)), and two social networks (Facebook and gemsec-Deezer networks). We then use two clustering metrics, compactness and separation, to illustrate the accuracy and runtime of clustering results. A case study is further carried out on APS and MAG data sets, in which we construct a connection between network structures and statistical data with triangle motifs. Results show that our method outperforms others in both runtime and accuracy, and the triangle motif structures can bridge network structures and statistical data in the academic collaboration area. massive scale related data, such as digital libraries and scholarly networks . As collaboration behaviors among scholars are becoming frequent, collaboration networks are generally in large-scale and contain rich collaboration information, reflecting the cooperation patterns among scholars in different research areas. Bordons et al. (1996) regard the academic teams as scientists communities, in which scholars can share research methods, materials, and financial resources rather than institutions organized by fixed structures (Barjak & Robinson, 2008). Furthermore, the ternary closures in social networks constitute a minimal stable structure; that is, a loop with three nodes. The number of ternary closures in social networks changes over time, which reveals the evolvement of human social behaviors. Besides, the definition of a clustering coefficient is based on the distributions of ternary closures. Milo et al. (2002) defined small network structures as motifs to present interconnections in complex networks by numbers that are significantly higher than those in randomized networks. Motifs can define universal classes of networks, and researchers are carrying on the motif detection experiments on networks from different areas, such as biochemistry, neurobiology, and engineering, to uncover the existence of motifs and the corresponding structure information in networks (Ribeiro, Silva & Kaiser, 2009;Bian & Zhang, 2016). Hence, triangle mo...

show abstract

Section: Resultsmentioning

confidence: 99%

COMICS: a community property-based triangle motif clustering scheme

Feng

Zhang

et al. 2019

PeerJ Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The main mathematical formulation here is that for a given underlying point x and the j th iteration esteem

T_{j} ((), x)

, it is challenging to position the enormous integer; on the other hand, RSA is dependent on the factoring of the integer, which is equally difficult. In addition to being used to create cryptosystems, this procedure can likewise be utilized to build authentication mechanisms as in many telecare medicine information systems, mobile emergency medical care systems, socially‐aware networking, vehicular social networks, message forwarding framework, and edge computing …”

Section: Introductionmentioning

confidence: 99%

A subtree‐based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing

Meshram

Lee

Ranadive

et al. 2020

Int J Communication

View full text Add to dashboard Cite

Cloud computing technologies have been prospering in recent years and have opened an avenue for a wide variety of forms of adaptable data sharing. Taking advantage of these state-of-the-art innovations, the cloud storage data owner must, however, use a suitable identity-based cryptographic mechanism to ensure the safety prerequisites while sharing data to large numbers of cloud data users with fuzzy identities. As a successful way to guarantee secure fuzzy sharing of cloud data, the identity-based cryptographic technology still faces an effectiveness problem under multireceiver configurations. The chaos theory is considered a reasonable strategy for reducing computational complexity while meeting the cryptographic protocol's security needs. In an identity-based cryptographic protocol, public keys for individual clients are distributed, allowing the clients to separately select their own network identities or names as their public keys. In fact, in a public-key cryptographic protocol, it is for the best that the confirmation of the public key is done in a safe, private manner, because this way the load of storage on the server's side can be considerably relieved. The objective of this paper is to outline and examine a conversion process that can transfer cryptosystems using Chebyshev's chaotic maps over the Galois field to a subtree-based protocol in the cloud computing setting for fuzzy user data sharing, as opposed to reconcocting a different structure. Furthermore, in the design of our conversion process, no adjustment of the original cryptosystem based on chaotic maps is needed. K E Y W O R D Schaotic hash function, Chebyshev chaotic maps, fuzzy user, public key cryptography, subtree | INTRODUCTIONCloud storage has introduced new ways to store, retrieve, and share digital data, making the concept of sharing ondemand information a reality. Cloud storage service suppliers have been merging into cloud information centers these days, and nominal costs are charged for the service of data sharing. Officers in companies and other organizations can easily acquire precious data with the assistance of cloud storage or share the latest information anywhere with other

show abstract

“…However, the distance between mobile vehicles and remote cloud servers may cause a large network transmission delay and create considerable overhead, which is intolerable for applications requiring real-time interaction and high mobility requirements [6,7]. Accordingly, it is benecial and necessary to bring the cloud closer to the users.…”

Section: Introductionmentioning

confidence: 99%

Resource Management Framework Based on the Stackelberg Game in Vehicular Edge Computing

Zhang

Wang

et al. 2020

Complexity

View full text Add to dashboard Cite

With the emergence and development of the Internet of Vehicles (IoV), quick response time and ultralow delay are required. Cloud computing services are unfavorable for reducing delay and response time. Mobile edge computing (MEC) is a promising solution to address this problem. In this paper, we combined MEC and IoV to propose a specific vehicle edge resource management framework, which consists of fog nodes (FNs), data service agents (DSAs), and cars. A dynamic service area partitioning algorithm is designed to balance the load of DSA and improve the quality of service. A resource allocation framework based on the Stackelberg game model is proposed to analyze the pricing problem of FNs and the data resource strategy of DSA with a distributed iteration algorithm. The simulation results show that the proposed framework can ensure the allocation efficiency of FN resources among the cars. The framework achieves the optimal strategy of the participants and subgame perfect Nash equilibrium.

show abstract

Green and Sustainable Cloud of Things: Enabling Collaborative Edge Computing

Cited by 123 publications

References 14 publications

COMICS: a community property-based triangle motif clustering scheme

COMICS: a community property-based triangle motif clustering scheme

A subtree‐based transformation model for cryptosystem using chaotic maps under cloud computing environment for fuzzy user data sharing

Resource Management Framework Based on the Stackelberg Game in Vehicular Edge Computing

Contact Info

Product

Resources

About