• Title/Summary/Keyword: Cluster Head(CH)

Search Result 58, Processing Time 0.021 seconds

A Novel Jamming Detection Technique for Wireless Sensor Networks

  • Vijayakumar, K.P.;Ganeshkumar, P.;Anandaraj, M.
    • 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%.

A WSN(Wiress Sensor Network) Building Scheme using Clustering and Location information (클러스터링 및 위치 정보를 활용한 WSN(Wireless Sensor Network) 구성 방안)

  • Kim, Jinsoo;Kwon, Hyukjin;Shin, Dongkyoo;Hong, Sunghoon
    • Convergence Security Journal
    • /
    • v.20 no.3
    • /
    • pp.13-20
    • /
    • 2020
  • Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services that require continuous monitoring or services to specific areas where accesses are limited, has gradually increased due to their expansion of application areas and the improvement of the efficiency. Especially, in the defense field, researches on the latest IT technologies including sensor network areas are actively conducted as an alternative to avoid the risk factors that can be occurred when personnel are put in, such as boundary and surveillance reconnaissance and to utilize personnel efficiently. In this paper, we analyze the conditions for increasing the life span of sensing nodes that make up sensor network by applying clustering and location-based techniques and derived the factors for extending the life span of them. The derived factors include CH(Cluster Head) election scheme and optimal path selection from CH to BS(Base Station). We proposed final scheme using derived factors and verified it through simulation experiments.

Fault Recover Algorithm for Cluster Head Node and Error Correcting Code in Wireless Sensor Network (무선센서 네트워크의 클러스터 헤드노드 고장 복구 알고리즘 및 오류 정정코드)

  • Lee, Joong-Ho
    • Journal of IKEEE
    • /
    • v.20 no.4
    • /
    • pp.449-453
    • /
    • 2016
  • Failures would occur because of the hostile nature environment in Wireless Sensor Networks (WSNs) which is deployed randomly. Therefore, considering faults in WSNs is essential when we design WSN. This paper classified fault model in the sensor node. Especially, this paper proposed new error correcting code scheme and fault recovery algorithm in the CH(Cluster Head) node. For the range of the small size information (<16), the parity size of the proposed code scheme has the same parity length compared with the Hamming code, and it has a benefit to generate code word very simple way. This is very essential to maintain reliability in WSN with increase power efficiency.

Adjusting Cluster Size for Alleviating Network Lifetime in Wireless Sensor Network (무선 센서네트워크에서 네트워크 수명 연장을 위한 클러스터 크기 조정 알고리즘)

  • Kwak, Tae-Kil;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.6
    • /
    • pp.1201-1206
    • /
    • 2007
  • In this paper, we propose an algorithm that improve network lifetime by adjusting cluster size according to location information of sensor node in wireless sensor network (WSN) using clustering algorithm. The collected sensing information by sensor nodes in each cluster are transferred to sink node using inter-cluster communications method. Cluster head (CH) that located nearby sink node spend much more energy than those of far from sink node, because nearer CH forwards more data, so network lifetime has a tendency to decrease. Proposed algorithm minimizes energy consumption in adjacent cluster to sink node by decreasing cluster size, and improve CH lifetime by distributing transmission paths. As a result of mathematical analysis, the proposed algorithm shows longer network lifetime in WSN.

Clustering Algorithm to Equalize the Energy Consumption of Neighboring Node with Sink in Wireless Sensor Networks (무선 센서 네트워크에서 싱크 노드와 인접한 노드의 균등한 에너지 소모를 위한 클러스터링 알고리즘)

  • Jung, Jin-Wook;Jin, Kyo-Hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.465-468
    • /
    • 2008
  • Clustering techniques in wireless sensor networks is developed to minimize the energy consumption of node, show the effect that increases the network lifetime. Existing clustering techniques proposed the method that increases the network lifetime equalizing each node's the energy consumption by rotating the role of CH(Cluster Head), but these algorithm did not present the resolution that minimizes the energy consumption of neighboring nodes with sink. In this paper, we propose the clustering algorithm that prolongs the network lifetime by not including a part of nodes in POS(Personal Operating Space) of the sink in a cluster and communicating with sink directly to reduce the energy consumption of CH closed to sink.

  • PDF

Dynamic-size Multi-hop Clustering Mechanism in Sensor Networks (센서 네트워크에서의 동적 크기 다중홉 클러스터링 방법)

  • Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.875-880
    • /
    • 2005
  • One of the most important issues in the sensor network with resource-constrained sensor nodes is prolonging the network lifetime by efficiently utilizing the given energy of nodes. The most representative mechanism to achieve a long-lived network is the clustering mechanism. In this paper, we propose a new dynamic-size multi-hop clustering mechanism in which the burden of a node acting as a cluster head(CH) is balanced regardless of the density of nodes in a sensor network by adjusting the size of a cluster based on the information about the communication load and the residual energy of the node and its neighboring nodes. We show that our proposed scheme outperforms other single-hop or fixed-size multi-hop clustering mechanisms by carrying out simulations.

Clustering Algorithm to Equalize the Energy Consumption of Neighboring Node on Sink in Wireless Sensor Networks (무선 센서 네트워크에서 싱크노드와 인접한 노드의 균등한 에너지 소모를 위한 클러스터링 알고리즘)

  • Jung, Jin-Wook;Jin, Kyo-Hong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.6
    • /
    • pp.1107-1112
    • /
    • 2008
  • Clustering techniques, which are algorithm to increase the network lifetime in wireless sensor networks, is developed to minimize the energy consumption of nodes. Existing clustering techniques by to increase the network lifetime with equalizing each node's the energy consumption by rotating the role of CH(Cluster Head), but these algorithms did not present the solution that minimizes the energy consumption of neighboring nodes with sink. In this paper, we propose the clustering algorithm that prolongs the network lifetime by not including a part of nodes in POS(Personal Operating Space) of the sink in a cluster and communicating with sink directly to reduce the energy consumption of CH closed to sink.

Clustering Methods for Cluster Uniformity in Wireless Sensor Networks (무선센서 네트워크에서 클러스터 균일화를 위한 클러스터링 방법)

  • Joong-Ho Lee
    • Journal of IKEEE
    • /
    • v.27 no.4
    • /
    • pp.679-682
    • /
    • 2023
  • In wireless sensor networks, communication failure between sensor nodes causes continuous connection attempts, which results in a large power loss. In this paper, an appropriate distance between the CH(Cluster Head) node and the communicating sensor nodes is limited so that a group of clusters of appropriate size is formed on a two-dimensional plane. To equalize the cluster size, sensor nodes in the shortest distance communicate with each other to form member nodes, and clusters are formed by gathering nearby nodes. Based on the proposed cluster uniformity algorithm, the improvement rate of cluster uniformity is shown by simulation results. The proposed method can improve the cluster uniformity of the network by about 30%.

Algorithm for Adjusting Cluster Size according to Location Information in WSN (무선 센서네트워크에서 센서노드의 위치 정보를 이용한 클러스터 크기 조정 알고리즘)

  • Kwak, Tae-Kil;Jin, Kyo-Hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.389-392
    • /
    • 2007
  • In this paper, we propose an algorithm that improve network lifetime by adjusting cluster size according to location information of sensor node in wireless sensor network (WSN) using clustering technique. The sensed information in each cluster transfers to sink node through inter-cluster communications. Cluster head (CH) that nearby located in sink node much more spend own energy than far away CHs, because nearer CH forwards more data, so network lifetime is decreased. Proposed algorithm minimizes energy consumption in adjacent cluster to sink node by decreasing cluster site, and improve CH lifetime by distributing transmission paths. As a result of analysis, the proposed algorithm shows longer network lifetime in WSN.

  • PDF

A Cluster Based Multi-channel Assignment Scheme for Adaptive Tactical Wireless Mesh Network (무선 메쉬 네트워크의 군 환경 적용을 위한 클러스터 기반 멀티채널 할당 기법)

  • Kim, Young-An
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.5
    • /
    • pp.880-887
    • /
    • 2011
  • The Wireless Mesh Network(WMN) technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield. Therefore, WMN is frequently used to satisfy needs for internet connection and active studies and research on them are in progress. However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment. Such phenomenon might cause an issue in fairness index. In order to resolve this issue, we proposed a Cluster Based Multi-channel Assignment Scheme(CB-MAS) for adaptive tactical wireless mesh network. In the CB-MAS, the communication between the Cluster-Head(CH) and cluster number nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-MAS can minimize the interference within multi-channel environments. Our Simulation results showed that CB-MAS achieves improved the throughput and fairness index in WMN.