Design and Implementation of Neighbor Information-based Mobile Video Surveillance Routing over Ad Hoc Networks
Date Issued
2007
Date
2007
Author(s)
Chang, Chia-Wei
DOI
zh-TW
Abstract
The cameras in traditional video surveillance system are needed to set in fixed points and connected to a central control room. With the digital camera, IP-based networking, wireless technology and IP-based video surveillance environments emerging, new video surveillance applications are inspired. For example, surveillance systems with cameras on the mobile devices (notebook, PDA, 3G mobile phone, etc) lead to the possibility of mobile video surveillance application.
The focus of this thesis is to explore new and innovative mobile video surveillance services with the quality of service guaranteed. Since individual nodes can move freely on an ad hoc network, the neighboring nodes within a node’s transmission range will vary with time and the neighbors’ position information need to be updated dynamically. Currently, the protocol design of IEEE 802.11x protocols does not favor efficient multi-Hop transmission. So our two research problems are as follows:
1. How to periodically obtain neighbor nodes’ information by each node in an ad hoc network?
2. How to establish a video surveillance transmission path that uses as few hops as possible, has a minimum data rate and is reliably connected.
We first conduct an experiment of real-time video streaming over an IEEE 802.11 ad hoc network to understand its transmission characteristic. We then design a neighbor information list (NIL) routing protocol of the network layer, which consists of a NIL exchange stack and a NIL routing algorithm (NILRA) to address the aforementioned two research problems. Our NIL exchange stack design includes IP address, longitude, latitude, data rate, speed, direction. It allows nodes to broadcast among each other periodically and collects neighbor’s information in the transmission range of each node. The neighbor’s information includes IP address, the position of longitude and latitude, moving speed, direction and data rate. In NILRA operations, when a node receives a route request (RREQ) originated from a source node, it checks a pre-set distance threshold carried by the RREQ. If the distance between the node and the requested destination location for video taking is not within the specified threshold, it will look for a next node in its NIL that is closer to the destination than this node and has a minimum data rate; the current node will then relay RREQ to this next node. If no closer next node can be found, this current node will be designated as the imaging taking node and move to the destination. Finally, we can establish an imaging taking path between the source node and the destination that satisfies the minimum rate requirement by this logic. In addition, the node on an established path can move according to the leader's command, and reduce the broken probability of path.
We implement the design into a system prototype of the NIL routing protocol in application layer. In NIL implementation, we utilize a Broadcast program of VB.NET TM to broadcast the NIL information, and build SQL TM Database to store neighbor’s information. In NILRA implementation, we use VB.NET TM to develop the NILRA program. It can extract NIL information at each node, then search and establish a transmission path. Finally, we demonstrate that NILRA finds a better video transmission path than the one found by shortest path algorithm.
Subjects
移動視訊偵搜
路由演算法
定位
位置
mobile video surveillance
neighbor information list
routing algorithm
positioning
Location
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-96-R94921004-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):93a4ea9a89d60c3200c90a44ce316ac4