Cover Image

Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks

The distributive nature of wireless sensor networks (WSNs) poses great challenges for the design of distributive scheduling to maximize network life and spatial reuse of time slot with minimum frame length. Most of the existing scheduling techniques are either centralized or contentional. The existi...

Full description

Saved in:
Bibliographic Details
Main Authors: Bakhsh, S.T., Aman Sheikh, M., Alghamdi, R.
Format: Article
Published: Hindawi Publishing Corporation 2015
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84947587660&doi=10.1155%2f2015%2f746216&partnerID=40&md5=3a5c23dc9d5c796e99deaf78673d959f
http://eprints.utp.edu.my/26053/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utp.eprints.26053
record_format eprints
spelling my.utp.eprints.260532021-08-30T08:51:04Z Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks Bakhsh, S.T. Aman Sheikh, M. Alghamdi, R. The distributive nature of wireless sensor networks (WSNs) poses great challenges for the design of distributive scheduling to maximize network life and spatial reuse of time slot with minimum frame length. Most of the existing scheduling techniques are either centralized or contentional. The existing techniques cannot efficiently adapt to the dynamic wireless environment. In this paper, self-scheduled and distributed MAC (SSD-MAC) and self-distributive MAC (SD-MAC) medium access control algorithms are proposed to reduce the complexity and variety of scheduling problems. The proposed algorithms do not require any synchronization and can effectively adapt to dynamic topology changes without incurring global communication overhead. According to the proposed algorithms, each node maps a conflict-free time slot for itself up to 2-hop neighboring nodes. Consequently, each node successfully schedules a unique time slot for itself in a heuristic manner based on its local information. Moreover, the proposed algorithms also guarantee conflict-free edge coloring because all the incident edges to a single node are assigned to colors in such a way that none of the edges should have the same color. It has been demonstrated that, with regard to communication overhead, energy consumption and execution time through simulation proposed that algorithms outperform existing distributed randomized scheduling algorithm (DRAND). © 2015 Sheikh Tahir Bakhsh et al. Hindawi Publishing Corporation 2015 Article NonPeerReviewed https://www.scopus.com/inward/record.uri?eid=2-s2.0-84947587660&doi=10.1155%2f2015%2f746216&partnerID=40&md5=3a5c23dc9d5c796e99deaf78673d959f Bakhsh, S.T. and Aman Sheikh, M. and Alghamdi, R. (2015) Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks. International Journal of Distributed Sensor Networks, 2015 . http://eprints.utp.edu.my/26053/
institution Universiti Teknologi Petronas
building UTP Resource Centre
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Petronas
content_source UTP Institutional Repository
url_provider http://eprints.utp.edu.my/
description The distributive nature of wireless sensor networks (WSNs) poses great challenges for the design of distributive scheduling to maximize network life and spatial reuse of time slot with minimum frame length. Most of the existing scheduling techniques are either centralized or contentional. The existing techniques cannot efficiently adapt to the dynamic wireless environment. In this paper, self-scheduled and distributed MAC (SSD-MAC) and self-distributive MAC (SD-MAC) medium access control algorithms are proposed to reduce the complexity and variety of scheduling problems. The proposed algorithms do not require any synchronization and can effectively adapt to dynamic topology changes without incurring global communication overhead. According to the proposed algorithms, each node maps a conflict-free time slot for itself up to 2-hop neighboring nodes. Consequently, each node successfully schedules a unique time slot for itself in a heuristic manner based on its local information. Moreover, the proposed algorithms also guarantee conflict-free edge coloring because all the incident edges to a single node are assigned to colors in such a way that none of the edges should have the same color. It has been demonstrated that, with regard to communication overhead, energy consumption and execution time through simulation proposed that algorithms outperform existing distributed randomized scheduling algorithm (DRAND). © 2015 Sheikh Tahir Bakhsh et al.
format Article
author Bakhsh, S.T.
Aman Sheikh, M.
Alghamdi, R.
spellingShingle Bakhsh, S.T.
Aman Sheikh, M.
Alghamdi, R.
Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks
author_facet Bakhsh, S.T.
Aman Sheikh, M.
Alghamdi, R.
author_sort Bakhsh, S.T.
title Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks
title_short Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks
title_full Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks
title_fullStr Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks
title_full_unstemmed Self-Schedule and Self-Distributive MAC Scheduling Algorithms for Next-Generation Sensor Networks
title_sort self-schedule and self-distributive mac scheduling algorithms for next-generation sensor networks
publisher Hindawi Publishing Corporation
publishDate 2015
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-84947587660&doi=10.1155%2f2015%2f746216&partnerID=40&md5=3a5c23dc9d5c796e99deaf78673d959f
http://eprints.utp.edu.my/26053/
_version_ 1738656817001529344
score 13.211869

Similar Items