• Journal of Electrical Engineering and Technology
• /
• 제9권6호
• /
• pp.2025-2035
• /
• 2014

The read range of UHF mobile readers can be extended by a booster for mobile RFID readers (BoMR). But in an environment where multiple BoMRs are installed, the read success rate may be decreased due to signal interference. This paper proposes three arbitration methods based on interference estimation with the purpose of enhancing the read success rate. A central arbitration server manages global information in centralized arbitration method (CAM) without broadcast/multicast communication facility. In fully distributed arbitration method (FDAM), all the arbitration messages are broadcasted from a BoMR to every BoMR, and each BoMR decides with broadcasted global information. Events in FDAM are serialized naturally with broadcasted messages. Cluster Distributed Arbitration Method (CDAM) forms clusters with multicasted BoMRs and a selected BoMR acts as an arbiter in the cluster. Such effects as lengthened read range, improved the read success rates of readers can be obtained by the proposed methods without any hardware modification. In order to evaluate the arbitration methods, the RFID system is modeled by using the DEVS formalism and simulated by using the DEVSim++.

• 제어로봇시스템학회논문지
• /
• 제10권11호
• /
• pp.1058-1064
• /
• 2004

This paper presents a distributed precedence queue mechanism to resolve unexpected transmission delay of a lower priority transaction in a CAN based system, which keeps a fixed priority in data transaction. The mechanism is implemented in the upper sub-layer of the data link layer(DLL), which is fully compatible with the original medium access control layer protocol of CAN. Thus the mechanism can be implemented dynamically while the data transactions are going on without any hardware modification. The CAN protocol was originally developed to be used in the automotive industry, and it was recently applied for a broader class of automated factories. Even though CAN is able to satisfy most of real-time requirements found in automated environments, it is not to enforce either a fair subdivision of the network bandwidth among the stations or a satisfactory distribution of the access delays in message transmission. The proposed solution provides a superset of the CAN logical link layer control, which can coexist with the older CAN applications. Through the real experiments, effectiveness of the proposed mechanism is verified.

• Journal of Species Research
• /
• 제4권1호
• /
• pp.49-56
• /
• 2015

Zeuzera is one of the most important wood borer pests in South East Asia. Like of most other genera of moths, the systematic of this genus is still in dispute, especially on the monophyly and the relationship within this genus due to the fact that genus is very varied. This genus was defined based on external characters only such as cross vein Sc-Rs present, humeral plate approximately triangular in shape and anal plate moderately long to moderately short. Therefore, the monophyly of this genus need to be evaluated based on more comprehensive data. To clarify the monophyly of the genus Zeuzera, to reveal the phylogenetic relationships among the Indonesian species, and to establish the genetic characters of Indonesian Zeuzera, we analyzed seven species of Indonesian Zeuzera including three other species distributed around the world based on nucleotide sequence variation across a 580-bp region in the CO I gene. The results showed that the monophyly of Zeuzera was supported by bootstrap tests at the MP and ML tree building methods (>95%). Genus Zeuzera was divided into two groups (A and B) with Z. borneana was excluded from the two groups and occupied at the basal node. Indonesian species was distributed into two different clades. CO I gene alone was able to fully resolve the relationships among species within clade B. However, further investigations were needed by including more species and other genes that the more conserved to test the validity of the phylogenetic hypothesis proposed here.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4372-4388
• /
• 2014

Robotic sensor network (RSN) contains mobile sensors and robots providing feasible solution for many multi-agent applications. One of the most critical issues in RSN and its application is how to effectively assign tasks. This paper presents a novel connectivity preserving hybrid task allocation strategy to answer the question particularly for RSN. Firstly, we model the task allocation in RSN to distinguish the discovering and allocating processes. Secondly, a fully distributed simple Task-oriented Unoccupied Neighbor Algorithm, named TUNA, is developed to allocate tasks with only partial view of the network topology. A connectivity controller is finally developed and integrated into the strategy to guarantee the global connectivity of entire RSN, which is critical to most RSN applications. The correctness, efficiency and scalability of TUNA are proved with both theoretical analysis and experimental simulations. The evaluation results show that TUNA can effectively assign tasks to mobile robots with the requirements of only a few messages and small movements of mobile agents.

• International Journal of Computer Science & Network Security
• /
• 제21권7호
• /
• pp.331-340
• /
• 2021

The Internet of Things (IoT) is a rapidly growing physical network that depends on objects, vehicles, sensors, and smart devices. IoT has recently become an important research topic as it autonomously acquires, integrates, communicates, and shares data directly across each other. The centralized architecture of IoT makes it complex to concurrently access control them and presents a new set of technological limitations when trying to manage them globally. This paper proposes a new decentralized access control architecture to manage IoT devices using blockchain, that proposes a solution to concurrency management problems and enhances resource locking to reduce the transaction conflict and avoids deadlock problems. In addition, the proposed algorithm improves performance using a fully distributed access control system for IoT based on blockchain technology. Finally, a performance comparison is provided between the proposed solution and the existing access management solutions in IoT. Deadlock detection is evaluated with the latency of requesting in order to examine various configurations of our solution for increasing scalability. The main goal of the proposed solution is concurrency problem avoidance in decentralized access control management for IoT devices.

• KNOM Review
• /
• 제24권2호
• /
• pp.48-55
• /
• 2021

이더리움은 분산 응용 프로그램을 구축 및 배포할 수 있도록 하는 블록체인 기술 기반 개방형 소프트웨어 플랫폼이다. 이더리움은 모든 참여 노드가 동등한 권한과 권리를 갖고 네트워크에 참여하는 완전 분산형 연결 방식을 사용한다. 이더리움 네트워크는 노드 정보를 검색하고 저장하기 위해 Kademlia 기반의 노드 탐색 프로토콜을 사용하고 있다. 동작하고 있는 이더리움 메인넷(Main Net)에서 이더리움 탐색 프로토콜을 해석하고 분석한 결과는 이더리움 P2P 네트워크의 성능향상을 위한 기초 연구임에도 불구하고 아직 그에 대한 연구결과가 없다. 본 논문에서는 이더리움 노드 탐색 과정의 패킷 정보를 제공받을 수 있는 와이어샤크 해석기를 개발한 결과를 제시하고, 이더리움 메인넷에서 노드 탐색 네트워크 트래픽을 수집하여 통계적인 분석을 실시한 결과를 제공한다. 이더리움 노드 탐색 과정 분석으로 네트워크 성능 향상과 취약성 연구를 위한 기초 자료로 활용될 수 있다.

• ETRI Journal
• /
• 제44권6호
• /
• pp.1020-1033
• /
• 2022

In this paper, we propose novel disaggregated memory module (dMM) architecture and memory access control schemes to solve the collision and contention problems of memory disaggregation, reducing the average memory access time to less than 1 ㎲. In the schemes, the distributed scheduler in each dMM determines the order of memory read/write access based on delay-sensitive priority requests in the disaggregated memory access frame (dMAF). We used the memory-intensive first (MIF) algorithm and priority-based MIF (p-MIF) algorithm that prioritize delay-sensitive and/or memory-intensive (MI) traffic over CPU-intensive (CI) traffic. We evaluated the performance of the proposed schemes through simulation using OPNET and hardware implementation. Our results showed that when the offered load was below 0.7 and the payload of dMAF was 256 bytes, the average round trip time (RTT) was the lowest, ~0.676 ㎲. The dMM scheduling algorithms, MIF and p-MIF, achieved delay less than 1 ㎲ for all MI traffic with less than 10% of transmission overhead.

• 한국콘텐츠학회논문지
• /
• 제17권3호
• /
• pp.115-128
• /
• 2017

본 연구의 목적은 분산적 리더십이 유치원 교사의 교직헌신에 미치는 영향을 확인하는 것이다. 먼저 유치원 교사들이 인식하는 분산적 리더십과 교직헌신 수준을 확인한 후, 분산적 리더십의 하위 변인들이 교사의 교직헌신에 어떤 영향을 미치는지 실증적으로 규명하였다. 연구 대상은 전라남도 지역의 유치원 교사들로 2016년 7월 12일부터 26일까지 온라인과 우편으로 설문조사를 진행하여 최종 143명의 자료를 수집하였다. 유치원 교사들의 배경 변인에 따른 분산적 리더십 및 교직헌신의 인식 차이는 차이검정을 통해 확인하였고, 분산적 리더십과 유치원 교사의 교직헌신과의 관계는 상관관계분석, 그리고 분산적 리더십이 교사의 교직헌신에 미치는 영향은 다중회귀분석을 통해 확인하였다. 분석 결과, 첫째, 유치원에서 분산적 리더십에 대한 교사의 인식은 교직경력과 학력에 따라 유의한 차이가 있었고, 교직헌신은 교직경력과 학력, 유치원 규모에 따라 유의한 차이가 확인되었다. 둘째, 유치원에서 분산적 리더십 하위요인과 교사들의 교직헌신 하위요인은 모두 정적인 상관관계가 있었다. 셋째, 분산적 리더십 하위요인 중 유치원 상황과 교사 리더십이 교직헌신에 정적인 영향을 미치는 것으로 나타났다. 결국 유치원에서 분산적 리더십이 교직헌신에 긍정적인 영향을 미치는 것은 원장의 리더십 보다는 교사 자신이 리더라는 생각과 책임과 영향력, 권한 등을 충분히 인식할 때라는 것을 알 수 있다. 따라서 유치원 교사들이 더 많은 리더십을 발휘하도록 원장의 각종 책임과 권한을 적절히 위임할 필요가 있다.

• 한국통신학회논문지
• /
• 제38A권12호
• /
• pp.1125-1134
• /
• 2013

최근 많은 수의 모바일 유저와 과도한 트래픽 증가를 해결하기 위한 솔루션으로 피코 혹은 펨토 셀과 같은 소형 셀을 설치하는 방법이 주목 받고 있다. 그러나 소형 셀에 속한 엣지 유저들은 주변 기지국으로부터 극심한 셀간 간섭을 받기 때문에 낮은 평균 전송률을 얻게 되고, 이를 해결하기 위해서는 셀 간 간섭을 효과적으로 관리하는 방법이 필요하다. 최근의 많은 연구들은 셀 간 간섭 관리를 위해 기지국의 전송 전력을 제어하는 알고리즘을 제시하였지만, 제시된 방법들은 높은 복잡도를 가지고 중앙 기지국의 도움을 필요로 한다는 단점이 있다. 본 연구에서는 기지국간의 경쟁을 기반으로 하여, 낮은 복잡도를 가지는 분산화된 방법의 기지국 전송 전력 on/off 제어 및 유저 스케줄링 알고리즘을 제안한다. 시뮬레이션 결과를 통해, 제안하는 방법이 셀 간 간섭 관리를 하지 않는 방법에 비해 셀 엣지 유저의 경우 170%의 성능 개선을 보이고, 최적의 알고리즘과 비교 했을 때 88-96%에 달하는 geometric average throughput (GAT) 성능 및 매우 근접한 average edge user throughput (AET) 성능을 보임을 검증한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2894-2909
• /
• 2015

As the number of mobile devices such as smart phones and tablets explodes, the need for new services or applications is also rapidly increasing. Smart class application is one of the emerging applications, in which most of contents are distributed to all members of a class simultaneously. It is highly required to select relay nodes to cover shadow area of radio as well as extend coverage, but existing algorithms in a smart class environment suffer from high control packet overhead and delay for exchanging topology information among all pairs of nodes to select relay nodes. In addition, the relay selection procedure should be repeated in order to adapt to the dynamic topology changes caused by link status changes or device's movement. This paper proposes the learning based relay selection algorithm to overcome aforementioned problems. The key idea is that every node keeps track of its relay quality in a fully distributed manner, where RQI (Relay Quality Indicator) is newly defined to measure both the ability of receiving packets from content source and the ability of successfully relaying them to successors. The RQI of each node is updated whenever it receives or relays broadcast packet, and the node having the higher RQI is selected as a relay node in a distributed and run-time manner. Thus, the proposed algorithm not only removes the overhead for obtaining prior knowledge to select relay nodes, but also provides the adaptability to the dynamic topology changes. The network simulation and experimental results prove that the proposed algorithm provides efficient and reliable content distribution to all members in a smart class as well adaptability against network dynamics.