Optimal Energy-Efficient Transmission for Hybrid Spectrum Sharing in Cooperative Cognitive Radio Networks

In order to improve the energy efficiency(EE)in cognitive radio(CR),this paper investigates the joint design of cooperative spectrum sensing time and the power control optimization problem for the secondary user systems to achieve the maximum energy efficiency in a cognitive network based on hybrid spectrum sharing,meanwhile considering the maximum transmit power,user quality of service(QoS)requirements,interference limitations,and primary user protection.The optimization of energy efficient sensing time and power allocation is formulated as a non-convex optimization problem.The Dinkelbach’s method is adopted to solve this problem and to transform the non-convex optimization problem in fractional form into an equivalent optimization problem in the form of subtraction.Then,an iterative power allocation algorithm is proposed to solve the optimization problem.The simulation results show the effectiveness of the proposed algorithms for energy-efficient resource allocation in the cognitive network.

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.

Supply Chain Network Equilibrium with Revenue Sharing Contract under Demand Disruptions

Contract is a common and effective mechanism for supply chain coordination,which has been studied extensively in recent years.For a supply chain network model,contracts can be used to coordinate it because it is too ideal to obtain the network equilibrium state in practical market competition.In order to achieve equilibrium,we introduce revenue sharing contract into a supply chain network equilibrium model with random demand in this paper.Then,we investigate the influence on this network equilibrium state from demand disruptions caused by unexpected emergencies.When demand disruptions happen,the supply chain network equilibrium state will be broken and change to a new one,so the decision makers need to adjust the contract parameters to achieve the new coordinated state through bargaining.Finally,a numerical example with a sudden demand increase as a result of emergent event is provided for illustrative purposes.

A Game Theoretic Approach for Hierarchical Caching Resource Sharing in 5G Networks with Virtualization

Caching and virtualization have been considered as the promising techniques in 5G Networks. In 5G networks with virtualization, the caching resources deployed by infrastructure providers (InPs) can be abstracted into isolated slices and transparently shared by mobile virtual network operators (MVNOs). In this case, one of the most important issues is how the MVNOs to share the caching resource. To solve this issue, different from previous works, a hierarchical caching architecture that core network and radio access network (RAN) have the caching capability in 5G networks with virtualization is first considered in this paper. Then, we study the problem of hierarchical caching resource sharing for MVNOs, and a competitive game to maximize their expectation revenue based on the oligopoly market model is formulated. As it is a hard problem to find the optimal solution in the hierarchical caching resource sharing problem, we decompose the optimization problem into two independent caching resource sharing problems in RAN and core network, respectively. Then the local optimal solutions are solved and the global Nash equilibrium solution is achieved. Finally, simulation results are illustrated to demonstrate the performance of the proposed scheme.

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks（MANETs） cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks（such as interception and physical destroy attacks）.Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.

Multi-agent reinforcement learning for edge information sharing in vehicular networks

To guarantee the heterogeneous delay requirements of the diverse vehicular services,it is necessary to design a full cooperative policy for both Vehicle to Infrastructure(V2I)and Vehicle to Vehicle(V2V)links.This paper investigates the reduction of the delay in edge information sharing for V2V links while satisfying the delay requirements of the V2I links.Specifically,a mean delay minimization problem and a maximum individual delay minimization problem are formulated to improve the global network performance and ensure the fairness of a single user,respectively.A multi-agent reinforcement learning framework is designed to solve these two problems,where a new reward function is proposed to evaluate the utilities of the two optimization objectives in a unified framework.Thereafter,a proximal policy optimization approach is proposed to enable each V2V user to learn its policy using the shared global network reward.The effectiveness of the proposed approach is finally validated by comparing the obtained results with those of the other baseline approaches through extensive simulation experiments.

Resource Allocation based on Shared Criterion in OFDMA Distributed Radio Access Network

Distributed radio access network (DRAN) is a novel wireless access architecture and can solve the problem of the available spectrum scarcity in wireless communications. In this paper, we investigate resource allocation for the downlink of OFDMA DRAN. Unlike previous exclusive criterion based algorithms that allocate each subcarrier to only one user in the system, the proposed algorithms are based on shared criterion that allow each subcarrier to be allocated to multiple users through different antennas and to only one user through same antenna. First, an adaptive resource allocation algorithm based on shared criterion is proposed to maximize total system rate under each user's minimal rate and each antenna's maximal power constraints. Then we improve the above algorithm by considering the influence of the resource allocation scheme on single user. The simulation results show that the shared criterion based algorithm provide much higher total system rate than that of the exclusive criterion based algorithm at the expense of the outage performance and the fairness, while the improved algorithm based on shared criterion can achieve a good tradeoff performance.

Intelligent Spectrum Management Based on Radio Map for Cloud-Based Satellite and Terrestrial Spectrum Shared Networks

Cloud-based satellite and terrestrial spectrum shared networks(CB-STSSN)combines the triple advantages of efficient and flexible net-work management of heterogeneous cloud access(H-CRAN),vast coverage of satellite networks,and good communication quality of terrestrial networks.Thanks to the complementary coverage characteristics,any-time and anywhere high-speed communications can be achieved to meet the various needs of users.The scarcity of spectrum resources is a common prob-lem in both satellite and terrestrial networks.In or-der to improve resource utilization,the spectrum is shared not only within each component but also be-tween satellite beams and terrestrial cells,which intro-duces inter-component interferences.To this end,this paper first proposes an analytical framework which considers the inter-component interferences induced by spectrum sharing(SS).An intelligent SS scheme based on radio map(RM)consisting of LSTM-based beam prediction(BP),transfer learning-based spec-trum prediction(SP)and joint non-preemptive prior-ity and preemptive priority(J-NPAP)-based propor-tional fair spectrum allocation is than proposed.The simulation result shows that the spectrum utilization rate of CB-STSSN is improved and user blocking rate and waiting probability are decreased by the proposed scheme.

SHARING AND PLANNING OF DISTRIBUTED EQUIPMENT FOR NETWORKED MANUFACTURING

Efficient utilization of the equipment distributed in different enterprises and optimal allocation of these resources is an important concern for networked manufacturing. The third party based equipment sharing approach is put forward to optimize the utilization of distributed equipment for networked manufacturing; Taking advantage of the shared equipment offered by equipment providers by means of lease agreement, the third party carries out production by establishing networked virtual factory. Operational mechanism of the third party based equipment sharing is discussed, and characteristics of this approach in achieving resource allocation are analyzed. Shared equipment planning is formulated as an optimization problem with the objective of maximizing profits for equipment coordinator, a mathematical model for shared equipment planning is developed. Finally a case study is discussed to show the effectiveness of the planning model.

Impact of utilization of hepatitis C positive organs in liver transplant:Analysis of united network for organ sharing database

BACKGROUND The utility of hepatitis C virus(HCV)organs has increased after the Food and Drug Administration approval of direct acting anti-viral(DAA)medications for the HCV treatment.The efficacy of DAA in treating HCV is nearly 100%.AIM To analyze the United Network for Organ Sharing(UNOS)database to compare the survival rates between the hepatitis C positive donors and negative recipients and hepatitis C negative donors and recipients.METHODS We analyzed the adult patients in UNOS database who underwent deceased donor liver transplant from January 2014 to December 2017.The primary endpoint was to compare the survival rates among the four groups with different hepatitis C donor and recipient status:(Group 1)Both donor and recipient negative for HCV(Group 2)Negative donor and positive recipient for HCV(Group 3)Positive donor and negative recipient for HCV(Group 4)Both positive donor and recipient for HCV.SAS 9.4 software was used for the data analysis.Kaplan Meier log rank test was used to analyze the estimated survival rates among the four groups.RESULTS A total of 24512 patients were included:Group 1:16436,Group 2:6174,Group 3:253 and Group 4:1649.The 1-year(Group 1:91.8%,Group 2:92.12%,Group 3:87%,Group 4:92.8%),2-year(Group 1:88.4%,Group 2:88.1%,Group 3:84.3%,Group 4:87.5%),3-year(Group 1:84.9%,Group 2:84.3%,Group 3:75.9%,Group 4:83.2%)survival rates showed no statistical significance among the four groups.Kaplan Meier log rank test did not show any statistical significance difference in the estimated survival rates between Group 3 vs all the other groups.CONCLUSION The survival rates in hepatitis C positive donors and negative recipients are similar as compared to both hepatitis C negative donors and recipients.This could be due to the use of DAA therapy with cure rates of nearly 100%.This study supports the use of hepatitis C positive organs in the selected group of recipients with and without HCV infection.Further long-term studies are needed to further validate these findings.

A Novel Two-Stage Dynamic Spectrum Sharing Scheme in Cognitive Radio Networks

In order to enhance the efficiency of spectrum utilization and reduce communication overhead in spectrum sharing process, we propose a two-stage dynamic spectrum sharing scheme in which cooperative and noncooperative modes are analyzed in both stages. In particular, the existence and the uniqueness of Nash Equilibrium(NE) strategies for noncooperative mode are proved. In addition, a distributed iterative algorithm is proposed to obtain the optimal solutions of the scheme. Simulation studies are carried out to show the performance comparison between two modes as well as the system revenue improvement of the proposed scheme compared with a conventional scheme without a virtual price control factor.

Achievement of Interference Alignment in General Underlay Cognitive Radio Networks: Scenario Classification and Adaptive Spectrum Sharing

Interference alignment(IA) is suitable for cognitive radio networks(CRNs).However, in IA spectrum sharing(SS) process of general underlay CRNs, transmit power of cognitive radio transmitters usually should be reduced to satisfy interference constraint of primary user(PU), which may lead to low signalto-noise-ratio at cognitive radio receivers(CRRs). Consequently, sum rate of cognitive users(CUs) may fall short of the theoretical maximum through IA. To solve this problem,we propose an adaptive IA SS method for general distributed multi-user multi-antenna CRNs. The relationship between interference and noise power at each CRR is analyzed according to channel state information, interference requirement of PU, and power budget of CUs. Based on the analysis, scenarios of the CRN are classified into 4 cases, and corresponding IA SS algorithms are properly designed. Transmit power adjustment, CU access control and adjusted spatial projection are used to realize IA among CUs. Compared with existing methods, the proposed method is more general because of breaking the restriction that CUs can only transmit on the idle sub-channels. Moreover, in comparison to other five IA SS methods applicable in general CRN, the proposed method leads to improved achievable sum rate of CUs while guarantees transmission of PU.

Proactive Spectrum Monitoring for Suspicious Wireless Powered Communications in Dynamic Spectrum Sharing Networks

This paper studies the proactive spec-trum monitoring with one half-duplex spectrum moni-tor(SM)to cope with the potential suspicious wireless powered communications(SWPC)in dynamic spec-trum sharing networks.The jamming-assisted spec-trum monitoring scheme via spectrum monitoring data(SMD)transmission is proposed to maximize the sum ergodic monitoring rate at SM.In SWPC,the suspi-cious communications of each data block occupy mul-tiple independent blocks,with a block dedicated to the wireless energy transfer by the energy-constrained suspicious nodes with locations in a same cluster(symmetric scene)or randomly distributed(asymmet-ric scene)and the remaining blocks used for the in-formation transmission from suspicious transmitters(STs)to suspicious destination(SD).For the sym-metric scene,with a given number of blocks for SMD transmission,namely the jamming operation,we first reveal that SM should transmit SMD signal(jam the SD)with tolerable maximum power in the given blocks.The perceived suspicious signal power at SM could be maximized,and thus so does the correspond-ing sum ergodic monitoring rate.Then,we further reveal one fundamental trade-off in deciding the op-timal number of given blocks for SMD transmission.For the asymmetric scene,a low-complexity greedy block selection scheme is proposed to guarantee the optimal performance.Simulation results show that the jamming-assisted spectrum monitoring schemes via SMD transmission achieve much better perfor-mance than conventional passive spectrum monitor-ing,since the proposed schemes can obtain more accu-rate and effective spectrum characteristic parameters,which provide basic support for fine-grained spectrum management and a solution for spectrum security in dynamic spectrum sharing network.

A distributed authentication and authorization scheme for in-network big data sharing

Big data has a strong demand for a network infrastructure with the capability to support data sharing and retrieval efficiently. Information-centric networking （ICN） is an emerging approach to satisfy this demand, where big data is cached ubiquitously in the network and retrieved using data names. However, existing authentication and authorization schemes rely mostly on centralized servers to provide certification and mediation services for data retrieval. This causes considerable traffic overhead for the secure distributed sharing of data. To solve this problem, we employ identity-based cryptography （IBC） to propose a Distributed Authentication and Authorization Scheme （DAAS）, where an identity-based signature （IBS） is used to achieve distributed verifications of the identities of publishers and users. Moreover, Ciphertext-Policy Attribnte-based encryption （CP-ABE） is used to enable the distributed and fine-grained authorization. DAAS consists of three phases： initialization, secure data publication, and secure data retrieval, which seamlessly integrate authentication and authorization with the in- terest/data communication paradigm in ICN. In particular, we propose trustworthy registration and Network Operator and Authority Manifest （NOAM） dissemination to provide initial secure registration and enable efficient authentication for global data retrieval. Meanwhile, Attribute Manifest （AM） distribution coupled with automatic attribute update is proposed to reduce the cost of attribute retrieval. We examine the performance of the proposed DAAS, which shows that it can achieve a lower bandwidth cost than existing schemes.

Always-optimally-coordinated candidate selection algorithm for peer-to-peer files sharing system in mobile self-organized networks

In order to improve the performance of peer-to-peer files sharing system under mobile distributed en- vironments, a novel always-optimally-coordinated （AOC） criterion and corresponding candidate selection algorithm are proposed in this paper. Compared with the traditional min-hops criterion, the new approach introduces a fuzzy knowledge combination theory to investigate several important factors that influence files transfer success rate and efficiency. Whereas the min-hops based protocols only ask the nearest candidate peer for desired files, the selection algorithm based on AOC comprehensively considers users＇ preferences and network requirements with flexible balancing rules. Furthermore, its advantage also expresses in the independence of specified resource discovering protocols, allowing for scalability. The simulation results show that when using the AOC based peer selection algorithm, system performance is much better than the rain-hops scheme, with files successful transfer rate improved more than 50% and transfer time re- duced at least 20%.

On Measuring the Privacy of Anonymized Data in Multiparty Network Data Sharing

This paper aims to find a practical way of quantitatively representing the privacy of network data. A method of quantifying the privacy of network data anonymization based on similarity distance and entropy in the scenario involving multiparty network data sharing with Trusted Third Party (TTP) is proposed. Simulations are then conducted using network data from different sources, and show that the measurement indicators defined in this paper can adequately quantify the privacy of the network. In particular, it can indicate the effect of the auxiliary information of the adversary on privacy.

Hierarchical Spectrum Sharing Networks

A spectrum heterogeneity analysis in the cognitive radio network is conducted in this paper. Subsequently,a spectrum-heterogeneity-based hierarchical spectrum sharing(HSS) network for cognitive radio is proposed.The corresponding method of classifying available spectrums and communication based on the proposed architecture is also presented. Based on the above network architecture,we propose a reference protocol architecture.Research on these protocol function blocks,such as spectrum sensing,spectrum manager,and so on,is conducted. Numerical results show that HSS can provide a considerable extension to available spectrums so that the spectral utility may be further improved.

Information Network Systems and Information Sharing on Administrative Websites

In Japanese 'e-government' policy, called 'e-Japan', the 'administrative document management system' is functioning as information searching systems. On the other hand, this system has also generated the problem that it is not fully functioning as a means for the information sharing in a governmental agency. So, the purpose of this research is to find how the administrative document management system can function as information sharing in administrative organization. For this purpose, this paper considers the current status and some problems firstly. And secondary, this paper proposes the idea and constructs some information systems using administrative official Website. This is the method and approach of this research. As a conclusion, this proposal information system junctions as information sharing support systems.

A Shared Multi-buffer Banyan Network

A Shared Multi-buffer Banyan Network is presented in this letter. Its control algorithm and switching fabric are simple, and it fits the high speed ATM network well. The simulation results show that the throughput of the proposed model is high.

Opportunistic spectrum sharing in software defined wireless network

Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks（MWNs） which significantly change human life. However, proliferating mobile demands lead to several intractable challenges that MWN has to face. Software-defined network is expected as a promising way for future network and has captured growing attention. Network virtualization is an essential feature in software-defined wireless network（SDWN）, and it brings two new entities, physical networks and virtual networks. Accordingly, efficiently assigning spectrum resource to virtual networks is one of the fundamental problems in SDWN. Directly orienting towards the spectrum resource allocation problem, firstly, the fluctuation features of virtual network requirements in SDWN are researched, and the opportunistic spectrum sharing method is introduced to SDWN. Then, the problem is proved as NP-hardness. After that, a dynamic programming and graph theory based spectrum sharing algorithm is proposed.Simulations demonstrate that the opportunistic spectrum sharing method conspicuously improves the system performance up to around 20%–30% in SDWN, and the proposed algorithm achieves more efficient performance.