QoS-Aware Semantic Web Service Composition with Uncertainties

Choosing the optimal execution plan is an important process of semantic web service composition. However, Quality of service （QoS） based plan selection is still challenging because the uncertain QoS values and uncertain user preference make data aggregation and decision making hard. This paper presents a novel Uncertain multiattribute decision making-based semantic web service composition algorithm （UMC） to solve the above difficulties for the first time. UMC takes all possible QoS expression types （real number, interval and linguistic） into consideration and includes three main steps： defuzzifying linguistic data, normalizing the decision matrix and evaluating alternatives synthetically. Further, the strategies of uncertain preference conversion are also discussed in UMC. Other contributions of the paper include an extensible QoS ontology to express the relative concepts, a QoS aggregation algorithm and a set of experiments that demonstrate the effectiveness and benefits of our approach.     

Virtualizing Network and Service Functions： Impact on ICT Transformation and Standardization

Virtualization of network/service functions means time sharing network/service（and affiliated）resources in a hyper speed manner.The concept of time sharing was popularized in the 1970s with mainframe computing.The same concept has recently resurfaced under the guise of cloud computing and virtualized computing.Although cloud computing was originally used in IT for server virtualization,the ICT industry is taking a new look at virtualization.This paradigm shift is shaking up the computing,storage,networking,and ser vice industries.The hope is that virtualizing and automating configuration and service management/orchestration will save both capes and opex for network transformation.A complimentary trend is the separation（over an open interface）of control and transmission.This is commonly referred to as software defined networking（SDN）.This paper reviews trends in network/service functions,efforts to standardize these functions,and required management and orchestration.     

APPLSS:Adaptive Privacy Preserved Location Sharing Scheme Based on Attribute-Based Encryption

Unauthorized access to location information in location-based service is one of the most critical security threats to mobile Internet.In order to solve the problem of quality of location sharing while keeping privacy preserved,adaptive privacy preserved location sharing scheme called APPLSS is proposed,which is based on a new hierarchical ciphertext-policy attribute-based encryption algorithm.In the algorithm,attribute authority sets the attribute vector according to the attribute tags of registration from the location service providers.Then the attribute vector can be adaptively transformed into an access structure to control the encryption and decryption.The APPLSS offers a natural hierarchical mechanism in protecting location information when partially sharing it in mobile networks.It allows service providers access to end user’s sensitive location more flexibly,and satisfies a sufficient-but-no-more strategy.For end-users,the quality of service is obtained while no extra location privacy is leaked.To improve service response performance,outsourced decryption is deployed to avoid the bottlenecks of the service providers and location information providers.The performance analysis and experiments show that APPLSS is an efficient and practical location sharing scheme.     

Database-Assisted Dynamic Spectrum Access with QoS Guarantees:A Double-Phase Auction Approach

Since FCC’s opening for white space(WS) utilization,database-assisted dynamic spectrum access(DSA) has become the de facto solution for the realization of dynamic spectrum sharing(DSS),due to its simplicity and compatibility with commercial off-the-shelf(COTS) devices.It is envisioned that such technology will strongly support the prosperous wireless multimedia networking(WMN) applications with satisfying QoS guarantees in the future.However,how to counter the time-frequency variant property when exploiting the WS spectrum for the provision of these services to secondary users(SUs) still remains a great challenge.In such context,a dynamic secondary access scheme for database-assisted spectrum sharing networks is proposed in this paper.In the beginning,the spectrum requirements of SUs for diverse services are modeled by considering the minimum required service data-rate and spectrum access duration.Afterwards,the spectrum demand evaluation and bidding policy are formulated based on the service classes of SUs.Furthermore,a doublephase(DP) spectrum allocation scheme,which consists of the initial resource allocation phase and resource allocation adjustment phase,is carefully designed for DSA.Finally,extensive simulations are conducted and the results demonstrate that our scheme can increase the spectrum trading revenue and adapt to varying service requirements.     

Resource Allo cation in High Energy-E? cient Co op erative Sp ectrum Sharing Communication Networks

High energy-e?cient wireless communica-tion has become hot due to global low-carbon economy. The systems total transmitting power can be saved by resource allocation in cooperative spectrum sharing net-works. In cooperative spectrum sharing, the secondary user relays the primary users tra?c, as a return, the sec-ondary user is admitted to access the licensed spectrum for its own data transmission. An optimal power and time al-location are presented to minimize the overall energy con-sum ption with the users service quality guaranteed in co-operative spectrum sharing. We formulated it as a convex problem and achieve its optimal power and time allocation in closed form. We analyze the performance of two different transmission protocols for the single relay channel.     

Improving Security and Sharing in Online Social Efficiency for Encrypted Data Networks

Despite that existing data sharing systems in online social networks （OSNs） propose to encrypt data before sharing, the multiparty access control of encrypted data has become a challenging issue. In this paper, we propose a secure data sharing scheme in 0SNs based on ciphertext-policy attribute- based proxy re-encryption and secret sharing. In order to protect users＇ sensitive data, our scheme allows users to customize access policies of their data and then outsource encrypted data to the OSNs service provider. Our scheme presents a multiparty access control model, which enables the disseminator to update the access policy of ciphertext if their attributes satisfy the existing access policy. Further, we present a partial decryption construction in which the computation overhead of user is largely reduced by delegating most of the decryption operations to the OSNs service provider. We also provide checkability on the results returned from the OSNs service provider to guarantee the correctness of partial decrypted ciphertext. Moreover, our scheme presents an efficient attribute revocation method that achieves both forward and backward secrecy. The security and performance analysis results indicate that the proposed scheme is secure and efficient in OSNs.     

Performance Analysis of Wireless Network with Opportunistic Spectrum Sharing via Cognitive Radio Nodes

Cognitive radio (CR) is found to be an emerging key for efficient spectrum utilization. In this paper, spectrum sharing among service providers with the help of cognitive radio has been investigated. The technique of spectrum sharing among service providers to share the licensed spectrum of licensed service providers in a dynamic manner is considered. The performance of the wireless network with opportunistic spectrum sharing techniques is analyzed. Thus, the spectral utilization and efficiency of sensing is increased, the interference is minimized, and the call blockage is reduced.     

A Composite Service Provision Method Based on Novel Node Model in Mobile Ad Hoc Networks

Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes＇ locations are dynamic and the nodes maybe unavailable at any time. Composite service is built through the service composition. In mobile ad hoc networks, the factors influencing the success rate of service composition are mainly the number of nodes and the time spent for the composition. The node＇s failure probability is proportional to the length of time the node exist in the networks. In order to improve the success rate of service composition, we take several measures. First, we split the service requirement into several segments and cluster the nodes, so that the nodes＇ waiting time for service composition can be reduced. Second, we propose a new node model of ＂one node contains multiple services＂ in mobile ad hoc networks. Using this type of nodes model, the number of nodes required for service composition can be reduced. These means can increase the success rate of service composition.     

Optimal distributed power allocation for a new spectrum sharing paradigm in cognitive radio networks

The problem of power allocation in cognitive radio networks plays an important role to improve the efficiency of spectrum utilization. However, most of previous works focus on the power allocation for secondary users in spectrum sharing overlay or spectrum sharing underlay, which needs to frequently handoff between the idle spectrum bands or considers the interference constraints in all spectrum bands respectively. In order to reduce the handoff and fully utilize the spectrum resource, we propose a new spectrum sharing paradigm which not only can just need to adjust the transmit power in spectrum bands instead of frequently handoff between idle spectrum bands, but can fully utilize the spectrum resource as we only consider the interference power constraints in active spectrum bands rather than in all spectrum bands. Then based on this new spectrum sharing paradigm and the constraint conditions, we study the distributed power allocation for secondary users and formulate the optimization problem as a non-cooperative game problem, after that the variational inequality approach is used to solve this game problem and a Nash equilibria solution is got, finally simulation results are illustrated to demonstrate the performance of the proposed scheme.     

Endogenous trusted network architecture for intelligent sharing

To address the needs of intelligent sharing of network resources,blockchain and artificial intelligence were integrated with the network,and an endogenous trusted resource intelligent sharing network architecture was proposed to make network asset sharing have endogenous trust.Based on distributed alliance blockchain,an integration mechanism of on-chain identification and off-chain resource was proposed to achieve credible management of network resources.Security and trusted sharing protocols for network data was designed to synchronize data consensus within the network.Based on smart contract,network resource scheduling and service composition methods were presented to achieve trusted service sharing.Finally,the proposed architecture was applied to decentralized scenarios such as domain name resolution,cross domain authentication,and virtual network operation.The proposed architecture realizes the integration of blockchain and network and supports the endogenous trusted sharing of network assets.     

Reliability and performance of tree-structured grid services

Grid computing is a new emerging technology aiming at large-scale resource sharing, and global-area collaboration. It is a next step in an evolution of parallel and distributed computing. Due to the large scale and complexity of the grid system, its performance and reliability are difficult to model, analyse, and evaluate. This paper presents a model that relaxes some assumptions unsuitable for grid computing systems that have been made in the existed works studying the distributed systems. The paper proposes a virtual tree model of the grid service. This model simplifies the physical structure of a grid service, allows service performance (execution time) to be estimated, and takes into account the common cause failures in communication channels. Based on the model, an algorithm for evaluating the grid service performance distribution and the service reliability indices is suggested. The algorithm is based on graph theory, and Bayesian analysis. Illustrative examples are presented in which the results of the suggested algorithm are compared with simulation results.     

Complex Event Detection in Extremely Resource-Constrained Wireless Sensor Networks

Complex Events are sequences of sensor measurements indicating interesting or unusual activity in the monitored process. Such events are ubiquitous in a wide range of Wireless Sensor Network (WSN) applications, yet there does not exist a common mechanism that addresses both the considerable constraints of WSNs and the specific properties of Complex Events. We argue that Complex Events cannot be described using standard threshold-based or composite logic approaches and attempting to represent them as such can lead to unpredictable execution cost while detection accuracy suffers from erroneous recording of observations which are common in WSNs. To address this, we develop a family of Complex Event Detection (CED) algorithms based on online symbolic conversion of sensor readings. With fixed execution cost and modest resource requirements, the CED algorithms cater for exact, approximate, non-parametric, multiple and probabilistic detection that is neither application nor data dependent. Overall, full implementation and simulations provide experimental evidence of the advantages of the proposed approach. We find that the proposed algorithms minimise configuration, promote unattended operation and complement the goal of prolonged lifetime—factors that satisfy the long-term research vision predicting Internet-scale WSNs comprising billions of devices.     

Organizing reserve channels for superior admission control performance

Good execution of seamless handoffs is key to the quality of service perceived by mobile service subscribers. Giving priority to handoff requests is a strategy commonly considered to guarantee low connection loss when performing handoffs. Often, priority systems can be implemented by adopting a pool of reserved (or guard) resources that is available only for calls or transactions being handed over. Most studies published thus far consider that fixed allocation of the guard resources is being employed. This work considers sharing the reserve channels among cells through the use of a particular method of dynamic resource allocation (DRA). It is shown here that the use of DRA on the pool of guard channels affords a great reduction in the probability of handoff failure without affecting the value of the new call blocking probability, thereby improving the quality of service provided by the cellular operator and also increasing system utilization.     

Wi-Fi网络资源共享现状及发展研究

目前,Wi-Fi网络资源共建共享已经成为全球通信业界广为流行的做法。为了了解国内三大运营商的Wi-Fi网络资源共享现状,对此进行了调查研究,指出三大运营商Wi-Fi网络资源共享中存在的问题,并根据国外运营商的共享情况对国内运营商Wi-Fi网络资源共享的未来做出了展望。     

LEDS: Providing Location-Aware End-to-End Data Security in Wireless Sensor Networks

Providing desirable data security, that is, confidentiality, authenticity, and availability, in wireless sensor networks (WSNs) is challenging, as a WSN usually consists of a large number of resource constraint sensor nodes that are generally deployed in unattended/hostile environments and, hence, are exposed to many types of severe insider attacks due to node compromise. Existing security designs mostly provide a hop-by-hop security paradigm and thus are vulnerable to such attacks. Furthermore, existing security designs are also vulnerable to many types of denial of service (DoS) attacks, such as report disruption attacks and selective forwarding attacks and thus put data availability at stake. In this paper, we seek to overcome these vulnerabilities for large-scale static WSNs. We come up with a location-aware end-to-end security framework in which secret keys are bound to geographic locations and each node stores a few keys based on its own location. This location-aware property effectively limits the impact of compromised nodes only to their vicinity without affecting end-to-end data security. The proposed multifunctional key management framework assures both node-to-sink and node-to-node authentication along the report forwarding routes. Moreover, the proposed data delivery approach guarantees efficient en-route bogus data filtering and is highly robust against DoS attacks. The evaluation demonstrates that the proposed design is highly resilient against an increasing number of compromised nodes and effective in energy savings.     

Query similarity index based query preprocessing mechanism for multiapplication sharing wireless sensor networks

In multiapplication sharing wireless sensor networks, various application queries exhibit similarity in their spatial, temporal, and sensing attribute requirements, thus result in redundant sensing tasks. The dissemination and execution of such redundant sensing tasks cause network traffic overhead and quick energy drop of the sensor nodes. Existing task scheduling and allocation mechanisms focus on reducing upstream traffic by maximizing data sharing among sensing tasks. However, downstream traffic due to sensing tasks dissemination plays a crucial role in large-scale WSNs and required to be addressed. This paper proposes a query similarity index based query preprocessing mechanism that prevents the generation of redundant sensing tasks by creating a common query corresponding to the overlapping functional requirements of the queries and reduces the downstream as well as upstream traffic significantly. The performance evaluation reveals approximately 60% reduction in downstream traffic, 20–40% reduction in upstream traffic, and 40% reduction in energy consumption when compared with state-of-the-art mechanisms.

     

Efficient Resource Allocation for Policy-Based Wireless/Wireline Interworking

This paper proposes efficient resource allocation techniques for a policy-based wireless/wireline interworking architecture, where quality of service (QoS) provisioning and resource allocation is driven by the service level agreement (SLA). For end-to-end IP QoS delivery, each wireless access domain can independently choose its internal resource management policies to guarantee the customer access SLA (CASLA), while the border-crossing traffic is served by a core network following policy rules to meet the transit domain SLA (TRSLA). Particularly, we propose an engineered priority resource sharing scheme for a voice/data integrated wireless domain, where the policy rules allow cellular-only access or cellular/WLAN interworked access. By such a resource sharing scheme, the CASLA for each service class is met with efficient resource utilization, and the interdomain TRSLA bandwidth requirement can be easily determined. In the transit domain, the traffic load fluctuation from upstream access domains is tackled by an inter-TRSLA resource sharing technique, where the spare capacity from underloaded TRSLAs can be exploited by the overloaded TRSLAs to improve resource utilization. Advantages of the inter-SLA resource sharing technique are that the core network service provider can freely design the policy rules that define underload and overload status, determine the bandwidth reservation, and distribute the spare resources among bandwidth borrowers, while all the policies are supported by a common set of resource allocation techniques.     

Extensible signaling for temporal resource sharing

The Internet is rapidly evolving from a network that provides basic best-effort communication service to an infrastructure capable of supporting complex value-added services. These services typically have multiple fluffs with interdependent resource requirements. These dependencies provide opportunities to share the same set of resources among related flows over time leading to significant resource gains. We call this type of sharing temporal resource sharing. Exploiting temporal sharing requires support in the signaling protocol that performs resource allocation for the related flows. We examine the problem of supporting temporal sharing in a signaling protocol. This paper makes the case that temporal sharing support must be designed to be extensible, so that service providers can define and implement new sharing behaviors without having to modify the signaling protocol. We motivate the need for an extensible design by showing that the range of possible temporal sharing behaviors is large and supporting the most general forms of temporal sharing is computationally expensive. We then present a design for extensible signaling support for temporal sharing. We have implemented the temporal sharing design presented in this paper in the Beagle signaling protocol. We present an evaluation of the Beagle design and contrast it with other signaling protocols like RSVP and Tenet-2     

Source time scale and optimal buffer/bandwidth tradeoff forheterogeneous regulated traffic in a network node

We study the problem of resource allocation and control for a network node with regulated traffic. Both guaranteed lossless service and statistical service with small loss probability are considered. We investigate the relationship between source characteristics and the buffer/bandwidth tradeoff under both services. Our contributions are the following. For guaranteed lossless service, we find that the optimal resource allocation scheme suggests that sources sharing a network node with finite bandwidth and buffer space divide into groups according to time scales defined by their leaky-bucket parameters. This time-scale separation determines the manner by which the buffer and bandwidth resources at the network node are shared among the sources. For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexer using the “extremal” on-off, periodic sources. Under this approach, the optimal resource allocation for statistical service is achieved by maximizing both the benefits of buffering sharing and bandwidth sharing. The optimal buffer/bandwidth tradeoff is again determined by a time-scale separation