1,366 research outputs found

    A survey of self organisation in future cellular networks

    Get PDF
    This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks

    A Comprehensive Survey of Potential Game Approaches to Wireless Networks

    Get PDF
    Potential games form a class of non-cooperative games where unilateral improvement dynamics are guaranteed to converge in many practical cases. The potential game approach has been applied to a wide range of wireless network problems, particularly to a variety of channel assignment problems. In this paper, the properties of potential games are introduced, and games in wireless networks that have been proven to be potential games are comprehensively discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on Communications, vol. E98-B, no. 9, Sept. 201

    A Survey of Self Organisation in Future Cellular Networks

    Full text link

    Architecture for Cognitive Networking within NASAs Future Space Communications Infrastructure

    Get PDF
    Future space mission concepts and designs pose many networking challenges for command, telemetry, and science data applications with diverse end-to-end data delivery needs. For future end-to-end architecture designs, a key challenge is meeting expected application quality of service requirements for multiple simultaneous mission data flows with options to use diverse onboard local data buses, commercial ground networks, and multiple satellite relay constellations in LEO, MEO, GEO, or even deep space relay links. Effectively utilizing a complex network topology requires orchestration and direction that spans the many discrete, individually addressable computer systems, which cause them to act in concert to achieve the overall network goals. The system must be intelligent enough to not only function under nominal conditions, but also adapt to unexpected situations, and reorganize or adapt to perform roles not originally intended for the system or explicitly programmed. This paper describes architecture features of cognitive networking within the future NASA space communications infrastructure, and interacting with the legacy systems and infrastructure in the meantime. The paper begins by discussing the need for increased automation, including inter-system collaboration. This discussion motivates the features of an architecture including cognitive networking for future missions and relays, interoperating with both existing endpoint-based networking models and emerging information-centric models. From this basis, we discuss progress on a proof-of-concept implementation of this architecture as a cognitive networking on-orbit application on the SCaN Testbed attached to the International Space Station

    Self-organized Relay Selection for Cooperative Transmission in Vehicular Ad-hoc Networks

    Get PDF
    Cooperation is a promising paradigm to improve spatial diversity in vehicular ad-hoc networks. In this paper, we pose a fundamental question: how the greediness and selfishness of individual nodes impact cooperation dynamics in vehicular ad-hoc networks. We map the self-interest-driven relay selection decision-making problems as an automata game formulation and present a non-cooperative game-theoretic analysis. We show that the relay selection game is an ordinal potential game. A decentralized self-organized relay selection algorithm is proposed based on a stochastic learning approach where each player evolves toward a strategic equilibrium state in the sense of Nash. Furthermore, we study the exact outage behavior of the multi-relay decode-and-forward cooperative communication network. Closed-form solutions are derived for the actual outage probability of this multi-relay system in both independent and identically distributed channels and generalized channels, which need not assume an asymptotic or high signal-to-noise ratio. Two tight approximations with low computational complexity are also developed for the lower bound of the outage probability. With the exact closed-form outage probability, we further develop an optimization model to determine optimal power allocations in the cooperative network, which can be combined with the decentralized learning-based relay selection. The analysis of the exact and approximative outage behaviors and the convergence properties of the proposed algorithm toward a Nash equilibrium state are verified theoretically and numerically. Simulation results are also given to demonstrate that the resulting cooperative network induced by the proposed algorithm achieves high energy efficiency, transmission reliability, and network-wide fairness performance

    Applications of Repeated Games in Wireless Networks: A Survey

    Full text link
    A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

    Adaptive resource allocation for cognitive wireless ad hoc networks

    Get PDF
    Widespread use of resource constrained wireless ad hoc networks requires careful management of the network resources in order to maximize the utilization. In cognitive wireless networks, resources such as spectrum, energy, communication links/paths, time, space, modulation scheme, have to be managed to maintain quality of service (QoS). Therefore in the first paper, a distributed dynamic channel allocation scheme is proposed for multi-channel wireless ad hoc networks with single-radio nodes. The proposed learning scheme adapts the probabilities of selecting each channel as a function of the error in the performance index at each step. Due to frequent changes in topology and flow traffic over time, wireless ad hoc networks require a dynamic routing protocol that adapts to the changes of the network while allocating network resources. In the second paper, approximate dynamic programming (ADP) techniques are utilized to find dynamic routes, while solving discrete-time Hamilton-Jacobi-Bellman (HJB) equation forward-in-time for route cost. The third paper extends the dynamic routing to multi-channel multi-interface networks which are affected by channel uncertainties and fading channels. By the addition of optimization techniques through load balancing over multiple paths and multiple wireless channels, utilization of wireless channels throughout the network is enhanced. Next in the fourth paper, a decentralized game theoretic approach for resource allocation of the primary and secondary users in a cognitive radio networks is proposed. The priorities of the networks are incorporated in the utility and potential functions which are in turn used for resource allocation. The proposed game can be extended to a game among multiple co-existing networks, each with different priority levels --Abstract, page iv
    corecore