• Title/Summary/Keyword: network density

Search Result 1,065, Processing Time 0.03 seconds

Construction of Structured q-ary LDPC Codes over Small Fields Using Sliding-Window Method

  • Chen, Haiqiang;Liu, Yunyi;Qin, Tuanfa;Yao, Haitao;Tang, Qiuling
    • Journal of Communications and Networks
    • /
    • v.16 no.5
    • /
    • pp.479-484
    • /
    • 2014
  • In this paper, we consider the construction of cyclic and quasi-cyclic structured q-ary low-density parity-check (LDPC) codes over a designated small field. The construction is performed with a pre-defined sliding-window, which actually executes the regular mapping from original field to the targeted field under certain parameters. Compared to the original codes, the new constructed codes can provide better flexibility in choice of code rate, code length and size of field. The constructed codes over small fields with code length from tenths to hundreds perform well with q-ary sum-product decoding algorithm (QSPA) over the additive white Gaussian noise channel and are comparable to the improved spherepacking bound. These codes may found applications in wireless sensor networks (WSN), where the delay and energy are extremely constrained.

A Zone based Routing algorithm for VANET (VANET 환경에서 구역 기반의 라우팅 알고리즘)

  • Lee, Seung-Hwan;Seok, Seung-Joon
    • Journal of Digital Convergence
    • /
    • v.10 no.9
    • /
    • pp.325-332
    • /
    • 2012
  • VANET(Vehicular Ad-hoc Network), which is a technology to create a network among vehicles, decides the route to the destination using information of neighbors within the transmission range as transmission nodes. The existing routing protocol which uses geographical information can cause delay and disconnection of the network when the density of nodes is not high enough to communicate because it only considers the distance of the relay nodes or destination nodes from the source nodes. To solve the problem, this dissertation suggests a routing algorithm based on zones for stable communications among vehicles in the environment of VANET. I minimize the packet loss rate by dividing the city environment into zones and taking into account not only the distance of the destination but also the density of vehicles to choose the best communications environment. This results in a better performance than the established research when the performance evaluation is implemented.

Efficient Flooding in Ad hoc Networks using Cluster Formation based on Link Density (애드 혹 네트워크에서 링크밀도기반 클러스터 구축을 이용한 효율적인 플러딩)

  • Lee, Jae-Hyun;Kwon, Kyung-Hee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.589-596
    • /
    • 2007
  • Although flooding has the disadvantages like a transmission of duplicated packets and a packet collision, it has been used frequently to find a path between a source and a sink node in a wireless ad hoc network. Clustering is one of the techniques that have been proposed to overcome those disadvantages. In this paper, we propose a new flooding mechanism in ad hoc networks using cluster formation based on the link density which means the number of neighbors within a node's radio reach. To reduce traffic overhead in the cluster is to make the number of non-flooding nodes as large as possible. Therefore, a node with the most links in a cluster will be elected as cluster header. This method will reduce the network traffic overhead with a reliable network performance. Simulation results using NS2 show that cluster formation based on the link density can reduce redundant flooding without loss of network performance.

The Difference of the Purchase Intention of Social Shopping by Connection Intensity and Centrality of Social Network -In the Case of Online Community and SNS- (소셜네트워크 연결밀도와 중심성에 따른 소셜쇼핑 구매의도의 차이 -온라인커뮤니티와 SNS를 중심으로-)

  • Chun, Myung-Hwan
    • Management & Information Systems Review
    • /
    • v.30 no.3
    • /
    • pp.153-167
    • /
    • 2011
  • This study conducts to examine the effect of purchase intention on social shopping by connection density and centrality which is a structural characteristic of social network. Furthermore, this study suggests and analyses the difference of social shopping purchase intention between online community which focuses on a group and SNS(social network service) which focuses on an individual. To examine these reason, this study proposes hypotheses that reflects structural characteristic then analyses them. The result of analysis shows that the purchase intention on social shopping seems to be high when the density of connection is high and the purchase intention seems to be high when the centrality is high as well. Moreover, there is difference in the purchase intention on social shopping between online community and SNS and it is found that both cases where the connection density is high in the online community and the connection centrality is high in SNS have significant impact on the purchase intention. Based on these results, this study provides an implication on the importance on network structure in social network and social shopping and to increase the purchase intention of social shopping, this study suggests the implication on the importance and direction which understands the structure of social network type.

  • PDF

A Numerical Simulation of Multiphase Flow in a Discrete Fracture Network (이산 균열망에서 다상 흐름에 대한 수치모의)

  • Jeong Woo Chang;Hwang Ma ha;Ko Ick Hwan;Song Jai Woo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2005.05b
    • /
    • pp.245-249
    • /
    • 2005
  • The numerical simulation of a two-phase flow In a discrete fracture network model is presented in this paper, The purpose of this work is to consider density-driven flows induced by the density difference between hot autochthonous heavy brines and injected cold water. Mechanical consequences of high pressure waves on the fracture permeability and heat exchanges between fluids and rock matrix are neglected in this study. The finite volume method is employed to discretize spatially and the system is solved by using an IMPES(Implicit Pressure-Explicit Saturation) scheme. In order to solve the strong non-linearity of the system, the Newton-Raphson algorithm is used. The well-known Buckeley-Leverett problem is adapted to validate results calculated from the model and a relatively good agreement is obtained.

  • PDF

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

  • Choi, Dongmin;Chung, Ilyong
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.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.

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

  • Dehkanov, Shuhrat;Kim, Young-Rag;Lee, Bok-Man;Kim, Chong-Gun
    • 한국정보컨버전스학회:학술대회논문집
    • /
    • 2008.06a
    • /
    • 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

Multifrequency monitoring of a flaring gamma-ray blazar 3C454.3 at 22 and 43GHz

  • Lee, Sang-Sung;Byun, Do-Young;Sohn, Bong-Won
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.36 no.1
    • /
    • pp.50.1-50.1
    • /
    • 2011
  • We report the results of the monitoring of a flaring gamma-ray blazar, 3C454.3 in total flux density at 22 and 43GHz and in polarization at 22GHz with KVN Ulsan 21-m radio telescope every 3-4 days from 19 November 2010 to 31 January 2011. After an extraordinary 5-day gamma-ray outburst in November 2010, the radio total flux density at 22/43GHz and the linear polarization at 22GHz has been decreased with a variation of a short time scale. In this paper, we also discuss a spectral change of 3C454.3 at 22 and 43GHz after the extraordinary gamma-ray outburst.

  • PDF

Matter Density Distribution Reconstruction of Local Universe with Deep Learning

  • Hong, Sungwook E.;Kim, Juhan;Jeong, Donghui;Hwang, Ho Seong
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.2
    • /
    • pp.53.4-53.4
    • /
    • 2019
  • We reconstruct the underlying dark matter (DM) density distribution of the local universe within 20Mpc/h cubic box by using the galaxy position and peculiar velocity. About 1,000 subboxes in the Illustris-TNG cosmological simulation are used to train the relation between DM density distribution and galaxy properties by using UNet-like convolutional neural network (CNN). The estimated DM density distributions have a good agreement with their truth values in terms of pixel-to-pixel correlation, the probability distribution of DM density, and matter power spectrum. We apply the trained CNN architecture to the galaxy properties from the Cosmicflows-3 catalogue to reconstruct the DM density distribution of the local universe. The reconstructed DM density distribution can be used to understand the evolution and fate of our local environment.

  • PDF