Loading...
Search for: network-resources
0.007 seconds

    Mobile cloud management: A new framework

    , Article IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC, 9 September 2012 through 12 September 2012 ; September , 2012 , Pages 48-53 ; 9781467325691 (ISBN) Salehi, M. J ; Khalaj, B. H ; Katz, M ; Fazelnia, G ; Karimi, P ; Sharif University of Technology
    2012
    Abstract
    Smartphones can be viewed as resource pools capable of communicating with their outside world. Such communication capabilities provide unique opportunity for sharing resources, which would result in new possibilities for end users. In this paper, we present a new framework designed for managing mobile local networks, also referred to as Mobile Clouds. In this framework, mobility of nodes is managed by selecting one leader for each cloud, which is responsible for all cloud-level decisions, as well as processing all incoming data from other users. We also evaluate and discuss our proposed framework under different scenarios  

    A surrogate optimization-based mechanism for resource allocation and routing in networks with strategic agents

    , Article IEEE Transactions on Automatic Control ; Volume 64, Issue 2 , 2019 , Pages 464-479 ; 00189286 (ISSN) Farhadi, F ; Golestani, S. J ; Teneketzis, D ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    We consider a mechanism design problem for the joint flow control and multipath routing in informationally decentralized networks with strategic agents. Based on a surrogate optimization approach, we propose an incentive mechanism that strongly implements the social-welfare maximizing outcome in Nash equilibria. This mechanism possesses several other desirable properties, including individual rationality and budget balance at equilibrium. More importantly, in contrast to the existing literature on the network resource allocation mechanisms, the proposed mechanism is dynamically stable, meaning that the Nash equilibrium (NE) of the game induced by the mechanism can be learned by the agents in... 

    An efficient spam mail detection by counter technique

    , Article World Academy of Science, Engineering and Technology ; Volume 50 , May , 2011 , Pages 573-576 ; 2010376X (ISSN) Kholghi, R ; Behnam Roudsari, S ; Nemaney Pour, A ; Sharif University of Technology
    Abstract
    Spam mails are unwanted mails sent to large number of users. Spam mails not only consume the network resources, but cause security threats as well. This paper proposes an efficient technique to detect, and to prevent spam mail in the sender side rather than the receiver side. This technique is based on a counter set on the sender server. When a mail is transmitted to the server, the mail server checks the number of the recipients based on its counter policy. The counter policy performed by the mail server is based on some pre-defined criteria. When the number of recipients exceeds the counter policy, the mail server discontinues the rest of the process, and sends a failure mail to sender of... 

    An efficient spam mail detection by counter technique

    , Article World Academy of Science, Engineering and Technology ; Volume 74 , May , 2011 , Pages 579-582 ; 2010376X (ISSN) Kholghi, R ; Roudsari, S. B ; Pour, A. N ; Sharif University of Technology
    2011
    Abstract
    Spam mails are unwanted mails sent to large number of users. Spam mails not only consume the network resources, but cause security threats as well. This paper proposes an efficient technique to detect, and to prevent spam mail in the sender side rather than the receiver side. This technique is based on a counter set on the sender server. When a mail is transmitted to the server, the mail server checks the number of the recipients based on its counter policy. The counter policy performed by the mail server is based on some pre-defined criteria. When the number of recipients exceeds the counter policy, the mail server discontinues the rest of the process, and sends a failure mail to sender of... 

    On social-aware content caching for D2D-enabled cellular networks with matching theory

    , Article IEEE Internet of Things Journal ; 2017 ; 23274662 (ISSN) Li, J ; Liu, M ; Lu, J ; Shu, F ; Zhang, Y ; Bayat, S ; Jayakody, D. N. K ; Sharif University of Technology
    Abstract
    In this paper, the problem of content caching in 5G cellular networks relying on social-aware device-to-device (D2D) communications is investigated. Our focus is on how to efficiently select important users (IUs) and how to allocate content files to the storage of these selected IUs to form a distributed caching system. We aim at proposing a novel approach for minimizing the downloading latency and maximizing the social welfare simultaneously. In particular, we first model the problem of maximizing the social welfare as a many-to-one matching game based on the social property of mobile users. We study this game by exploiting users’ social properties to generate the utility functions of the... 

    Distant-based resource placement in product networks

    , Article 18th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2007, Adelaide, SA, 3 December 2007 through 6 December 2007 ; January , 2007 , Pages 31-35 ; 0769530494 (ISBN); 9780769530499 (ISBN) Imani, N ; Sarbazi Azad, H ; Zomaya, A. Y ; Sharif University of Technology
    2007
    Abstract
    The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this Inherent regularity. This paper introduces some novel algorithms for deriving resource placement schemes in product networks based on the assumed perfect resource placement in their underling basic graphs. © 2007 IEEE  

    Resource placement in Cartesian product of networks

    , Article Journal of Parallel and Distributed Computing ; Volume 70, Issue 5 , 2010 , Pages 481-495 ; 07437315 (ISSN) Imani, N ; Sarbazi-Azad, H ; Zomaya, A.Y ; Sharif University of Technology
    2010
    Abstract
    The utilization of the limited resources of a multiprocessor or multicomputer system is a primary performance issue which is crucial for the design of many scheduling algorithms. While many of the existing parallel machines benefit from a regular product network topology, almost none of the previous resource placement techniques have come to recognize and exploit this inherent regularity. This paper introduces several novel algorithms for deriving resource placement schemes in product networks based on the assumption of perfect resource placement in their underling basic graphs. Our techniques use known schemes for the basic networks as their building blocks for deploying the resource... 

    Load balancing in UTRAN by bipartite graphs

    , Article 4th European Conference on Circuits and Systems for Communications, ECCSC '08, Bucharest, 10 July 2008 through 11 July 2008 ; 2008 , Pages 301-306 ; 9781424424207 (ISBN) Javan, M. R ; Bouzari, S. M ; Tabandeh, M ; Sharif University of Technology
    2008
    Abstract
    3g wireless communication is the next version of mobile networks. Load balancing in networks causes efficient using of network resources. In this paper, we propose an efficient algorithm for load balancing of Radio Network Controllers (RNCs) in Radio Access Networks (RANs). As the characteristics of connections between RNCs and BTSs in a RAN are similar to those of graphs, we make use of graphs to solve our problem. The algorithm is based on the finding a path by which the RNCs could exchange their overloads. By using these paths the algorithm load balances the RNCs in an efficient and fast way. By testing our algorithm on networks with different topology and comparing the results, the... 

    Optimal hierarchical radio resource management for HetNets with flexible backhaul

    , Article IEEE Transactions on Wireless Communications ; Volume 17, Issue 7 , 2018 , Pages 4239-4255 ; 15361276 (ISSN) Omidvar, N ; Liu, A ; Lau, V ; Zhang, F ; Tsang, D. H. K ; Pakravan, M. R ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    Providing backhaul connectivity for macro and pico base stations (BSs) constitutes a significant share of infrastructure costs in future heterogeneous networks (HetNets). To address this issue, the emerging idea of flexible backhaul is proposed. Under this architecture, not all the pico BSs are connected to the backhaul, resulting in a significant reduction in the infrastructure costs. In this regard, pico BSs without backhaul connectivity need to communicate with their nearby BSs in order to have indirect accessibility to the backhaul. This makes the radio resource management (RRM) in such networks more complex and challenging. In this paper, we address the problem of cross-layer RRM in... 

    Energy-spectral efficient resource allocation and power control in heterogeneous networks with D2D communication

    , Article Wireless Networks ; 2018 ; 10220038 (ISSN) Khazali, A ; Sobhi Givi, S ; Kalbkhani, H ; Shayesteh, M. G ; Sharif University of Technology
    Springer New York LLC  2018
    Abstract
    Heterogeneous networks (HetNets) provide the demand for high data rates. In this study, we analyze the coexistence of femtocells and device-to-device (D2D) communication with macrocells. Interference management and decreasing energy consumption are two important issues in HetNets. To this end, we propose an efficient fractional frequency reuse (FFR)-based spectrum partitioning scheme to reduce the cross-tier interference. We also propose to use different optimization problems for resource allocation in different tiers. For this purpose, an energy efficient optimization problem is applied to D2D user equipment. Further, an optimization problem based on the spectral efficiency, i.e.,... 

    On social-aware content caching for d2d-enabled cellular networks with matching theory

    , Article IEEE Internet of Things Journal ; Volume 6, Issue 1 , 2019 , Pages 297-310 ; 23274662 (ISSN) Li, J ; Liu, M ; Lu, J ; Shu, F ; Zhang, Y ; Bayat, S ; Jayakody, D. N. K ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2019
    Abstract
    In this paper, the problem of content caching in 5G cellular networks relying on social-aware device-to-device communications (DTD) is investigated. Our focus is on how to efficiently select important users (IUs) and how to allocate content files to the storage of these selected IUs to form a distributed caching system. We aim at proposing a novel approach for minimizing the downloading latency and maximizing the social welfare simultaneously. In particular, we first model the problem of maximizing the social welfare as a many-to-one matching game based on the social property of mobile users. We study this game by exploiting users' social properties to generate the utility functions of the... 

    Mobility aware distributed topology control in mobile ad-hoc networks using mobility pattern matching

    , Article WiMob 2009 - 5th IEEE International Conference on Wireless and Mobile Computing Networking and Communication, 12 October 2009 through 14 October 2009, Marrakech ; 2009 , Pages 453-458 ; 9780769538419 (ISBN) Khaledi, MH ; Mousavi, S. M ; Rabiee, H. R ; Movaghar, A ; Khaledi, MJ ; Ardakanian, O ; Sharif University of Technology
    Abstract
    Topology control algorithms in mobile ad-hoc networks aim to reduce the power consumption while keeping the topology connected. These algorithms can preserve network resources and increase network capacity. However, few efforts have focused on the issue of topology control in presence of node mobility. One of the notable mobility aware topology control protocols is the "Mobility Aware Distributed Topology Control Protocol". The main drawback of this protocol is on its mobility prediction method. This prediction method assumes linear movements and is unable to cope with sudden changes in the mobile node movements. In this paper, we propose a pattern matching based mobility prediction method... 

    Performance tradeoff of MVNOs in OFDMA-Based virtualized wireless networks

    , Article IEEE Transactions on Vehicular Technology ; Volume 71, Issue 1 , 2022 , Pages 697-712 ; 00189545 (ISSN) Mili, M.R ; Li, S ; Mokhtari, F ; Derakhshani, M ; Ashtiani, F ; Le-Ngoc, T ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2022
    Abstract
    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...