A TDMA scheduling scheme for many-to-one communications in wireless sensor networks

Mao, Jianlin; Wu, Zhiming; Wu, Xing

doi:10.1016/j.comcom.2006.10.006

Cited by 102 publications

(45 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The many-to-one scheduling has been addressed previously by [18,19,20]. Reference [18] proposes an evolutionary algorithm where genetic algorithm and particle swarm optimization are hybridized to enhance the searching ability however does not provide any guarantees on the performance.…”

Section: Introductionmentioning

confidence: 99%

“…Reference [18] proposes an evolutionary algorithm where genetic algorithm and particle swarm optimization are hybridized to enhance the searching ability however does not provide any guarantees on the performance. References [19] and [20] on the other hand propose heuristic algorithms that schedule as many independent segments as possible to increase the degree of parallel transmission but does not consider the specific nature of many-to-one communication nor the interference models in wireless communication.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

TDMA scheduling algorithms for wireless sensor networks

Coleri¹,

2009

View full text Add to dashboard Cite

Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflict-free assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or node-based scheduling, which is adapted from classical multi-hop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or levelbased scheduling, which is a novel scheduling algorithm for many-to-one communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10-70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

TDMA scheduling algorithms for wireless sensor networks

Coleri¹,

2009

View full text Add to dashboard Cite

show abstract

“…Examples of schedule-based MAC protocols for WSNs are presented in [46,96,179,188,224,251,274]. Scheduling with minimizing packet de-lays [83,96,97,179,269], scheduling with max-min fairness [258], maximizing the parallel transmissions with TDMA scheduling [104] are the other topics related with TDMA scheduling in WSNs.…”

Section: Tdma Scheduling and Convergecasts In Wsnsmentioning

confidence: 99%

“…data collection applications [188,214]. Consider a repeated frame of k time slots in which each link of the data gathering tree is scheduled once.…”

Section: Enhancing the Data Collection Rate Of Tree-based Aggregationmentioning

confidence: 99%

See 1 more Smart Citation

Multi-channel wireless sensor networks : protocols, design and evaluation

Durmaz¹

View full text Add to dashboard Cite

Pervasive systems, which are described as networked embedded systems integrated with everyday environments, are considered to have the potential to change our daily lives by creating smart surroundings and by their ubiquity, just as the Internet. In the last decade, "Wireless Sensor Networks" have appeared as one of the real-world examples of pervasive systems by combining automated sensing, embedded computing and wireless networking into tiny embedded devices.A wireless sensor network typically comprises a large number of spatially distributed, tiny, battery-operated, embedded sensor devices that are networked to cooperatively collect, process, and deliver data about a phenomenon that is of interest to the users. Traditionally, wireless sensor networks have been used for monitoring applications based on low-rate data collection with low periods of operation. Current wireless sensor networks are considered to support more complex operations ranging from target tracking to health care which require efficient and timely collection of large amounts of data. Considering the low-bandwidth, low-power operation of the radios on the sensor devices, interference and contention over the wireless medium and the energy-efficiency requirements due to the battery-operated devices, fulfilling the mentioned data-collection requirements in complex applications becomes a challenging task.This thesis focuses on the efficient delivery of large amounts of data in bandwidth-limited wireless sensor networks by making use of the multi-channel capability of the sensor radios and by using optimal routing topologies. We start with experimenting the operation of the sensor radios to characterize the behavior of multi-channel communication. We propose a set of algorithms to increase the throughput and timely delivery of the data and analyze the bounds on the data collection capacity of the wireless sensor networks. The main contributions of the thesis are listed as follows:• Contribution 1 -Characteristics, challenges and the use of multi-channel communication in wireless ad hoc networks and wireless sensor networks: We review the state of the art channel assignment protocols in wireless multi-hop networks, particularly in wireless ad hoc networks and wireless sensor networks. We classify the existing solutions according to the number of transceivers required per node and according to the dynamics of the channel assignment. Since the channel assignment methods designed for general wireless ad hoc networks may not be directly applicable to wireless sensor networks, we give brief comparisons of them and discuss the additional challenges and requirements for wireless sensor networks.• Contribution 2 -Characterization of multi-channel interference: The assumption of perfectly orthogonal, interference-free channels, which is adopted in most of the multi-channel communication studies, may fail in practice. Radio signals are not limited to their allocated frequency band, but cause interference in adjacent bands as well -how much depends on...

show abstract

Minimizing Single TDMA Frame Sizes in Alarm-driven Wireless Sensor Networks Applications

Macedo

Nunes

Grilo

Wireless and Mobile Networking

View full text Add to dashboard Cite

Energy-efficiency and latency requirements in alarm-driven Wireless Sensor Networks often demand the use of TDMA protocols with special features such as cascading of timeslots, in a way that the sensor-to-sink delay bound can stay below a single frame. However, this single TDMA frame should be as small as possible. This paper presents a comparative study of timeslot allocation strategies that can be used to attain this goal. The Minimum Single Frame Size Problem is formulated, and the considered slot allocation algorithms are studied based on simulations. The results point to the conclusion that informed depth-first, coupled with a longest-path-first heuristic, can improve significantly the behavior of blind depth-first. Two centralized strategies are also simulated: a longest-paths-first, which allocates the branches by decreasing order of the length of the paths, and a largest-distances-first, which allocates the branches by decreasing distances to the sink that the paths can reach. It is also shown that a largest-distances-first strategy can achieve the smallest single frame sizes, and also the lowest variation of frame sizes. A distributed version of this algorithm (DIST-LDF) is presented, which obtains the same results of its centralized version.

show abstract

A TDMA scheduling scheme for many-to-one communications in wireless sensor networks

Cited by 102 publications

References 6 publications

TDMA scheduling algorithms for wireless sensor networks

TDMA scheduling algorithms for wireless sensor networks

Multi-channel wireless sensor networks : protocols, design and evaluation

Minimizing Single TDMA Frame Sizes in Alarm-driven Wireless Sensor Networks Applications

Contact Info

Product

Resources

About