• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.772-779
• /
• 2012

In the current MANET, DOS or DDOS attacks are increasing, but as MANET has limited bandwidth, computational resources and battery power, the existing traceback mechanisms can not be applied to it. Therefore, in case of traceback techniques being applied to MANET, the resource of each node must be used efficiently. However, in the traceback techniques applied to an existing ad hoc network, as a cluster head which represents all nodes in the cluster area manages the traceback, the overhead of the cluster head shortens each node's life. In addition, in case of multi-hop clustering, as one Cluster head manages more node than one, its problem is getting even worse. This paper proposes TNA(Traceback against Network Attacks) based on multihop clustering using the depth of tree structure in order to reduce the overhead of distributed information management.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1618-1637
• /
• 2014

Clustering wireless sensor network is an efficient way to reduce the energy consumption of individual nodes in a cluster. In clustering, multihop routing techniques increase the load of the Cluster head near the sink. This unbalanced load on the Cluster head increases its energy consumption, thereby Cluster heads die faster and create an energy hole problem. In this paper, we propose an Energy Balancing Cluster Head (EBCH) in wireless sensor network. At First, we balance the intra cluster load among the cluster heads, which results in nonuniform distribution of nodes over an unequal cluster size. The load received by the Cluster head in the cluster distributes their traffic towards direct and multihop transmission based on the load distribution ratio. Also, we balance the energy consumption among the cluster heads to design an optimum load distribution ratio. Simulation result shows that this approach guarantees to increase the network lifetime, thereby balancing cluster head energy.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.45-50
• /
• 2013

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

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

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.910-917
• /
• 2016

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.17-20
• /
• 2008

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.

• Journal of KIISE:Information Networking
• /
• v.37 no.1
• /
• pp.50-56
• /
• 2010

This paper proposes a data gathering method by adapting the mobile sink to prolong the whole operation time of large WSNs. After partitioning a network into several clusters, a mobile sink visits each cluster and collects data from it. An efficient protocol improves the energy efficiency by delivering messages from the mobile sink to the cluster head as well as reduces the data gathering delay, which is the disadvantage of the mobile sink. For the scalability of sensor network, the network architecture should support the multihop transmission in the duster rather than the single hop transmission. The process for the data aggregation linked to the travelling path is proposed to improve the energy consumption of intermediate nodes. The experiment results show that the proposed model is more efficient than legacy methods in the energy consumption and the data gathering time.

• Journal of the Korea Society for Simulation
• /
• v.21 no.4
• /
• pp.47-56
• /
• 2012

In this study, we use a parallel simulator PASENS(Parallel SEnsor Network Simulator) to predict power consumption and data reception rate of the hierarchical routing protocols for sensor network - LEACH (Low-Energy Adaptive Clustering Hierarchy), TL-LEACH (Two Level Low-Energy Adaptive Clustering Hierarchy), M-LEACH (Multi hop Low-Energy Adaptive Clustering Hierarchy) and LEACH-C (LEACH-Centralized). According to simulation results, M-LEACH routing protocol shows the highest data reception rate for the wider area, since more sensor nodes are involved in the data transmission. And LEACH-C routing protocol, where the sink node considers the entire node's residual energy and location to determine the cluster head, results in the most efficient energy consumption and in the narrow area needed long life of sensor network.

• Journal of Korea Multimedia Society
• /
• v.21 no.6
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.640-648
• /
• 2017

Sensors have limited resources in sensor networks, so efficient use of energy is important. In order to use the energy of the sensor node efficiently, researches applying mobile sink to the sensor network have been actively carried out. The sink node moves the sensor network, collects data from each sensor node, which spread the energy concentrated around the sink node, thereby extending the entire life cycle of the network. But, when the sink node moves, it requires a reset of the data transmission path, which causes a lot of control messages and delays. In this paper, we propose a CMS(Cluster-based Mobile Sink) method to support the movement of mobile sink in a cluster sensor environment. The proposed scheme minimizes an amount of control messages without resetting the routing paths of entire sensor networks by supporting the sink mobility path using the neighbor cluster list. And, it simplifies the routing path setup process by setting a single hop path between clusters without a gateway. The experiment results show that the proposed scheme has superior energy efficiency in processing and network structure, compared with existing clustering and mesh routing protocols.