• Journal of Communications and Networks
• /
• v.10 no.2
• /
• pp.221-227
• /
• 2008

The proposed zone-based self-organized clustering broadcasts neighbor information to only a zone with the same ID. Besides, the zone-based self-organized clustering with unique IDs can communicate securely even if the state transition of nodes in zone-based self-organized clustering is threatened by corrupted nodes. For this security, the Byzantine agreement protocol with proactive asynchronous verifiable secret sharing (AVSS) is considered. As a result of simulation, an efficiency and a security of the proposed clustering are better than those of a traditional clustering. Therefore, this paper describes a new and extended self-organized clustering that securely seeks to minimize the interference in mobile ad hoc networks (MANETs).

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.180-190
• /
• 2011

Efficient energy consumption is a critical factor for deployment and operation of wireless sensor networks (WSNs). To achieve energy efficiency there have been several hierarchical routing protocols that organize sensors into clusters where one sensor is a cluster-head to forward messages received from its cluster-member sensors to the base station of the WSN. In this paper, we propose a self-organized clustering method for cluster-head selection and cluster based routing for a WSN. To select cluster-heads and organize clustermembers for each cluster, every sensor uses only local information and simple decision mechanisms which are aimed at configuring a self-organized system. By these self-organized interactions among sensors and selforganized selection of cluster-heads, the suggested method can form clusters for a WSN and decide routing paths energy efficiently. We compare our clustering method with a clustering method that is a well known routing protocol for the WSNs. In our computational experiments, we show that the energy consumptions and the lifetimes of our method are better than those of the compared method. The experiments also shows that the suggested method demonstrate properly some self-organized properties such as robustness and adaptability against uncertainty for WSN's.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.113-114
• /
• 2019

다수의 센서 노드로 구성된 IoT 환경에서는 네트워크 수명, 센서 노드의 통신 범위 제한과 같은 제약 사항들이 있다. 이러한 한계점을 해결하기 위해 밀집된 센서 노드 간의 협력이 필요하다. 이때, 밀집된 센서 노드들은 에너지 낭비 및 전송 데이터의 정확도를 저하시킨다. 본 연구에서는 데이터 집중으로 인해 발생하는 네트워크의 에너지 낭비 및 전송 데이터의 정확도 문제를 해결하기 위해 자체조직지도(Self Organized Map, SOM)를 기반으로 한 클러스터링 기법을 제안한다. 결과적으로 제안된 기법을 통하여 클러스터링 된 노드들은 다른 클러스터링 기법과 비교했을 때 밀도 기반의 정확한 예측 값을 얻을 수 있다.

• The Journal of Information Technology
• /
• v.5 no.2
• /
• pp.17-26
• /
• 2002

On this paper, we propose SOSL(Self-Organized Supervised Learning) and it's architecture SOSL is hybrid type neural network. It consists of several CBP (Component Back Propagation) neural networks, and a modified PCA neural networks. CBP neural networks perform supervised learning procedure in parallel to clustered and complex input patterns. Modified PCA networks perform it's learning in order to transform dimensions of original input patterns to lower dimensions by clustering and local projection. Proposed SOSL can effectively apply to neural network learning with large input patterns results in huge networks size.

• Journal of Internet Computing and Services
• /
• v.9 no.6
• /
• pp.15-25
• /
• 2008

Due to the differences between a mobile ad-hoc network and a sensor network, the pre-existing autoconfiguration for a mobile ad-hoc network cannot be simply applied to a sensor network. But. a mechanism is still necessary to assign locally unique addresses to sensor nodes efficiently. This paper proposes a hybrid IDs assignment scheme of local area sensor networks. The IDs assignment scheme of hybrid method combines a proactive IDs assignment with a reactive IDs assignment scheme. The proposed scheme considers efficient communication using reactive IDs assignment, and security for potential attacks using zone-based self-organized clustering with Byzantine Agreement in sensor networks. Thus, this paper has solved the shortage of security due to minimizing network traffic and the problem of repairing the network from the effects of an aberrant node in sensor networks.

• Journal of Computing Science and Engineering
• /
• v.9 no.4
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1213-1237
• /
• 2019

Vehicular Ad-hoc Network (VANET) facilities envision future Intelligent Transporting Systems (ITSs) by providing inter-vehicle communication for metrics such as road surveillance, traffic information, and road condition. In recent years, vehicle manufacturers, researchers and academicians have devoted significant attention to vehicular communication technology because of its highly dynamic connectivity and self-organized, decentralized networking characteristics. However, due to VANET's high mobility, dynamic network topology and low communication coverage, dissemination of large data packets (e.g. multimedia content) is challenging. Clustering enhances network performance by maintaining communication link stability, sharing network resources and efficiently using bandwidth among nodes. This paper proposes a mobility-based, multi-hop clustering algorithm, (MBCA) for multimedia content broadcasting over an IEEE 802.11p-LTE-enabled hybrid VANET architecture. The OMNeT++ network simulator and a SUMO traffic generator are used to simulate a network scenario. The simulation results indicate that the proposed clustering algorithm over a hybrid VANET architecture improves the overall network stability and performance, resulting in an overall 20% increased cluster head duration, 20% increased cluster member duration, lower cluster overhead, 15% improved data packet delivery ratio and lower network delay from the referenced schemes [46], [47] and [50] during multimedia content dissemination over VANET.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.986-988
• /
• 1995

The ART(Adaptive Resonance Theory) model is self- organized with nonstationary input patterns in real time. But there is a multirun problem caused by fault clustering, or pertubated clustering and confines the advantage of the stationary real-time processing in ART model. In this paper, we propose the incremental vigilance threshold approach to decrease the number of multiruns. The incremental vigilance threshold approach is to learn with incremental vigilance threshold and competition with clusters.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06a
• /
• pp.1046-1051
• /
• 1994

It is known that SOFM has the property of effectively creating topographically the organized map of various features on input signals, SOFM can effectively be applied to the recognition of Korean phonemes. However, is isn't guaranteed that the network is sufficiently learned in SOFM algorithm. In order to solve this problem, we propose the learning algorithm combined with the conventional K-means clustering algorithm in fine-tuning stage. To evaluate the proposed algorithm, we performed speaker dependent recognition experiment using six phoneme classes. Comparing the performances of the Kohonen's algorithm with a proposed algorithm, we prove that the proposed algorithm is better than the conventional SOFM algorithm.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.230-238
• /
• 2021

A sensor network is made up of many sensors deployed in different areas to be monitored. They communicate with each other through a wireless medium. The routing of collected data in the wireless network consumes most of the energy of the network. In the literature, several routing approaches have been proposed to conserve the energy at the sensor level and overcome the challenges inherent in its limitations. In this paper, we propose a new low-energy routing protocol for power grids sensors based on an unsupervised clustering approach. Our protocol equitably harnesses the energy of the selected cluster-head nodes and conserves the energy dissipated when routing the captured data at the Base Station (BS). The simulation results show that our protocol reduces the energy dissipation and prolongs the network lifetime.