Research on Coverage Connection Establishment and Maintenance for Mobile Video Surveillance over Ad Hoc Networks

• Main Authors: Wun-Yan Lyu, 呂文彥
• Other Authors: Shi-Chung Chang
• Format: Others
• Language: zh-TW
• Published: 2008
• Online Access: http://ndltd.ncl.edu.tw/handle/85423374066606751082

碩士 === 國立臺灣大學 === 電機工程學研究所 === 96 === Since the event of 911 in New York, the importance of individual and public safety has been raised. Video surveillance system has been broadly used in the applications of human and public protection. By the development of IP-based video surveillance network, the transmission of video streaming can be though wireless network, and solicits more new types of mobile video surveillance services. For example, the monitoring system which consists of digital cameras setting on mobile equipments like laptop, PDA, 3G and cellular phone, etc, provides much more mobility of video surveillance service. The goal of this thesis aims at designing the methodology and associated system to command the peers of a mobile video surveillance network to establish a connection covering the target, static or moving, with minimum moving energy consumption and to provide and maintain target’s streaming video to requesting peer. To command peers moving and sense the target moving, we exploit the mobile video surveillance architecture proposed by Liao, 2006, and Chang, 2007, and add two new function blocks to the application layer: command block and surveillance block, We use these two blocks to plan a path to cover the target and to assign the coverage and relay mission to proper peers by moving or handoff based on the movement information of target. To model the problem of path planning for establishing video surveillance coverage and connection, we first formulate a mathematical model of Initial Coverage and Connection Problem (ICCP). The model takes communication coverage and the constraints of moving path into consideration to minimize moving energy consumption. There are three decision variables: (1) numbers of active peers, (2) desired locations of peers and (3) pair variables. We propose a two-stage solution algorithm (TSSA) to solve ICCP. Stage 1 decides numbers of active peers and stage 2 determines the desired locations of the active peers and peer-location assignment. To address the problem about how to maintain a video connection as the target moves, we look ahead T time units and predict target’s next location after T. Then we plan how the peers move to maintain video surveillance coverage and connection when the target is at the predicted location. This problem can be viewed as an extension of ICCP. We propose a mechanism which includes information exchange, mission handoff and Dynamic Adjustment Peers Location Algorithm (DAPLA). The main concepts of the algorithm are repetitively predicting target’s next location, refreshing neighborhood information to do the mission handoff and solving ICCP by TSSA. We implement the mechanism for moving planning and command by VB.NET 2003TM and SQL 2000TM in the application layer in three parts: I. a self-broadcast program to construct the Peers Information list (PIL), II. the TSSA in Lingo 9.0 to solve ICCP for a path plan of peer movements, and III. a surveillance block to sense and predict target location and a command function block to transmit location information to active peers with unit-cast.