Spatial TDMA: A Collision-Free Multihop Channel Access Protocol

Nelson, Randolph; Kleinrock, Leonard

doi:10.1109/tcom.1985.1096405

Cited by 364 publications

(223 citation statements)

References 4 publications

Supporting

Mentioning

221

Contrasting

Unclassified

Order By: Relevance

“…The throughput and single-hop delay of many MAC schemes have been comprehensively studied in the literature [1,2]. However, little work has been carried out on their multihop delay.…”

Section: Previous Workmentioning

confidence: 99%

Towards an end-to-end delay analysis of wireless multihop networks

Xie

Haenggi

2009

Ad Hoc Networks

View full text Add to dashboard Cite

We employ discrete-time queueing theory to analyze the end-to-end (e2e) delay of wireless multihop networks for two MAC schemes, m-phase TDMA and slotted ALOHA. Unlike general two-dimensional networks where there exists sufficient traffic multiplexing that would permit the arrival processes to be approximated as independent, in linear networks with multihop communication, the arrival processes are correlated due to the lack of traffic multiplexing. This paper studies an extreme scenario, a linear network fed with a single flow. A decomposition approach is used to decouple the whole network into isolated nodes. Each node is modeled as a GI/Geo/1 queueing system. We derive the complete per-node delay distribution, Preprint submitted to Elsevier 5 June 2007accounting for both the queueing delay and access delay. Additionally, we characterize the departure processes by a correlated and bursty on-off traffic model. The per-node analysis provides the e2e delay mean while for the e2e delay variance, the strong correlations between the arrival processes need to be considered. Our study shows that the sign of the correlation coefficients depends on both the MAC scheme and the traffic burstiness, both of which determine the relative burst size of the source flow compared to a Bernoulli process, which constitutes an "eigentraffic"process. There is a wide gap in the e2e delay variances for the source flows with different burst sizes even if they have identical average rates. The relative burst size also determines from which direction and at which rate the departure processes converge to the eigentraffic process after traversing multiple relay nodes.

show abstract

“…The throughput and single-hop delay of many MAC schemes have been comprehensively studied in the literature [1,2]. However, little work has been carried out on their multihop delay.…”

Section: Previous Workmentioning

confidence: 99%

Towards an end-to-end delay analysis of wireless multihop networks

Xie

Haenggi

2009

Ad Hoc Networks

View full text Add to dashboard Cite

show abstract

“…An observation of the objective function l(R) in (30) shows that it has the same form as f (g 1 ) in (23). Therefore, l(R) must be strictly convex and has only one unconstrained optimal solution…”

Section: Ptc-usg Schemementioning

confidence: 99%

“…First, in the network (or equivalently, the super-frame, as explained shortly) level, we eliminate the interference between clusters using spatial TDMA (STDMA) [23], where the interfering clusters in the system are assigned to different frames in a super-frame. Second, in the cluster (frame) level, we propose a group-based scheduling for the transmission of active nodes, i.e., we combine the active sensors into groups and assign slots to each group in such a way that the energy consumption of the frame is minimized.…”

Section: Introductionmentioning

confidence: 99%

Energy-efficient power/rate control and scheduling in hybrid TDMA/CDMA wireless sensor networks

Shu

Krunz

2009

Computer Networks

View full text Add to dashboard Cite

We consider a hybrid TDMA/CDMA wireless sensor network (WSN) and quantitatively investigate the energy efficiency obtained by combining adaptive power/rate control with time-domain scheduling. The energy efficiency improvement is carried out with respect to interfering-cluster scheduling, intra-cluster node scheduling, and transmission powers and times (durations) control (PTC) for individual nodes. The interfering-cluster scheduling is formulated as a vertex-coloring problem, which can be solved efficiently using existing numerical algorithms in graph theory. For the node scheduling problem, we present a heuristic algorithm, which iteratively searches for the best schedule in such a way that the energy consumption keeps decreasing after every iteration. Compared with the exponentially complicated exhaustive search algorithm, this heuristic algorithm has polynomial computing complexity and can provide optimal solutions in the most simulated cases. For the transmission power/time control, two simplified PTC schemes, namely, PTC-UT and PTC-USG, are proposed and studied based on our previous optimization work PTC-IPT. We show that PTC-UT and PTC-USG provide comparable energy efficiency to PTC-IPT at only half of its complexity. Numerical examples are used to validate our findings.

show abstract

“…There are a number of works in the past studying the problem of how concurrent non-interfering transmissions in a TDMA-based mesh network may affect the arrangement of individual link transmission rate and the resulting network capacity throughput. Most of the work use some techniques such as compatibility matrix [3] to first find non-interfering transmission pairs and then use centralized algorithms for time slot assignment [4][5] [6] [7]. Various linear programming and heuristic methods are proposed for time slot assignment [8] [1].…”

Section: Introductionmentioning

confidence: 99%

A Distributed Channel Access Scheduling Scheme with Clean-Air Spatial Reuse for Wireless Mesh Networks

Lin

Hsiao

Tung

et al. 2008

NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet

View full text Add to dashboard Cite

Abstract. There are two effective approaches to maximize network capacity throughput: increasing concurrent non-interfering transmissions by exploiting spatial reuse and increasing transmission rates of active senders. These two ways are, however, a tradeoff due to the signal interference. In this paper, we propose a distributed channel access scheduling scheme under a Clean-Air Spatial Reuse architecture which spans both the MAC layer and the network planning plane to scale a wireless mesh network to high network capacity throughput and large coverage. Simulations results of the network capacity throughput performance under different levels of Clean-Air Spatial Reuse policies are presented. The results show that having more number of concurrent transmission pairs scheduled in each time slot usually can compensate the negative effect of using lower transmission rates of transmission links and result in better throughput performance.

show abstract

Spatial TDMA: A Collision-Free Multihop Channel Access Protocol

Cited by 364 publications

References 4 publications

Towards an end-to-end delay analysis of wireless multihop networks

Towards an end-to-end delay analysis of wireless multihop networks

Energy-efficient power/rate control and scheduling in hybrid TDMA/CDMA wireless sensor networks

A Distributed Channel Access Scheduling Scheme with Clean-Air Spatial Reuse for Wireless Mesh Networks

Contact Info

Product

Resources

About