• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• Smart Structures and Systems
• /
• v.16 no.1
• /
• pp.223-242
• /
• 2015

Wireless sensor networks (WSNs) have emerged as a novel solution to many of the challenges of structural health monitoring (SHM) in civil engineering structures. While research projects using WSNs are ongoing worldwide, implementations of WSNs on full-scale structures are limited. In this study, a WSN is deployed on a full-scale 17.3m-long, 11-bay highway sign support structure to investigate the ability to use vibration response data to detect damage induced in the structure. A multi-level damage detection strategy is employed for this structure: the Angle-between-String-and-Horizon (ASH) flexibility-based algorithm as the Level I and the Axial Strain (AS) flexibility-based algorithm as the Level II. For the proposed multi-level damage detection strategy, a coarse resolution Level I damage detection will be conducted first to detect the damaged region(s). Subsequently, a fine resolution Level II damage detection will be conducted in the damaged region(s) to locate the damaged element(s). Several damage cases are created on the full-scale highway sign support structure to validate the multi-level detection strategy. The multi-level damage detection strategy is shown to be successful in detecting damage in the structure in these cases.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.5
• /
• pp.959-972
• /
• 2021

Decentralized Identity is based on the concept of self-sovereign identity, in which holders manage and provide their own credentials. However, a procedure is required to obtain credentials from issuers, and there is a risk of mess personal information leaking due to negligence of the issuers. In this paper, we propose a peer decentralized identity system based on Peer DID technology that allows only participants to verify their identity in 1:1 or 1:N small groups by matching the holder with the issuer. It is directly connected to a mobile device using short-range wireless communications such as bluetooth, and the holders create and provide their own credentials in person to the other party, thus fully realizing the self-sovereignty identity. The proposed system can simplify the identification process, improve security and privacy, and reduce costs. Furthermore, an extended architecture is possible to connect the proposed system and the distributed ledger to identify users in other domains. In the future, based on various technologies, it is also necessary to expand research on identity systems that can be utilized for human-to-thing and things-to-things authentication.

• Journal of the Korea Convergence Society
• /
• v.7 no.6
• /
• pp.43-48
• /
• 2016

Wireless sensor networks (WSN) can be more reliable and easier to program and use with the help of sensor database management systems (SDMS). SDMS establish a user-friendly SQL-based interface to process declarative user-defined queries over sensor readings from WSN. Typical queries in SDMS are ad-hoc snapshot queries and long-running, continuous queries. In SDMSs queries are flooded to all nodes in the sensor net, and query results are sent back from nodes that have qualified results to a base station. For query flooding to all nodes, and result flooding to the base station, a lot of communication energy consuming is required. This paper suggests an efficient in-network index solution, named Distributed Information Gathering (DIG) to process range queries in a sensor net environment that can save energy by reducing query and result flooding.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.89-100
• /
• 2000

Recently, studies on the mobile computing environments that enable mobile hosts to move while retaining its network connection are in progress. In these mobile computing environments, one of the necessary components is the distributed file system supporting mobile hosts, and there are several issues for the design and implementation of the shared file system. Among these issues, there are problems caused by network traffic on limited bandwidth of wireless media. Also, there are consistency maintenance issues that are caused by update-conflicts on the shared files in the distributed file system. In this paper, we propose TWB(Trickle Write-Back) scheme that utilizes weak connectivity for cache management of mobile clients. This scheme focuses on saving bandwidth, reducing waste of disk space, and reducing risks caused by disconnection. For such goals, this scheme lets mobile clients write back intermediate states periodically or on demand while delaying unnecessary write-backs. Meanwhile, this scheme is based on the existing distributed file system architecture and provides transparency.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.861-865
• /
• 2009

As the hospital environment has been increasingly changed into a ubiquitous environment, the application services for the hospital environment are also faced with new requirements. In particular, the emergence of various mobile devices and the introduction of a wireless sensor network technology have accelerated the realization of the u-healthcare. The multi-agent paradigm has been introduced for satisfying both the integration of information and the various application scenarios established from various environments. This paper describes the software structure and u-applications for u-hospital information system based on ubiquitous environments. And it suggested the construction of a multi agent based distributed framework for supporting u-hospital information system. The suggested framework includes the JADE and distributed object group framework. And it implemented u-application services for supporting doctors and nurses, which provides the patient's health information and ward environment information. Especially, it is using a dynamic security mechanism on the security situation, which has not been emphasized in existing researches, and this paper shows the results for each user through the GUI.

• 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.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.143-154
• /
• 2003

There is a growing trend in developing system for distributed mobile system that supports services - job flow management, video conference, replicated data management and resource allocation. Supporting these services, applications have to use causally ordered message delivery. Previous proposals that provide causally ordered message delivery have problems such as communication overhead, message delaying, scalability, computing overload of mobile host. In this paper, we proposed efficient protocol for causally ordered message delivery using the methods that MSS maintains dependency information matrix between MSS and MH, Piggybacking dependency information about each immediate predecessor message. Proposed algorithm, when compared with previous proposals, provides a low message overhead, and low probability of unnecessary inhibition in delivering messages. Also, it consider resource restriction of MH and low bandwidth of wireless communication by computing most of algorithm at MSS, and reduce processing delay by executing causally ordered message delivery a unit of MH.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2A
• /
• pp.179-187
• /
• 2007

As wireless networks evolve to orthogonal frequency division multiple access(OFDMA) systems, inter-cell interference control becomes a critical issue in radio resource management. The allocation of the same channels in neighbor cells cause inter-cell interference, so the channel allocation needs to be taken carefully to lower the inter-cell interference. In distributed channel allocation, each cell independently tries to allocate channels that suffer low interference level. In this paper, under the assumption of static users, we introduce the concept of interference range and use it in designing our two algorithms; basic and combined. The basic algorithm performs interference range detection and determines whether to use the considered channel, while the combined algorithm checks the channel quality in addition to detecting the interference range. The two algorithms dynamically perform channel allocation with low complexity and show good throughput and fairness performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2548-2567
• /
• 2015

Recently, there has been a clear trend towards the application of ad hoc networking technology in civil aviation communication systems, giving birth to a new research field, namely, aeronautical ad hoc networks (AANETs). An AANET is a special type of ad hoc wireless network with a significantly larger scale and distinct characteristics of its mobile nodes. Thus, there is an urgent need to develop a simulator to facilitate the research in these networks. In this paper, we present a network simulator, Aero-Sim, for AANETs. Aero-Sim, which is based on the freely distributed NS-2 simulator, enables detailed packet-level simulations of protocols at the MAC, link, network, transport, and application layers by composing simulations with existing modules and protocols in NS-2. Moreover, Aero-Sim supports three-dimensional network deployment. Through several case studies using realistic China domestic air traffic, we show that the proposed simulator can be used to simulate AANETs and can reproduce the real world with high fidelity.