This page has only limited features, please log in for full access.

Unclaimed
Ilyong Chung
Department of Computer Engineering, Chosun University, Gwangju 61452, Korea

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 26 February 2021 in Electronics
Reads 0
Downloads 0

Nowadays, the research on vehicular ad hoc networks (VANETs) remains a hot topic within the Internet of Things (IoT) scenarios. Diverse studies and techniques regarding all aspects of VANETs have been investigated thoroughly. Particularly, the wireless characteristic of heterogeneous vehicular communication, along with the complicated and dynamic connection topology among participating VANET entities, have severely affected the secure and stable data exchange. Specifically, the spontaneous vehicle-to-vehicle (V2V) message dissemination, as the essential functionality of VANET, plays a significant role for instant and real-time data sharing for vehicles within a certain vicinity. However, with the short-time interaction and high mobilization of vehicular connections, the remote V2V message delivery intended for long-distance vehicles in the range of different roadside units (RSUs) has not been properly researched. Meanwhile, both V2V and V2R (Vehicle-to-RSU) communication are highly restricted by environmental factors such as physical obstructions or signal interferences, thus drastically reducing the wireless connectivity in practical VANET implementations. In this case, the unmanned aerial vehicles (UAVs), as the auxiliary facilities, can provide the VANET with substitute wireless routes, so that the transmission quality and availability can be improved. In this paper, the authenticated UAV group association design is proposed at first. On this basis, the remote V2V message dissemination method is enabled, where the decentralized V2V connections involving all RSUs along the way are provided. The analysis regarding crucial security properties is presented accordingly, where the formal proofs and comparison are conducted. Moreover, the performance evaluation in terms of storage and time consumption during RSU authentication process is illustrated, respectively. Comparison results with the state-of-the-art prove that superiority on the major performance factors can be achieved.

ACS Style

Haowen Tan; Ilyong Chung. RSU-Aided Remote V2V Message Dissemination Employing Secure Group Association for UAV-Assisted VANETs. Electronics 2021, 10, 548 .

AMA Style

Haowen Tan, Ilyong Chung. RSU-Aided Remote V2V Message Dissemination Employing Secure Group Association for UAV-Assisted VANETs. Electronics. 2021; 10 (5):548.

Chicago/Turabian Style

Haowen Tan; Ilyong Chung. 2021. "RSU-Aided Remote V2V Message Dissemination Employing Secure Group Association for UAV-Assisted VANETs." Electronics 10, no. 5: 548.

Journal article
Published: 14 October 2020 in Electronics
Reads 0
Downloads 0

Currently, the outbreak of COVID-19 pandemic has caused catastrophic effect on every aspect of our lives, globally. The entire human race of all countries and regions has suffered devastating losses. With its high infectiousness and mortality rate, it is of great significance to carry out effective precautions and prevention of COVID-19. Specifically, the transportation system has been confirmed as one of the crucial spreading routes. Hence, enhancing healthcare monitoring and infection tracking for high-mobility transportation system is infeasible for pandemic control. Meanwhile, due to the promising advantages in the emerging intelligent transportation system (ITS), vehicular ad hoc networks (VANETs) is able to collect and process relevant vehicular data for improving the driving experience and road safety, which provide a way for non-contact automatic healthcare monitoring. Furthermore, the proliferating cloud computing and blockchain techniques enable sufficient processing and storing capabilities, along with decentralized remote auditing towards heterogenous vehicular data. In this case, the automated infection tracking for pandemic control could be achieved accordingly. For the above consideration, in this paper we develop a practical homomorphic authentication scheme for cloud-assisted VANETs, where the healthcare monitoring for all involving passengers is provided. Notably, the integrated cloud-assisted VANET infrastructure is utilized, where the hybrid medical data acquisition module is attached. In this way, timely, non-contact measurement on all passengers’ physical status can be remotely done by vehicular cloud (VC), which could also drastically improve the efficiency and guarantee safety. Vulnerabilities of the employed dedicated-short-range-communication (DSRC) technique could be properly addressed with the applied homomorphic encryption design. Additionally, the decentralized blockchain-based vehicle recording mechanism is cooperatively performed by VC and edge units. Infection tracking on specific vehicle and individual can be offered in this way. Each signature sequence is collaboratively maintained and verified by the current roadside unit (RSU) and its neighbor RSUs. The security analysis demonstrates that the proposed scheme is secure against major attacks, while the performance comparison with the state-of-the-arts relevant methods are presented for efficiency discussion.

ACS Style

Haowen Tan; Pankoo Kim; Ilyong Chung. Practical Homomorphic Authentication in Cloud-Assisted VANETs with Blockchain-Based Healthcare Monitoring for Pandemic Control. Electronics 2020, 9, 1683 .

AMA Style

Haowen Tan, Pankoo Kim, Ilyong Chung. Practical Homomorphic Authentication in Cloud-Assisted VANETs with Blockchain-Based Healthcare Monitoring for Pandemic Control. Electronics. 2020; 9 (10):1683.

Chicago/Turabian Style

Haowen Tan; Pankoo Kim; Ilyong Chung. 2020. "Practical Homomorphic Authentication in Cloud-Assisted VANETs with Blockchain-Based Healthcare Monitoring for Pandemic Control." Electronics 9, no. 10: 1683.

Journal article
Published: 12 June 2020 in Symmetry
Reads 0
Downloads 0

Emerging as the effective strategy of intelligent transportation system (ITS), vehicular ad hoc networks (VANETs) have the capacity of drastically improving the driving experience and road safety. In typical VANET scenarios, high mobility and volatility of vehicles result in dynamic topology of vehicular networks. That is, individual vehicle may pass through the effective domain of multiple neighboring road-side-units (RSUs) during a comparatively short time interval. Hence, efficient and low-latency cross-domain verification with all the successive RSUs is of significance. Recently, a lot of research on VANET authentication and key distribution was presented, while the critical cross-domain authentication (CDA) issue has not been properly addressed. Particularly, the existing CDA solutions mainly reply on the acquired confidential keying information from the neighboring entities (RSUs and vehicles), while too much trustworthiness is granted to the involved RSUs. Please note that the RSUs are distributively located and may be compromised or disabled by adversary, thus vital vehicle information may be revealed. Furthermore, frequent data interactions between RSUs and cloud server are always the major requisite so as to achieve mutual authentication with cross-domain vehicles, which leads to heavy bandwidth consumption and high latency. In this paper, we address the above VANET cross-domain authentication issue under the novel RSU edge networks assumption. Please note that RSUs are assumed to be semi-trustworthy entity in our design, where critical vehicular keying messages remain secrecy. Homomorphic encryption design is applied for all involved RSUs and vehicles. In this way, successive RSUs could efficiently verify the cross-domain vehicle with the transited certificate from the neighbor RSUs and vehicle itself, while the identity and secrets of each vehicle is hidden all the time. Afterwards, dynamic updating towards the anonymous vehicle identity is conducted upon validation, where conditional privacy preserving is available. Moreover, pairing-free mutual authentication method is used for efficiency consideration. Formal security analysis is given, proving that the HCDA mechanism yields desirable security properties on VANET cross domain authentication issue. Performance discussions demonstrate efficiency of the proposed HCDA scheme compared with the state-of-the-art.

ACS Style

Haowen Tan; Shichang Xuan; Ilyong Chung. HCDA: Efficient Pairing-Free Homographic Key Management for Dynamic Cross-Domain Authentication in VANETs. Symmetry 2020, 12, 1003 .

AMA Style

Haowen Tan, Shichang Xuan, Ilyong Chung. HCDA: Efficient Pairing-Free Homographic Key Management for Dynamic Cross-Domain Authentication in VANETs. Symmetry. 2020; 12 (6):1003.

Chicago/Turabian Style

Haowen Tan; Shichang Xuan; Ilyong Chung. 2020. "HCDA: Efficient Pairing-Free Homographic Key Management for Dynamic Cross-Domain Authentication in VANETs." Symmetry 12, no. 6: 1003.

Journal article
Published: 30 March 2020 in IEEE Access
Reads 0
Downloads 0

With the development of the Internet, numerous new applications have emerged, the features of which are constantly changing. It is necessary to perform application classification detection on the network traffic to monitor the changes in the applications. Using RelSamp to sample traffic can provide the sampled traffic with sufficient application features to support application classification. RelSamp separately assigns counters for each flow to record the statistical features and introduces a collision chain into the hash flow table to resolve hash conflicts in the table entries. However, in high-speed networks, owing to the number of concurrent flows and heavy-tailed nature of the traffic, the storage allocation method of RelSamp results in a significant waste of storage on the traffic sampling device. Moreover, the hash conflict resolution of RelSamp causes the collision chains of several hash table entries to be excessively deep, thereby reducing the search efficiency of the flow nodes. To overcome the shortcomings of RelSamp, this study presents a sampling model known as MiniSamp. Based on the RelSamp sampling mechanism, MiniSamp introduces shared counter trees to compress the storage space of the counters during the sampling process and integrates an efficient search tree into the hash table. The search tree structure is adjusted according to the network environment to improve the search efficiency of the flow nodes. The experimental results demonstrate that MiniSamp can effectively aid network operators to classify traffic in the high-speed network.

ACS Style

Shichang Xuan; Dezhi Tang; Ilyong Chung; Youngju Cho; Xiaojiang Du; Wu Yang. Network Traffic Sampling System Based on Storage Compression for Application Classification Detection. IEEE Access 2020, 8, 63106 -63120.

AMA Style

Shichang Xuan, Dezhi Tang, Ilyong Chung, Youngju Cho, Xiaojiang Du, Wu Yang. Network Traffic Sampling System Based on Storage Compression for Application Classification Detection. IEEE Access. 2020; 8 (99):63106-63120.

Chicago/Turabian Style

Shichang Xuan; Dezhi Tang; Ilyong Chung; Youngju Cho; Xiaojiang Du; Wu Yang. 2020. "Network Traffic Sampling System Based on Storage Compression for Application Classification Detection." IEEE Access 8, no. 99: 63106-63120.

Journal article
Published: 27 December 2019 in IEEE Access
Reads 0
Downloads 0

Nowadays, with rapid advancements of vehicular telematics and communication techniques, proliferation of vehicular ad hoc networks (VANETs) have been witnessed, which facilitates the construction of promising intelligent transportation system (ITS). Due to inherent wireless communicating features in open environment, secure transmission among numerous VANET entities remains crucial issues. Currently, lots of research efforts have been made, while most of which tend to allocate the universal group key to the verified devices for both vehicle-to-vehicle (V2V) and vehicle-to-RSU (V2R) communications. However, in heterogeneous VANET environment with large numbers of devices in same vehicular group, complicated and variable topologies lead to continuous key updating in every moment, causing interference to regular V2R data exchange, which is not reliable and efficient for resource-constrained VANET environment. Moreover, group membership recording and detecting mechanisms are necessary for real time vehicle revocation and participation, which has not been further studied so far. In this paper, we address the above issues by proposing a secure authentication and key management scheme. In our design, novel VANET system model with edge computing infrastructure is adopted so as to offer adequate computing and storing capacity compared to traditional VANET structure. Note that our certificateless authentication scheme applies the independent session key for each vehicle for interference avoidance. Furthermore, consortium blockchain is employed for V2V group key construction. Real time group membership arrangement with efficient group key updating is accordingly provided. Formal security proofs are presented, demonstrating that the proposed scheme can achieve desired security properties. Performance analysis is conducted as well, proving that the proposed scheme is efficient compared with the state-of-the-arts.

ACS Style

Haowen Tan; Ilyong Chung. Secure Authentication and Key Management With Blockchain in VANETs. IEEE Access 2019, 8, 2482 -2498.

AMA Style

Haowen Tan, Ilyong Chung. Secure Authentication and Key Management With Blockchain in VANETs. IEEE Access. 2019; 8 (99):2482-2498.

Chicago/Turabian Style

Haowen Tan; Ilyong Chung. 2019. "Secure Authentication and Key Management With Blockchain in VANETs." IEEE Access 8, no. 99: 2482-2498.

Journal article
Published: 28 November 2019 in Applied Sciences
Reads 0
Downloads 0

With the arrival of the Internet of Things (IoT) era and the rise of Big Data, cloud computing, and similar technologies, data resources are becoming increasingly valuable. Organizations and users can perform all kinds of processing and analysis on the basis of massive IoT data, thus adding to their value. However, this is based on data-sharing transactions, and most existing work focuses on one aspect of data transactions, such as convenience, privacy protection, and auditing. In this paper, a data-sharing-transaction application based on blockchain technology is proposed, which comprehensively considers various types of performance, provides an efficient consistency mechanism, improves transaction verification, realizes high-performance concurrency, and has tamperproof functions. Experiments were designed to analyze the functions and storage of the proposed system.

ACS Style

Shichang Xuan; Yibo Zhang; Hao Tang; Ilyong Chung; Wei Wang; Wu Yang. Hierarchically Authorized Transactions for Massive Internet-of-Things Data Sharing Based on Multilayer Blockchain. Applied Sciences 2019, 9, 5159 .

AMA Style

Shichang Xuan, Yibo Zhang, Hao Tang, Ilyong Chung, Wei Wang, Wu Yang. Hierarchically Authorized Transactions for Massive Internet-of-Things Data Sharing Based on Multilayer Blockchain. Applied Sciences. 2019; 9 (23):5159.

Chicago/Turabian Style

Shichang Xuan; Yibo Zhang; Hao Tang; Ilyong Chung; Wei Wang; Wu Yang. 2019. "Hierarchically Authorized Transactions for Massive Internet-of-Things Data Sharing Based on Multilayer Blockchain." Applied Sciences 9, no. 23: 5159.

Journal article
Published: 01 August 2019 in Symmetry
Reads 0
Downloads 0

Nowadays, with rapid advancement of both the upcoming 5G architecture construction and emerging Internet of Things (IoT) scenarios, Device-to-Device (D2D) communication provides a novel paradigm for mobile networking. By facilitating continuous and high data rate services between physically proximate devices without interconnection with access points (AP) or service network (SN), spectral efficiency of the 5G network can be drastically increased. However, due to its inherent open wireless communicating features, security issues and privacy risks in D2D communication remain unsolved in spite of its benefits and prosperous future. Hence, proper D2D authentication mechanisms among the D2D entities are of great significance. Moreover, the increasing proliferation of smartphones enables seamlessly biometric sensor data collecting and processing, which highly correspond to the user’s unique behavioral characteristics. For the above consideration, we present a secure certificateless D2D authenticating mechanism intended for extreme scenarios in this paper. In the assumption, the key updating mechanism only requires a small modification in the SN side, while the decryption information of user equipment (UEs) remains constant as soon as the UEs are validated. Note that a symmetric key mechanism is adopted for the further data transmission. Additionally, the user activities data from smartphone sensors are analyzed for continuous authentication, which is periodically conducted after the initial validation. Note that in the assumed scenario, most of the UEs are out of the effective range of cellular networks. In this case, the UEs are capable of conducting data exchange without cellular connection. Security analysis demonstrates that the proposed scheme can provide adequate security properties as well as resistance to various attacks. Furthermore, performance analysis proves that the proposed scheme is efficient compared with state-of-the-art D2D authentication schemes.

ACS Style

Haowen Tan; Yuanzhao Song; Shichang Xuan; Sungbum Pan; Ilyong Chung. Secure D2D Group Authentication Employing Smartphone Sensor Behavior Analysis. Symmetry 2019, 11, 969 .

AMA Style

Haowen Tan, Yuanzhao Song, Shichang Xuan, Sungbum Pan, Ilyong Chung. Secure D2D Group Authentication Employing Smartphone Sensor Behavior Analysis. Symmetry. 2019; 11 (8):969.

Chicago/Turabian Style

Haowen Tan; Yuanzhao Song; Shichang Xuan; Sungbum Pan; Ilyong Chung. 2019. "Secure D2D Group Authentication Employing Smartphone Sensor Behavior Analysis." Symmetry 11, no. 8: 969.

Journal article
Published: 28 November 2018 in IEEE Access
Reads 0
Downloads 0
ACS Style

Haowen Tan; Ziyuan Gui; Ilyong Chung. A Secure and Efficient Certificateless Authentication Scheme With Unsupervised Anomaly Detection in VANETs. IEEE Access 2018, 6, 74260 -74276.

AMA Style

Haowen Tan, Ziyuan Gui, Ilyong Chung. A Secure and Efficient Certificateless Authentication Scheme With Unsupervised Anomaly Detection in VANETs. IEEE Access. 2018; 6 ():74260-74276.

Chicago/Turabian Style

Haowen Tan; Ziyuan Gui; Ilyong Chung. 2018. "A Secure and Efficient Certificateless Authentication Scheme With Unsupervised Anomaly Detection in VANETs." IEEE Access 6, no. : 74260-74276.

Journal article
Published: 14 November 2018 in Sensors
Reads 0
Downloads 0

The wireless body area network (WBAN) is considered as one of the emerging wireless techniques in the healthcare system. Typical WBAN sensors, especially implantable sensors, have limited power capability, which restricts their wide applications in the medical environment. In addition, it is necessary for the healthcare center (HC) to broadcast significant notifications to different patient groups. Considering the above issues, in this paper, the novel practical WBAN system model with group message broadcasting is built. Subsequently, a secure and efficient group key management protocol with cooperative sensor association is proposed. In the proposed protocol, the Chinese remainder theorem (CRT) is employed for group key management between HC and the personal controller (PC), which also supports batch key updating. The proposed sensor association scheme is motivated by coded cooperative data exchange (CCDE). The formal security proofs are presented, indicating that the proposed protocol can achieve the desired security properties. Moreover, performance analysis demonstrates that the proposed protocol is efficient compared with state-of-the-art group key management protocols.

ACS Style

Haowen Tan; Ilyong Chung. A Secure and Efficient Group Key Management Protocol with Cooperative Sensor Association in WBANs. Sensors 2018, 18, 3930 .

AMA Style

Haowen Tan, Ilyong Chung. A Secure and Efficient Group Key Management Protocol with Cooperative Sensor Association in WBANs. Sensors. 2018; 18 (11):3930.

Chicago/Turabian Style

Haowen Tan; Ilyong Chung. 2018. "A Secure and Efficient Group Key Management Protocol with Cooperative Sensor Association in WBANs." Sensors 18, no. 11: 3930.

Research article
Published: 20 May 2018 in Wireless Communications and Mobile Computing
Reads 0
Downloads 0

As a crucial component of Internet-of-Thing (IoT), vehicular ad hoc networks (VANETs) have attracted increasing attentions from both academia and industry fields in recent years. With the extensive VANETs deployment in transportation systems of more and more countries, drivers’ driving experience can be drastically improved. In this case, the real-time road information needs to be disseminated to the correlated vehicles. However, due to inherent wireless communicating characteristics of VANETs, authentication and group key management strategies are indispensable for security assurance. Furthermore, effective road message dissemination mechanism is of significance. In this paper, we address the above problems by developing a certificateless authentication and road message dissemination protocol. In our design, certificateless signature and the relevant feedback mechanism are adopted for authentication and group key distribution. Subsequently, message evaluating and ranking strategy is introduced. Security analysis shows that our protocol achieves desirable security properties. Additionally, performance analysis demonstrates that the proposed protocol is efficient compared with the state of the art.

ACS Style

Haowen Tan; Dongmin Choi; Pankoo Kim; Sungbum Pan; Ilyong Chung. Secure Certificateless Authentication and Road Message Dissemination Protocol in VANETs. Wireless Communications and Mobile Computing 2018, 2018, 1 -13.

AMA Style

Haowen Tan, Dongmin Choi, Pankoo Kim, Sungbum Pan, Ilyong Chung. Secure Certificateless Authentication and Road Message Dissemination Protocol in VANETs. Wireless Communications and Mobile Computing. 2018; 2018 ():1-13.

Chicago/Turabian Style

Haowen Tan; Dongmin Choi; Pankoo Kim; Sungbum Pan; Ilyong Chung. 2018. "Secure Certificateless Authentication and Road Message Dissemination Protocol in VANETs." Wireless Communications and Mobile Computing 2018, no. : 1-13.

Journal article
Published: 26 September 2017 in IEEE Transactions on Intelligent Transportation Systems
Reads 0
Downloads 0

Recently, Vijayakumar et al. proposed a dual authentication and key management scheme for secure data transmission in vehicular ad-hoc networks. As described by Vijayakumar et al., a dual authentication scheme and the corresponding group key management mechanism are illustrated successively. The authors claimed that the proposed scheme is resistant to replay attack and masquerade attack. However, we find that the proposed scheme given by Vijayakumar et al. is still vulnerable to replay attack, which could be conducted by reusing previously acquired messages. Moreover, this scheme cannot resist masquerade attack toward the system. For the above consideration, in this paper, modifications toward the existing protocol are presented, so as to provide adequate security assurance toward the mentioned attacks.

ACS Style

Haowen Tan; Dongmin Choi; Pankoo Kim; Sungbum Pan; Ilyong Chung. Comments on “Dual Authentication and Key Management Techniques for Secure Data Transmission in Vehicular Ad Hoc Networks”. IEEE Transactions on Intelligent Transportation Systems 2017, 19, 2149 -2151.

AMA Style

Haowen Tan, Dongmin Choi, Pankoo Kim, Sungbum Pan, Ilyong Chung. Comments on “Dual Authentication and Key Management Techniques for Secure Data Transmission in Vehicular Ad Hoc Networks”. IEEE Transactions on Intelligent Transportation Systems. 2017; 19 (7):2149-2151.

Chicago/Turabian Style

Haowen Tan; Dongmin Choi; Pankoo Kim; Sungbum Pan; Ilyong Chung. 2017. "Comments on “Dual Authentication and Key Management Techniques for Secure Data Transmission in Vehicular Ad Hoc Networks”." IEEE Transactions on Intelligent Transportation Systems 19, no. 7: 2149-2151.

Journal article
Published: 25 December 2014 in Wireless Personal Communications
Reads 0
Downloads 0

This study examines the problem that sensors are irregularly deployed in a wireless sensor network (WSN). Such irregularity makes clustering protocols less efficient. This paper proposes a new clustering algorithm, called balanced clustering algorithm (BCA), for irregularly deployed WSNs. In BCA, each node determines the probability that the node itself becomes the cluster head (CH) by considering the sensing population, which is defined as the number of nodes within the sensing range of a node. As a result, the coverage area of each cluster is distributed almost equally and unused redundant nodes are turned into sleep mode. Therefore, the large deviation of the coverage areas of clusters in a network can be decreased and the unnecessary duplication of sensing and transmission can also be decreased. In addition, the inefficient energy consumption is reduced significantly because the sleeping nodes do not send duplicated information over high populated areas. According to the simulation, the proposed BCA reduces energy consumption, increases the network lifetime and distributes the detection area of each cluster evenly, compared to the conventional schemes.

ACS Style

Heewook Shin; SangMan Moh; Ilyong Chung; Moonsoo Kang. Equal-Size Clustering for Irregularly Deployed Wireless Sensor Networks. Wireless Personal Communications 2014, 82, 995 -1012.

AMA Style

Heewook Shin, SangMan Moh, Ilyong Chung, Moonsoo Kang. Equal-Size Clustering for Irregularly Deployed Wireless Sensor Networks. Wireless Personal Communications. 2014; 82 (2):995-1012.

Chicago/Turabian Style

Heewook Shin; SangMan Moh; Ilyong Chung; Moonsoo Kang. 2014. "Equal-Size Clustering for Irregularly Deployed Wireless Sensor Networks." Wireless Personal Communications 82, no. 2: 995-1012.

Journal article
Published: 11 August 2014 in Sensors
Reads 0
Downloads 0

A cognitive radio sensor network (CRSN) is a wireless sensor network whose sensor nodes are equipped with cognitive radio capability. Clustering is one of the most challenging issues in CRSNs, as all sensor nodes, including the cluster head, have to use the same frequency band in order to form a cluster. However, due to the nature of heterogeneous channels in cognitive radio, it is difficult for sensor nodes to find a cluster head. This paper proposes a novel energy-efficient and compact clustering scheme named clustering with temporary support nodes (CENTRE). CENTRE efficiently achieves a compact cluster formation by adopting two-phase cluster formation with fixed duration. By introducing a novel concept of temporary support nodes to improve the cluster formation, the proposed scheme enables sensor nodes in a network to find a cluster head efficiently. The performance study shows that not only is the clustering process efficient and compact but it also results in remarkable energy savings that prolong the overall network lifetime. In addition, the proposed scheme decreases both the clustering overhead and the average distance between cluster heads and their members.

ACS Style

Shelly Salim; SangMan Moh; Dongmin Choi; Ilyong Chung. An Energy-Efficient and Compact Clustering Scheme with Temporary Support Nodes for Cognitive Radio Sensor Networks. Sensors 2014, 14, 14634 -14653.

AMA Style

Shelly Salim, SangMan Moh, Dongmin Choi, Ilyong Chung. An Energy-Efficient and Compact Clustering Scheme with Temporary Support Nodes for Cognitive Radio Sensor Networks. Sensors. 2014; 14 (8):14634-14653.

Chicago/Turabian Style

Shelly Salim; SangMan Moh; Dongmin Choi; Ilyong Chung. 2014. "An Energy-Efficient and Compact Clustering Scheme with Temporary Support Nodes for Cognitive Radio Sensor Networks." Sensors 14, no. 8: 14634-14653.

Journal article
Published: 01 February 2013 in International Journal of Distributed Sensor Networks
Reads 0
Downloads 0

In wireless sensor networks, clustering is effectively used for many applications, including environment monitoring, because it promises efficient energy consumption for inexpensive battery-operated sensors. The most famous clustering protocol, LEACH (Low Energy Adaptive Clustering Hierarchy), enables the balanced consumption of energy to prolong a network lifetime. In LEACH, however, extra energy and time are consumed to reform clusters at the setup phase of every round. This side effect is worse as the number of clusters increases. This paper presents a novel energy-efficient clustering scheme called COTS (Clustering with One-Time Setup) which removes the cluster-reforming process required at every round after the first round. The proposed COTS allows that the role of the cluster head is rotated among members in a cluster without cluster reforming. By removing the cluster-reforming process, the number of transmissions per round is decreased accordingly. As a result, energy consumption is significantly reduced, resulting in prolonged network lifetime. The simulation study shows that the network performance and lifetime are much improved as the number of clusters is increased.

ACS Style

Heewook Shin; SangMan Moh; Ilyong Chung. Clustering with One-Time Setup for Reduced Energy Consumption and Prolonged Lifetime in Wireless Sensor Networks. International Journal of Distributed Sensor Networks 2013, 9, 1 .

AMA Style

Heewook Shin, SangMan Moh, Ilyong Chung. Clustering with One-Time Setup for Reduced Energy Consumption and Prolonged Lifetime in Wireless Sensor Networks. International Journal of Distributed Sensor Networks. 2013; 9 (2):1.

Chicago/Turabian Style

Heewook Shin; SangMan Moh; Ilyong Chung. 2013. "Clustering with One-Time Setup for Reduced Energy Consumption and Prolonged Lifetime in Wireless Sensor Networks." International Journal of Distributed Sensor Networks 9, no. 2: 1.

Journal article
Published: 01 January 2011 in ISRN Communications and Networking
Reads 0
Downloads 0

To achieve efficiency in prolonging the lifetime of sensor networks many schemes have been proposed. Among these schemes, a clustering protocol is an efficient method that prolongs the lifetime of a network. However, in applying this method, some nodes consume energy unnecessarily because of an environment in which the collected data of the sensor nodes easily overlap. In this paper we propose a clustering method which reduces unnecessary data transmission among nodes by excluding the duplication of data. Our method alleviates the problem where nearby nodes collect the same data from adjacent areas by electing all nodes that form a cluster in consideration of the sensing coverage of the nodes. Also, it introduces relay nodes, also called repeaters, which help to hop the data transmission along to cluster head nodes in order to cope with energy-hole and link failure problems. This method prevents data loss caused by link failure problem and thus the data is collected reliably. According to the results of the performance analysis, our method reduces the energy consumption, increases the transmission efficiency, and prolongs network lifetime when compared to the existing clustering methods.

ACS Style

Dongmin Choi; SangMan Moh; Ilyong Chung. ARCS: An Energy-Efficient Clustering Scheme for Sensor Network Monitoring Systems. ISRN Communications and Networking 2011, 2011, 1 -10.

AMA Style

Dongmin Choi, SangMan Moh, Ilyong Chung. ARCS: An Energy-Efficient Clustering Scheme for Sensor Network Monitoring Systems. ISRN Communications and Networking. 2011; 2011 ():1-10.

Chicago/Turabian Style

Dongmin Choi; SangMan Moh; Ilyong Chung. 2011. "ARCS: An Energy-Efficient Clustering Scheme for Sensor Network Monitoring Systems." ISRN Communications and Networking 2011, no. : 1-10.

Journal article
Published: 03 November 2006 in Information Sciences
Reads 0
Downloads 0

Double-loop [J. Bermond, F. Comellas, D. Hsu, Distributed Loop Computer Networks: A Survey, J. Parallel and Distributed Computing, Academic Press, 24 (1995) 2–10] and 2-circulant networks (2-CN) [J. Park, Cycle Embedding of Faulty Recursive Circulants, J. of Korea Info. Sci. Soc. 31 (2) (2004) 86–94] are widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on circulant networks, that is a key to the performance of this network. We would like to transmit 2k packets from a source node to a destination node simultaneously along paths on G(n; ±s1, ±s2, … , ±sk), where the ith packet traverses along the ith path (1 ⩽ i ⩽ 2k). In order for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian circuit latin square (HCLS), a special class of (n × n) matrices, we present O(n2) parallel routing algorithm on circulant networks.

ACS Style

Youngjoo Cho; Ilyong Chung. A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square. Information Sciences 2006, 176, 3132 -3142.

AMA Style

Youngjoo Cho, Ilyong Chung. A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square. Information Sciences. 2006; 176 (21):3132-3142.

Chicago/Turabian Style

Youngjoo Cho; Ilyong Chung. 2006. "A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square." Information Sciences 176, no. 21: 3132-3142.

Journal article
Published: 03 August 2006 in Information Sciences
Reads 0
Downloads 0

In order to maintain load balancing in a distributed network, each node should obtain workload information from all the nodes in the network. To accomplish this, this processing requires O(v2) communication complexity, where v is the number of nodes. First, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k + 1, 1)-configured network applying a symmetric balanced incomplete block design, where v = k2 + k + 1. Our algorithm designs a special adjacency matrix and then transforms it to (v, k + 1, 1)-configured network for an efficient communication. It requires only O(vv) communication complexity and each node receives workload information from all the nodes without redundancy since each link has the same amount of traffic for transferring workload information. Later, this algorithm is revised for distributed networks and is analyzed in terms of efficiency of load balancing.

ACS Style

Okbin Lee; Seongjin Yoo; Byungjeon Park; Ilyong Chung. The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design. Information Sciences 2006, 176, 2148 -2160.

AMA Style

Okbin Lee, Seongjin Yoo, Byungjeon Park, Ilyong Chung. The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design. Information Sciences. 2006; 176 (15):2148-2160.

Chicago/Turabian Style

Okbin Lee; Seongjin Yoo; Byungjeon Park; Ilyong Chung. 2006. "The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design." Information Sciences 176, no. 15: 2148-2160.

Journal article
Published: 01 March 2004 in Journal of Applied Mathematics and Computing
Reads 0
Downloads 0

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on network. This processing requiresO(v 2) communication overhead, wherev is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k+1, 1)-configured network applying a symmetric balanced incomplete block design, wherev=k 2+k+1. Our algorithm needs only \(O(v\sqrt v )\) communication overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.

ACS Style

Ilyong Chung; Yongeun Bae. The design of an efficient load balancing algorithm employing block design. Journal of Applied Mathematics and Computing 2004, 14, 343 -351.

AMA Style

Ilyong Chung, Yongeun Bae. The design of an efficient load balancing algorithm employing block design. Journal of Applied Mathematics and Computing. 2004; 14 (1-2):343-351.

Chicago/Turabian Style

Ilyong Chung; Yongeun Bae. 2004. "The design of an efficient load balancing algorithm employing block design." Journal of Applied Mathematics and Computing 14, no. 1-2: 343-351.