Citation Export
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이택균 | - |
dc.date.issued | 2018-09 | - |
dc.identifier.issn | 1598-849X | - |
dc.identifier.uri | https://aurora.ajou.ac.kr/handle/2018.oak/34864 | - |
dc.description.abstract | In this paper, we propose a hexagon model-based efficient beacon frame scheduling approach for wireless sensor networks. The existing beacon frame scheduling approaches use a lot of slots and subslots for the beacon frame scheduling. Thus, the data from source nodes are not efficiently delivered to a sink node. Also in case a sink node needs to broadcast a beacon frame to the nodes in the network, delivering the beacon frame to the network nodes is not efficient as well. Thus, to solve the problem, we use a hexagon model to find the number of slots and subslots for the beacon frame scheduling. By using them for the beacon frame scheduling, the proposed approach performs better than other approaches in terms of the data transmission delay, the number of received data, the beacon transmission delay and the number of relaying the beacon frames. | - |
dc.language.iso | Kor | - |
dc.publisher | 한국컴퓨터정보학회 | - |
dc.title | 무선 센서 네트워크에서 헥사곤 모델에 기반한 효율적인 비콘 스케줄링 기법 | - |
dc.title.alternative | A Hexagon Model-based Efficient Beacon Scheduling Approach for Wireless Sensor Networks | - |
dc.type | Article | - |
dc.citation.endPage | 50 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 43 | - |
dc.citation.title | 한국컴퓨터정보학회논문지 | - |
dc.citation.volume | 23 | - |
dc.identifier.bibliographicCitation | 한국컴퓨터정보학회논문지, Vol.23 No.9, pp.43-50 | - |
dc.identifier.doi | 10.9708/jksci.2018.23.09.043 | - |
dc.subject.keyword | Beacon | - |
dc.subject.keyword | Scheduling | - |
dc.subject.keyword | Slot | - |
dc.subject.keyword | Collision | - |
dc.subject.keyword | Cluster Tree | - |
dc.subject.keyword | Wireless Sensor Networks | - |
dc.type.other | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.