Conference Paper

A stochastic association mechanism for macro-to-femtocell handover

Centre for Wireless Commun., Univ. of Oulu, Oulu, Finland
DOI: 10.1109/ACSSC.2010.5757801 Conference: Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on
Source: IEEE Xplore


In this paper, we consider a macrocell site underlaid with self-organizing stand-alone femtocells and propose a mechanism for macro-to-femtocell handover, inspired by multi-stage Dutch auctions. The proposed solution introduces a new distributed handover procedure, which does not rely on any centralized coordination typically performed by the macro base stations in existent cellular systems. The applicability of this solution is assessed through system-level simulations using the Monte Carlo approach. When considering the duration of association procedures, results have shown that the distributed mechanism scales well with increasing density of femtocell sites. Additionally, macrocell users benefit from better link quality and less uncoordinated interference generated by the underlay femtocell tier. To illustrate, after performing handover, the co-channel interference experienced by a tagged macrocell user becomes less than one tenth of that in full interference scenario.

Download full-text


Available from: Matti Latva-aho, Aug 18, 2015
  • Source
    • "The same concept has been further extended in [6] to facilitate admission control in Femtocell networks for traffic load balancing among sub-carriers when there are multiple Quality of Service (QoS) classes. Similarly, in [8] the stochastic counter management is combined with a modified Dutch auction and a distributed association mechanism for Macro-to-Femto handover is proposed. According to the proposed scheme, upon arrival of a route request, the corresponding hub of the local network, in which the route request has been issued, executes the algorithm by looking at its routing table to determine what intra-and/or inter-BAN routes are available to the requesting sensor. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider cooperative multi-hop wireless Body Area Networks (BANs), connecting sensor nodes to multiple data sinks, referred to as hubs. Each network comprises a set of sensory devices, as well as a data sink, and the coexisting BANs cooperate in order to enable the sensor nodes to have their data traffic delivered to one of the data sinks. To reach a hub, either located in the local- or a nearby network, each sensor should choose a route and communicate with the relay at the tail of the chosen route. We propose a stochastic route selection mechanism, which takes into account the maximum perceived outage probability, maximum queue utilization factor, and the minimum remaining battery power of the relays of each route to determine how probable the route is to be selected to deliver a requesting sensor node's traffic to a particular hub. The performance of the proposed scheme is assessed through system-level simulations, revealing that the introduced mechanism scales well with the increase of the number of sensor nodes.
    IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2011, Toronto, ON, Canada, September 11-14, 2011; 01/2011
  • Source

  • [Show abstract] [Hide abstract]
    ABSTRACT: We propose distributed matching algorithms for an uplink communication network comprised of multiple femtocell access points (FAPs), multiple wireless operators (WOs) which own multiple macrocell access points (MAPs) and multiple final users (FUs) subscribed to these WOs. In particular, we propose two algorithms: the first algorithm matches the FAPs with the final users (FUs), the resultant matchings of which are then used for the second matching to match the FAPs with the WOs. The key idea behind the proposed algorithms is that the FAPs aid the transmission of the FUs belonging to the WOs by (i) increasing the WO's coverage and (ii) reducing the traffic load of the WO's macrocell access points (MAPs), and in exchange, the WOs provide monetary compensation to the FAPs. We prove that both of the proposed algorithms converge to a group stable matching. Numerical analysis also reveal that the proposed distributed algorithms achieves a performance close to a centralized method, with much less overhead.
    Communications (ICC), 2012 IEEE International Conference on; 01/2012
Show more