By Topic

Cooperation-Based Scheduling Algorithm in Wireless Multimedia Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bo Zeng ; Sch. of Comput. Sci., Zhejiang Univ., Hangzhou, China ; Yabo Dong ; Dongming Lu

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.

Published in:

Wireless Communications, Networking and Mobile Computing (WiCOM), 2011 7th International Conference on

Date of Conference:

23-25 Sept. 2011