A Survey of Topology-Transparent Scheduling Schemes in Multi-Hop Packet Radio Networks

Kar, Udit Narayana; Dash, Dipti; Sanyal, Debarshi Kumar; Guha, Dibyajyoti; Chattopadhyay, Samiran

doi:10.1109/comst.2017.2739418

Cited by 13 publications

(8 citation statements)

References 93 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This gives b 1 = v 1 r 1 /q 1 = 16093. For class-2 nodes alone, we again choose S 2 = S (2,11,1331). This means we first assign 11 transmission slots to all nodes.…”

Section: Our Methods Stpsmentioning

confidence: 99%

“…The frame length is L = v. Since the number of blocks (or rows) must be at least as large as the number of nodes b ≥ N. Further, it must form a D cover-free family; since every block (of q elements) has at most t − 1 overlapping elements, it is D cover-free iff q − (t − 1)D ≥ 1. Numerical simulations in Reference 13 show that the use of Steiner systems in TTS improves the expected throughput as well as the delay bound over those in case of orthogonal arrays (used in References 2,5 and many other TTS algorithms 11 ). However, the optimal Steiner system for a given N, D is not guaranteed to exist.…”

Section: Tts With Steiner Systemmentioning

confidence: 99%

“…Researchers have also proposed methods to increase the throughput of a network in TTS; examples include schemes where nodes use unassigned slots aided by power control, where nodes exchange Request‐to‐Send/Clear‐to‐Send signals as in Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocols to avoid transmissions in collision‐prone slots, and where nodes use variable‐weight schedules to adapt to local topology as well as traffic load . A detailed review of TTS along with its applications can be found in Reference .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Steiner system‐based topology‐transparent priority scheduling for wireless ad hoc networks

Dash

Sanyal

2019

Internet Technology Letters

Self Cite

View full text Add to dashboard Cite

Topology‐transparent scheduling (TTS) for wireless networks involves generation of schedules which do not need update even when the network topology is constantly changing. TTS schemes designed with Steiner systems support the largest number of nodes—among all cover‐free families—for a given frame length. In this paper, we propose a TTS scheme using Steiner systems for a network in which nodes are divided into multiple classes of different priorities. Our proposed scheme called “Steiner system‐based Topology‐transparent Priority Scheduling” (STPS) produces priority‐sensitive schedules using different Steiner systems for the different priority classes. We explain our proposed method through illustrative examples and show its superiority over a competitive scheme in the literature with respect to the frame length.

show abstract

“…This gives b 1 = v 1 r 1 /q 1 = 16093. For class-2 nodes alone, we again choose S 2 = S (2,11,1331). This means we first assign 11 transmission slots to all nodes.…”

Section: Our Methods Stpsmentioning

confidence: 99%

Section: Tts With Steiner Systemmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Steiner system‐based topology‐transparent priority scheduling for wireless ad hoc networks

Dash

Sanyal

2019

Internet Technology Letters

Self Cite

View full text Add to dashboard Cite

show abstract

“…The authors proposed a local route optimization algorithm to minimize the overall power consumption in the network. Better topology control algorithms integrated with enhanced sleep scheduling mechanisms can enhance the overall lifetime in WSNs [26]. Considering the essential factors like coverage, connectivity, and communication (C3), a holistic approach has been proposed in [11].…”

Section: State Of Artmentioning

confidence: 99%

A Level-Wise Periodic Tree Construction Mechanism for Sleep Scheduling in WSN

Tarasia

Swain

Roy

et al. 2020

J. commun. softw. syst. (Online)

View full text Add to dashboard Cite

The wireless sensor network (WSN) has been extensively used to monitor and control the natural ecosystem on a large scale like air quality, natural life, etc. Low battery power,low storage, and limited processing ability are the most critical areas of concern in WSN. To reduce energy utilization, the sensor nodes in WSN work in a cyclic process between active and sleep mode. A certain number of nodes are chosen active and they are responsible for sensing as well as data transmission and rest of the nodes are gone to sleep. In order to lengthen the lifetime of network, in this paper we proposed a level wise periodic tree construction algorithm that uses a specific set of nodes to participate in tree construction, instead of all the nodes, to minimize the energy consumption. In this proposed approach, the main idea is to put the nodes, which are currently active and have already spent a significant amount of energy, to sleep mode, while giving chances to the leaf nodes, which has comparatively spent less energy, to become an active node and maintain connectivity. The performance of the proposed protocol is evaluated using the Castalia simulator. The simulation results show that the proposed level-wise periodic tree construction approach increases the durability of the network in conjunction with the non-level approach.

show abstract

“…For deterministic scheme, time division multiple access (TDMA), where each node is assigned a unique slot to transmit, is a common option. A variety of more sophisticated topologytransparent sequence schemes have been proposed in the literature; see the survey paper [2] and the references therein. Such schemes usually take into account the network density D (maximum number of interfering nodes among all nodes in the network).…”

Section: Introductionmentioning

confidence: 99%

Delay-Constrained Topology-Transparent Distributed Scheduling for MANETs

Deng

Liu²,

Zhang³

et al. 2020

Preprint

View full text Add to dashboard Cite

Transparent topology is common in many mobile ad hoc networks (MANETs) such as vehicle ad hoc networks (VANETs), unmanned aerial vehicle (UAV) ad hoc networks, and wireless sensor networks due to their decentralization and mobility nature. There are many existing works on distributed scheduling scheme design for topology-transparent MANETs. Most of them focus on delay-unconstrained settings. However, with the proliferation of real-time applications over wireless communications, it becomes more and more important to support delay-constrained traffic in MANETs. In such applications, each packet has a given hard deadline: if it is not delivered before its deadline, its validity will expire and it will be removed from the system. This feature is fundamentally different from the traditional delay-unconstrained one. In this paper, we for the first time investigate distributed scheduling schemes for a topology-transparent MANET to support delay-constrained traffic. We analyze and compare probabilistic ALOHA scheme and deterministic sequence schemes, including the conventional time division multiple access (TDMA), the Galois field (GF) sequence scheme proposed in [1], and the combination sequence scheme that we propose for a special type of sparse network topology. We use both theoretical analysis and empirical simulations to compare all these schemes and summarize the conditions under which different individual schemes perform best.

show abstract

A Survey of Topology-Transparent Scheduling Schemes in Multi-Hop Packet Radio Networks

Cited by 13 publications

References 93 publications

Steiner system‐based topology‐transparent priority scheduling for wireless ad hoc networks

Steiner system‐based topology‐transparent priority scheduling for wireless ad hoc networks

A Level-Wise Periodic Tree Construction Mechanism for Sleep Scheduling in WSN

Delay-Constrained Topology-Transparent Distributed Scheduling for MANETs

Contact Info

Product

Resources

About