204,070 research outputs found

    Social-aware Forwarding in Opportunistic Wireless Networks: Content Awareness or Obliviousness?

    Full text link
    With the current host-based Internet architecture, networking faces limitations in dynamic scenarios, due mostly to host mobility. The ICN paradigm mitigates such problems by releasing the need to have an end-to-end transport session established during the life time of the data transfer. Moreover, the ICN concept solves the mismatch between the Internet architecture and the way users would like to use it: currently a user needs to know the topological location of the hosts involved in the communication when he/she just wants to get the data, independently of its location. Most of the research efforts aim to come up with a stable ICN architecture in fixed networks, with few examples in ad-hoc and vehicular networks. However, the Internet is becoming more pervasive with powerful personal mobile devices that allow users to form dynamic networks in which content may be exchanged at all times and with low cost. Such pervasive wireless networks suffer with different levels of disruption given user mobility, physical obstacles, lack of cooperation, intermittent connectivity, among others. This paper discusses the combination of content knowledge (e.g., type and interested parties) and social awareness within opportunistic networking as to drive the deployment of ICN solutions in disruptive networking scenarios. With this goal in mind, we go over few examples of social-aware content-based opportunistic networking proposals that consider social awareness to allow content dissemination independently of the level of network disruption. To show how much content knowledge can improve social-based solutions, we illustrate by means of simulation some content-oblivious/oriented proposals in scenarios based on synthetic mobility patterns and real human traces.Comment: 7 pages, 6 figure

    Optimization of Mobility Parameters using Fuzzy Logic and Reinforcement Learning in Self-Organizing Networks

    Get PDF
    In this thesis, several optimization techniques for next-generation wireless networks are proposed to solve different problems in the field of Self-Organizing Networks and heterogeneous networks. The common basis of these problems is that network parameters are automatically tuned to deal with the specific problem. As the set of network parameters is extremely large, this work mainly focuses on parameters involved in mobility management. In addition, the proposed self-tuning schemes are based on Fuzzy Logic Controllers (FLC), whose potential lies in the capability to express the knowledge in a similar way to the human perception and reasoning. In addition, in those cases in which a mathematical approach has been required to optimize the behavior of the FLC, the selected solution has been Reinforcement Learning, since this methodology is especially appropriate for learning from interaction, which becomes essential in complex systems such as wireless networks. Taking this into account, firstly, a new Mobility Load Balancing (MLB) scheme is proposed to solve persistent congestion problems in next-generation wireless networks, in particular, due to an uneven spatial traffic distribution, which typically leads to an inefficient usage of resources. A key feature of the proposed algorithm is that not only the parameters are optimized, but also the parameter tuning strategy. Secondly, a novel MLB algorithm for enterprise femtocells scenarios is proposed. Such scenarios are characterized by the lack of a thorough deployment of these low-cost nodes, meaning that a more efficient use of radio resources can be achieved by applying effective MLB schemes. As in the previous problem, the optimization of the self-tuning process is also studied in this case. Thirdly, a new self-tuning algorithm for Mobility Robustness Optimization (MRO) is proposed. This study includes the impact of context factors such as the system load and user speed, as well as a proposal for coordination between the designed MLB and MRO functions. Fourthly, a novel self-tuning algorithm for Traffic Steering (TS) in heterogeneous networks is proposed. The main features of the proposed algorithm are the flexibility to support different operator policies and the adaptation capability to network variations. Finally, with the aim of validating the proposed techniques, a dynamic system-level simulator for Long-Term Evolution (LTE) networks has been designed

    Task allocation in dynamic networks of satellites

    No full text
    The management of distributed satellite systems requires the coordination of a large number of heterogeneous spacecraft. Task allocation in such a system is complicated by limited communication and individual satellite dynamics. Previous work has shown that task allocation using a market-based mechanism can provide scalable and efficient management of static networks; in this paper we extend this work to determine the impact of dynamic topologies. We develop a Keplerian mobility model to describe the topology of the communication network over time. This movement model is then used in simulation to show that the task allocation mechanism does not show a significant decrease in effectiveness from the static case, reflecting the suitability distributed market-based control to the highly dynamic environment

    zCap: a zero configuration adaptive paging and mobility management mechanism

    Get PDF
    Today, cellular networks rely on fixed collections of cells (tracking areas) for user equipment localisation. Locating users within these areas involves broadcast search (paging), which consumes radio bandwidth but reduces the user equipment signalling required for mobility management. Tracking areas are today manually configured, hard to adapt to local mobility and influence the load on several key resources in the network. We propose a decentralised and self-adaptive approach to mobility management based on a probabilistic model of local mobility. By estimating the parameters of this model from observations of user mobility collected online, we obtain a dynamic model from which we construct local neighbourhoods of cells where we are most likely to locate user equipment. We propose to replace the static tracking areas of current systems with neighbourhoods local to each cell. The model is also used to derive a multi-phase paging scheme, where the division of neighbourhood cells into consecutive phases balances response times and paging cost. The complete mechanism requires no manual tracking area configuration and performs localisation efficiently in terms of signalling and response times. Detailed simulations show that significant potential gains in localisation effi- ciency are possible while eliminating manual configuration of mobility management parameters. Variants of the proposal can be implemented within current (LTE) standards
    corecore