Sharif Digital Repository

In this letter, we improve the tradeoff among the downlink (DL) rates of service providers (SPs), provided by a mobile virtual network operator (MVNO) using non-orthogonal multiple access (NOMA) technique. In this respect, NOMA provides a suitable opportunity for the MVNO to share resources among SPs more efficiently. Regarding interaction among the DL rates provided for SPs we formulate our resource allocation problem as a multiobjective optimization problem (MOOP) while taking into account user fairness. By using the weighted Tchebycheff technique, we are able to solve the formulated MOOP by considering different tradeoffs among DL rates of different SPs. Our numerical results show that by... 

In this letter, we improve the tradeoff among the downlink (DL) rates of service providers (SPs), provided by a mobile virtual network operator (MVNO) using non-orthogonal multiple access (NOMA) technique. In this respect, NOMA provides a suitable opportunity for the MVNO to share resources among SPs more efficiently. Regarding interaction among the DL rates provided for SPs we formulate our resource allocation problem as a multiobjective optimization problem (MOOP) while taking into account user fairness. By using the weighted Tchebycheff technique, we are able to solve the formulated MOOP by considering different tradeoffs among DL rates of different SPs. Our numerical results show that by... 

In this paper, we focus on a cognitive network scenario, comprised of a WLAN overlaid on a network with time-scheduled primary users. WiMAX is an example of such primary networks. For time-scheduled primary users simple On-Off traffic model with exponential durations is not valid anymore. In this scenario, the cognitive nodes (CNs) hear downlink map (DL-MAP) and thus, know the frequency and time locations of all allocated slots at each frame. Then, cognitive nodes contend with each other in order to transmit their fixed size packets based on IEEE 802.11 MAC protocol. Since the number of empty slots at each frame is variable each packet transmission in cognitive network prolongs a random... 

Frame aggregation (FA) mechanisms improve the throughput of WLANs. In this paper, the effect of the FA mechanism on the throughput of wireless local area networks (WLANs) has been investigated. To this end, we propose an analytical model in order to analyze an IEEE 802.11n network comprised of an access point (AP) and several conventional nodes (CNs), all in the coverage area of each other. With respect to the heavier download traffic compared to the upload one, in our scenario, only the AP uses an FA mechanism and the other nodes use the basic IEEE 802.11 standard. In our proposed analytical model, the maximum downlink (DL) throughput is derived. Regarding the asymmetry among nodes, our... 

In this letter, we focus on evaluating Peak Age-of-Information (PAoI) in a typical wireless link in which each packet transmission is successful with some probability. The receiver applies a hybrid ARQ (HARQ) scheme such as chase combining to decode each packet. Thus, several transmissions of the same packet lead to a sequence of strictly increasing successful packet reception probabilities. Moreover, the number of transmissions for each packet is limited. In this link, when the packets are generated randomly, we compare two queueing policies at the transmitter, i.e., blocking and preemptive. The former exploits the capability of HARQ to send the packet to the destination sooner, but the... 

In this paper, we propose a new delayed data offloading scheme by exploiting full-duplex (FD) device-to-device (D2D) communications. To this end, we consider a scenario in which a common file is requested by a subset of users in different times and with different maximum tolerable delays. Moreover, a maximum specific bandwidth is dedicated for data transmission. In order to send the file in the specific bandwidth, we use multicasting alongside FD D2D communications. Thanks to the fact that users have different deadlines, we divide them into non-overlapping groups, i.e., coalitions, to receive the file in distinct intervals. In order to guarantee the tolerable delay of all users, a coalition... 

Regarding the dynamic nature of cognitive radio networks and the delay of the central decision algorithms due to collecting necessary information in a multi-hop wireless network, distributed resource allocation algorithms are of crucial importance. In this paper we propose a new distributed resource allocation algorithm that properly selects link/frequency in a multi-hop cognitive radio network for delay sensitive applications. This algorithm, uses the locally collected information from neighboring nodes to make suitable routing decisions regarding the dynamic environment and the behavior of the neighbors. We consider the delay as the routing criterion, consisting the queueing delay and the... 

In this paper, we propose a data offloading algorithm in a network comprised of a macro base station and a few number of WiFi access points with overlapped coverage areas. The main goal of our algorithm is how to assign offloaded mobile stations (MSs) to access points (APs). Our approach in proposing the algorithm is based on mapping the problem onto finding a suitable matching algorithm, in order to minimize the average delay of the offloaded packets as one of the main QoS parameters on the one hand and to maximize the utility of the APs on the other hand. The utility of each AP is considered to be a combination of monetary benefit due to offloading service and the cost due to extra energy... 

Spectrum mobility in cognitive radio networks not only enables the secondary users to guarantee the desired QoS of the primary users but also grants an efficient exploitation of the available spectrum holes in the network. In this paper, we propose a probabilistic approach in determining the initial and target channels for the handoff procedure in a single secondary user network. To characterize the network, a queuing theoretical framework is introduced, and 'stay' and 'change' handoff policies are both addressed. The performance of the secondary user in terms of average sojourn and extended service times for secondary connections is analyzed, and convex optimization problems with the... 

Data traffic is increasing in recent years and small cell densification is a promising solution for handling the consequences of this growth. However, it faces with backhual' constraint which limits its efficiency. Caching the popular files near to the small base stations (SBSs) is an effective technique which decreases usage of backhual links. In this paper, we model the network by a graph and propose a new popular files' placement based on graph coloring for which different powerful solutions and algorithms have been presented in the literature. In this respect, we propose an algorithm to fill the caches of SBSs with the popular files and show the efficiency of our proposed algorithm... 

Caching the popular files in the memories of small base stations (SBSs) is an effective solution to the limited capacity of wireless backhaul links. The efficiency of caching depends on the proper design of the content placement. This is more challenging when the SBSs have overlapped coverage and especially when the users are also mobile. In this letter, we exploit the concept of graph-coloring and model the connection between SBSs and users as well as user mobilities, through a weighted graph in which SBSs are its vertices, and propose some algorithms to color it effectively. Then, we fill the memory of colored SBSs with popular content accordingly. © 1967-2012 IEEE  

In this paper, we propose a new analytical model in order to evaluate the throughput of a wireless tandem network coding. Our analytical model is based on a multi-class open queueing network. In this model, we include two basic processes of network coding, i.e., packets combination and packets multicasting, in a suitable way considering the constraints of the queueing networks. To this end, we consider the coded packets as new classes of customers. In our model we consider the arrival and departure rates in and from the wireless nodes in steady state. By solving the related traffic equations and applying the stability condition, we compute the maximum stable throughput, i.e., the maximum... 

In this paper, we study the effect of some traffic patterns on energy consumption for IEEE 802.16e nodes while operating in the sleep mode. In the sleep mode, a Mobile Subscribe Station (MSS) sleeps for a sleep interval and wakes up at the end of this interval in order to check buffered packet(s) at Base Station (BS) destined to it. If there is no packet, the MSS increases the sleep window up to the maximum value and sleeps again. For a more general traffic pattern, we evaluate the average power consumption. Based on our analysis, we conclude that traffic pattern plays an important role in power consumption. ©2007 IEEE  

In this paper, we analyze the tradeoff between the profits gained by mobile virtual network operators (MVNOs) in an orthogonal frequency division multiple access (OFDMA)-based virtualized wireless network (VWN). In this respect, MVNOs rent the network resources from a mobile network operator (MNO) to create virtual resources based on allocated rates and the cost due to allocated transmit powers in two different strategies: resource-based isolation strategy and rate-based isolation strategy. In resource-based isolation strategy, it is assumed that the whole bandwidth in each base station is divided equally between MVNOs whereas in rate-based isolation strategy, the whole bandwidth in each... 

This paper introduces a well-balanced second-order finite volume scheme, based on the Q-scheme of Roe, for simulating granular type flows. The proposed method is applied to solve the incompressible Euler equations under Savage-Hutter assumptions. The model is derived in a local coordinate system along a non-erodible bed to take its curvature into account. Moreover, simultaneous appearance of flowing/static regions is simulated by considering a basal friction resistance which keeps the granular flow from moving when the angle of granular flow is less than the angle of repose. The proposed scheme preserves stationary solutions up to second order and deals with different situations of wet/dry... 

In this paper, we investigate the resource allocation in an underlay cognitive radio network when multiple primary and secondary users are served via multi-carrier non-orthogonal multiple access (MC-NOMA) scheme. Our main objective is to maximize the sum rate subject to a minimum guaranteed rate for the primary users. The performance of the system is highly affected by the power allocation and subchannel assignment for all users. Hence, our optimization problem is formulated as a nonconvex mixed integer non-linear program whose global optimum can be found through a computationally infeasible exhaustive search. To overcome this challenge, we propose an efficient iterative algorithm to jointly... 

Cloud Manufacturing (CM) as a successful manufacturing business model and a major driver of Industry 4.0 has attracted a lot of attention in recent years. CM idea aims to streamline the on-demand provisioning of manufacturing resources and capabilities as services, providing end-users with flexible and scalable services accessible through global networks. This idea created many opportunities and challenges. One of the critical challenges is resource allocation, which determines who interacts with whom and how in the CM platform. The type of the platform is a determining factor for the selection of the appropriate resource allocation. To analyze the impact of the allocation on the utilities,... 

With unbounding the manufacturing resources and capabilities from shopfloors and being available as on-demand services for everyone who needs, the service allocation problem becomes critical. Despite of private Cloud Manufacturing platforms in which the service allocation problem is an optimization matching problem, in public Cloud Manufacturing platforms the service allocation problem is a matching game between manufacturing providers and consumers. This is a complex form of games that has two sides, one side is the players that has manufacturing resources and capabilities and the other side is the players who want to receives such services. In this paper, we present a matching game model... 

Online manufacturing platforms are spreading in the manufacturing industry in the shade of Cloud Manufacturing systems. The paper manipulates a matching mechanism for public Cloud Manufacturing platforms based on the Intuitionistic Fuzzy Sets Theory, VIKOR method, and Deferred Acceptance algorithm. The VIKOR method provides a rational, scientific, and systematic approach to enable providers and consumers to evaluate the attributes of each other and develop their preference lists. The method is augmented by the Intuitionistic Fuzzy Sets Theory to grasp the high level of vagueness and uncertainty in the process of preference list development. The utilization of Deferred Acceptance algorithm... 

Online manufacturing markets are new emerging types of markets that are spreading in the shade of public Cloud Manufacturing. This paper introduces a public Cloud Manufacturing market and denotes its differences from a private one. Public Cloud Manufacturing enables service-oriented manufacturing models for everyone in society. The prosperity of such market is tied to appropriate matching between providers to consumers. This paper elaborates on a mechanism to prescribe an appropriate allocation between resources and demands in this public market. The mechanism exploits the VIKOR method to develop preference lists for providers and consumers, the method also is augmented by the Intuitionistic...