scispace - formally typeset
Search or ask a question

Showing papers on "Heterogeneous network published in 2017"


Proceedings ArticleDOI
04 Aug 2017
TL;DR: Two scalable representation learning models, namely metapath2vec and metapATH2vec++, are developed that are able to not only outperform state-of-the-art embedding models in various heterogeneous network mining tasks, but also discern the structural and semantic correlations between diverse network objects.
Abstract: We study the problem of representation learning in heterogeneous networks. Its unique challenges come from the existence of multiple types of nodes and links, which limit the feasibility of the conventional network embedding techniques. We develop two scalable representation learning models, namely metapath2vec and metapath2vec++. The metapath2vec model formalizes meta-path-based random walks to construct the heterogeneous neighborhood of a node and then leverages a heterogeneous skip-gram model to perform node embeddings. The metapath2vec++ model further enables the simultaneous modeling of structural and semantic correlations in heterogeneous networks. Extensive experiments show that metapath2vec and metapath2vec++ are able to not only outperform state-of-the-art embedding models in various heterogeneous network mining tasks, such as node classification, clustering, and similarity search, but also discern the structural and semantic correlations between diverse network objects.

1,794 citations


Journal ArticleDOI
TL;DR: DTINet is introduced, whose performance is enhanced in the face of noisy, incomplete and high-dimensional biological data by learning low-dimensional vector representations, which accurately explains the topological properties of individual nodes in the heterogeneous network.
Abstract: The emergence of large-scale genomic, chemical and pharmacological data provides new opportunities for drug discovery and repositioning. In this work, we develop a computational pipeline, called DTINet, to predict novel drug-target interactions from a constructed heterogeneous network, which integrates diverse drug-related information. DTINet focuses on learning a low-dimensional vector representation of features, which accurately explains the topological properties of individual nodes in the heterogeneous network, and then makes prediction based on these representations via a vector space projection scheme. DTINet achieves substantial performance improvement over other state-of-the-art methods for drug-target interaction prediction. Moreover, we experimentally validate the novel interactions between three drugs and the cyclooxygenase proteins predicted by DTINet, and demonstrate the new potential applications of these identified cyclooxygenase inhibitors in preventing inflammatory diseases. These results indicate that DTINet can provide a practically useful tool for integrating heterogeneous information to predict new drug-target interactions and repurpose existing drugs.Network-based data integration for drug-target prediction is a promising avenue for drug repositioning, but performance is wanting. Here, the authors introduce DTINet, whose performance is enhanced in the face of noisy, incomplete and high-dimensional biological data by learning low-dimensional vector representations.

502 citations


Journal ArticleDOI
TL;DR: Extensive simulations and analysis show the effectiveness and efficiency of the proposed framework, in which the blockchain structure performs better in term of key transfer time than the structure with a central manager, while the dynamic scheme allows SMs to flexibly fit various traffic levels.
Abstract: As modern vehicle and communication technologies advanced apace, people begin to believe that the Intelligent Transportation System (ITS) would be achievable in one decade. ITS introduces information technology to the transportation infrastructures and aims to improve road safety and traffic efficiency. However, security is still a main concern in vehicular communication systems (VCSs). This can be addressed through secured group broadcast. Therefore, secure key management schemes are considered as a critical technique for network security. In this paper, we propose a framework for providing secure key management within the heterogeneous network. The security managers (SMs) play a key role in the framework by capturing the vehicle departure information, encapsulating block to transport keys and then executing rekeying to vehicles within the same security domain. The first part of this framework is a novel network topology based on a decentralized blockchain structure. The blockchain concept is proposed to simplify the distributed key management in heterogeneous VCS domains. The second part of the framework uses the dynamic transaction collection period to further reduce the key transfer time during vehicles handover. Extensive simulations and analysis show the effectiveness and efficiency of the proposed framework, in which the blockchain structure performs better in term of key transfer time than the structure with a central manager, while the dynamic scheme allows SMs to flexibly fit various traffic levels.

466 citations


Journal ArticleDOI
TL;DR: A detailed investigation on multiple-antenna techniques for guaranteeing secure communications in point-to-point systems, dual-hop relaying systems, multiuser systems, and heterogeneous networks is provided.
Abstract: As a complement to high-layer encryption techniques, physical layer security has been widely recognized as a promising way to enhance wireless security by exploiting the characteristics of wireless channels, including fading, noise, and interference. In order to enhance the received signal power at legitimate receivers and impair the received signal quality at eavesdroppers simultaneously, multiple-antenna techniques have been proposed for physical layer security to improve secrecy performance via exploiting spatial degrees of freedom. This paper provides a comprehensive survey on various multiple-antenna techniques in physical layer security, with an emphasis on transmit beamforming designs for multiple-antenna nodes. Specifically, we provide a detailed investigation on multiple-antenna techniques for guaranteeing secure communications in point-to-point systems, dual-hop relaying systems, multiuser systems, and heterogeneous networks. Finally, future research directions and challenges are identified.

416 citations


Journal ArticleDOI
TL;DR: A comprehensive review of the SDWSN literature is presented, which delves into some of the challenges facing this paradigm, as well as the majorSDWSN design requirements that need to be considered to address these challenges.
Abstract: Software defined networking (SDN) brings about innovation, simplicity in network management, and configuration in network computing. Traditional networks often lack the flexibility to bring into effect instant changes because of the rigidity of the network and also the over dependence on proprietary services. SDN decouples the control plane from the data plane, thus moving the control logic from the node to a central controller. A wireless sensor network (WSN) is a great platform for low-rate wireless personal area networks with little resources and short communication ranges. However, as the scale of WSN expands, it faces several challenges, such as network management and heterogeneous-node networks. The SDN approach to WSNs seeks to alleviate most of the challenges and ultimately foster efficiency and sustainability in WSNs. The fusion of these two models gives rise to a new paradigm: Software defined wireless sensor networks (SDWSN). The SDWSN model is also envisioned to play a critical role in the looming Internet of Things paradigm. This paper presents a comprehensive review of the SDWSN literature. Moreover, it delves into some of the challenges facing this paradigm, as well as the major SDWSN design requirements that need to be considered to address these challenges.

375 citations


Journal ArticleDOI
TL;DR: Preliminary results are reported that demonstrate the encouraging performance of the proposed deep learning system compared to a benchmark routing strategy (Open Shortest Path First (OSPF)) in terms of significantly better signaling overhead, throughput, and delay.
Abstract: Recently, deep learning, an emerging machine learning technique, is garnering a lot of research attention in several computer science areas. However, to the best of our knowledge, its application to improve heterogeneous network traffic control (which is an important and challenging area by its own merit) has yet to appear because of the difficult challenge in characterizing the appropriate input and output patterns for a deep learning system to correctly reflect the highly dynamic nature of large-scale heterogeneous networks. In this vein, in this article, we propose appropriate input and output characterizations of heterogeneous network traffic and propose a supervised deep neural network system. We describe how our proposed system works and how it differs from traditional neural networks. Also, preliminary results are reported that demonstrate the encouraging performance of our proposed deep learning system compared to a benchmark routing strategy (Open Shortest Path First (OSPF)) in terms of significantly better signaling overhead, throughput, and delay.

342 citations


Journal ArticleDOI
TL;DR: A survey on clustering over the last two decades reveals that QoS aware clustering demands more attention and indicates that clustering techniques enhanced with smart network selection solutions could highly benefit the QoS and QoE in IoT.
Abstract: Wireless sensor network (WSN) systems are typically composed of thousands of sensors that are powered by limited energy resources. To extend the networks longevity, clustering techniques have been introduced to enhance energy efficiency. This paper presents a survey on clustering over the last two decades. Existing protocols are analyzed from a quality of service (QoS) perspective including three common objectives, those of energy efficiency, reliable communication and latency awareness. This review reveals that QoS aware clustering demands more attention. Furthermore, there is a need to clarify how to improve quality of user experience (QoE) through clustering. Understanding the users’ requirements is critical in intelligent systems for the purpose of enabling the ability of supporting diverse scenarios. User awareness or user oriented design is one remaining challenging problem in clustering. In additional, this paper discusses the potential challenges of implementing clustering schemes to Internet of Things (IoT) systems in 5G networks. We indicate that clustering techniques enhanced with smart network selection solutions could highly benefit the QoS and QoE in IoT. As the current studies for WSNs are conducted either in homogeneous or low level heterogeneous networks, they are not ideal or even not able to function in highly dynamic IoT systems with a large range of user scenarios. Moreover, when 5G is finally realized, the problem will become more complex than that in traditional simplified WSNs. Several challenges related to applying clustering techniques to IoT in 5G environment are presented and discussed.

248 citations


Journal ArticleDOI
TL;DR: Numerical results have shown that the proposed cooperative content caching and delivery policy can significantly improve content delivery performance in comparison with existing caching strategies.
Abstract: To address the explosively growing demand for mobile data services in the 5th generation (5G) mobile communication system, it is important to develop efficient content caching and distribution techniques, aiming at significantly reducing redundant data transmissions and improving content delivery efficiency. In heterogeneous cellular network (HetNet), which has been deemed as a promising architectural technique for 5G, caching some popular content items at femto base-stations (FBSs) and even at user equipment (UE) can be exploited to alleviate the burden of backhaul and to reduce the costly transmissions from the macro base-stations to UEs. In this paper, we develop the optimal cooperative content caching and delivery policy, for which FBSs and UEs are all engaged in local content caching. We formulate the cooperative content caching problem as an integer-linear programming problem, and use hierarchical primal-dual decomposition method to decouple the problem into two level optimization problems, which are solved by using the subgradient method. Furthermore, we design the optimal content delivery policy, which is formulated as an unbalanced assignment problem and solved by using Hungarian algorithm. Numerical results have shown that the proposed cooperative content caching and delivery policy can significantly improve content delivery performance in comparison with existing caching strategies.

206 citations


Proceedings ArticleDOI
02 Feb 2017
TL;DR: Zhang et al. as mentioned in this paper proposed a task-guided and path-augmented heterogeneous network embedding model for author identification under double-blind review setting, which is to identify potential authors given information of an anonymized paper.
Abstract: In this paper, we study the problem of author identification under double-blind review setting, which is to identify potential authors given information of an anonymized paper. Different from existing approaches that rely heavily on feature engineering, we propose to use network embedding approach to address the problem, which can automatically represent nodes into lower dimensional feature vectors. However, there are two major limitations in recent studies on network embedding: (1) they are usually general-purpose embedding methods, which are independent of the specific tasks; and (2) most of these approaches can only deal with homogeneous networks, where the heterogeneity of the network is ignored. Hence, challenges faced here are two folds: (1) how to embed the network under the guidance of the author identification task, and (2) how to select the best type of information due to the heterogeneity of the network. To address the challenges, we propose a task-guided and path-augmented heterogeneous network embedding model. In our model, nodes are first embedded as vectors in latent feature space. Embeddings are then shared and jointly trained according to task-specific and network-general objectives. We extend the existing unsupervised network embedding to incorporate meta paths in heterogeneous networks, and select paths according to the specific task. The guidance from author identification task for network embedding is provided both explicitly in joint training and implicitly during meta path selection. Our experiments demonstrate that by using path-augmented network embedding with task guidance, our model can obtain significantly better accuracy at identifying the true authors comparing to existing methods.

195 citations


Journal ArticleDOI
TL;DR: In this paper, a generalized orthogonal/non-orthogonal random access scheme was proposed to improve the network efficiency while reducing the signaling overhead in the UDHN.
Abstract: Due to the exponentially increased demands of mobile data traffic, for example, a 1000-fold increase in traffic demand from 4G to 5G, network densification is considered as a key mechanism in the evolution of cellular networks, and UDHN is a promising technique to meet the requirements of explosive data traffic in 5G networks. In the UDHN, the base station is brought closer and closer to users through densely deploying small cells, which results in extremely high spectral efficiency and energy efficiency. In this article, we first present a potential network architecture for the UDHN, and then propose a generalized orthogonal/non-orthogonal random access scheme to improve the network efficiency while reducing the signaling overhead. Simulation results demonstrate the effectiveness of the proposed scheme. Finally, we present some of the key challenges of the UDHN.

188 citations


Journal ArticleDOI
TL;DR: The benefits of using UAVs for this function include significantly decreasing sensor node energy consumption, lower interference, and offers considerably increased flexibility in controlling the density of the deployed nodes since the need for the multihop approach for sensor-to-sink communication is either eliminated or significantly reduced.

Journal ArticleDOI
01 Feb 2017
TL;DR: This paper presents a typical architecture of the large-scale HANETs, and investigates research advances of the current key technologies, to address existing issues and suggest some potential solutions to deal with the current challenges.
Abstract: The Heterogeneous Ad Hoc Networks (HANETs) are important components of the Internet of things, which become an inevitable trend in the future researches and applications. In recent years, the ad hoc networks have been widely employed in many fields, especially in environment monitoring, weapon control, intelligent transportation, smart city and other domains. HANETs consist of wireless sensor networks, smart ad hoc networks, wireless fidelity networks, telecommunication networks, vehicular ad hoc networks, etc. The digital information and physical objects are integrated through appropriate communication methods, thus new applications and services are created. Different applications use the independent network structures, which form a heterogeneous network platform and increase operational complexity of communication between each other. This paper presents a typical architecture of the large-scale HANETs, and investigates research advances of the current key technologies. To address existing issues, we suggest some potential solutions to deal with the current challenges, such as self-organization, big data transmission, privacy protection, data fusion and processing for large-scale HANETs.

Journal ArticleDOI
TL;DR: This paper designs a novel information-centric heterogeneous networks framework aiming at enabling content caching and computing, and forms the virtual resource allocation strategy as a joint optimization problem, where the gains of not only virtualization but also caching and Computing are taken into consideration.
Abstract: In order to better accommodate the dramatically increasing demand for data caching and computing services, storage and computation capabilities should be endowed to some of the intermediate nodes within the network, therefore increasing the data throughput and reducing the network operation cost. In this paper, we design a novel information-centric heterogeneous networks framework aiming at enabling content caching and computing. Furthermore, due to the virtualization of the whole system, communication, computing, and caching resources can be shared among all users associated with different virtual service providers. We formulate the virtual resource allocation strategy as a joint optimization problem, where the gains of not only virtualization but also caching and computing are taken into consideration in the proposed information-centric heterogeneous networks virtualization architecture. In addition, a distributed algorithm based on alternating direction method of multipliers is adopted in order to solve the formulated problem. Since each base station only needs to solve its own problem without exchange of channel state information by using the distributed algorithm, the computational complexity and signaling overhead can be greatly reduced. Finally, extensive simulations are presented to show the effectiveness of the proposed scheme under different system parameters.

Journal ArticleDOI
TL;DR: This paper proposes a hybrid caching design consisting of identical caches in the macro-tier and random caching in the pico-tier, and a corresponding multicasting design, and achieves better performance in the general region than any asymptotically optimal solution, under a mild condition.
Abstract: Heterogeneous wireless networks (HetNets) provide a powerful approach to meeting the dramatic mobile traffic growth, but also impose a significant challenge on backhaul. Caching and multicasting at macro and pico base stations (BSs) are two promising methods to support massive content delivery and reduce backhaul load in HetNets. In this paper, we jointly consider caching and multicasting in a large-scale cache-enabled HetNet with backhaul constraints. We propose a hybrid caching design consisting of identical caching in the macro-tier and random caching in the pico-tier, and a corresponding multicasting design. By carefully handling different types of interferers and adopting appropriate approximations, we derive tractable expressions for the successful transmission probability in the general signal-to-noise ratio (SNR) and user density region as well as the high SNR and user density region, utilizing tools from stochastic geometry. Then, we consider the successful transmission probability maximization by optimizing design parameters, which is a very challenging mixed discrete-continuous optimization problem. By exploring structural properties, we obtain a near optimal solution with superior performance and manageable complexity. This solution achieves better performance in the general region than any asymptotically optimal solution, under a mild condition. The analysis and optimization results provide valuable design insights for practical cache-enabled HetNets.

Journal ArticleDOI
TL;DR: It is shown that the proposed hybrid backscatter communication can increase the transmission range of WPHetNet, while achieving uniform rate distribution.
Abstract: In this paper, we propose hybrid backscatter communication for wireless-powered communication networks (WPCNs) to increase transmission range and provide uniform rate distribution in the heterogeneous network (HetNet) environment. In such HetNet, where the TV tower or high-power base station (macrocell) coexists with densely deployed small-power access points (e.g., small-cells or WiFi), users can operate in either bistatic scatter or ambient backscatter, or a hybrid of them, given that the harvested energy from the dedicated or ambient RF signals may not be sufficient enough to support the existing harvest-then-transmit protocol for WPCN, which is extended to the wireless-powered heterogeneous network (WPHetNet). Considering the hybrid and dual mode operation, we formulate a throughput maximization problem depending on the user location, namely Macro-zone or WiFi-zone. After performing the optimal time allocation for the above operation, we show that the proposed hybrid backscatter communication can increase the transmission range of WPHetNet, while achieving uniform rate distribution.

Proceedings ArticleDOI
02 Feb 2017
TL;DR: Empirical experiments demonstrate the EOE outperforms consistently single network embedding methods in applications including visualization, link prediction multi-class classification, and multi-label classification.
Abstract: Network embedding is increasingly employed to assist network analysis as it is effective to learn latent features that encode linkage information. Various network embedding methods have been proposed, but they are only designed for a single network scenario. In the era of big data, different types of related information can be fused together to form a coupled heterogeneous network, which consists of two different but related sub-networks connected by inter-network edges. In this scenario, the inter-network edges can act as comple- mentary information in the presence of intra-network ones. This complementary information is important because it can make latent features more comprehensive and accurate. And it is more important when the intra-network edges are ab- sent, which can be referred to as the cold-start problem. In this paper, we thus propose a method named embedding of embedding (EOE) for coupled heterogeneous networks. In the EOE, latent features encode not only intra-network edges, but also inter-network ones. To tackle the challenge of heterogeneities of two networks, the EOE incorporates a harmonious embedding matrix to further embed the em- beddings that only encode intra-network edges. Empirical experiments on a variety of real-world datasets demonstrate the EOE outperforms consistently single network embedding methods in applications including visualization, link prediction multi-class classification, and multi-label classification.

Journal ArticleDOI
TL;DR: The proposed methodology proves to be capable of providing a promising solution for drug‐target prediction based on topological similarity with a heterogeneous network, and may be readily re‐purposed and adapted in the existing of similarity‐based methodologies.
Abstract: Motivation A heterogeneous network topology possessing abundant interactions between biomedical entities has yet to be utilized in similarity-based methods for predicting drug-target associations based on the array of varying features of drugs and their targets. Deep learning reveals features of vertices of a large network that can be adapted in accommodating the similarity-based solutions to provide a flexible method of drug-target prediction. Results We propose a similarity-based drug-target prediction method that enhances existing association discovery methods by using a topology-based similarity measure. DeepWalk, a deep learning method, is adopted in this study to calculate the similarities within Linked Tripartite Network (LTN), a heterogeneous network generated from biomedical linked datasets. This proposed method shows promising results for drug-target association prediction: 98.96% AUC ROC score with a 10-fold cross-validation and 99.25% AUC ROC score with a Monte Carlo cross-validation with LTN. By utilizing DeepWalk, we demonstrate that: (i) this method outperforms other existing topology-based similarity computation methods, (ii) the performance is better for tripartite than with bipartite networks and (iii) the measure of similarity using network topology outperforms the ones derived from chemical structure (drugs) or genomic sequence (targets). Our proposed methodology proves to be capable of providing a promising solution for drug-target prediction based on topological similarity with a heterogeneous network, and may be readily re-purposed and adapted in the existing of similarity-based methodologies. Availability and implementation The proposed method has been developed in JAVA and it is available, along with the data at the following URL: https://github.com/zongnansu1982/drug-target-prediction . Contact nazong@ucsd.edu. Supplementary information Supplementary data are available at Bioinformatics online.

Journal ArticleDOI
03 May 2017
TL;DR: An analytical model is formulated and presented to calculate the optimum number of small cells that need to be kept active at various times of the day in order to minimize power consumption while meeting users’ quality of service demands and reveals that the proposed green communication model saves up to 48% more power than other existing models.
Abstract: Small cell networks (SCNs) are envisaged as a key technology enabling the fifth-generation (5G) wireless communication system to address the challenge of rising mobile data demand. Green communications will be another major attribute of 5G systems, as power consumption from the information and communication technology sector is forecast to increase significantly by 2030. Accordingly, energy-efficient SCN design has attracted significant attention from researchers in recent years. In addition, to enable the ubiquitous deployment of dense small cells, service providers require energy-efficient backhauling solutions. In this paper, we present an energy-efficient communication model for 5G heterogeneous networks (HetNets). The proposed model considers both the access and backhaul network elements. We formulate and present an analytical model to calculate the optimum number of small cells that need to be kept active at various times of the day in order to minimize power consumption while meeting users’ quality of service demands. Based on our critical investigation of backhaul power consumption, we also isolate and present two energy-efficient backhauling solutions for 5G HetNets. Simulated results reveal that the proposed green communication model saves up to 48% more power than other existing models.

Journal ArticleDOI
TL;DR: The dynamic clustering is based on an iterative and fast procedure that considers the spatiotemporal characteristics of congestion propagation and identifies the links with the highest degree of heterogeneity due to time dependent conditions and finally re-cluster them to guarantee connectivity and minimize heterogeneity.
Abstract: The problem of clustering in urban traffic networks has been mainly studied in static framework by considering traffic conditions at a given time. Nevertheless, it is important to underline that traffic is a strongly time-variant process and it needs to be studied in the spatiotemporal dimension. Investigating the clustering problem over time in the dynamic domain is critical to better understand and reveal the hidden information during the process of congestion formation and dissolution. The primary motivation of the paper is to study the spatiotemporal relation of congested links, observing congestion propagation from a macroscopic perspective, and finally identifying critical pockets of congestion that can aid the design of peripheral control strategies. To achieve this, we first introduce a static clustering method to partition the heterogeneous network into homogeneous connected sub-regions. The proposed framework guarantees connectivity of the cluster in different steps, which eases the development of a dynamic framework. The proposed clustering approach has 3 steps; firstly, it obtains a set of homogeneous connected components in the network. Each component has a form of sequence which is built by sequentially adding neighboring links with similar level of congestion. Secondly, the major skeleton of clusters is obtained out of this feasible set by minimizing a heterogeneity index. Thirdly, a fine-tuning step is designed to complete the clustering task by assigning the unclustered links of the network to proper clusters while keeping the connectivity. The optimization problem in both second and third step is formulated as a mixed integer linear programming. The approach is also extended to capture spatiotemporal growth and formation of congestion. The dynamic clustering is based on an iterative and fast procedure that considers the spatiotemporal characteristics of congestion propagation and identifies the links with the highest degree of heterogeneity due to time dependent conditions and finally re-cluster them to guarantee connectivity and minimize heterogeneity. An implementation of the developed methodologies in a megacity based on more than 20,000 taxis with GPS highlights the quality of the method due to its fast computation and proper integration of physical properties of congestion.

Journal ArticleDOI
TL;DR: The proposed approach utilizes the priority-wise dominance and the entropy approaches for providing solutions to the two problems considered in this paper, namely, Macro Base Station (MBS) decision problem and the cooperative UAV allocation problem.

Journal ArticleDOI
Yue Li1, Lin Cai1
TL;DR: This article utilizes UAV-based floating relay to deploy FR cells inside the macrocell, and thus achieves dynamic and adaptive coverage, and comprehensive analyses on FR cells' deployment including frequency reuse, interference, backhaul resource allocation, and coverage are given.
Abstract: The growing popularity of mobile Internet and massive MTC with special traffic characteristics and locations have imposed huge challenges to current cellular networks. Deploying new base stations, however, becomes difficult and expensive, especially for complicated urban scenarios and MTC traffic. The UAV-assisted heterogeneous cellular solution is proposed in this article. It utilizes UAV-based floating relay (FR) to deploy FR cells inside the macrocell, and thus achieves dynamic and adaptive coverage. Comprehensive analyses on FR cells' deployment including frequency reuse, interference, backhaul resource allocation, and coverage are given.

Posted Content
Ke Tu1, Peng Cui1, Xiao Wang1, Fei Wang2, Wenwu Zhu1 
TL;DR: Deep Hyper-Network Embedding (DHNE) as discussed by the authors proposes a new deep model to realize a non-linear tuplewise similarity function while preserving both local and global proximities in the formed embedding space.
Abstract: Network embedding has recently attracted lots of attentions in data mining. Existing network embedding methods mainly focus on networks with pairwise relationships. In real world, however, the relationships among data points could go beyond pairwise, i.e., three or more objects are involved in each relationship represented by a hyperedge, thus forming hyper-networks. These hyper-networks pose great challenges to existing network embedding methods when the hyperedges are indecomposable, that is to say, any subset of nodes in a hyperedge cannot form another hyperedge. These indecomposable hyperedges are especially common in heterogeneous networks. In this paper, we propose a novel Deep Hyper-Network Embedding (DHNE) model to embed hyper-networks with indecomposable hyperedges. More specifically, we theoretically prove that any linear similarity metric in embedding space commonly used in existing methods cannot maintain the indecomposibility property in hyper-networks, and thus propose a new deep model to realize a non-linear tuplewise similarity function while preserving both local and global proximities in the formed embedding space. We conduct extensive experiments on four different types of hyper-networks, including a GPS network, an online social network, a drug network and a semantic network. The empirical results demonstrate that our method can significantly and consistently outperform the state-of-the-art algorithms.

Journal ArticleDOI
TL;DR: A discussion of the inherent technical challenges of BS ON-OFF switching and a comprehensive review of recent advances on switching mechanisms in different application scenarios are provided.
Abstract: To achieve the expected 1000x data rates under the exponential growth of traffic demand, a large number of BSs or APs will be deployed in 5G wireless systems to support high data rate services and to provide seamless coverage. Although such BSs are expected to be small-scale with lower power, the aggregated energy consumption of all BSs would be remarkable, resulting in increased environmental and economic concerns. In existing cellular networks, turning off the underutilized BSs is an efficient approach to conserve energy while preserving the QoS of mobile users. However, in 5G systems with new physical layer techniques and highly heterogeneous network architecture, new challenges arise in the design of BS ON-OFF switching strategies. In this article, we begin with a discussion of the inherent technical challenges of BS ON-OFF switching. We then provide a comprehensive review of recent advances on switching mechanisms in different application scenarios. Finally, we present open research problems and conclude the article.

Journal ArticleDOI
TL;DR: New iterative algorithms are developed based on an exact penalty method combined with successive convex programming, where the binary BS-UE association problem and the nonconvex power allocation problem are dealt with one at a time.
Abstract: In this paper, new strategies are devised for joint load balancing and interference management in the downlink of a heterogeneous network, where small cells are densely deployed within the coverage area of a traditional macrocell. Unlike existing work, the limited backhaul capacity at each base station (BS) is taken into account. Here, users (UEs) cannot be offloaded to any arbitrary BS, but only to ones with sufficient backhaul capacity remaining. Jointly designed with traffic offload, transmit power allocation mitigates the intercell interference to further support the quality of service of each UE. The objective here is either: 1) to maximize the network sum rate subject to minimum throughput requirements at individual UEs, or 2) to maximize the minimum UE throughput. Both formulated problems belong to the difficult class of mixed-integer nonconvex optimization problems. The inherently binary BS-UE association variables are strongly coupled with the transmit power variables, making the problems even more challenging to solve. New iterative algorithms are developed based on an exact penalty method combined with successive convex programming, where the binary BS-UE association problem and the nonconvex power allocation problem are dealt with one at a time. At each iteration of the proposed algorithms, only two simple convex problems need to be solved at the same time scale. It is proven that the algorithms improve the objective functions at each iteration and converge eventually. Numerical results demonstrate the efficiency of the proposed algorithms in both traffic offloading and interference mitigation.

Journal ArticleDOI
TL;DR: The differences between homogeneous and heterogeneous networks regarding APS are discussed, and a two-stage APS method is proposed for hybrid Li-Fi/Wi-Fi networks, which achieves a close-to-optimal throughput at significantly reduced complexity.
Abstract: Hybrid light fidelity (Li-Fi) and wireless fidelity (Wi-Fi) networks are an emerging technology for future indoor wireless communications. This hybrid network combines the high-speed data transmission offered by visible light communication and the ubiquitous coverage of radio-frequency techniques. While a hybrid network can improve the system throughput and users’ experience, it also challenges the process of access point selection (APS) due to the mixture of heterogeneous access points. In this paper, the differences between homogeneous and heterogeneous networks regarding APS are discussed, and a two-stage APS method is proposed for hybrid Li-Fi/Wi-Fi networks. In the first stage, a fuzzy logic system is developed to determine the users that should be connected to Wi-Fi. In the second stage, the remaining users are assigned in the environment of a homogeneous Li-Fi network. Compared with the optimisation method, the proposed method achieves a close-to-optimal throughput at significantly reduced complexity. Simulation results also show that our method greatly improves the system throughput over the conventional methods, such as the signal strength strategy and load balancing, at slightly increased complexity.

Journal ArticleDOI
TL;DR: A novel Cloud-assisted Message Downlink dissemination Scheme (CMDS), with which the safety messages in the cloud server are first delivered to the suitable mobile gateways on relevant roads with the help of cloud computing, and then being disseminated among neighboring vehicles via vehicle-to-vehicle (V2V) communication.
Abstract: In vehicular ad hoc networks (VANETs), efficient message dissemination is critical to road safety and traffic efficiency. Since many VANET-based schemes suffer from high transmission delay and data redundancy, the integrated VANET–cellular heterogeneous network has been proposed recently and attracted significant attention. However, most existing studies focus on selecting suitable gateways to deliver safety message from the source vehicle to a remote server, whereas rapid safety message dissemination from the remote server to a targeted area has not been well studied. In this paper, we propose a framework for rapid message dissemination that combines the advantages of diverse communication and cloud computing technologies. Specifically, we propose a novel Cloud-assisted Message Downlink dissemination Scheme (CMDS), with which the safety messages in the cloud server are first delivered to the suitable mobile gateways on relevant roads with the help of cloud computing (where gateways are buses with both cellular and VANET interfaces), and then being disseminated among neighboring vehicles via vehicle-to-vehicle (V2V) communication. To evaluate the proposed scheme, we mathematically analyze its performance and conduct extensive simulation experiments. Numerical results confirm the efficiency of CMDS in various urban scenarios.

Journal ArticleDOI
TL;DR: This paper focuses on mobile traffic offloading and resource allocation in SDWN-based HetUDNs, constituted of different macro base stations and small-cell base stations (SBSs), and proves the monotonicity and incentive compatibility of the resulting contracts.
Abstract: In heterogeneous ultra-dense networks (HetUDNs), the software-defined wireless network (SDWN) separates resource management from geo-distributed resources belonging to different service providers. A centralized SDWN controller can manage the entire network globally. In this paper, we focus on mobile traffic offloading and resource allocation in SDWN-based HetUDNs, constituted of different macro base stations and small-cell base stations (SBSs). We explore a scenario where SBSs’ capacities are available, but their offloading performance is unknown to the SDWN controller: this is the information asymmetric case. To address this asymmetry, incentivized traffic offloading contracts are designed to encourage each SBS to select the contract that achieves its own maximum utility. The characteristics of large numbers of SBSs in HetUDNs are aggregated in an analytical model, allowing us to select the SBS types that provide the off-loading, based on different contracts which offer rationality and incentive compatibility to different SBS types. This leads to a closed-form expression for selecting the SBS types involved, and we prove the monotonicity and incentive compatibility of the resulting contracts. The effectiveness and efficiency of the proposed contract-based traffic offloading mechanism, and its overall system performance, are validated using simulations.

Journal ArticleDOI
TL;DR: A joint user association and power control optimization algorithm is developed to determine the traffic load in energy-cooperation enabled NOMA HetNets, which achieves much higher energy efficiency performance than existing schemes.
Abstract: This paper focuses on resource allocation in energy-cooperation enabled two-tier heterogeneous networks (HetNets) with non-orthogonal multiple access (NOMA), where base stations (BSs) are powered by both renewable energy sources and the conventional grid. Each BS can serve multiple users at the same time and frequency band. To deal with the fluctuation of renewable energy harvesting, we consider that renewable energy can be shared between BSs via the smart grid. In such networks, user association and power control need to be re-designed, since existing approaches are based on OMA. Therefore, we formulate a problem to find the optimum user association and power control schemes for maximizing the energy efficiency of the overall network, under quality-of-service constraints. To deal with this problem, we first propose a distributed algorithm to provide the optimal user association solution for the fixed transmit power. Furthermore, a joint user association and power control optimization algorithm is developed to determine the traffic load in energy-cooperation enabled NOMA HetNets, which achieves much higher energy efficiency performance than existing schemes. Our simulation results demonstrate the effectiveness of the proposed algorithm, and show that NOMA can achieve higher energy efficiency performance than OMA in the considered networks.

Journal ArticleDOI
TL;DR: A proactive drone-cell deployment framework to alleviate overload conditions caused by flash crowd traffic in 5G networks is proposed and experimental results have shown that the proposed framework can effectively address the overload caused byflash crowd traffic.
Abstract: This paper is concerned with providing radio access network (RAN) elements (supply) for flash crowd traffic demands The concept of multi-tier cells [heterogeneous networks (HetNets)] has been introduced in 5G network proposals to alleviate the erratic supply–demand mismatch However, since the locations of the RAN elements are determined mainly based on the long-term traffic behavior in 5G networks, even the HetNet architecture will have difficulty in coping up with the cell overload induced by flash crowd traffic In this paper, we propose a proactive drone-cell deployment framework to alleviate overload conditions caused by flash crowd traffic in 5G networks First, a hybrid distribution and three kinds of flash crowd traffic are developed in this framework Second, we propose a prediction scheme and an operation control scheme to solve the deployment problem of drone cells according to the information collected from the sensor network Third, the software-defined networking technology is employed to seamlessly integrate and disintegrate drone cells by reconfiguring the network Our experimental results have shown that the proposed framework can effectively address the overload caused by flash crowd traffic

Journal ArticleDOI
TL;DR: This paper proposes an efficient collaborative multi-tier caching framework in Het-Nets that focuses on exploring the maximum capacity of the network infrastructure so as to offload the network traffic and support users’ content requests locally.
Abstract: To deal with the explosive growth in multimedia service requests in mobile networks, caching contents at the cells (base stations) is regarded as an effective emerging technique to reduce the duplicated transmissions of content downloads, while heterogeneous networks (HetNets) are regarded as an effective technique to increase the network capacity. Yet, the combination of content caching and HetNets for future networks (i.e., 5G) is still not well explored. In this paper, we propose an efficient collaborative multi-tier caching framework in Het-Nets. In particular, based on patterns of user requests, link capacities, heterogenous cache sizes, and the derived system topology, we focus on exploring the maximum capacity of the network infrastructure so as to offload the network traffic and support users’ content requests locally. Due to the NP-hardness of the complex multi-tier caching problem, we approximately decompose it into some subproblems that focus on the caching cooperation at different tiers by utilizing the derived system topology. Our proposed framework is low-complexity and distributed, and can be used for practical engineering implementation. Trace-based simulation results demonstrate the effectiveness of the proposed framework.