The Minimum Scheduling Time for Convergecast in Wireless Sensor Networks
We study the scheduling problem for data collection from sensor nodes to the sink node in wireless sensor networks, also referred to as the convergecast problem. The convergecast problem in general network topology has been proven to be NP-hard. In this paper, we propose our heuristic algorithm (fin...
Main Authors: | Changyong(Andrew) Jung, Suk Jin Lee, Vijay Bhuse |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2014-03-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/7/1/145 |
Similar Items
-
Escalator: An Autonomous Scheduling Scheme for Convergecast in TSCH
by: Sukho Oh, et al.
Published: (2018-04-01) -
OSCAR: An Optimized Scheduling Cell Allocation Algorithm for Convergecast in IEEE 802.15.4e TSCH Networks
by: Mohamed Osman, et al.
Published: (2021-04-01) -
W-MAC: A Workload-Aware MAC Protocol for Heterogeneous Convergecast in Wireless Sensor Networks
by: Dongming Lu, et al.
Published: (2011-02-01) -
Study of Mobility Enhancements for RPL in Convergecast Scenarios
by: Jinpeng Wang, et al.
Published: (2017-11-01) -
An Adaptive Strategy for an Optimized Collision-Free Slot Assignment in Multichannel Wireless Sensor Networks
by: Pascale Minet, et al.
Published: (2013-07-01)