Making transmission schedules immune to topology changes in multi-hop packet radio networks

Chlamtac, I.; Faragó, András

doi:10.1109/90.282605

Cited by 319 publications

(209 citation statements)

References 8 publications

Supporting

Mentioning

206

Contrasting

Order By: Relevance

“…Under the Deterministic Policy, [6], [7], each node u ∈ V is randomly assigned a unique polynomial f u of degree k with coefficients from a finite Galois field of order q (GF (q)). Polynomial f u is represented as…”

Section: Scheduling Policiesmentioning

confidence: 99%

“…Chlamtac and Farago, [6], have proposed an original TDMA-based scheme for topology transparent scheduling. The mathematical properties of polynomials with coefficients from finite Galois fields are exploited to randomly assign scheduling time slot sets to each node of the network.…”

Section: Introductionmentioning

confidence: 99%

“…In a previous work, [8], the general approach proposed in [6] and [7] (to be referred to as the Deterministic Policy) was considered and the idea of allowing the nodes to utilize (according to a common access probability) scheduling slots not originally assigned (according to the rules in [6], [7]) to them, was introduced. The proposed policy (to be referred to as the Probabilistic Policy) was analyzed for a specific transmission and the conditions under which the throughput for a specific transmission under the Probabilistic Policy is higher than that under the Deterministic Policy, were established.…”

Section: Introductionmentioning

confidence: 99%

“…The mathematical properties of polynomials with coefficients from finite Galois fields are exploited to randomly assign scheduling time slot sets to each node of the network. It is guaranteed that for each node at least one time slot in a frame would be collision-free, [6]. Another scheme proposed by Ju and Li, [7], maximizes the minimum guaranteed throughput.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks

Οικονόμου

Stavrakakis

2003

Quality for All

View full text Add to dashboard Cite

Abstract. The design of an efficient Medium Access Control (MAC) is challenging in ad-hoc networks where users can enter, leave or move inside the network without any need for prior configuration. The existing topology-unaware TDMA-based schemes are capable of providing a minimum guaranteed throughput by considering a deterministic policy for the utilization of the assigned scheduling time slots. In an earlier work, a probabilistic policy that utilizes the non-assigned slots according to an access probability, common for all nodes in the network, was proposed. The achievable throughput for a specific transmission under this policy was analyzed. In this work, the system throughput is studied and the conditions under which the system throughput under the probabilistic policy is higher than that under the deterministic policy are established. In addition, the value for the access probability that maximizes the system throughput is determined analytically, as well as simplified lower and upper bounds that depend only on a topology density metric. Since the analysis of the system throughput is shown to be difficult or impossible in the general case an approximation is introduced whose accuracy is investigated. Simulation results show that the approximate analysis successfully determines the range of values for the access probability for which the system throughput under the probabilistic policy is not only higher than that under the deterministic, but it is also close to the maximum.

show abstract

Section: Scheduling Policiesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks

Οικονόμου

Stavrakakis

2003

Quality for All

View full text Add to dashboard Cite

show abstract

“…Forgoing RTS/CTS and ACK message exchanges gives rise to the hidden node problem, increasing the probability of packet collisions. Note that the highly dynamic topology of VANETs requires appropriate topology-transparent protocols [7]. Topology-transparent protocols are ones which do not need a detailed description of the network topology in order to schedule packet transmissions.…”

Section: Introductionmentioning

confidence: 99%

A Universal Geocast Scheme for Vehicular Ad Hoc Networks

Nekoui

Pishro-Nik

2010

2010 7th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-A universal communications scheme for Vehicular Ad hoc Networks (VANETs) is proposed. This scheme accounts for a diverse variety of VANET-specific characteristics such as the gradual introduction of technology, highly dynamic topology, roadconstrained vehicle movement and the presence of obstacles. The scheme incorporates a geometrical framework previously proposed by the authors which makes it appropriate for urban as well as rural area deployments. Moreover, by making the scheme probabilistic, capacity-delay tradeoffs crucial for safety message exchange are addressed. Although the presence of infrastructure is a privilege to our scheme, the network can still operate in a pure ad hoc manner. Simulation results confirm that our heuristic method dramatically improves the probability of reception of nodes in different scenarios.

show abstract

Medium Access Control (MAC) Protocols

Faragó

Syrotiuk

2003

Wiley Encyclopedia of Telecommunications

View full text Add to dashboard Cite

The medium access control (MAC) protocol serves a vital role in all networks in which communication is based on a broadcast (or multiaccess) channel. The MAC protocol is directly responsible for controlling access to the communication resources, subject to the technological constraints of the hardware. This article provides a taxonomy of MAC protocols, and then reviews some of the most important MAC protocols according to their method of sharing the medium since this best characterizes their operation.

show abstract

Making transmission schedules immune to topology changes in multi-hop packet radio networks

Cited by 319 publications

References 8 publications

Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks

Throughput Analysis of a Probabilistic Topology-Unaware TDMA MAC Policy for Ad-hoc Networks

A Universal Geocast Scheme for Vehicular Ad Hoc Networks

Medium Access Control (MAC) Protocols

Contact Info

Product

Resources

About