DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Dae-Young | - |
dc.contributor.advisor | 김대영 | - |
dc.contributor.author | Park, No-Seong | - |
dc.contributor.author | 박노성 | - |
dc.date.accessioned | 2011-12-30 | - |
dc.date.available | 2011-12-30 | - |
dc.date.issued | 2005 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392475&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/55335 | - |
dc.description | 학위논문(석사) - 한국정보통신대학교 : 공학부, 2005, [ vii, 66 p. ] | - |
dc.description.abstract | While getting so much attention as the most promising technology that makes human environment interactions possible, wireless sensor network has been showing its tangible applications in real fields thanks to the advances in technologies such as MEMS, wireless communications, processors and so on. Among many design factors, the energy efficiency is the most crucial, Until now, there have been many trials to provide an optimal route for minimum energy consumption in wireless sensor network whose energy resource is very limited at every node. Currently, however, the mechanisms to find $\It{minimum energy paths}$ (MEPG) do not properly take into account the efficiency in time and storage, the optimality in results, and the feasibility in real systems. In the thesis, as an useful auxiliary for the minimum energy routing protocol, we propose an efficient and first optimal algorithm to find the MEPG in which all $\It{minimum energy paths}$ are included, not only significantly reducing its total number of edges, but also getting an optimal result in $\It{O}(\It{V}\log{V+E})$. In addition, the proposed algorithm can be utilized to find other types of reduced graph according to the weight values used in the graph. For example, adopting the delay as a weight value, the proposed algorithm can draw the graph having all $\It{minimum delay paths}$ but whose total number of edges is quite less than the original graph. We also suggest $\It{Power Aware Data-centric}$ (PAD) routing protocol characterized by minimum energy consumption, longer lifetime, and low network delay in sensor networks PAD, which makes the routing table prior to packet transmissions, is a kind of $\It{Distance Vector}$ (DV) routing protocol, PAD is designed to perform the minimum energy routing and reduce the overheads for routing table constructions. For longer lifetime, detours can be used instead of found minimum energy paths with low overhead. In addition, the mobility is also supported with low ov... | eng |
dc.language | eng | - |
dc.publisher | 한국정보통신대학교 | - |
dc.subject | Minimum Energy Routing | - |
dc.subject | Minimum Energy Property Graph | - |
dc.subject | Sensor Network | - |
dc.subject | PAD | - |
dc.subject | 최저전력 라우팅 | - |
dc.subject | 최저전력특징그래프 | - |
dc.subject | 센서 네트워크 | - |
dc.subject | DDBF | - |
dc.title | An optimal and lightweight routing for minimum energy consumption in wireless sensor networks | - |
dc.title.alternative | 센서 네트워크에서 최저전력소모를 위한 최적의 가벼운 라우팅 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 392475/225023 | - |
dc.description.department | 한국정보통신대학교 : 공학부, | - |
dc.identifier.uid | 020034535 | - |
dc.contributor.localauthor | Kim, Dae-Young | - |
dc.contributor.localauthor | 김대영 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.