File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/WCNC.2007.751
- Scopus: eid_2-s2.0-36348959157
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Achieving 360° angle coverage with minimum transmission cost in visual sensor networks
Title | Achieving 360° angle coverage with minimum transmission cost in visual sensor networks |
---|---|
Authors | |
Keywords | Communications |
Issue Date | 2007 |
Publisher | IEEE Communications Society. |
Citation | Ieee Wireless Communications And Networking Conference, Wcnc, 2007, p. 4115-4119 How to Cite? |
Abstract | In this paper, we study the angle coverage problem in visual sensor network. We consider a tracking system where an object of interest moves around the network, and the sensors surrounding it are responsible for capturing the images of it. We aim at finding the minimum cost cover which preserves all the angles of view with minimum transmission cost. We proved formally that the minimum cost cover problem can be transformed into the shortest path problem. Due to the acyclic nature of graphs generated in the transformation, we can develop a distributed algorithm to solve the problem, which is a lot more efficient than the distance vector protocol. Our simulation results show that our algorithm can successfully save a lot of energy. © 2007 IEEE. |
Description | Proceedings of the IEEE Wireless Communications and Networking Conference, 2007, p. 4112-4116 |
Persistent Identifier | http://hdl.handle.net/10722/98832 |
ISSN | 2020 SCImago Journal Rankings: 0.361 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chow, KY | en_HK |
dc.contributor.author | Lui, KS | en_HK |
dc.contributor.author | Lam, EY | en_HK |
dc.date.accessioned | 2010-09-25T18:04:08Z | - |
dc.date.available | 2010-09-25T18:04:08Z | - |
dc.date.issued | 2007 | en_HK |
dc.identifier.citation | Ieee Wireless Communications And Networking Conference, Wcnc, 2007, p. 4115-4119 | en_HK |
dc.identifier.issn | 1525-3511 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/98832 | - |
dc.description | Proceedings of the IEEE Wireless Communications and Networking Conference, 2007, p. 4112-4116 | - |
dc.description.abstract | In this paper, we study the angle coverage problem in visual sensor network. We consider a tracking system where an object of interest moves around the network, and the sensors surrounding it are responsible for capturing the images of it. We aim at finding the minimum cost cover which preserves all the angles of view with minimum transmission cost. We proved formally that the minimum cost cover problem can be transformed into the shortest path problem. Due to the acyclic nature of graphs generated in the transformation, we can develop a distributed algorithm to solve the problem, which is a lot more efficient than the distance vector protocol. Our simulation results show that our algorithm can successfully save a lot of energy. © 2007 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.publisher | IEEE Communications Society. | - |
dc.relation.ispartof | IEEE Wireless Communications and Networking Conference, WCNC | en_HK |
dc.rights | ©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Communications | - |
dc.title | Achieving 360° angle coverage with minimum transmission cost in visual sensor networks | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1525-3511&volume=&spage=4112&epage=4116&date=2007&atitle=Achieving+360+degree+angle+coverage+with+minimum+transmission+cost+in+visual+sensor+networks | - |
dc.identifier.email | Lui, KS:kslui@eee.hku.hk | en_HK |
dc.identifier.email | Lam, EY:elam@eee.hku.hk | en_HK |
dc.identifier.authority | Lui, KS=rp00188 | en_HK |
dc.identifier.authority | Lam, EY=rp00131 | en_HK |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/WCNC.2007.751 | en_HK |
dc.identifier.scopus | eid_2-s2.0-36348959157 | en_HK |
dc.identifier.hkuros | 133248 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-36348959157&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 4115 | en_HK |
dc.identifier.epage | 4119 | en_HK |
dc.publisher.place | United States | en_HK |
dc.identifier.scopusauthorid | Chow, KY=15046367600 | en_HK |
dc.identifier.scopusauthorid | Lui, KS=7103390016 | en_HK |
dc.identifier.scopusauthorid | Lam, EY=7102890004 | en_HK |
dc.identifier.issnl | 1525-3511 | - |