DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Yang, Hyun-Seung | - |
dc.contributor.advisor | 양현승 | - |
dc.contributor.author | Jeong, Go-Wun | - |
dc.contributor.author | 정고운 | - |
dc.date.accessioned | 2015-04-23T08:30:35Z | - |
dc.date.available | 2015-04-23T08:30:35Z | - |
dc.date.issued | 2014 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=568608&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/197820 | - |
dc.description | 학위논문(박사) - 한국과학기술원 : 전산학과, 2014.2, [ vi, 74 p. ] | - |
dc.description.abstract | Networks of wirelessly communicating, battery-powered, field-of-view-overlapping, stationary camera sensors, called wireless camera networks in the thesis, have been widely employed for surveillance due to their sensors’ cheapness and handy installation. Since these cameras of limited capabilities on bandwidth, lifespan, computation, and storage have to deal with high-dimension data sets generated from images, the networks more seriously suffer from such limited network resources. Because sensing and processing scenes are the most costly ones of cameras’ jobs, we intuitively attempt to reduce the occurring rate of such jobs in a network by selecting only a portion of optimal cameras for currently given targets to activate. This selection problem is modeled in a cooperative bargaining game where cameras sequentially decide their mode between “sleep” and “active” in descending order of their bargaining power based on the serial dictatorial rule to raise the global target coverage collectively. Such a great deal of image data to travel in a network also requires low resource overheads to secure network communication. We target one of the most harmful security attacks, impersonating, where an attacker physically capturing a node obtains every cryptographic information of the node and diffuses a lot of false data by impersonating the captured node with the obtained keys, to efficiently tackle with assuming a clustered network. Our proposed novel dynamic key management framework of different keying mechanisms respectively secure in-cluster, inter-cluster, and individual communication by refreshing keys on demand, while adaptively handling node addition and eviction. Theoretic analyses and simulation results show that both of our proposed approaches provide high performance in terms of resource efficiency and related measurements, such as target coverage for resource utilization and impersonating-resiliency for security. Each of them also presents a better trade-o... | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | dynamic keying | - |
dc.subject | serial dictatorial rule | - |
dc.subject | cooperative bargaining game | - |
dc.subject | sensor scheduling | - |
dc.subject | impersonating | - |
dc.subject | dynamic keying | - |
dc.subject | impersonating | - |
dc.subject | sensor scheduling | - |
dc.subject | cooperative bargaining game | - |
dc.subject | serial dictatorial rule | - |
dc.title | Dynamic key-based security and serial dictatorial rule-based resource utilization for efficient wireless camera networks | - |
dc.title.alternative | 효율적인 무선 카메라 네트워크를 위한 다이나믹 키 기반 보안 및 순차 우선적 규칙 기반 자원 효용 기술 | - |
dc.type | Thesis(Ph.D) | - |
dc.identifier.CNRN | 568608/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 020085329 | - |
dc.contributor.localauthor | Yang, Hyun-Seung | - |
dc.contributor.localauthor | 양현승 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.