• Title/Summary/Keyword: Irregular Networks

Search Result 55, Processing Time 0.024 seconds

Enhancing Irregular Repetition Slotted ALOHA with Polarization Diversity in LEO Satellite Networks

  • Su, Jingrui;Ren, Guangliang;Zhao, Bo;Ding, Jian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3907-3923
    • /
    • 2020
  • An enhanced irregular repetition slotted ALOHA (IRSA) protocol is proposed by using polarization characteristic of satellite link and MIMO detection in low earth orbit (LEO) satellite networks, which is dubbed polarized MIMO IRSA (PM-IRSA). In the proposed scheme, one or two packets in one slot can be decoded by employing polarized MIMO detection, and more than two collided packets in multiple slots which can construct the virtual MIMO model can be decoded by the MIMO detection algorithm. The performance of the proposed scheme is analyzed with the density evolution (DE) approach and the degree distribution is optimized to maximize the system throughput by using a differential evolution. Numerical results certify our analysis and show that the normalized throughput of the proposed PM-IRSA can achieve 1.89 bits/symbol.

A Robust Disjoint Multipath Scheme based on Geographic Routing in Irregular Wireless Sensor Networks (불규칙적 무선센서네트워크에 강한 위치기반 다중경로 제공 방안)

  • Kim, Sung-Hwi;Park, Ho-Sung;Lee, Jeong-Cheol;Oh, Seung-Min;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.1B
    • /
    • pp.21-30
    • /
    • 2012
  • Sensor networks are composed of a great number of sensor nodes with constrained battery. Disjoint multipath scheme based flooding method has a merit that efficiently construct multipath in irregular networks, but causes lots of energy consumption in networks. Flooding method is not a suitable technology in wireless sensor networks with constrained battery. We introduce energy-efficient geographic routing scheme considered as an efficient, simple, and scalable routing protocol for wireless sensor networks. The geographic routing scheme on multipath generates a problem with a congestion. So we introduce the concept of multipath pipeline as a congestion avoidance strategy. But multipath pipelines have a big problem on the boundary of holes under irregular networks. We propose a novel disjoint multipath scheme as combined method with geographic routing scheme and hole detouring algorithm on multipath. A novel disjoint multipath scheme constructs disjoint multipath pipelines efficiently for reliability without a collision in irregular wireless sensor networks. Simulation results are provided to validate the claims.

Fast Computation Algorithm for the Impedance Calculation of Irregular Shaped Metal-dielectric-metal Type Power Distribution Plane (임의 형상의 금속-유전체-금속 전력배분기판에 대한 빠른 임피던스 계산 방법)

  • Suh, Young-Suk
    • Journal of the Korean Institute of Electrical and Electronic Material Engineers
    • /
    • v.18 no.5
    • /
    • pp.457-463
    • /
    • 2005
  • This paper presents a method for analyzing irregular shaped power distribution networks. The irregular shaped metal-dielectric-metal plane is split into several piece of rectangular segments to calculate the impedance of the irregular shaped plane. Impedance matrix for each rectangular segments is calculated using the Mobius transform method to reduce the calculation time. Then the segmentation and do-segmentation method is applied to the piece of rectangular segments. Applied to the 6 inch by 5 inch size irregular shaped board, the proposed method shows 10 times faster than the electromagnetic or circuit analysis method.

Optimized Geometric LDPC Codes with Quasi-Cyclic Structure

  • Jiang, Xueqin;Lee, Moon Ho;Gao, Shangce;Wu, Yun
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.249-257
    • /
    • 2014
  • This paper presents methods to the construction of regular and irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by these methods have quasi-cyclic (QC) structure and large girth. By decomposing hyperplanes in Euclidean geometry, the proposed irregular LDPC codes have flexible column/row weights. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting in the extrinsic information transfer (EXIT) charts. Simulation results show that the proposed codes perform very well with an iterative decoding over the AWGN channel.

Game Theoretic based Distributed Dynamic Power Allocation in Irregular Geometry Multicellular Network

  • Safdar, Hashim;Ullah, Rahat;Khalid, Zubair
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.199-205
    • /
    • 2022
  • The extensive growth in data rate demand by the smart gadgets and mobile broadband application services in wireless cellular networks. To achieve higher data rate demand which leads to aggressive frequency reuse to improve network capacity at the price of Inter Cell Interference (ICI). Fractional Frequency Reuse (FFR) has been recognized as an effective scheme to get a higher data rate and mitigate ICI for perfect geometry network scenarios. In, an irregular geometric multicellular network, ICI mitigation is a challenging issue. The purpose of this paper is to develop distributed dynamic power allocation scheme for FFR based on game theory to mitigate ICI. In the proposed scheme, each cell region in an irregular multicellular scenario adopts a self-less behavior instead of selfish behavior to improve the overall utility function. This proposed scheme improves the overall data rate and mitigates ICI.

Sink Location Service via Circle Path for Geographic Routing in Wireless Sensor Networks (무선 센서 네트워크에서 위치 기반 라우팅을 위한 원형 경로 기반 싱크 위치 서비스)

  • Park, Ho-Sung;Lee, Jeong-Cheol;Oh, Seung-Min;Yim, Young-Bin;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6A
    • /
    • pp.585-593
    • /
    • 2010
  • Geographic routing has been considered as an efficient, simple, and scalable routing protocol for wireless sensor networks since it exploits pure local location information instead of global topology information to route data packets. Geographic routing requires the sources nodes to be aware of the location of sinks. Most existing geographic routing protocols merely assume that source nodes are aware of the locations of sinks. How can source nodes get the locations of sinks was not addressed in detail. In this paper, we propose a sink location service via circle path for geographic routing in wireless sensor networks. In this scheme, a sink sends a Sink Location Announcement (SLA) message along a circle path, and a source node sends a Sink Location Query (SLQ) message along a straight path that certainly passes through the circle path. By this way we can guarantee the SLQ path and SLA path have at least one crossing point. The node located on the crossing point of the two paths informs the source node the sink location. This procedure can correctly work in any irregular profile sensor networks such as network that has holes or irregular shape by some rules. Simulation results show that our protocol is superior to other protocols in terms of energy consumption and control overhead.

On the Use of Adaptive Weight Functions in Wavelength-Continuous WDM Multi-Fiber Networks under Dynamic Traffic

  • Miliotis Konstantinos V.;Papadimitriou Georgios I.;Pomportsis Andreas S.
    • Journal of Communications and Networks
    • /
    • v.7 no.4
    • /
    • pp.499-508
    • /
    • 2005
  • In this paper, we address the problem of efficient routing and wavelength assignment (RWA) in multi-fiber wavelength division multiplexing (WDM) networks without wavelength translation, under dynamic traffic. We couple Dijkstra's shortest path algorithm with a suitable weight function which chooses optical paths based both on wavelength availability and multi-fiber segments. We compare our approach with other RWA schemes both for regular and irregular WDM multi-fiber network topologies in terms of blocking probability and overall link utilization.

Sink Location Dissemination Scheme in Geographic Routing for Wireless Sensor Networks (무선 센서 망을 위한 위치 기반 라우팅에서 싱크 위치 전달 방안)

  • Lee, Eul-Sin;Park, Soo-Chang;Lee, Jeong-Cheol;Kim, Sang-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9B
    • /
    • pp.847-856
    • /
    • 2009
  • In geographic routing for wireless sensor networks, sources need the location of sinks destined for delivering their data packets. Most of the existing geographic routing protocols merely assume that the sources can get the locations of sinks by some location service. How source nodes find out the location of sinks is not easy. In this paper, we propose a sink location dissemination scheme in geographic routing for wireless sensor networks. In this scheme, a source node and a sink node send sink location announcement and query messages along two paths respectively by geographic routing. The node located on the crossing point of the two paths informs the source about the sink location. Then the source can send data packet to the sink by geographic routing. How to guarantee that these two paths have at least one crossing point in any irregular profile of sensor network is the challenge of this paper Simulation results show that our protocol is significantly superior to other protocols in terms of energy consumption and control overhead.

A Study on Triangulated Irregular Network Generation Method for GSIS (지형공간정보체계의 이용을 위한 불규칙삼각망 생성기법에 관한 연구)

  • 유복모;장지원;윤정학
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.12 no.2
    • /
    • pp.209-218
    • /
    • 1994
  • This study aims to generate triangulated irregular network in a form of digital terrain model which is being increasingly used. In general, grid digital elevation model and triangulated irregular network are reasonable units for solving terrain problems. But, triangulated irregular network is an efficient alternative to grid digital elevation model because of their efficiency in storing data and their convenient data structure for accommodating irregularly spaced elevation data. Various methods represented for extracting triangulated irregular networks from grid digital elevation model, and then algorithm that get accurate results for triangulation with their data set was introduced. The new approach for triangulation in this study uses the Elevation and Changeable Distance criterion, and adding interpolation points and restricted constraint lines can generate triangulated irregular network which is more close to real surface. This made database efficient construction and could be used for many applications of geo-spatial information system.

  • PDF

Reconstruction of 3D Topography from Contour Line Data using Artificial Neural Networks (신경회로망을 이용한 등고선 데이터로부터 3차원 지형 복원)

  • Su-Sun Kim
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.3
    • /
    • pp.297-308
    • /
    • 2001
  • We propose an algorithm which can reconstruct the 3D information from geographical information. The conventional techniques, the triangular patches and the Random Fractal Midpoint Displacement (RFMD) method, etc., have often been used to reconstruct natural images. While the RFMD method using Gaussian distribution obtains good results for the symmetric images, it is not reliable on asymmetric images immanent in the nature. Our proposed algorithm employs neural networks for the RFMD method to present the asymmetrical images. By using a neural network for reconstructing the 3D images, we can utilize statistical characteristics of irregular data. We show that our algorithm has a better performance than others by the point of view on the similarity evaluation. And, it seems that our method is more efficient for the mountainous topography which is more rough and irregular.

  • PDF