104 research outputs found

    Design of Ad Hoc Wireless Mesh Networks Formed by Unmanned Aerial Vehicles with Advanced Mechanical Automation

    Get PDF
    Ad hoc wireless mesh networks formed by unmanned aerial vehicles (UAVs) equipped with wireless transceivers (access points (APs)) are increasingly being touted as being able to provide a flexible "on-the-fly" communications infrastructure that can collect and transmit sensor data from sensors in remote, wilderness, or disaster-hit areas. Recent advances in the mechanical automation of UAVs have resulted in separable APs and replaceable batteries that can be carried by UAVs and placed at arbitrary locations in the field. These advanced mechanized UAV mesh networks pose interesting questions in terms of the design of the network architecture and the optimal UAV scheduling algorithms. This paper studies a range of network architectures that depend on the mechanized automation (AP separation and battery replacement) capabilities of UAVs and proposes heuristic UAV scheduling algorithms for each network architecture, which are benchmarked against optimal designs.Comment: 12 page

    Coalitions in Cooperative Wireless Networks

    Full text link
    Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coalition structure, i.e., set of coalitions from which users have no incentives to defect, depends on the manner in which the rate gains are apportioned among the cooperating users. Specifically, the stability of the grand coalition (GC), i.e., the coalition of all users, is studied. Transmitter and receiver cooperation in an interference channel (IC) are studied as illustrative cooperative models to determine the stable coalitions for both flexible (transferable) and fixed (non-transferable) apportioning schemes. It is shown that the stable sum-rate optimal coalition when only receivers cooperate by jointly decoding (transferable) is the GC. The stability of the GC depends on the detector when receivers cooperate using linear multiuser detectors (non-transferable). Transmitter cooperation is studied assuming that all receivers cooperate perfectly and that users outside a coalition act as jammers. The stability of the GC is studied for both the case of perfectly cooperating transmitters (transferrable) and under a partial decode-and-forward strategy (non-transferable). In both cases, the stability is shown to depend on the channel gains and the transmitter jamming strengths.Comment: To appear in the IEEE Journal on Selected Areas in Communication, Special Issue on Game Theory in Communication Systems, 200

    Cellular Systems with Many Antennas: Large System Analysis under Pilot Contamination

    Full text link
    Base stations with a large number of transmit antennas have the potential to serve a large number of users simultaneously at higher rates. They also promise a lower power consumption due to coherent combining at the receiver. However, the receiver processing in the uplink relies on the channel estimates which are known to suffer from pilot interference. In this work, we perform an uplink large system analysis of multi-cell multi-antenna system when the receiver employs a matched filtering with a pilot contaminated estimate. We find the asymptotic Signal to Interference plus Noise Ratio (SINR) as the number of antennas and number of users per base station grow large while maintaining a fixed ratio. To do this, we make use of the similarity of the uplink received signal in a multi-antenna system to the representation of the received signal in CDMA systems. The asymptotic SINR expression explicitly captures the effect of pilot contamination and that of interference averaging. This also explains the SINR performance of receiver processing schemes at different regimes such as instances when the number of antennas are comparable to number of users as well as when antennas exceed greatly the number of users. Finally, we also propose that the adaptive MMSE symbol detection scheme, which does not require the explicit channel knowledge, can be employed for cellular systems with large number of antennas.Comment: 5 pages, 4 figure

    Uplink Linear Receivers for Multi-cell Multiuser MIMO with Pilot Contamination: Large System Analysis

    Full text link
    Base stations with a large number of transmit antennas have the potential to serve a large number of users at high rates. However, the receiver processing in the uplink relies on channel estimates which are known to suffer from pilot interference. In this work, making use of the similarity of the uplink received signal in CDMA with that of a multi-cell multi-antenna system, we perform a large system analysis when the receiver employs an MMSE filter with a pilot contaminated estimate. We assume a Rayleigh fading channel with different received powers from users. We find the asymptotic Signal to Interference plus Noise Ratio (SINR) as the number of antennas and number of users per base station grow large while maintaining a fixed ratio. Through the SINR expression we explore the scenario where the number of users being served are comparable to the number of antennas at the base station. The SINR explicitly captures the effect of pilot contamination and is found to be the same as that employing a matched filter with a pilot contaminated estimate. We also find the exact expression for the interference suppression obtained using an MMSE filter which is an important factor when there are significant number of users in the system as compared to the number of antennas. In a typical set up, in terms of the five percentile SINR, the MMSE filter is shown to provide significant gains over matched filtering and is within 5 dB of MMSE filter with perfect channel estimate. Simulation results for achievable rates are close to large system limits for even a 10-antenna base station with 3 or more users per cell.Comment: Accepted for publication in IEEE Transactions on Wireless Communication

    A Colonel Blotto Game for Interdependence-Aware Cyber-Physical Systems Security in Smart Cities

    Full text link
    Smart cities must integrate a number of interdependent cyber-physical systems that operate in a coordinated manner to improve the well-being of the city's residents. A cyber-physical system (CPS) is a system of computational elements controlling physical entities. Large-scale CPSs are more vulnerable to attacks due to the cyber-physical interdependencies that can lead to cascading failures which can have a significant detrimental effect on a city. In this paper, a novel approach is proposed for analyzing the problem of allocating security resources, such as firewalls and anti-malware, over the various cyber components of an interdependent CPS to protect the system against imminent attacks. The problem is formulated as a Colonel Blotto game in which the attacker seeks to allocate its resources to compromise the CPS, while the defender chooses how to distribute its resources to defend against potential attacks. To evaluate the effects of defense and attack, various CPS factors are considered including human-CPS interactions as well as physical and topological characteristics of a CPS such as flow and capacity of interconnections and minimum path algorithms. Results show that, for the case in which the attacker is not aware of the CPS interdependencies, the defender can have a higher payoff, compared to the case in which the attacker has complete information. The results also show that, in the case of more symmetric nodes, due to interdependencies, the defender achieves its highest payoff at the equilibrium compared to the case with independent, asymmetric nodes
    corecore