• International Journal of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.51-58
• /
• 2017

This paper deals with the improvement of cluster head selection method in L-SEP for heterogeneous nodes among hierarchical routing protocols of wireless sensor network. Wireless sensor networks are classified into homogeneous and heterogeneous network. In heterogeneous network, SEP, L-SEP are mainly used because cluster head selection probability is different depending on node type. But, since protocol based on SEP has different cluster head selection probabilities depending on the node type, clusters that transmit data inefficiently can be formed. to improve this, it is necessary to select the cluster head that minimizes the transmission distance of member node and the cluster head. Therefore, we propose a protocol that improve the cluster head selection method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3834-3857
• /
• 2021

The design of cluster-based routing protocols is necessary for Wireless Sensor Networks (WSN). But, due to the lack of features, the traditional methods face issues, especially on unbalanced energy consumption of routing protocol. This work focuses on enhancing the security and energy efficiency of the system by proposing Energy Efficient Based Secure Routing Protocol (EESRP) which integrates trust management, optimization algorithm and key management. Initially, the locations of the deployed nodes are calculated along with their trust values. Here, packet transfer is maintained securely by compiling a Digital Signature Algorithm (DSA) and Elliptic Curve Cryptography (ECC) approach. Finally, trust, key, location and energy parameters are incorporated in Particle Swarm Optimization (PSO) and meta-heuristic based Harmony Search (HS) method to find the secure shortest path. Our results show that the energy consumption of the proposed approach is 1.06mJ during the transmission mode, and 8.69 mJ during the receive mode which is lower than the existing approaches. The average throughput and the average PDR for the attacks are also high with 72 and 62.5 respectively. The significance of the research is its ability to improve the performance metrics of existing work by combining the advantages of different approaches. After simulating the model, the results have been validated with conventional methods with respect to the number of live nodes, energy efficiency, network lifetime, packet loss rate, scalability, and energy consumption of routing protocol.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.61-69
• /
• 2009

Most existing clustering protocols have been aimed to provide balancing the residual energy of each node and maximizing life-time of wireless sensor networks. In this paper, we present the threshold based cluster head replacement strategy for clustering protocols in wireless sensor networks. This protocol minimizes the number of cluster head selection by preventing the cluster head replacement up to the threshold of residual energy. Reducing the amount of head selection and replacement cost, the life-time of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that our protocol outperformed than LEACH in terms of balancing energy consumption and network life-time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1222-1227
• /
• 2009

In this paper, we proposed a new method, the CACH(Context-aware Clustering Hierarchy) algorithm in Mobile Ad-hoc Network(MANET) systems. The proposed CACH algorithm based on hybrid and clustering protocol that provide the reliable monitoring and control of a variety of environments for remote place. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. Also, the proposed CACH could be used localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that a new method for CACH could find energy efficient depth of hierarchy of a cluster.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1419-1436
• /
• 2020

For an energy harvesting sensor network, when the network lifetime is not the only primary goal, maximizing the network performance under environmental energy harvesting becomes a more critical issue. However, clustering protocols that aim at providing maximum information throughput have not been thoroughly explored in Energy Harvesting Wireless Sensor Networks (EH-WSNs). In this paper, clustering protocols are studied for maximizing the data transmission in the whole network. Based on a long short-term memory (LSTM) energy predictor and node energy consumption and supplement models, an uneven clustering protocol is proposed where the cluster head selection and cluster size control are thoroughly designed for this purpose. Simulations and results verify that the proposed scheme can outperform some classic schemes by having more data packets received by the cluster heads (CHs) and the base station (BS) under these energy constraints. The outcomes of this paper also provide some insights for choosing clustering routing protocols in EH-WSNs, by exploiting the factors such as uneven clustering size, number of clusters, multiple CHs, multihop routing strategy, and energy supplementing period.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11c
• /
• pp.2017-2020
• /
• 2003

오늘날의 무선 이동 통신의 발전은 상당한 발전을 이루고 있다. 이동 통신 분야의 한 분야가 Ad hoc 네트워크 분야일 것이다. Ad hoc 네트워크는 기존의 고정된 네트워크의 한계를 뛰어 넘는 네트워크이다. 본 논문에서는 Ad hoc 네트워크의 클러스터 기반에서의 인증에 대한 보안 프로토콜을 연구하였다. 클러스터 기반의 CBRP(Cluster Based Routing Protocol) 라우팅 프로토콜을 이용하여 클러스터끼리의 인증을 위한 CH(Cluster Head)에 대한 선출 과정에 대한 방법과 클러스터간의 인증을 위하여 CH(Cluster Head)간의 인증을 위한 방법을 제안하였다. 기존의 방법은 CH간의 신뢰성을 전제로 하여 작성하였다. 본 논문에서도 신뢰성을 위하여 MCH(Main Cluster Head)를 두어 CH간의 신뢰성을 보장함으로써 상호 클러스터간의 인증을 위한 프로토콜을 설계하였다. MCH에서의 CH에 대한 인증 프로토콜을 설계함으로써 클러스터간의 인증의 신뢰성을 높일 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.630-635
• /
• 2008

Recently, in order to improve the energy efficiency of WSN(Wireless Sensor Network), widely research have teen carried on. But, up to the present, Majority of methods are based on direct communication between CH(cluster head) and sink node, and based on the assumption that node can regulate signal energy actively according to the distance between nodes. So it's hard to implement those methods. Based on the theory that node has fixed radio wave radius, this paper present a multi leveling routing protocol. According to the simulation of the presented protocol, we have proved the energy saving efficiency and the implementation in real WSN.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.1035-1037
• /
• 2009

Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.