• Journal of Internet Computing and Services
• /
• v.11 no.1
• /
• pp.15-20
• /
• 2010

In this paper, we propose a novel approach to reduce spatial query access latency and energy consumption by leveraging results from nearby peers in wireless broadcast environments. We propose a three-tier Hierarchical Location-Based Sequential access index, called HLBS, which provides selective tuning (pruning and searching entries) without pointers using a linear accessing structure based on the location of each data object. The HLBS saves search cost and index overhead, since the small index size with a sequential index structure results in low access latency overhead and facilitates efficient searches for sequential-access media (wireless channels with data broadcast). Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

• Journal of Internet Computing and Services
• /
• v.10 no.2
• /
• pp.161-169
• /
• 2009

The development of Wireless Multimedia Sensor Networks(WMSNs) is getting realized in accordance with the increased demands to provide multimedia data transmission service such as CCTV movie, image chapter information, audio information based on wireless sensor network. It is very important to provide the differentiated quality assurance of service. In this paper, we propose a sensor medium access control protocol based on DSMAC, which provides differentiated Quality of Service(QoS) for delay. A proposed protocol is able to reduce the delay without increasing the energy consumption by adaptively changing the duty cycle according to the buffer occupancy. Simulation results show that the new MAC protocol performs better in terms of latency than S-MAC and DSMAC.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1679-1686
• /
• 2007

Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

• Journal of the Korea Convergence Society
• /
• v.10 no.11
• /
• pp.41-46
• /
• 2019

Recently, the Byzantine Fault Tolerance(BFT) family of consensus algorithms has been attracting attention as the problems of the Proof-of-work (PoW) blockchain consensus algorithms result in energy waste and lack of scalability. One of the great features of the PBFT family consensus algorithms is the formation of a set of validators and consensus within them. In this paper, we compared and analyzed the scalability, targeted attackability, and civil attackability of Algorand, Stellar, and EOS validator set formation methods among BFT family consensus algorithms. Also, we found the problems of each verifier formation method through data analysis, and the consensus algorithms showed that the centralization phenomenon that the few powerful nodes dominate the whole system in common.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.603-606
• /
• 2019

In this paper, we propose a slotted-ALOHA-based random access protocol and derive the optimal number of random slots that maximize channel throughput when multiple energy harvesting sensor devices perform random access in wireless-powered sensor networks (WPSN). Throughput numerical analysis, we prove that the throughput has a concavity with respect to the number of random slots and obtain the optimal number of slots. Simulation results show that the throughput of the proposed slotted ALOHA-based random access protocol is maximize when the derived optimal number of slots is employed in the considered WPSN.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.578-580
• /
• 2009

Wireless Sensor Networks(WSNs) has been used for various applications. It is optimized to low power operation than various function and transmission reliability because of limited power by batteries. but it is necessary to guarantee of reliability for using exact data for more diversity purpose. In WSNs environment composed by multi-hop, it is guarantee to end-to-end transmission reliability based hop-by-hop reliability. however, IEEE 802.15.4 standard is not consider link-layer reliability. in this paper, we propose energy efficient Reliable Link-layer Protocol for Wireless Sensor Networks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.631-632
• /
• 2009

센서 네트워크에 대한 보안은 일반 네트워크와 동일하게 보안성, 무결성, 가용성 등이 요구된다. 그러나 일반적으로 센서 네트워크는 무선 통신을 하는 네트워크이고, 고정된 인프라가 없으며, 네트워크 토폴로지가 자주 변하는 특징으로 인해 보안문제는 어려운 것으로 인식되고 있다. 특히, 센서 노드의 에너지와 같은 자원 고갈을 유발하여 정상적인 동작을 못하게 하는 서비스 거부(Denial of Service, DoS)와 같은 공격에 취약하다. 본 논문에서는 센서 네트워크의 일반적인 구성을 통해 발생할 수 있는 DoS 공격의 유형을 분석하고, 보안요구사항을 제시하였다. 제시한 보안요구사항은 DoS 공격 뿐 아니라 센서 네트워크에서 발생할 수 있는 다양한 공격 유형에 대한 보안요구사항을 마련하는 데에 기초가 될 것으로 기대한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.710-713
• /
• 2008

센서 네트워크는 습도, 온도, 조도 등의 다양한 정보를 수집할 수 있는 센서들을 특정한 지역이나 광범위한 지역에 분포하여 특정 이벤트를 탐지하거나 계속적으로 환경을 관찰하여 수집된 정보를 효율적으로 Base Station으로 전송하는 일종의 애드 혹 네트워크이다. 본 논문은 센서 네트워크의 라우팅 프로토콜 중 PEGASIS와 동심원 형태의 클러스터링 방법에 대해 취약점을 알아보고, 이를 해결하기 위한 방법으로 클러스터 헤드 선출을 위한 두 가지 기준을 정하고, 퍼지 이론을 기반으로 적절한 선택 값을 도출하여 효율적인 클러스터 헤드를 선출하는 방법을 제안한다. 이 방법은 각 센서 노드들의 남아있는 에너지를 고려할 수 있으며, 각 레벨에서 클러스터 헤드들은 가깝게 위치하게 되어 Multi-hop으로 데이터 전송 시 기존의 방법들보다 전송 거리를 줄일 수 있는 장점을 가지고 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.815-818
• /
• 2007

최근 유비쿼터스 시대가 도래하면서 센서 네트워크의 중요성이 대두되고 있다. 센서 네트워크란 필요한 모든 곳에 전자태그를 부착하고, 이를 통해 사물의 인식 정보를 기본으로 주변의 환경정보까지 각종 센서를 통해 실시간으로 수집하여 관리, 통제할 수 있도록 구성한 네트워크를 말한다. 이러한 센서 네트워크에서 각 노드들은 에너지, 계산 능력, 대역폭 등에 상당한 제한을 받으며, 정보가 저장된 장치를 쉽게 도난 당할 수도 있다. 특히 보안 통신을 하기 위해 키 설정 및 관리는 필수적이며 지금까지 그로 인해 여러 가지 키 분배 및 관리 방법이 제안되었다. 본 논문은 군대 등의 특정 상황과 같이 계층적 구조를 가지는 센서 네트워크에서 더욱 효율적으로 통신을 할 수 있는 키 관리 방법을 소개하고자 한다. 기존의 계층적 구조의 취약점을 분석하고, 이를 바탕으로 레벨 키를 제안하여 같은 레벨에서 다른 그룹간 통신이 가능한 효율적인 키 분배 방안을 제시한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.8
• /
• pp.66-75
• /
• 2016

Due to aggressive scaling of device sizes and reduced noise margins, physical defects caused by aging and process variation are continuously increasing. Additionally, with scaling limitation of metal wire and the increasing of communication volume, fault tolerant method in manycore network-on-chip (NoC) has been actively researched. However, there are few researches investigating reliability in NoC with voltage-frequency-island (VFI) regime. In this paper, we propose a table-based routing technique that can communicate, even if link failures occur in the VFI NoC. The output port is alternatively selected between best and the detour routing path in order to improve reliability with minimized hardware cost. Experimental results show that the proposed method achieves full coverage within 1% faulty links. Compared to $d^2$-LBDR that also considers a routing method for searching a detour path in real time, the proposed method, on average, produces 0.8% savings in execution time and 15.9% savings in energy consumption.