Real-time multimedia processing in video sensor networks

被引:25
作者
Gu, Yaoyao [1 ]
Tian, Yuan
Ekici, Eylem
机构
[1] Texas Instruments Inc, Dallas, TX 75265 USA
[2] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA
关键词
video sensor networks; real-time multimedia processing; energy efficiency;
D O I
10.1016/j.image.2006.12.013
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Video sensor networks (VSNs) has become the recent research focus due to the rich information it provides to address various data-hungry applications. However, VSN implementations face stringent constraints of limited communication bandwidth, processing capability, and power supply. In-network processing has been proposed as efficient means to address these problems. The key component of in-network processing, task mapping and scheduling problem, is investigated in this paper. Although task mapping and scheduling in wired networks of processors has been extensively studied, their application to VSNs remains largely unexplored. Existing algorithms cannot be directly implemented in VSNs due to limited resource availability and shared wireless communication medium. In this work, an application-independent task mapping and scheduling solution in multi-hop VSNs is presented that provides real-time guarantees to process video feeds. The processed data is smaller in volume which further releases the burden on the end-to-end communication. Using a novel multi-hop channel model and a communication scheduling algorithm, computation tasks and associated communication events are scheduled simultaneously with a dynamic critical-path scheduling algorithm. Dynamic voltage scaling (DVS) mechanism is implemented to further optimize energy consumption. According to the simulation results, the proposed solution outperforms existing mechanisms in terms of guaranteeing application deadlines with minimum energy consumption. (c) 2007 Published by Elsevier B.V.
引用
收藏
页码:237 / 251
页数:15
相关论文
共 22 条
[1]   A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems [J].
Braun, TD ;
Siegel, HJ ;
Beck, N ;
Bölöni, LL ;
Maheswaran, M ;
Reuther, AI ;
Robertson, JP ;
Theys, MD ;
Yao, B ;
Hensgen, D ;
Freund, RF .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (06) :810-837
[2]   BOUNDS ON NUMBER OF PROCESSORS AND TIME FOR MULTIPROCESSOR OPTIMAL SCHEDULES [J].
FERNANDEZ, EB ;
BUSSELL, B .
IEEE TRANSACTIONS ON COMPUTERS, 1973, C-22 (08) :745-751
[3]  
Garey MR, 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[4]   A COMPARISON OF CLUSTERING HEURISTICS FOR SCHEDULING DIRECTED ACYCLIC GRAPHS ON MULTIPROCESSORS [J].
GERASOULIS, A ;
YANG, T .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 16 (04) :276-291
[5]   Collaborative resource allocation in wireless sensor networks [J].
Giannecchini, S ;
Caccamo, M ;
Shih, CS .
16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, :35-44
[6]   An application-specific protocol architecture for wireless microsensor networks [J].
Heinzelman, WB ;
Chandrakasan, AP ;
Balakrishnan, H .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2002, 1 (04) :660-670
[7]  
HORSTER E, 2005, P 3 ACM INT WORKSH V
[8]   COMPARING IMAGES USING THE HAUSDORFF DISTANCE [J].
HUTTENLOCHER, DP ;
KLANDERMAN, GA ;
RUCKLIDGE, WJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (09) :850-863
[9]  
Karp B., 2000, MobiCom 2000. Proceedings of the Sixth Annual International Conference on Mobile Computing and Networking, P243, DOI 10.1145/345910.345953
[10]  
KASAHARA H, 1984, IEEE T COMPUT, V33, P1023, DOI 10.1109/TC.1984.1676376