Locally scheduled packet bursting for data collection in wireless sensor networks

Data collection is the most basic application of sensor networks. Sensors are deployed in a given region of interest. They sense some physical phenomenon and store the readings. All the sensors send stored data to sink. Sink is a central node which may be connected to the Internet. Sensor nodes may use either CSMA/CA or TDMA at the MAC layer. TDMA prevents collisions. Packets need not be retransmitted. This results in energy-saving and reduction in data delivery delay. We have mainly focused on TDMA based scheduling schemes. TDMA scheduling schemes are aimed to meet one or more of the following objectives: (i) minimizing schedule length (ii) maximizing fairness (iii) minimizing Latency (iv) meeting deadlines (v) minimizing energy consumption. Existing literature covers a detailed survey of schemes aimed to minimize schedule lengths. In present work, we have surveyed some mechanisms trying to maximize fairness. Often scheduling problems are mapped to graph coloring problem. We have also surveyed methods of TDMA scheduling using graph coloring. For each category i.e. fairness and graph coloring, some open issues are also mentioned.

show abstract

“…In [8], problem of overloading is handled. When an event is detected, C-node (data collection point) is elected.…”

Section: Ensuring Fairnessmentioning

confidence: 99%

Review of fairness and graph coloring methods for data collection in wireless sensor networks

Vasavada

Srivastava

2013

2013 Annual IEEE India Conference (INDICON)

View full text Add to dashboard Cite

show abstract

“…Therefore, the new pair (L, B) is inserted into slot 3 because it cannot be scheduled before slot 3 (line [15][16][17]. Another node pair (E, A) is found and inserted into slot 3, concurrently scheduling with (L, B) (line [18][19][20][21]. Regarding another node, K wants to join, the related pair (K, A) is inserted into slot 1 because it is scheduled with (H, F) concurrently (line 10-14).…”

Section: Scheduling Strategy Maintenancementioning

confidence: 99%

An energy efficient medium access control protocol for target tracking based on dynamic convey tree collaboration in wireless sensor networks

Wang

Shi

et al. 2012

Int J Communication

View full text Add to dashboard Cite

SUMMARY Collisions and interferences among nodes pose a challenge for data aggregation in many applications, such as target tracking by adopting dynamic convey tree‐based collaboration (DCTC). Because coordination with a time division multiple access (TDMA) medium access control (MAC) might provide an opportunity for better interference control, in this paper, we refine slot allocation to nodes in a dynamic convey tree and design an energy efficient MAC protocol called dynamic‐time division multiple access (D‐TDMA). The D‐TDMA protocol avoids collisions and interferences and allocates contiguous active slots to nodes as far as possible during data aggregation from leaf nodes to a root node. As a result, energy consumption in switching from sleep to active state is saved. In comparison with Always‐On scheme, theoretical analysis results show that the proposed protocol D‐TDMA improves energy efficiency by up to 28.3% during one data aggregation. Furthermore, simulation results show that D‐TDMA does not suffer from collisions and interferences among nodes in a dynamic convey tree and performs similar throughput to that of Always‐On scheme. Because of its advantage of parallel and continuous scheduling among node pairs in the convey tree, D‐TDMA outperforms efficient slot reservation in both energy efficiency and low delay because of to slot saving. Copyright © 2012 John Wiley & Sons, Ltd.

show abstract

“…In this way any event may be reported by more than one sensor node due to the nature of these networks [12]. This phenomenon in turn increases the network congestion ratio, packet loss ratio and network energy consumption [11].…”

Section: Introductionmentioning

confidence: 99%

OLDA: An Efficient On-Line Data Aggregation Method for Wireless Sensor Networks

Kamarei

Hajimohammadi

Patooghy

et al. 2013

2013 Eighth International Conference on Broadband and Wireless Computing, Communication and Applications

View full text Add to dashboard Cite

Sending and receiving redundant packets inWireless Sensor Networks (WSN), increase the congestion ratio as well as energy consumption in WSNs. In this regard, several data aggregation methods for WSNs have been presented to identify and to aggregate redundant packets. In this paper, we present an efficient on-line data aggregation method, OLDA, for real-time WSNs. OLDA method assigns different priorities to different events to help Cluster Head (CH) nodes in making an appropriate decision about the packet i.e., forwarding or aggregation. Indeed, CH nodes send newly received packet with probability െ and remove it with probability . Since the parameter is proportional to time and location of the occurred event, OLDA method, tends to forward packets of newly occurred events i.e., is close to 0 here. When more time is passed parameter is gradually increased; hence OLDA method tends to drop packets. Experimental results by the use of NS2 simulator show that OLDA method effectively reduces the miss rate compared with DASDR and RDAG aggregation methods. Also, OLDA method aggregates more than 70% of redundant packets and reduces the network end-to-end delay compared with RAG and SPEED methods.

show abstract

Locally scheduled packet bursting for data collection in wireless sensor networks

Cited by 15 publications

References 21 publications

Review of fairness and graph coloring methods for data collection in wireless sensor networks

Review of fairness and graph coloring methods for data collection in wireless sensor networks

An energy efficient medium access control protocol for target tracking based on dynamic convey tree collaboration in wireless sensor networks

OLDA: An Efficient On-Line Data Aggregation Method for Wireless Sensor Networks

Contact Info

Product

Resources

About