Cooperation-Based Scheduling Algorithm in Wireless Multimedia Sensor Networks

Wireless Multimedia Sensor Networks (WMSNs) are characterized by limited hardware resource, bandwidth and variable channel capacity. Most potential applications of WMSN require the network to reliably transmit large multimedia content to sink and to minimize the whole energy consumption. Energy and bandwidth are important factors which must be taken into account when schedule links. We use the data aggregate to reduce the amount of data in WMSN. In this paper, we proposed a simple heuristic algorithm: Cooperation-based scheduling which is base on conflict graph. If the node has minimum degree in conflict graph, it will be scheduled preferentially. The cooperation is means that we will schedule the children firstly when the children of the node has the data. The depth of priority scheduling (PSD) represent the level of cooperation in this paper. We researched the influence of different PSD on schedule performance of Cooperation-based scheduling. The simulation results show that Cooperation-based scheduling has remarkable improvements on the scheduling length and energy efficiency.