• Journal of Electrical Engineering and Technology
• /
• v.9 no.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++.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.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
• /
• v.4 no.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)
• /
• v.8 no.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
• /
• v.21 no.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
• /
• v.24 no.2
• /
• pp.48-55
• /
• 2021

Ethereum is an open software platform based on blockchain technology that enables the construction and distribution of distributed applications. Ethereum uses a fully distributed connection method in which all participating nodes participate in the network with equal authority and rights. Ethereum networks use Kademlia-based node discovery protocols to retrieve and store node information. Ethereum is striving to stabilize the entire network topology by implementing node discovery protocols, but systems for monitoring are insufficient. This paper develops a WireShark dissector that can receive packet information in the Ethereum node discovery process and provides network packet measurement results. It can be used as basic data for the research on network performance improvement and vulnerability by analyzing the Ethereum node discovery process.

• ETRI Journal
• /
• v.44 no.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.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.115-128
• /
• 2017

The purpose of this study is to examine the influence of the distributed leadership upon kindergarten teachers' commitment of teachers. As a result of the analysis, first, the teachers' recognition on the distributed leadership at a kindergarten was confirmed to have a significant difference depending on the teaching career and the academic background. And the commitment of teachers perceived by the kindergarten teachers was identified to have a statistically significant difference according to the teaching career, academic background, and scale. Second, the kindergarten situation and the teacher leadership among sub-factors of the distributed leadership were indicated to have a positive effect on the commitment of teachers. Especially, the teacher leadership was confirmed to have a positive impact on the whole of professional consciousness, educational love, and passion, which are sub-factors in the commitment of teachers. What the distributed leadership has a positive influence upon the commitment of teachers at a kindergarten can be known to be ultimately the time when a teacher oneself fully recognizes responsibility, influence, and authority with thinking that a teacher oneself is a leader, rather than a director's leadership. Accordingly, a director's many responsibilities and authorities need to be properly entrusted so that the kindergarten teachers can display much more leadership.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1125-1134
• /
• 2013

Small cells such as pico or femto cells are promising as a solution to cope with higher traffic explosion and the large number of users. However, the users within small cells are likely to suffer severe inter-cell interference (ICI) from neighboring base stations (BSs). To tackle this, several papers suggest BS transmit power on/off control algorithms which increase edge user throughput. However, these algorithms require centralized coordinator and have high computational complexity. This paper makes a contribution towards presenting fully distributed and low complex joint BS on/off control and user scheduling algorithm (FDA) by selecting on/off pattern of BSs. Throughput the extensive simulations, we verify the performance of our algorithm as follows: (i) Our FDA provides better throughput performance of cell edge users by 170% than the algorithm without the ICI management. (ii) Our FDA catches up with the performance of optimal algorithm by 88-96% in geometric average throughput and sufficiently small gap in edge user throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.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.