4th International ICST Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Research Article

Ad Hoc Networks with Topology-Transparent Scheduling Schemes: Scaling Laws and Capacity/Delay Tradeoffs

  • @INPROCEEDINGS{10.1109/WIOPT.2006.1666465,
        author={Daniele  Miorandi and Hwee-Pink Tan and Michele  Zorzi},
        title={Ad Hoc Networks with Topology-Transparent Scheduling Schemes: Scaling Laws and Capacity/Delay Tradeoffs},
        proceedings={4th International ICST Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks},
        publisher={IEEE},
        proceedings_a={WIOPT},
        year={2006},
        month={8},
        keywords={},
        doi={10.1109/WIOPT.2006.1666465}
    }
    
  • Daniele Miorandi
    Hwee-Pink Tan
    Michele Zorzi
    Year: 2006
    Ad Hoc Networks with Topology-Transparent Scheduling Schemes: Scaling Laws and Capacity/Delay Tradeoffs
    WIOPT
    IEEE
    DOI: 10.1109/WIOPT.2006.1666465
Daniele Miorandi1,*, Hwee-Pink Tan2,*, Michele Zorzi3,*
  • 1: CREATE-NET, v. Solteri 38, 38100 – Trento (Italy)
  • 2: EURANDOM, PO Box 513, 5600 MB – Eindhoven (The Netherlands)
  • 3: Dep. of Information Engineering, v. Gradenigo 6/B, 35131 – Padova (Italy)
*Contact email: daniele.miorandi@create-net.org, tan@eurandom.tue.nl, zorzi@dei.unipd.it

Abstract

In this paper 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, in a distributed fashion, a deterministic upper bound on the access delay. The analysis is based on some asymptotic (focusing) properties of geometric random graphs. The analytical framework is 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) scheduling scheme.