• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.6-11
• /
• 2021

Routing protocols play a pivotal role in the energy management and lifespan of any Wireless Sensor Network. Lower network lifetime has been one of the biggest concerns in LEACH protocol due to dead nodes. The LEACH protocol suffers from uneven energy distribution problem due to random selection of a cluster head. The cluster head has much greater responsibility compared to other non- cluster head nodes and consumes greater energy for its roles. This results in early dead nodes due to energy lost for the role of cluster- head. This study proposes an approach to balance the energy consumption of the LEACH protocol by using a semi-deterministic opportunity coefficient to select the cluster head. This is calculated in each node with the battery energy level and node ID. Ultimately, based on the opportunity cost, cluster head will be selected and broadcasted for which other nodes with higher opportunity cost will agree. It minimizes the chances of nodes with lower battery level being elected as cluster head. Our simulation experiments demonstrate that cluster heads chosen using our proposed algorithm perform better than those using the legacy LEACH protocol.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4223-4249
• /
• 2015

A novel jamming detection technique to detect the presence of jamming in the downstream direction for cluster based wireless sensor networks is proposed in this paper. The proposed technique is deployed in base station and in cluster heads. The proposed technique is novel in two aspects: Firstly, whenever a cluster head receives a packet it verifies whether the source node is legitimate node or new node. Secondly if a source node is declared as new node in the first step, then this technique observes the behavior of the new node to find whether the new node is legitimate node or jammed node. In order to monitor the behavior of the existing node and new node, the second step uses two metrics namely packet delivery ratio (PDR) and received signal strength indicator (RSSI). The rationality of using PDR and RSSI is presented by performing statistical test. PDR and RSSI of every member in the cluster is measured and assessed by the cluster head. And finally the cluster head determines whether the members of the cluster are jammed or not. The CH can detect the presence of jamming in the cluster at member level. The base station can detect the presence of jamming in the wireless sensor network at CH level. The simulation result shows that the proposed technique performs extremely well and achieves jamming detection rate as high as 99.85%.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.105-113
• /
• 2009

The previous key management methods are not appropriate for secure data communication in cluster-based routing scheme. Because cluster heads are elected in every round and communicate with the member nodes for authentication and share-key establishment phase in the cluster. In addition, there are not considered to mobility of nodes in previous key management mechanisms. In this paper, we propose the secure and effective key management mechanisim in the cluster-based routing scheme that if there are no share keys between cluster head and its nodes, we create the cluster key using authentication with base station or trust autentication and exchange the their information for a round.

• Korean Journal of Veterinary Service
• /
• v.37 no.1
• /
• pp.11-18
• /
• 2014

Porcine reproductive and respiratory syndrome (PRRS) causes a significant economic loss in the swine industry not only in Korea but also all over the world. Andong and Hapcheon region were selected for Area Regional Control (ARC) programme to reduce the shedding of PRRS virus (PRRSV) and decrease PRRS outbreaks. Before conducting the PRRS ARC, sera of pigs were tested for both antibody using ELISA and antigen using RT-PCR, then phylogenetic classifications was analysed. Pigs of 138/275 (50.2%) in Andong and 352/425 (82.8%) in Hapcheon were seropositive. Also, the RT-PCR results revealed that 27 heads (8.2%) in Andong, 112 heads (22.0%) in Hapcheon were positive for PRRSV antigen. PRRSVs were mainly detected between the ages of 40 to 60 days. PRRSV ORF5 regions were used to determine genetic clusters based on previous report. All PRRSV type I detected in both Andong and Hapcheon were classified as Cluster I. The PRRSV type II isolates in Andong were assorted to Cluster II, whereas the PRRSV type II isolates in Hapcheon were the viruses were unassembled into any cluster except one identified to Cluster III. Phylogenetic analysis indicated that new clusters of PRRSVs type II were prevalent in Hapcheon.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.5
• /
• pp.195-202
• /
• 2008

In this paper, To improve the effectiveness of security enforcement, the first contribution in this work is that we present a clustered heterogeneous WSN(Wareless Sensor Network) architecture, composed of not only resource constrained sensor nodes, but also a number of more powerful high-end devices acting as cluster heads. Compared to sensor nodes, a high-end cluster head has higher computation capability, larger storage, longer power supply, and longer radio transmission range, and it thus does not suffer from the resource scarceness problem as much as a sensor node does. A distinct feature of our heterogeneous architecture is that cluster heads are equipped with TC(trusted computing) technology, and in particular a TCG(Trusted Computing Group) compliant TPM (Trusted Platform Module) is embedded into each cluster head. According the TCG specifications, TPM is a tamper-resistant, self-contained secure coprocessor, capable of performing cryptographic functions. A TPM attached to a host establishes a trusted computing platform that provides sealed storage, and measures and reports the integrity state of the platform.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.665-683
• /
• 2011

Wireless sensor networks (WSN) consist of a large amount of sensor nodes distributed in a certain region. Due to the limited battery power of a sensor node, lots of energy-efficient schemes have been studied. Clustering is primarily used for energy efficiency purpose. However, clustering in WSNs faces several unattained issues, such as ensuring connectivity and scheduling inter-cluster transmissions. In this paper, we propose a location-based spiral clustering (LBSC) algorithm for improving connectivity and avoiding inter-cluster collisions. It also provides reliable location aware routing paths from all cluster heads to a sink node during cluster formation. Proposed algorithm can simultaneously make clusters in four spiral directions from the center of sensor field by using the location information and residual energy level of neighbor sensor nodes. Three logical addresses are used for categorizing the clusters into four global groups and scheduling the intra- and inter-cluster transmission time for each cluster. We evaluated the performance with simulations and compared it with other algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.9
• /
• pp.920-926
• /
• 2007

Establishing a fixed path for the message delivery through a wireless network is impossible due to the mobility. Among the number of routing protocols that have been proposed for wireless ad-hoc networks, the AODV(Ad-hoc On-demand Distance Vector) algorithm is suitable in the case of highly dynamic topology changes, along with ZigBee Routing(ZBR), with the exception of route maintenance. Accordingly, this paper introduces a routing scheme focusing on the energy efficiency and route discovery time for wireless alarm systems using IEEE 802.15.4-based ZigBee. Essentially, the proposed routing algorithm utilizes a cluster structure and applies ZBR within a cluster and DSR (Dynamic Source Routing) between clusters. The proposed algorithm does not require a routing table for the cluster heads, as the inter-cluster routing is performed using DSR. The performance of the proposed algorithm is evaluated and compared with ZBR using an NS2 simulator. The results confirm that the proposed Cluster-based AODV (CAODV) algorithm is more efficient than ZBR in terms of the route discovery time and energy consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1064-1072
• /
• 2005

For the efficient operation of sensor networks, it is very important to design sensor networks for sensors to utilize their energies in very effective ways. Cluster-based routing schemes such as LEACH can achieve their energy efficiencies by delivering data between cluster heads and sensor nodes. In those cluster-based schemes, cluster reconfiguration algorithm is one of the most critical issues to achieve longer operation lifetime of sensor networks. In this paper, we propose a new energy efficient cluster reconfiguration algorithm. Proposed method does not require any location or energy information of sensors, and can configure clusters with fair cluster regions such that all the sensors in a sensor network can utilize their energies equally. The performances of the proposed scheme have been compared with LEACH and LEACH-C.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.63-74
• /
• 2021

According to the double-phase cluster-head election method (DCE), the final cluster heads (CHs) sometimes are located at the edge of cluster. They have a long distance from the base station (BS). Sensor data is directly transmitted to BS by CHs. This makes some nodes consume much energy for transmitting data and die earlier. To address this problem, energy efficient multi-hop cluster-head election strategy (EEMCE) is proposed in this paper. To avoid taking these nodes far from BS as CH, this strategy first introduces the distance from the sensor nodes to the BS into the tentative CH election. Subsequently, in the same cluster, the energy of tentative CH is compared with those of other nodes, and then the node that has more energy than the tentative CH and being nearest the tentative CH are taken as the final CH. Lastly, if the CH is located at the periphery of the network, the multi-hop method will be employed to reduce the energy that is consumed by CHs. The simulation results suggest that the proposed method exhibits higher energy efficiency, longer stability period and better scalability than other protocols.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.