File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Achieving 360° angle coverage with minimum transmission cost in visual sensor networks

TitleAchieving 360° angle coverage with minimum transmission cost in visual sensor networks
Authors
KeywordsCommunications
Issue Date2007
PublisherIEEE Communications Society.
Citation
Ieee Wireless Communications And Networking Conference, Wcnc, 2007, p. 4115-4119 How to Cite?
AbstractIn 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.
DescriptionProceedings of the IEEE Wireless Communications and Networking Conference, 2007, p. 4112-4116
Persistent Identifierhttp://hdl.handle.net/10722/98832
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorChow, KYen_HK
dc.contributor.authorLui, KSen_HK
dc.contributor.authorLam, EYen_HK
dc.date.accessioned2010-09-25T18:04:08Z-
dc.date.available2010-09-25T18:04:08Z-
dc.date.issued2007en_HK
dc.identifier.citationIeee Wireless Communications And Networking Conference, Wcnc, 2007, p. 4115-4119en_HK
dc.identifier.issn1525-3511en_HK
dc.identifier.urihttp://hdl.handle.net/10722/98832-
dc.descriptionProceedings of the IEEE Wireless Communications and Networking Conference, 2007, p. 4112-4116-
dc.description.abstractIn 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.languageengen_HK
dc.publisherIEEE Communications Society.-
dc.relation.ispartofIEEE Wireless Communications and Networking Conference, WCNCen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsIEEE Wireless Communications and Networking Conference. Proceedings. Copyright © IEEE Communications Society.-
dc.rights©20xx 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.subjectCommunications-
dc.titleAchieving 360° angle coverage with minimum transmission cost in visual sensor networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://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.emailLui, KS:kslui@eee.hku.hken_HK
dc.identifier.emailLam, EY:elam@eee.hku.hken_HK
dc.identifier.authorityLui, KS=rp00188en_HK
dc.identifier.authorityLam, EY=rp00131en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/WCNC.2007.751en_HK
dc.identifier.scopuseid_2-s2.0-36348959157en_HK
dc.identifier.hkuros133248en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-36348959157&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage4115en_HK
dc.identifier.epage4119en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridChow, KY=15046367600en_HK
dc.identifier.scopusauthoridLui, KS=7103390016en_HK
dc.identifier.scopusauthoridLam, EY=7102890004en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats