• Title/Summary/Keyword: USN cluster

Search Result 19, Processing Time 0.022 seconds

A Design of KDPC(Key Distributed Protocol based on Cluster) using ECDH Algorithm on USN Environment (USN 환경에서 ECDH 알고리즘을 이용한 KDPC(Key Distribution Protocol based on Cluster) 설계)

  • Jeong, Eun-Hee;Lee, Byung-Kwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.856-858
    • /
    • 2013
  • The data which is sensed on USN(Ubiquitous Sensor Network) environment is concerned with personal privacy and the secret information of business, but it has more vulnerable characteristics, in contrast to common networks. In other words, USN has the vulnerabilities which is easily exposed to the attacks such as the eavesdropping of sensor information, the distribution of abnormal packets, the reuse of message, an forgery attack, and denial of service attacks. Therefore, the key is necessarily required for secure communication between sensor nodes. This paper proposes a KDPC(Key Distribution Protocol based on Cluster) using ECDH algorithm by considering the characteristics of sensor network. As a result, the KDPC can provide the safe USN environment by detecting the forgery data and preventing the exposure of sensing data.

  • PDF

Improvement of PEGASIS using Sub-cluster Chaining (서브 클러스터 기법을 이용한 효과적인 USN 라우팅 프로토콜)

  • Jeoung, Su-Hyung;Yoo, Hae-Young
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.6
    • /
    • pp.1647-1652
    • /
    • 2008
  • The PEGASIS protocol is more effective about energy consumption more than LEACH in USN environment. However, PEGASIS is weakness enemy in change of sensor network net composition because It changes BS node frequently. Therefore, we propose new routing protocol that use Sub-Cluster Chaining to solve this problem in this paper. It can reduce overhead that happen in election of middle node doing so and reduce energy consumption. Also, It can supplement limitation that PEGASIS has. This is treatise shows that new protocol that propose than existent PEGASIS through simulation is superior.

A Study on the Robust Efficiency of a Cluster Head Election for USN (USN에서 클러스터헤드 선출의 강건한 효율성 연구)

  • Cho, Do-Hyeoun;Lee, Chul;Choi, Jin-Tek;Kim, Jin-Soo;Lee, Sang-Hun;Lee, Jong-Yong
    • 전자공학회논문지 IE
    • /
    • v.46 no.2
    • /
    • pp.11-17
    • /
    • 2009
  • This study speak abut demerit of LEACH, EACHS, and HEED. There are demerits that LEACH, EACHS shall be rest energy of all nodes and HEED can't guarantee the number of cluster head. Proposed energy efficiency of selected cluster head guarantees the number of cluster head which is a demerit of HEED and minimizes the node of DEAD. Energy efficiency of simulation is compared by MA TLAB.

An Hybrid Clustering Using Meta-Data Scheme in Ubiquitous Sensor Network (유비쿼터스 센서 네트워크에서 메타 데이터 구조를 이용한 하이브리드 클러스터링)

  • Nam, Do-Hyun;Min, Hong-Ki
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.4
    • /
    • pp.313-320
    • /
    • 2008
  • The dynamic clustering technique has some problems regarding energy consumption. In the cluster configuration aspect the cluster structure must be modified every time the head nodes are re-selected resulting in high energy consumption. Also, there is excessive energy consumption when a cluster head node receives identical data from adjacent cluster sources nodes. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects duster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. Furthermore, the issue of redundant data occurring at the cluster head node is dealt with by broadcasting metadata of the initially received data to prevent reception by a sensor node with identical data. A simulation experiment was performed to verify the validity of the proposed approach. The results of the simulation experiments were compared with the performances of two of the must widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 29.3% and 21.2% more efficient than LEACH and HEED, respectively.

  • PDF

Energy-Efficient Hierarchical Cluster-Based Routing for Ubiquitous Sensor Networks (유비쿼터스 센서 네트워크를 위한 에너지-효율적인 계층구조 클러스터 기반 라우팅 기법)

  • Kang, Hee-Hoon;Lee, Young-Jong;Han, Won-Ok
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.4 no.3
    • /
    • pp.243-246
    • /
    • 2009
  • A cluster-based routing with a hierachical structure for continuous query stream ubiquitous sensor network is proposed in this paper. the proposed method realizes high energy-efficiency by using a head-set instead of head for transmitting node-messages to a base station. By using head-set, the method make network lifetime increased.

  • PDF

Energy Efficiency Routing Algorithm for Vessel Ubiquitous Sensor Network Environments (선박 USN에서 에너지 효율성을 위한 라우팅 알고리즘)

  • Choi, Myeong-Soo;Pyo, Se-Jun;Lee, Jin-Seok;Yoon, Seok-Ho;Lee, Seong-Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.5B
    • /
    • pp.557-565
    • /
    • 2011
  • In this paper, we assume that sensor nodes organize the multi-hop networks, are fixed, and operate as full function devices(FFD). The wireless sensor network(WSN) only consists of mobile nodes without the assistance from the fixed infrastructure, which increases the flexibility of the network. However, it is difficult to perform routing in the WSN, since sensor nodes freely join in and drop out of the network, and some sensor nodes have very low power. We propose the algorithm combining routing schemes based on the bitmap and cluster methods in this paper. Through computer simulations, we show the validity of the proposed algorithm.

A Energy-Efficient Cluster Header Election Algorithm in Ubiquitous Sensor Networks (USN에서 에너지 효율성을 고려한 효과적인 클러스터 헤더 선출 알고리즘)

  • Hur, Tai-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.197-203
    • /
    • 2011
  • In this paper, a new cluster configuration process is proposed. The energy consumption of sensor nodes is reduced by configuring the initial setup process only once with keeping the initial cluster. Selecting the highest power consumed node of the member nodes within the cluster to the header of next round can distribute power consumption of all nodes in the cluster evenly. With this proposed way, the lifetime of the USN is increased by the reduced energy consumption of all nodes in the cluster. Also, evenly distributed power consumptions of sensors are designed to improve the energy hole problem. The effectiveness of the proposed algorithms is confirmed through simulations.

Design of a Fault-Tolerant Routing Protocol for USN (USN을 위한 결함허용 라우팅 프로토콜의 설계)

  • Oh, Sun-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.51-57
    • /
    • 2009
  • Ubiquitous sensor network is the communication environment where sensor nodes move freely and construct network to get the services from the system. So, it does not need fixed infrastructure and can easily be placed in unaccessible regions like war or calamity area. Wireless sensor network protocol has self-organizing capability, need to adapt topology change flexibly and also has technique that sensor nodes work cooperatively, because network disconnection is frequently occurred due to the active mobility of sensor nodes. In this paper, we design a cluster based fault-tolerant routing protocol for the efficient topology construction and to guarantee stable data transmission in USN. The performance of the proposed protocol is evaluated by an analytic model.

  • PDF

Efficient USN Routing Protocol using Sub-Clustering

  • Jeong, Su-Hyung;Yoo, Hae-Young
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.4
    • /
    • pp.466-469
    • /
    • 2008
  • The existing routing protocols in USN environment, PEGASIS is more efficient than LEACH, which is a hierarchical routing protocol, for network configuration based on power consumption. Despite its merit that it can reduce energy consumption per node, however, the PEGASIS protocol also has a weakness that it is less responsive to frequent changes that occur in the configuration of sensor network due to BS nodes that keep changing, which is a typical characteristic of the sensor network. To address this problem, this paper proposes to select sub-cluster heads and have them serve as intermediate nodes. This paper presents and analyses that this method can resolve the aforementioned problem of the PEGASIS algorithm.

Advanced HEED protocol using distance weight in USN (USN 환경에서 거리 가중치를 사용한 개선된 HEED 프로토콜)

  • Jeoung, Su-Hyung;Yoo, Hae-Young
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.2
    • /
    • pp.370-376
    • /
    • 2009
  • Recently, Study for routing protocol is gone vigorously in the Ubiquitous Sensor Network. A hierarchical routing protocol is being practical and received interest among them. Therefore we analyze a weak point of HEED. And I suggest the new protocol that solved a weak point of HEED. The new protocol that we propose puts weight in the energy remainder amount than HEED and elect CH. And elected CH is designed to change by new node when quantity of energy leftover becomes less than 50%. Therefore all nodes come to use energy fairly. The protocol that we proposed can prove the cluster survival rate about 30%. And CH is more effective because when elect CH replace, response time selects small node.