• 제목/요약/키워드: node density

검색결과 293건 처리시간 0.031초

Fundamental Considerations: Impact of Sensor Characteristics, Application Environments in Wireless Sensor Networks

  • Choi, Dongmin;Chung, Ilyong
    • 한국멀티미디어학회논문지
    • /
    • 제17권4호
    • /
    • pp.441-457
    • /
    • 2014
  • Observed from the recent performance evaluation of clustering schemes in wireless sensor networks, we found that most of them did not consider various sensor characteristics and its application environment. Without considering these, the performance evaluation results are difficult to be trusted because these networks are application-specific. In this paper, for the fair evaluation, we measured several clustering scheme's performance variations in accordance with sensor data pattern, number of sensors per node, density of points of interest (data density) and sensor coverage. According to the experiment result, we can conclude that clustering methods are easily influenced by POI variation. Network lifetime and data accuracy are also slightly influenced by sensor coverage and number of sensors. Therefore, in the case of the clustering scheme that did not consider various conditions, fair evaluation cannot be expected.

2D Delaunay Triangulation을 이용한 점군 절단 (Point Cloud Slicing Based on 2D Delaunay Triangulation)

  • 박형태;장민호;박상철
    • 한국정밀공학회지
    • /
    • 제24권5호
    • /
    • pp.127-134
    • /
    • 2007
  • Presented in the paper is an algorithm to generate a section curve by slicing a point cloud including tens of thousands of points. Although, there have been previous research results on the slicing problem, they are quite sensitive on the density variations of the point cloud, as well as on the local noise in the point cloud. To relive the difficulties, three technological requirements are identified; 1) dominant point sampling, 2) avoiding local vibration, and 3) robustness on the density changes. To satisfy these requirements, we propose a new slicing algorithm which is based on a node-sphere diagram. The algorithm has been implemented and tested with various examples.

Fuzzy Logic Approach to Zone-Based Stable Cluster Head Election Protocol-Enhanced for Wireless Sensor Networks

  • Mary, S.A. Sahaaya Arul;Gnanadurai, Jasmine Beulah
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권4호
    • /
    • pp.1692-1711
    • /
    • 2016
  • Energy is a scarce resource in wireless sensor networks (WSNs). A variety of clustering protocols for WSNs, such as the zone-based stable election protocol-enhanced (ZSEP-E), have been developed for energy optimization. The ZSEP-E is a heterogeneous zone-based clustering protocol that focuses on unbalanced energy consumption with parallel formation of clusters in zones and election of cluster heads (CHs). Most ZSEP-E research has assumed probabilistic election of CHs in the zones by considering the maximum residual energy of nodes. However, studies of the diverse CH election parameters are lacking. We investigated the performance of the ZSEP-E in such scenarios using a fuzzy logic approach based on three descriptors, i.e., energy, density, and the distance from the node to the base station. We proposed an efficient ZSEP-E scheme to adapt and elect CHs in zones using fuzzy variables and evaluated its performance for different energy levels in the zones.

A Calculation Method of Closeness Centrality for High Density Wireless Sensor Networks

  • Dehkanov, Shuhrat;Kim, Young-Rag;Lee, Bok-Man;Kim, Chong-Gun
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 한국정보컨버전스학회 2008년도 International conference on information convergence
    • /
    • pp.43-46
    • /
    • 2008
  • Centrality has been actively studied in network analysis field. In this paper we show a calculation method of closeness centrality for WSN. Since nodes in a sensor network are very scarce in energy and computation capability the calculation of the closeness is done in two tiers by dividing network into clusters. In first step closeness centrality for cluster heads is calculated. In the second step closeness of member nodes of the chosen cluster is computed in respect to that cluster itself.

  • PDF

학교 보건사업 협력 네트워크 분석 (The network analysis for school health program)

  • 배상수
    • 보건교육건강증진학회지
    • /
    • 제33권3호
    • /
    • pp.1-11
    • /
    • 2016
  • Objectives: The challenging issue of public health program is to strengthen partnership and network between health resources. This study identified the structure and characteristics of school health program network. Methods: In this paper we collected data from schools and organizations in 4 local communities in 2014 that participated to school health program. Using social network analysis techniques we measured the number of component, diameter, density, average degree, node centralization for each network. Results: We determined that networks shared some common organizational structure such as less density, low average degree, and short diameter. Networks were dominated by the health center, and directions of collaborations between nodes were mostly one-way. Conclusions: These findings can help to depict the network of school health program. The further research is necessary to define causal relationship between network effectiveness and public health outcomes.

Effects of Aperture Densitv Distribution on the Flow Through a Rock Fracture with Line-Source and Line-Collection

  • Park, Chung-Kyun;Hahn, Pil-So
    • Nuclear Engineering and Technology
    • /
    • 제30권6호
    • /
    • pp.485-495
    • /
    • 1998
  • Migration characteristics of tracers in a rock fracture in a case of line-source and line-collection was studied. The fracture plane was discretized into a square mesh to which variable apertures were assigned. The spatially varying apertures of a fracture were generated using a geostatistical method, based on a given aperture probability density distribution and a specified spatial correlation length. The flow potential and pressure at each node were computed. Calculations showed that fluid flow occurs predominantly through a few preferred paths. Hence, the large range of apertures in the fracture gives rise to flow channeling. The solute transport was calculated using a particle tracking method. The migration plumes of tracer between injection line and withdrawal line are displayed in contour plots. The elution curves are shown to be controlled by the aperture density distribution and to be insensitive to statistical realization and spatial correlation length.

  • PDF

Study of Via-Typed Air-Gap for Logic Devices Applications below 45 nm Node

  • Kim, Sang-Yong;Kim, Il-Soo;Jeong, Woo-Yang
    • Transactions on Electrical and Electronic Materials
    • /
    • 제12권4호
    • /
    • pp.131-134
    • /
    • 2011
  • Back-end-of-line using ultra low-k (ULK; k < 2.5) has been required to reduce resistive capacitance beyond 45 nmtechnologies, because micro-processing units need higher speed and density. There are two strategies to manufacture ULK inter-layer dielectric (ILD) materials using an air-gap (k = 1). The former ULK and calcinations of ILD degrade the mechanical strength and induce a high cost due to the complication of following process, such as chemical mechanical polishing and deposition of the barrier metal. In contrast, the air-gap based low-k ILD with a relatively higher density has been researched on the trench-type with activity, but it has limited application to high density devices due to its high air-gap into the next metal layer. The height of air-gap into the next metal layer was reduced by changing to the via-typed air-gap, up to about 50% compared to that of the trench-typed air-gap. The controllable ULK was easily fabricated using the via-typed air-gap. It is thought that the via-type air-gap made the better design margin like via-patterning in the area with the dense and narrow lines.

뜨살리스-엔트로피 분석을 통한 무선 랜의 이기적인 노드 탐지 기법 (A Study on Detecting Selfish Nodes in Wireless LAN using Tsallis-Entropy Analysis)

  • 류병현;석승준
    • 한국지능시스템학회논문지
    • /
    • 제22권1호
    • /
    • pp.12-21
    • /
    • 2012
  • IEEE 802.11 표준 무선 네트워크에서 사용되는 DCF(CSMA/CA) 방식의 MAC 프로토콜은 노드들 사이에서 공평한 채널 접근 확률을 보장하도록 설계되었다. 하지만 최근 급속히 확산되고 있는 무선 환경에서 다른 노드들보다 인위적으로 더 많은 데이터를 전송하는 노드가 존재하는 것이 사실이다. 이들 오동작 노드들은 더 많은 데이터를 보내기 위해서 자신의 MAC 프로토콜 동작을 변형시키거나 다른 노드들의 MAC 동작을 방해한다. 이러한 문제는 이기적(Selfish) 노드 문제라고 정의되어 왔으며, 지금까지의 대부분 연구들에서는 무선 랜 내부의 MAC 프로토콜 동작을 프레임 단위로 분석하여 이기적인 노드를 검색하는 방법을 제안하였으나 모든 종류의 이기적인 노드들을 효과적으로 검출할 수는 없었다. 이러한 단점을 보안하기 위해서 본 논문에서는 통계적 기법 중 하나인 뜨살리스-엔트로피(Tsallis-Entropy)를 사용하여 이기적인 노드 탐색 알고리즘을 제안한다. 뜨살리스-엔트로피는 확률 분포의 밀집도 혹은 분산정도를 효과적으로 나타낼 수 있는 척도이다. 제안한 알고리즘은 무선 랜을 구성하는 AP노드에서 동작하도록 설계되었으며, 무선 노드별로 데이터 간격에 대한 확률 분포를 추출해서 뜨살리스-엔트로피를 계산한 후 임계치와 비교하는 방법으로 이기적인 노드를 검출한다. 논문에서 제안한 이기적 노드 검출 알고리즘의 성능을 평가하기 위하여 다양한 무선 랜 환경(혼잡도, 이기적 노드 동작방법, 임계치)을 고려하여 시뮬레이션을 수행한다. 시뮬레이터는 ns2를 사용하였으며, 실험결과 제안한 방법의 이기적인 노드 검출률 이 매우 높음을 알 수 있다.

연산기와 메모리 재사용을 이용한 효율적인 DVB-S2 규격의 LDPC 복호기 구조 (Architecture of an LDPC Decoder for DVB-S2 using reuse Technique of processing units and Memory Relocation)

  • 박재근;이찬호
    • 대한전자공학회논문지SD
    • /
    • 제43권9호
    • /
    • pp.31-37
    • /
    • 2006
  • Low Density Parity Check (LDPC) code는 최근 그 우수한 성능으로 인하여 4세대 무선 이동 통신용 채널 코딩으로 주목받고 있다. 또한 유럽 디지털 위성 방송 규격인 DVB-S2는 LDPC 코드를 채널 코딩방식으로 채택하였다. 본 논문에서는 인코더와 디코더 양쪽 모두 효율적으로 하드웨어 구현이 가능한 hybrid H-matrix 구조를 이용한 DVB-S2 LDPC 복호기 구조를 제안한다. Hybrid H-matrix는 semi-random 방식과 partly parallel 방식을 결합하여 부호기와 복호기를 동시에 효율적으로 구현할 수 있다. 제안된 복호기 구조에서는 다양한 코드율에 사용되는 Variable Node processor Unit (VNU)을 재사용하기 위한 새로운 VNU와 최적화된 블록 메모리 배치 방법을 이용하였다. 제안된 구조를 이용하여 코드율 1/2의 DVB-S2 LDPC 복호기를 설계하였고 그 결과를 기존의 복호기와 비교하였다.

높은 접근성과 에너지 효율을 갖는 계수기반 브로드캐스트 기법 (Efficient Counter-Based Broadcast Scheme for High Reachability and Energy Efficiency)

  • 정지영;서동윤;이정륜
    • 한국통신학회논문지
    • /
    • 제41권12호
    • /
    • pp.1780-1792
    • /
    • 2016
  • 본 논문에서는 높은 접근성과 에너지 효율을 갖는 계수기반 브로드캐스팅 기법을 제안한다. 이를 위해 더 넓은 영역을 추가로 커버할 수 있는 노드가 리브로드캐스팅을 수행할 수 있도록, 두 노드로부터 동일한 브로드캐스팅 메시지를 수신 받은 노드가 자신이 리브로드캐스팅 시 얻을 수 있는 추가적인 커버리지를 계산하는 방법을 제안한다. 계산된 추가적인 커버리지 정보와 거리정보, 밀집도 정보, 배터리 잔량 정보를 통해 임의의 접속 지연(RAD)을 결정하는 수식을 제안하였고, 밀집도 정보와 배터리 잔량 정보를 통해 계수 임계값 ($C_{th}$)을 결정하는 수식을 제안한다. 시뮬레이션 성능평가를 통해 기존에 제안된 계수기반 브로드캐스팅 기법들과 성능비교를 통해 제안하는 알고리즘의 성능을 평가한다.