Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks

Djukic, Petar; Valaee, Shahrokh

doi:10.1109/tnet.2008.2005219

Cited by 144 publications

(142 citation statements)

References 28 publications

Supporting

Mentioning

139

Contrasting

Unclassified

Order By: Relevance

“…The proposed algorithm tries to find a delay-aware path, from a source node to the BS, based on the communication distance and delay associated with the path. In [5], Djukic and Valaee studied the delay due to sub-optimum transmission schedules in time division multiple access (TDMA) wireless networks. By formulating the transmission orders of the links into a cost function, the link scheduling problem is treated as a min-max optimization problem.…”

Section: Related Workmentioning

confidence: 99%

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

Cheng

Ganganath

2013

2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

View full text Add to dashboard Cite

Abstract-Collecting data from massive numbers of individual nodes is always a challenging task in wireless sensor networks. The duration of a data collection process, which can greatly affect the detection capabilities of a network, should be reduced whenever possible. For scenarios where only a single cluster is allowed, the delayaware data collection network structure can minimize the duration of a data collection process. The aim of this paper is to explore the possibilities of improving the original delay-aware network structure by splitting the single tree structure into multiple clusters. Analyses on the conditions and effects of splitting the aforementioned structure are presented. Based on the analyses, two novel network splitting algorithms using k-means clustering algorithms are proposed. Simulation results show that the proposed network splitting algorithms may further reduce the duration of a data collection process. With the help of the k-means algorithms, communication distance among sensor nodes can be further reduced especially for networks with large numbers of wireless sensor nodes.

show abstract

Section: Related Workmentioning

confidence: 99%

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

Cheng

Ganganath

2013

2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery

View full text Add to dashboard Cite

show abstract

“…This algorithm don't consider the protocol overhead of TDMA scheduling. While [10] uses the load-balancing algorithm to increase spatial reuse, [8] considers Bellman-Ford method for both spatial reuse and minimum TDMA delay. These schemes don't take into account the underlying network behavior which can affect scheduling of traffic flows of other MSSs.…”

Section: Related Workmentioning

confidence: 99%

“…The QoS control field in the MAC frame format is a 16 bits field which facilitates the description of QoS requirements of application flows. Its TID (4 bits) identifies the TC (0-7) or the TS (8)(9)(10)(11)(12)(13)(14)(15) to which the corresponding MSDU in the FB field belongs. The last eight bits are used usually by QAP to receive the queue size of QSTAs.…”

Section: Qos Comparison Between Wifi and Wimax Mesh Modementioning

confidence: 99%

“…Since the tree rooted at the MBS is a binary one, each MSS has maximum of six logical links to its neighbor MSSs; three for sending and another three for receiving packets ( Figure 1). As wireless transceivers are usually half duplex [8], they can't be used for reception and transmission at the same time. So there are six queues in each MSS, three of these are to store the outbound packets and three others are for inbound packets to queue for reception.…”

Section: Basic Assumptionsmentioning

confidence: 99%

“…We consider M>1; i.e., there is at least one MSS. In most of the mesh networks, the frame length is fixed and may not be changed; otherwise the whole system should be restarted [8]; hence the frame length is fixed at L milliseconds. Each transmission in the frame is along with some overheads, so the number of transmissions for each link should be limited to one per frame to minimize transmission overhead.…”

Section: Basic Assumptionsmentioning

confidence: 99%

See 2 more Smart Citations

Application of Genetic Algorithms in Scheduling of TDMA-WMNs

Sattari-Naeini¹,

Movahhedinia²

2012

Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies

View full text Add to dashboard Cite

Detection of collision using optimized deep model and mitigation of collision using dolphin ant lion optimizer in wireless sensor network

Khare

Selvakumar

Dugyala

2023

Int J Communication

View full text Add to dashboard Cite

Summary Wireless sensor network (WSN) comprises automatic sensors that are dispersed into a huge region. WSN is constructed from huge sensors, which is allocated to a particular task and the majority of task involves reporting and monitoring. However, as the network can be extended to several sensor nodes, there is a high chance of collision. Thus, this paper devises a novel technique for performing both collision detection and mitigation in WSN. Initially, the simulation of WSN is performed, and then the selection of cluster head is done using fractional artificial bee colony (FABC). Here, the network‐based parameter is extracted that involves received signal strength index (RSSI), priority level, delivery rate, and energy consumed. The deep recurrent neural network (DRNN) is adapted for collision detection. Here, the training of DRNN is done using lion crow search optimizer (LCSO). After collision detection, the collision mitigation is performed with a pre‐scheduling algorithm, namely dolphin ant lion optimizer (Dolphin ALO). Here, fitness is considered for collision mitigation that includes energy, sleep index (SI), delivery rate, priority level, E‐waste, and E‐save. The proposed method outperformed with the smallest energy consumption of 0.185, highest throughput of 0.815, highest packet delivery ratio (PDR) of 0.815, and highest collision detection rate of 0.930.

show abstract

Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks

Cited by 144 publications

References 28 publications

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

To Split or Not to Split? From the Perspective of a Delay-Aware Data Collection Network Structure

Application of Genetic Algorithms in Scheduling of TDMA-WMNs

Detection of collision using optimized deep model and mitigation of collision using dolphin ant lion optimizer in wireless sensor network

Contact Info

Product

Resources

About