Topology-Transparent Scheduling Schemes for Ad Hoc Networks 
[back to main]
Contact Hwee-Pink Tan [tanhp(at)tcd(dot)ie], Daniele Miorandi [daniele(dot)miorandi(at)create-net(dot)org] and Michele Zorzi [zorzi(at)ing(dot)unife(dot)it]

Context
Starting with the seminal paper of Gupta and Kumar on the capacity of wireless networks, various researchers have, in the last few years, addressed the limiting performance, in terms of throughput and delay, of ad hoc networks.

Overview
In our work, we investigate the limiting properties, in terms of capacity and delay, of an ad hoc network employing a topology-transparent scheduling scheme. In particular, we focus on Time-Spread Multiple Access (TSMA) protocols, which are able to offer a deterministic upper bound on the access delay. The analysis is based on some asymptotic (focusing) properties of geometric random graphs. The analytical framework may be applied to both static and mobile networks. The obtained results are compared with the results present in the literature for the case of an optimum (centralized) scheduler.

Related Publications

  • Daniele Miorandi, Hwee-Pink Tan and Michele Zorzi. Ad Hoc Networks with Topology-Transparent Scheduling Schemes: Scaling Laws and Capacity / Delay Tradeoffs. Proc. of the 4th IEEE WiOpt, April 2006.