• 제목/요약/키워드: Cluster Protocol

검색결과 360건 처리시간 0.021초

SIP기반 홈네트워킹 보안 기술에 관한 연구 (A study with respect to the home networking security Technology based on SIP)

  • 함영옥;신용태
    • 한국컴퓨터정보학회논문지
    • /
    • 제14권12호
    • /
    • pp.169-180
    • /
    • 2009
  • 홈 네트워크는 유무선 네트워크를 기반으로 언제, 어디서나 정보가전 및 기기제어와 양방향 멀티미디어 서비스를 이용할 수 있는 주거환경을 일컫는다. 홈 네트워크가 점차 활성화되고 있는 현시점에서 댁내망은 PC 뿐만 아니라 홈오토메이션, 백색가전 등 다양한 기기들로 구축되기 때문에 외부의 공격 형태 및 피해 양상 역시 다양하게 나타날 수 있다. 그래서 본 논문에서 홈 네트워크에 대한 침입에 대응할 수 있는 SIP 기반 홈 네트워킹인 SSIP(Secure Session Initiate Protocol) 모델을 제안한다. 본 논문에서 제안하는 SIP기반 홈네트워킹인 SSIP(Secure Session Initiate Protocol) 모델은 홈 게이트웨이에서 수행하는 Cluster-to-Cluster환경에 SIP의 인증기능을 추기하여 효과적인 인증과 세션 재설정시에 세션 시간 및 셋업 시간을 줄여 주는 효율적이고 신뢰성 있는 시스템이다.

Initial Rendezvous Protocol using Multicarrier Operation for Cognitive Radio Ad-hoc Networks

  • Choi, Ik-Soo;Yoo, Sang-Jo;Seo, Myunghwan;Han, Chul-Hee;Roh, Bongsoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권6호
    • /
    • pp.2513-2533
    • /
    • 2018
  • In cognitive radio technology, the overall efficiency of communications systems can be improved without allocating additional bands by allowing a secondary system to utilize the licensed band when the primary system, which has the right to use the band, does not use it. In this paper, we propose a fast and reliable common channel initialization protocol without any exchange of initialization messages between the cluster head and the member nodes in cognitive ad-hoc networks. In the proposed method, the cluster and member nodes perform channel-based spectrum sensing. After sensing, the cluster head transmits a system activation signal through its available channels with a predetermined angle difference pattern. To detect the cluster head's transmission channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation for the angle difference sequence of the received signal patterns. This is compared to the predetermined reference angle difference pattern. The join-request and channel-decision procedures are presented in this paper. Performance evaluation of the proposed method is presented in the simulation results.

Adaptive method for selecting Cluster Head according to the energy of the sensor node

  • Kim, Yong Min;LEE, WooSuk;Kwon, Oh Seok;Jung, Kyedong;Lee, Jong-Yong
    • International Journal of Advanced Culture Technology
    • /
    • 제4권2호
    • /
    • pp.19-26
    • /
    • 2016
  • The most important factor in the wireless sensor network is the use of effective energy and increase in lifetime of the individual nodes in order to operate the wireless network more efficiently. For this purpose, various routing protocols have been developed. The LEACH such a protocol, well known among typical cluster routing protocols. However, when a cluster head is selected, the energy consumption may not be equal because it does not take into account the energy of the nodes. In this paper, we seek to improve the cluster head selection method according to residual energy of each sensor node. This method then adaptively applies the LEACH algorithm and the cluster head section algorithm with consideration of node energy in accordance with the energy of the whole sensor field. Through the simulation, it was found that this proposed algorithm was effective.

A New Cluster Head Selection Technique based on Remaining Energy of Each Node for Energy Efficiency in WSN

  • Subedi, Sagun;Lee, Sang-Il;Lee, Jae-Hee
    • International journal of advanced smart convergence
    • /
    • 제9권2호
    • /
    • pp.185-194
    • /
    • 2020
  • Designing of a hierarchical clustering algorithm is one of the numerous approaches to minimize the energy consumption of the Wireless Sensor Networks (WSNs). In this paper, a homogeneous and randomly deployed sensor nodes is considered. These sensors are energy constrained elements. The nominal selection of the Cluster Head (CH) which falls under the clustering part of the network protocol is studied and compared to Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. CHs in this proposed process is the function of total remaining energy of each node as well as total average energy of the whole arrangement. The algorithm considers initial energy, optimum value of cluster heads to elect the next group of cluster heads for the network as well as residual energy. Total remaining energy of each node is compared to total average energy of the system and if the result is positive, these nodes are eligible to become CH in the very next round. Analysis and numerical simulations quantify the efficiency and Average Energy Ratio (AER) of the proposed system.

Position-Based Cluster Routing Protocol for Wireless Microsensor Networks

  • Kim Dong-hwan;Lee Ho-seung;Jin Jung-woo;Son Jae-min;Han Ki-jun
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.330-333
    • /
    • 2004
  • Microsensor nodes is energy limited in sensor networks. If nodes had been stop in working, sensor network can't acquire sensing data in that area as well as routing path though the sensor can't be available. So, it's important to maximize the life of network in sensor network. In this paper, we look at communication protocol, which is modified by LEACH(Low-Energy Adaptive Clustering Hierarchy). We extend LEACH's stochastic cluster-head selection algorithm by a Position-based Selection (PB-Leach). This method is that the sink divides the topology into several areas and cluster head is only one in an area. PB-Leach can prevent that the variance of the number of Cluster-Head is large and Cluster-Heads are concentrated in specific area. Simulation results show that PB-Leach performs better than leach by about 100 to $250\%.$

  • PDF

이동 에드-혹 네트워크에서 조합 가중치 클러스터링 알고리즘에 의한 클러스터 그룹 멀티캐스트 (Cluster Group Multicast by Weighted Clustering Algorithm in Mobile Ad-hoc Networks)

  • 박양재;이정현
    • 전자공학회논문지CI
    • /
    • 제41권3호
    • /
    • pp.37-45
    • /
    • 2004
  • 본 논문에서는 이동 에드-혹 네트워크에서 조합가중치 클러스터링 알고리즘을 적용하여 강건하고 신뢰성 있는 클러스터 기반의 그룹 멀티캐스트 방식을 제안한다. 에드-혹 네트워크는 고정된 통신 하부 구조의 도움 없이 이동 단말기로만 구성된 무선 네트워크이다. 제한된 대역폭과 높은 이동성으로 인하여 에드-혹 네트워크에서의 라우팅 프로토콜은 강건하고, 간단하면서 에너지 소비를 최소화하여야 한다. WCGM(Weighted Cluster Group Multicast)방식은 조합 가중치 다중 클러스터 기반 구조를 이용하고 기존의 FGMP(Forwarding Group Multicast Protocol)방식의 장점인 제한적인 플러딩에 의한 데이터 전달방식은 유지하면서 클러스터 헤드 선출 시 조합가중치를 적용한다. 이것은 안정적이며 강건한 데이터 전달 구조를 가지기 때문에 데이터 전달 구조를 유지하기 위한 오버헤드(Overhead)와 데이터 전달을 위한 오버헤드를 모두 줄이는 효과를 시뮬레이션을 통하여 검증하였다.

A Hierarchical Time Division Multiple Access Medium Access Control Protocol for Clustered Underwater Acoustic Networks

  • Yun, Changho;Cho, A-Ra;Kim, Seung-Geun;Park, Jong-Won;Lim, Yong-Kon
    • Journal of information and communication convergence engineering
    • /
    • 제11권3호
    • /
    • pp.153-166
    • /
    • 2013
  • A hierarchical time division multiple access (HTDMA) medium access control (MAC) protocol is proposed for clustered mobile underwater acoustic networks. HTDMA consists of two TDMA scheduling protocols (i.e., TDMA1 and TDMA2) in order to accommodate mobile underwater nodes (UNs). TDMA1 is executed among surface stations (e.g., buoys) using terrestrial wireless communication in order to share mobility information obtained from UNs which move cluster to cluster. TDMA2 is executed among UNs, which send data to their surface station as a cluster head in one cluster. By sharing mobility information, a surface station can instantaneously determine the number of time slots in a TDMA2 frame up to as many as the number of UNs which is currently residing in its cluster. This can enhance delay and channel utilization performance by avoiding the occurrence of idle time slots. We analytically investigate the delay of HTDMA, and compare it with that of wellknown contention-free and contention-based MAC protocols, which are TDMA and Slotted-ALOHA, respectively. It is shown that HTDMA remarkably decreases delay, compared with TDMA and Slotted-ALOHA.

클러스터 기반 라우팅 프로토콜의 에너지 효율성에 관한 연구 (A Study on Energy Efficiency for Cluster-based Routing Protocol)

  • 이원석;안태원;송창영
    • 전자공학회논문지
    • /
    • 제53권3호
    • /
    • pp.163-169
    • /
    • 2016
  • 클러스터 기반 라우팅 프로토콜로 대표적인 LEACH는 에너지 부하의 공평한 분배를 위해 매 라운드 미리 정해진 확률에 따라 랜덤하게 클러스터 헤드를 선출한다. 하지만 센서 노드가 갖는 현재 에너지 레벨은 고려대상이 아니기에 만일 잔존 에너지가 적은 센서 노드가 클러스터 헤드로 선출된다면 에너지 부하가 큰 헤드의 역할을 완수하지 못하고 사망할 수 있을 것이다. 결국 노드의 첫 사망시간이 매우 빨라져 WSN의 서비스 품질도 나빠질 것이다. 이러한 점에 착안하여 본 논문에서는 클러스터 헤드의 에너지 레벨과 기지국까지의 통신거리를 고려하여 클러스터 내부에 서브 클러스터 헤드를 선택하는 방법을 제안한다. 기존 LEACH에 제안하는 방법을 적용 시 클러스터 헤드의 에너지 부담이 줄어들어 노드의 첫 번째 사망시간이 증가하였고 더욱 증가된 데이터가 기지국에 도착하였으며 이로 인한 WSN의 서비스 품질도 개선되었음을 확인할 수 있었다.

Security-reliability Analysis for a Cognitive Multi-hop Protocol in Cluster Networks with Hardware Imperfections

  • Tin, Phu Tran;Nam, Pham Minh;Duy, Tran Trung;Voznak, Miroslav
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제6권3호
    • /
    • pp.200-209
    • /
    • 2017
  • In this paper, we investigate the tradeoff between security and reliability for a multi-hop protocol in cluster-based underlay cognitive radio networks. In the proposed protocol, a secondary source communicates with a secondary destination via the multi-hop relay method in the presence of a secondary eavesdropper. To enhance system performance under the joint impact of interference constraint required by multiple primary users and hardware impairments, the best relay node is selected at each hop to relay the source data to the destination. Moreover, the destination is equipped with multiple antennas and employs a selection combining (SC) technique to combine the received data. We derive closed-form expressions of the intercept probability (IP) for the eavesdropping links and the outage probability (OP) for the data links over a Rayleigh fading channel. Finally, the correction of our derivations is verified by Monte-Carlo simulations.

엑티브 네트워크 기반의 고속 이동시 차량 간 통신 프로토콜 (The Network Protocol Among Cars at High-Speed based on Active Network)

  • 장혜숙;이진관;정규철;이종찬;박기홍
    • 융합보안논문지
    • /
    • 제8권1호
    • /
    • pp.9-18
    • /
    • 2008
  • 고속으로 이동 중인 차량들 간의 긴급한 정보를 주고받아 고속도로에서의 다중충돌사고를 미연에 방지할 수 있는 차량 통신 프로토콜을 제안한다. 본 논문에서는, 도로위의 차량들은 서로 연계성이 없기 때문에 위치추적시스템인 GPS에서 수신한 거리 값을 연계하여 클러스터를 구성한다. 클러스터를 IEEE 802.11 MAC 계층에서 구성하기 때문에 경로 설정으로 인한 과부하문제를 해소 하였다. 논문에서 제안한 액티브 네트워크 기반의 멀티 홉 라우팅 프로토콜은, Active Network를 이용하여 안정된 통신이 이루어 질수 있도록 한다.

  • PDF