Throughput Analysis for Wireless Networks with Full-Duplex Radios

This paper investigates the throughput for wireless network with full-duplex radios using stochastic geometry. Full-duplex (FD) radios can exchange data simultaneously with each other. On the other hand, the downside of FD transmission is that it will inevitably cause extra interference to the network compared to half-duplex (HD) transmission. In this paper, we focus on a wireless network of nodes with both HD and FD capabilities and derive and optimize the throughput in such a network. Our analytical result shows that if the network is adapting an ALOHA protocol, the maximal throughput is always achieved by scheduling all concurrently transmitting nodes to work in FD mode instead of a mixed FD/HD mode or HD mode regardless of the network configurations. Moreover, the throughput gain of using FD transmission over HD transmission is analytically lower and upper bounded.Comment: 4 figure

An Analog Baseband Approach for Designing Full-Duplex Radios

Recent wireless testbed implementations have proven that full-duplex communication is in fact possible and can outperform half-duplex systems. Many of these implementations modify existing half-duplex systems to operate in full-duplex. To realize the full potential of full-duplex, radios need to be designed with self-interference in mind. In our work, we use an experimental setup with a patch antenna prototype to characterize the self-interference channel between two radios. In doing so, we form an analytical model to design analog baseband cancellation techniques. We show that our cancellation scheme can provide up to 10 dB improved signal strength, 2.5 bps/Hz increase in rate, and a 10,000 improvement in BER as compared to the RF only cancellation provided by the patch antenna.Comment: 5 pages, 8 figures, to appear in 2013 Asilomar Conference proceeding

Providing End-to-End Delay Guarantees for Multi-hop Wireless Sensor Networks over Unreliable Channels

Wireless sensor networks have been increasingly used for real-time surveillance over large areas. In such applications, it is important to support end-to-end delay constraints for packet deliveries even when the corresponding flows require multi-hop transmissions. In addition to delay constraints, each flow of real-time surveillance may require some guarantees on throughput of packets that meet the delay constraints. Further, as wireless sensor networks are usually deployed in challenging environments, it is important to specifically consider the effects of unreliable wireless transmissions. In this paper, we study the problem of providing end-to-end delay guarantees for multi-hop wireless networks. We propose a model that jointly considers the end-to-end delay constraints and throughput requirements of flows, the need for multi-hop transmissions, and the unreliable nature of wireless transmissions. We develop a framework for designing feasibility-optimal policies. We then demonstrate the utility of this framework by considering two types of systems: one where sensors are equipped with full-duplex radios, and the other where sensors are equipped with half-duplex radios. When sensors are equipped with full-duplex radios, we propose an online distributed scheduling policy and proves the policy is feasibility-optimal. We also provide a heuristic for systems where sensors are equipped with half-duplex radios. We show that this heuristic is still feasibility-optimal for some topologies