Gareth Middleton

Learn More
— Inter-operator spectrum sharing in a wide-area broadband network is considered in this paper. A packet-based cellular model is developed, emphasizing the shift in the telecommunications industry towards IP-based services. In the framework of this architecture, we show the ideal maximum load that the network can handle without excessive delays, and present(More)
— In this paper, we will consider the impact of finite resolution in a receiver analog-digital converter on the performance of square, linearly modulated systems over fading channels. We show that in fading channels, the probability of error in a quantized system cannot be reduced to zero due to the introduction of quantization noise, even for arbitrarily(More)
—When designing distributed wireless networks utilizing shared bandwidth, a critical issue is allocating spatial and temporal resources to streaming information flows. We focus on large networks of half-duplex terminals sharing common bandwidth, and study methods for allocating resources on a fine-grained temporal basis, with specific emphasis on managing(More)
—We present a wide-area, multiflow ad-hoc network model leveraging information-theoretic rate control, emphasizing interfering rather than colliding transmissions. We seek to allocate resources in this network by optimizing scheduling, routing and power control to solve the max-min throughput problem for all flows involved. In general, our time-slotted,(More)
—Resource reuse at the system level is introduced for the realistic urban cellular environment. Our proposal for reuse is presented, and we give a mathematical requirement for allowing resources to be shared: specifically, we find the minimum distance which must separate all active links in order for a minimum SINR to be guaranteed. This sharing proposal(More)
—We introduce the problem of joint routing, scheduling and power control for multiple information flows in half-duplex, interference limited ad-hoc networks. The joint problem of optimizing for throughput is NP-Hard, and so we present an approximation of the problem and a general framework for solving it in O(N 3) time. We attack the problem in two ways,(More)
We consider the problem of allocating resources in large wireless networks in which multiple information flows must be accommodated. In particular, we seek a method for selecting schedules, routes, and power allocations for networks with terminals capable of user-cooperation at the signal level. To that end, we adopt a general information-theoretic(More)
— Recently, new network topologies including relays and meshed networks have emerged as a key technology receiving a lot of attention due the increasing need for additional resources such as spectrum and required high data-rates. In this paper, we identify and describe the novel network topologies that will be able to accommodate the foreseen high data(More)