Abstract
Median Access Control (MAC) protocols are designed to mitigate collisions and enhance the energy efficiency for sensor data collection. This paper reviews two basic categories of MAC protocols. The first class is the contention-based protocols, where nodes randomly compete for channel access. The second class is the schedule-based MAC protocols, in which nodes access the channel on the basis of the predetermined schedules. We focus on discussing the Time Division Multiple Access (TDMA) protocols and classify different TDMA schedulings into three categories according to the communication patterns in the network, i.e., the link scheduling, aggregate scheduling and non-aggregate scheduling. Link scheduling deals with the peer to peer communication pattern, where there is no central node in the network. In comparison, both the aggregate and non-aggregate schedulings handle the convergecast communication pattern, in which all traffic are destined to the sink. This survey provides a comprehensive overview of these three categories and provided a detailed briefing on how the TDMA schedules handle the network traffic dynamics in the network. Compared with other surveys in this domain, this review does not confine itself to deal with collecting a particular form of data, but provides a unified framework to integrate the data semantics in a broader sense into the design of TDMA scheduling algorithms.
Highlights
Recent technological development in micro-electronics, communications and micro-processor systems has made possible the low manufacturing price for small wireless sensor devices, which are adept at sensing and measuring various phenomenons in physical world
Sensor data gathering is a major process involved in many wireless sensor network applications such as environmental monitoring and target tracking [53], [56]
We focus on elaborating various Time Division Multiple Access (TDMA) scheduling techniques in sensor data collection
Summary
Recent technological development in micro-electronics, communications and micro-processor systems has made possible the low manufacturing price for small wireless sensor devices (sensor nodes), which are adept at sensing and measuring various phenomenons in physical world. By doing this the latency bound of aggregate data collection can be further reduced to 16R+ −14 In their proposed method, the root has to first gather the aggregated data generated by all nodes, sends the aggregation results to the sink via the shortest route, which incurs an additional delay of at most the network radius R. The root has to first gather the aggregated data generated by all nodes, sends the aggregation results to the sink via the shortest route, which incurs an additional delay of at most the network radius R This topology setting has been adopted by many later research works [41]–[43]. DTSM is proved to achieve reasonable bandwidth allocation and high channel utilization
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
