The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper investigates the problem of power allocation, in the presence of a malicious adversary. For this scenario, we consider a source, a destination and full-duplex (FD) relay, that receives private messages and transmits jamming signals on the same time and frequency band. In this system model, we assume the adversary can jam legitimate link or eavesdrop the private message, and benefit from...
In this paper, we investigate the energy-efficient transmission problem by resource allocation in SCMA networks. We formulate it as an optimization problem to maximize the network energy efficiency (EE) subject to quality-of-service (QoS) requirements, codebook assignment, power allocation, and subcarrier reuse constraints. Due to its mixed combinatory, we separate codebook assignment and power allocation...
In this paper, we apply access class barring (ACB) scheme and sparse code multiple access (SCMA) technique to massive machine type communication devices (MTCDs) communications, and propose a resource allocation scheme to increase the number of successful accesses. The proposed scheme employs ACB to control the number of massive random access (RA) attempts during preamble transmission in physical random...
In this paper, a novel approach for solving the `Water- filling problem with peak power constraints for individual resources' also known as Cave-Filling Problem (CFP) is proposed. The proposed algorithm calculates a lower bound for the number of resources that are assigned positive powers, K, and then calculates the K powers only once. This lowers the total computational cost of the proposed algorithm...
The research on search and rescue after landslide is very important for improving the victims' survival rate. In this paper, the improved Truncated Lévy walks are used to simulate rescue teams' search behaviors. We propose a cooperative rescue plan based on distributed auction mechanism and simulate its effect in three disaster scenarios "fatal", "serious" and "normal"...
We propose to realize availability-aware service provisioning in EONs with FIPP-p-cycles and bandwidth-squeezed restoration. Simulation results show that the proposed schemes are more reliable and spectrum-efficient than the existing approach.
Task allocation for Multi UCAVs (unmanned combat aerial vehicle) cooperatively attacking targets is a complex NP-hard nonlinear multiple objective optimization problem with strong constraints. A new method for solving the problem is proposed based on an improved particle swarm optimization (PSO) algorithm which has parallelism, high resolution and high efficiency. Firstly, an improved PSO other than...
The cloud landscape is becoming increasingly diverse, with more businesses, E-science moving their services to the cloud, more resource providers entering the market to meet these growing demands. Resource allocation is a central component of this landscape. Commonly used fixed-price allocation is inefficient due to its inflexible nature. Novel approaches, using market mechanisms such as auctions,...
In this paper, we present an efficient algorithm for Nash bargaining solution (NBS). While NBS can be deployed to allocate limited resources to multiple users fairly and optimally, it requires significantly high computational complexity to find NBS, in particular, as the number of users becomes large. In order to reduce the complexity for NBS, we propose to adopt a coalition formation based approach,...
In this paper, we analyze the ergodic spectral efficiency upper bound of a large-scale MIMO and the key technologies, and present new approaches for detection and power allocation. Assuming arbitrary antenna correlation and user distributions, we derive approximations of achievable rates with zero forcing(ZF), maximum ratio combining (MRC), minimum mean squared error (MMSE) and eigen-value decomposition...
This paper evaluates the performance of partition scheme with first-last fit spectrum allocation for elastic optical networks. The scheme intends to increase the number of contiguous aligned available slots, and hence suppresses the blocking probability. The partition approach creates more aligned available slots by separating the spectrum allocation of the non-disjoint connections. The first-last...
In this paper, a distributed fair algorithm is proposed to address the resource allocation problem in the cognitive femtocell network. The cognitive functionalities equipped in femtocells enable us to effectively identify the qualified resource blocks (RBs), thus we can mitigate inter-cell interference. By exploiting the satisfaction degree and the channel state difference, the proposed distributed...
This paper investigates secrecy rate optimization for a multicasting network, in which a transmitter broadcasts the same information to multiple legitimate users in the presence of multiple eavesdroppers. In order to improve the achievable secrecy rates, private jammers are employed to generate interference to confuse the eavesdroppers. These private jammers charge the legitimate transmitter for their...
This paper proposes two wavelength overprovisioning strategies that can be used to improve the performance of path restoration in optical core networks under dynamic traffic conditions while considering single fiber link failure scenarios. The study presented in the paper shows that with the two proposed schemes it is possible to achieve nearly the same level of average connection availability and...
This paper proposes a lightpath threshold adaptation algorithm for dispersion-adaptive first-last fit spectrum allocation scheme in elastic optical networks in order to improve the performance in terms of call blocking in the network. The proposed algorithm adapts the suitable lightpath threshold value, denoted by β, according to the traffic condition in the network. The dispersion-adaptive first-last...
Service function chaining (SFC) refers to as an order set composed of multiple service functions (SFs) that specific flows should be processed. In this paper, we formulate an optimization problem to efficiently utilize the network resource in SFC-enabled networks by determining the amount of flows assigned to each link and SF instance. Simulation results demonstrate that the proposed optimal solution...
We present an optimal and efficient algorithm for finding a shortest path in an elastic optical network. The algorithm is an adaptation of the Dijkstra shortest path algorithm, where we take into account the spectrum continuity and contiguity constraints, and a limit on the path length. The adaptation redefines the node label in the Dijkstra algorithm, allows for revisiting nodes even at a higher...
Dynamic spectrum access (DAS) is an efficient way to redistribute spare channels among users. Conventionally, dynamic spectrum access is conducted through (double) spectrum auction, where a third-party auctioneer collects bids from buyers and sellers, and determines the spectrum allocation. Rather than placing bids only on individual channels, combinatorial spectrum auction allows buyers to express...
The Ada programming language has been used for more than 12 years in our classes of concurrent and real time programming. This teaching includes also programming assignment based on various equipment and in particular on railway scale models. Moreover, students have had inexpensive Ada 95 programming environments on PC/Windows at their disposal for several years. They are therefore able to prepare...
This paper proposes a delay-aware resource provisioning policy for virtualized wireless networks (VWNs) to minimize the total average transmit power while holding the minimum required average rate of each slice and maximum average packet transmission delay for each user. The proposed cross-layer optimization problem is inherently non-convex and has high computational complexity. To develop an efficient...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.