• Title/Summary/Keyword: Coverage algorithm

Search Result 364, Processing Time 0.023 seconds

Device-to-Device Relay Cooperative Transmission Based on Network Coding

  • Wang, Jing;Ouyang, Mingsheng;Liang, Wei;Hou, Jun;Liu, Xiangyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3431-3445
    • /
    • 2017
  • Due to the advantages of low transmit power consumption, high spectral efficiency and extended system coverage, Device-to-Device (D2D) communication has drawn explosive attention in wireless communication field. Considering that intra-cell interference caused between cellular signals and D2D signals, in this paper, a network coding-based D2D relay cooperative transmission algorithm is proposed. Under D2D single-hop relay transmission mode, cellular interfering signals can be regarded as useful signals to code with D2D signals at D2D relay node. Using cellular interfering signals and network coded signals, D2D receiver restores the D2D signals to achieve the effect of interference suppression. Theoretical analysis shows that, compared with Amplify-and-forward (AF) mode and Decode-and-forward (DF) mode, the proposed algorithm can dramatically increase the link achievable rate. Furthermore, simulation experiment verifies that by employing the proposed algorithm, the interference signals in D2D communication can be eliminated effectively, and meanwhile the symbol error rate (SER) performance can be improved.

Collaborative Sub-channel Allocation with Power Control in Small Cell Networks

  • Yang, Guang;Cao, Yewen;Wang, Deqiang;Xu, Jian;Wu, Changlei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.611-627
    • /
    • 2017
  • For enhancing the coverage of wireless networks and increasing the spectrum efficiency, small cell networks (SCNs) are considered to be one of the most prospective schemes. Most of the existing literature on resource allocation among non-cooperative small cell base stations (SBSs) has widely drawn close attention and there are only a small number of the cooperative ideas in SCNs. Based on the motivation, we further investigate the cooperative approach, which is formulated as a coalition formation game with power control algorithm (CFG-PC). First, we formulate the downlink sub-channel resource allocation problem in an SCN as a coalition formation game. Pareto order and utilitarian order are applied to form coalitions respectively. Second, to achieve more availability and efficiency power assignment, we expand and solve the power control using particle swarm optimization (PSO). Finally, with our proposed algorithm, each SBS can cooperatively work and eventually converge to a stable SBS partition. As far as the transmit rate of per SBS and the system rate are concerned respectively, simulation results indicate that our proposed CFG-PC has a significant advantage, relative to a classical coalition formation algorithm and the non-cooperative case.

An Effective Memory Test Algorithm for Detecting NPSFs (이웃 패턴 감응 고장을 위한 효과적인 메모리 테스트 알고리듬)

  • Suh, Il-Seok;Kang, Yong-Seok;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.11
    • /
    • pp.44-52
    • /
    • 2002
  • Since memory technology has been developed fast, test complexity and test time have been increased simultaneously. In practice, March algorithms are used widely for detecting various faults. However, March algorithms cannot detect NPSFs(Neighborhood Pattern Sensitive Faults) which must be considered for DRAMs. This paper proposes an effective algorithm for high fault coverage by modifying the conventional March algorithms.

Mobility-Based Clustering Algorithm for Multimedia Broadcasting over IEEE 802.11p-LTE-enabled VANET

  • Syfullah, Mohammad;Lim, Joanne Mun-Yee;Siaw, Fei Lu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1213-1237
    • /
    • 2019
  • Vehicular Ad-hoc Network (VANET) facilities envision future Intelligent Transporting Systems (ITSs) by providing inter-vehicle communication for metrics such as road surveillance, traffic information, and road condition. In recent years, vehicle manufacturers, researchers and academicians have devoted significant attention to vehicular communication technology because of its highly dynamic connectivity and self-organized, decentralized networking characteristics. However, due to VANET's high mobility, dynamic network topology and low communication coverage, dissemination of large data packets (e.g. multimedia content) is challenging. Clustering enhances network performance by maintaining communication link stability, sharing network resources and efficiently using bandwidth among nodes. This paper proposes a mobility-based, multi-hop clustering algorithm, (MBCA) for multimedia content broadcasting over an IEEE 802.11p-LTE-enabled hybrid VANET architecture. The OMNeT++ network simulator and a SUMO traffic generator are used to simulate a network scenario. The simulation results indicate that the proposed clustering algorithm over a hybrid VANET architecture improves the overall network stability and performance, resulting in an overall 20% increased cluster head duration, 20% increased cluster member duration, lower cluster overhead, 15% improved data packet delivery ratio and lower network delay from the referenced schemes [46], [47] and [50] during multimedia content dissemination over VANET.

Hierarchical Resource Management Framework and Multi-hop Task Scheduling Decision for Resource-Constrained VEC Networks

  • Hu, Xi;Zhao, Yicheng;Huang, Yang;Zhu, Chen;Yao, Jun;Fang, Nana
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.11
    • /
    • pp.3638-3657
    • /
    • 2022
  • In urban vehicular edge computing (VEC) environments, one edge server always serves many task requests in its coverage which results in the resource-constrained problem. To resolve the problem and improve system utilization, we first design a general hierarchical resource management framework based on typical VEC network structures. Following the framework, a specific interacting protocol is also designed for our decision algorithm. Secondly, a greedy bidding-based multi-hop task scheduling decision algorithm is proposed to realize effective task scheduling in resource-constrained VEC environments. In this algorithm, the goal of maximizing system utility is modeled as an optimization problem with the constraints of task deadlines and available computing resources. Then, an auction mechanism named greedy bidding is used to match task requests to edge servers in the case of multiple hops to maximize the system utility. Simulation results show that our proposal can maximize the number of tasks served in resource constrained VEC networks and improve the system utility.

Power Configuration using Weighted Sum Genetic Algorithm in Femtocell System (가중치 합 유전자 알고리즘을 이용한 펨토셀 전력 설정 기법)

  • Hong, In;Hwang, Jae-Ho;Shon, Sung-Hwan;Kim, Jae-Moung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.6
    • /
    • pp.136-150
    • /
    • 2010
  • Due to the effect of indoor coverage problem, the QoS of the indoor users will be degraded dramatically, with the number of indoor users. The femto cell is a popular solution for such problems. Since the price of the femto base station is usually cheap enough, one can sets up huge number of base stations in a small indoor area to reduce the size of communication cell. In this way, the QoS of the indoor users can be improved significantly. Moreover, the data rate can also be increased. However, how to decide an ideal transmitting power according to the surrounding radio environment is not a trivial problem, that still has not been addressed well. If the transmit power of femto base station is too large, the interference to the macro users will be increased. Conversely, if the transmit power of femto base station is too small; the coverage of femto base station will be reduced. To address this problem, we propose a power configuration method in femto base station using Genetic Algorithm by investigating a new fitness function. Furthermore, we adopt the weighted sum approach to improve the user performance in different modes. The simulation results show that the proposed power configuration method can not only improves the downlink SINR, but also enhance the channel capacity for both the Macro cell systems and Femto cell systems compared with some conventional methods.

Seismic Traveltime Tomography in Inhomogeneous Tilted Transversely Isotropic Media (불균질 횡등방성 매질에서의 탄성파 주시토모그래피)

  • Jeong, Chang-Ho;Suh, Jung-Hee
    • Geophysics and Geophysical Exploration
    • /
    • v.10 no.4
    • /
    • pp.229-240
    • /
    • 2007
  • In this study, seismic anisotropic tomography algorithm was developed for imaging the seismic velocity anisotropy of the subsurface. This algorithm includes several inversion schemes in order to make the inversion process stable and robust. First of all, the set of the inversion parameters is limited to one slowness, two ratios of slowness and one direction of the anisotropy symmetric axis. The ranges of the inversion parameters are localized by the pseudobeta transform to obtain the reasonable inversion results and the inversion constraints are controlled efficiently by ACB(Active Constraint Balancing) method. Especially, the inversion using the Fresnel volume is applied to the anisotropic tomography and it can make the anisotropic tomography more stable than ray tomography as it widens the propagation angle coverage. The algorithm of anisotropic tomography is verified through the numerical experiments. And, it is applied to the real field data measured at limestone region and the results are discussed with the drill log and geological survey data. The anisotropic tomography algorithm will be able to provide the useful tool to evaluate and understand the geological structure of the subsurface more reasonably with the anisotropic characteristics.

A Centralized Deployment Protocol with Sufficient Coverage and Connectivity Guarantee for WSNs (무선 센서 네트워크에서 유효 커버리지 및 접속성 보장을 위한 중앙 집중형 배치 프로토콜)

  • Kim, Hyun-Tae;Zhang, Gui-Ping;Kim, Hyoung-Jin;Joo, Young-Hoon;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.683-690
    • /
    • 2006
  • Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.

Motor Control IP Design and Quality Evaluation from the Viewpoint of Reuse (ICCAS 2004)

  • Lee, Sang-Deok;Han, Sung-Ho;Kim, Min-Soo;Park, Young-Jun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.981-985
    • /
    • 2004
  • In this paper we designed the motor control IP Core and evaluate its quality from the viewpoint of IP reuse. The most attractive merit of this methodology, so called IP-based hardware design, is hardware reuse. Although various vendors designed hardware with the same specification and got the same functional results, all that IPs is not the same quality in the reuse aspect. As tremendous calls for SoC have been increased, associated research about IP quality standard, VSIA(Virtual Socket Interface Alliance) and STARC(Semiconductor Technology Academic Research Center), has been doing best to make the IP quality evaluation system. And they made what conforms to objective IP design standard. We suggest the methodology to evaluate our own designed motor control IP quality with this standard. To attain our goal, we designed motor control IP that could control the motor velocity and position with feedback compensation algorithm. This controller has some IP blocks : digital filter, quadrature decoder, position counter, motion compensator, and PWM generator. Each block's functionality was verified by simulator ModelSim and then its quality was evaluated. To evaluate the core, We use Vnavigator for lint test and ModelSim for coverage check. During lint process, We adapted the OpenMORE's rule based on RMM (Reuse Methodology Manual) and it could tell us our IP's quality in a manner of the scored value form. If it is high, its quality is also high, and vice versa. During coverage check ModelSim-SE is used for verifying how our test circuits cover designs. This objective methods using well-defined commercial coverage metrics could perform a quantitative analysis of simulation completeness. In this manner, We evaluated the designed motor control IP's quality from the viewpoint of reuse. This methodology will save the time and cost in designing SoC that should integrate various IPs. In addition to this, It can be the guide for comparing the equally specified IP's quality. After all, we are continuously looking forward to enhancing our motor control IP in the aspect of not only functional perfection but also IP reuse to prepare for the SoC-Compliant motor control IP design.

  • PDF

Optimizing Similarity Threshold and Coverage of CBR (사례기반추론의 유사 임계치 및 커버리지 최적화)

  • Ahn, Hyunchul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.8
    • /
    • pp.535-542
    • /
    • 2013
  • Since case-based reasoning(CBR) has many advantages, it has been used for supporting decision making in various areas including medical checkup, production planning, customer classification, and so on. However, there are several factors to be set by heuristics when designing effective CBR systems. Among these factors, this study addresses the issue of selecting appropriate neighbors in case retrieval step. As the criterion for selecting appropriate neighbors, conventional studies have used the preset number of neighbors to combine(i.e. k of k-nearest neighbor), or the relative portion of the maximum similarity. However, this study proposes to use the absolute similarity threshold varying from 0 to 1, as the criterion for selecting appropriate neighbors to combine. In this case, too small similarity threshold value may make the model rarely produce the solution. To avoid this, we propose to adopt the coverage, which implies the ratio of the cases in which solutions are produced over the total number of the training cases, and to set it as the constraint when optimizing the similarity threshold. To validate the usefulness of the proposed model, we applied it to a real-world target marketing case of an online shopping mall in Korea. As a result, we found that the proposed model might significantly improve the performance of CBR.