• Title/Summary/Keyword: BS selection

Search Result 57, Processing Time 0.027 seconds

Effect of Cooperative and Selection Relaying Schemes on Multiuser Diversity in Downlink Cellular Systems with Relays

  • Kang, Min-Suk;Jung, Bang-Chul;Sung, Dan-Keun
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.175-185
    • /
    • 2008
  • In this paper, we investigate the effect of cooperative and selection relaying schemes on multiuser diversity in downlink cellular systems with fixed relay stations (RSs). Each mobile station (MS) is either directly connected to a base station (BS) and/or connected to a relay station. We first derive closed-form solutions or upper-bound of the ergodic and outage capacities of four different downlink data relaying schemes: A direct scheme, a relay scheme, a selection scheme, and a cooperative scheme. The selection scheme selects the best access link between the BS and an MS. For all schemes, the capacity of the BS-RS link is assumed to be always larger than that of RS-MS link. Half-duplex channel use and repetition based relaying schemes are assumed for relaying operations. We also analyze the system capacity in a multiuser diversity environment in which a maximum signal-to-noise ratio (SNR) scheduler is used at a base station. The result shows that the selection scheme outperforms the other three schemes in terms of link ergodic capacity, link outage capacity, and system ergodic capacity. Furthermore, our results show that cooperative and selection diversity techniques limit the performance gain that could have been achieved by the multiuser diversity technique.

Generalized User Selection Algorithm im Downlink Multiuser MIMo System (하향링크 다중 사용자 MIMO 시스템에서의 일반화된 사용자 선택 알고리즘)

  • Kang, Dae Geun;Shin, Change Ui;Kuem, Dong Hyun;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.4
    • /
    • pp.99-105
    • /
    • 2012
  • Recently, there are many user selection algorithms in multi user multiple-input multiple-output (MU-MIMO) systems. One of well-known user selection methods is Semi orthogonal user selection (SUS). It is an algorithm maximizing channel capacity. However, it is applicable only when user's antenna is one. We propose a generalized user selection algorithm regardless of the number of user's antennas. In the proposed scheme, Base station (Bs) selects the first user who has the highest determinant of channel and generates a user group that correlation with first user's channel is less than allowance of correlation. Then, each determinant of channels made up of first user's channel and a user's channel in the generated group is calculated and BS selects the next user who has the highest determinant of that. BS selects following users by repeating above procedure. In this paper, we get better performance because of selecting users who have the highest determinant of channel as well as allowance of correlation optimally calculated through matrix operations.

Improved TOA-Based Localization Method with BS Selection Scheme for Wireless Sensor Networks

  • Go, Seungryeol;Chong, Jong-Wha
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.707-716
    • /
    • 2015
  • The purpose of a localization system is to estimate the coordinates of the geographic location of a mobile device. The accuracy of wireless localization is influenced by nonline-of-sight (NLOS) errors in wireless sensor networks. In this paper, we present an improved time of arrival (TOA)-based localization method for wireless sensor networks. TOA-based localization estimates the geographic location of a mobile device using the distances between a mobile station (MS) and three or more base stations (BSs). However, each of the NLOS errors along a distance measured from an MS (device) to a BS (device) is different because of dissimilar obstacles in the direct signal path between the two devices. To accurately estimate the geographic location of a mobile device in TOA-based localization, we propose an optimized localization method with a BS selection scheme that selects three measured distances that contain a relatively small number of NLOS errors, in this paper. Performance evaluations are presented, and the experimental results are validated through comparisons of various localization methods with the proposed method.

Fixed Indoor-BS Selection Based Self-Healing in Indoor Wireless Communication System (인도어 무선통신시스템에서 고정적 인도어기지국 선택을 통한 자가치유 알고리즘)

  • Lee, Howon;Lee, Kisong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1540-1546
    • /
    • 2014
  • In order to resolve coverage hole problems caused by indoor-BS (IBS) faults, we propose a new frame structure and practical algorithm based on optimization technique. Our main contributions can be described as follows: 1) a frame structure with healing channels for solving abnormal IBS faults; and 2) an efficient heuristic resource allocation algorithm with fixed IBS selection to reduce the complexity for the optimization problem. Through intensive simulations, we evaluate the performance excellency of our proposed algorithm with respect to average cell capacity and user fairness compared with conventional algorithms.

User Selection Algorithms for MU-MIMO Systems with Coordinated Beamforming

  • Maciel-Barboza, Fermin Marcelo;Soriano-Equigua, Leonel;Sanchez-Garcia, Jaime;Castillo-Soria, Francisco Ruben;Topete, Victor Hugo Castillo
    • ETRI Journal
    • /
    • v.38 no.1
    • /
    • pp.62-69
    • /
    • 2016
  • In this paper, we propose two novel user selection algorithms for multiuser multiple-input and multiple-output downlink wireless systems, in which both a base station (BS) and mobile stations (MSs) are equipped with multiple antennas. Linear transmit beamforming at the BS and receive combining at the MSs are used to avoid interference between users and find a better sum-rate capacity performance. An optimal technique for selecting users would entail an exhaustive search, which in practice becomes computationally complex for a realistic number of users. Suboptimal algorithms with low complexity are proposed for a coordinated beamforming scheme. Simulation results show that the performance of the proposed algorithms is better than that provided by previous algorithms and is very close to an optimal approach with reduced complexity.

Socially Aware Device-to-multi-device User Grouping for Popular Content Distribution

  • Liu, Jianlong;Zhou, Wen'an;Lin, Lixia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.11
    • /
    • pp.4372-4394
    • /
    • 2020
  • The distribution of popular videos incurs a large amount of traffic at the base stations (BS) of networks. Device-to-multi-device (D2MD) communication has emerged an efficient radio access technology for offloading BS traffic in recent years. However, traditional studies have focused on synchronous user requests whereas asynchronous user requests are more common. Hence, offloading BS traffic in case of asynchronous user requests while considering their time-varying characteristics and the quality of experience (QoE) of video request users (VRUs) is a pressing problem. This paper uses social stability (SS) and video loading duration (VLD)-tolerant property to group VRUs and seed users (SUs) to offload BS traffic. We define the average amount of data transmission (AADT) to measure the network's capacity for offloading BS traffic. Based on this, we formulate a time-varying bipartite graph matching optimization problem. We decouple the problem into two subproblems which can be solved separately in terms of time and space. Then, we propose the socially aware D2MD user selection (SA-D2MD-S) algorithm based on finite horizon optimal stopping theory, and propose the SA-D2MD user matching (SA-D2MD-M) algorithm to solve the two subproblems. The results of simulations show that our algorithms outperform prevalent algorithms.

Analysis of genetic characteristics of pig breeds using information on single nucleotide polymorphisms

  • Lee, Sang-Min;Oh, Jae-Don;Park, Kyung-Do;Do, Kyoung-Tag
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.32 no.4
    • /
    • pp.485-493
    • /
    • 2019
  • Objective: This study was undertaken to investigate the genetic characteristics of Berkshire (BS), Landrace (LR), and Yorkshire (YS) pig breeds raised in the Great Grandparents pig farms using the single nucleotide polymorphisms (SNP) information. Methods: A total of 25,921 common SNP genotype markers in three pig breeds were used to estimate the expected heterozygosity ($H_E$), polymorphism information content, F-statistics ($F_{ST}$), linkage disequilibrium (LD) and effective population size ($N_e$). Results: The chromosome-wise distribution of $F_{ST}$ in BS, LR, and YS populations were within the range of 0-0.36, and the average $F_{ST}$ value was estimated to be $0.07{\pm}0.06$. This result indicated some level of genetic segregation. An average LD ($r^2$) for the BS, LR, and YS breeds was estimated to be approximately 0.41. This study also found an average $N_e$ of 19.9 (BS), 31.4 (LR), and 34.1 (YS) over the last 5th generations. The effective population size for the BS, LR, and YS breeds decreased at a consistent rate from 50th to 10th generations ago. With a relatively faster $N_e$ decline rate in the past 10th generations, there exists possible evidence for intensive selection practices in pigs in the recent past. Conclusion: To develop customized chips for the genomic selection of various breeds, it is important to select and utilize SNP based on the genetic characteristics of each breed. Since the improvement efficiency of breed pigs increases sharply by the population size, it is important to increase test units for the improvement and it is desirable to establish the pig improvement network system to expand the unit of breed pig improvement through the genetic connection among breed pig farms.

Distance Aware Intelligent Clustering Protocol for Wireless Sensor Networks

  • Gautam, Navin;Pyun, Jae-Young
    • Journal of Communications and Networks
    • /
    • v.12 no.2
    • /
    • pp.122-129
    • /
    • 2010
  • Energy conservation is one of the most important issues for evaluating the performance of wireless sensor network (WSN) applications. Generally speaking, hierarchical clustering protocols such as LEACH, LEACH-C, EEEAC, and BCDCP are more efficient in energy conservation than flat routing protocols. However, these typical protocols still have drawbacks of unequal and high energy depletion in cluster heads (CHs) due to the different transmission distance from each CH to the base station (BS). In order to minimize the energy consumption and increase the network lifetime, we propose a new hierarchical routing protocol, distance aware intelligent clustering protocol (DAIC), with the key concept of dividing the network into tiers and selecting the high energy CHs at the nearest distance from the BS. We have observed that a considerable amount of energy can be conserved by selecting CHs at the nearest distance from the BS. Also, the number of CHs is computed dynamically to avoid the selection of unnecessarily large number of CHs in the network. Our simulation results showed that the proposed DAIC outperforms LEACH and LEACH-C by 63.28% and 36.27% in energy conservation respectively. The distance aware CH selection method adopted in the proposed DAIC protocol can also be adapted to other hierarchical clustering protocols for the higher energy efficiency.

Dynamic Cell Reconfiguration Framework for Energy Conservation in Cellular Wireless Networks

  • Son, Kyuho;Guruprasad, Ranjini;Nagaraj, Santosh;Sarkar, Mahasweta;Dey, Sujit
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.567-579
    • /
    • 2016
  • Several energy saving techniques in cellular wireless networks such as active base station (BS) selection, transmit power budget adaptation and user association have been studied independently or only part of these aspects have been considered together in literature. In this paper, we jointly tackle these three problems and propose an integrated framework, called dynamic cell reconfiguration (DCR). It manages three techniques operating on different time scales for ultimate energy conservation while guaranteeing the quality of service (QoS) level of users. Extensive simulations under various configurations, including the real dataset of BS topology and utilization, demonstrate that the proposed DCR can achieve the performance close to an optimal exhaustive search. Compared to the conventional static scheme where all BSs are always turned on with their maximum transmit powers, DCR can significantly reduce energy consumption, e.g., more than 30% and 50% savings in uniform and non-uniform traffic distribution, respectively.

Selection of Bird Species for the Nakdong River Estuary Management (낙동강 하구 관리를 위한 조류종의 선정)

  • Kim, Bum-soo;Yeo, Unsang;Oh, Dongha;Sung, Kijune
    • Journal of Environmental Science International
    • /
    • v.25 no.5
    • /
    • pp.615-623
    • /
    • 2016
  • Bird species (BS) of the Nakdong River estuary (NRE) were selected to suggest conservation and management strategies, taking habitats and major threats into consideration. Five BS (Cygnus spp., Calidris alpina, Sterna albifrons, Fulica atra, and Anser fabalis) were selected following analysis of their dominance, national importance, seasonality, taxonomic group, and distribution within the NRE. The BS comprise two winter birds, one summer, one passage bird, and one resident bird. They can also be classified into four taxonomic groups: two under ducks and geese (Anatidae), and one each under gulls (Laridae), shorebirds (Scolopacidae), and diving birds (Rallidae). The results show that BS could be a useful tool in guiding estuary management because their habitats are clearly distinct, and include important areas of the NRE. A reduction of feeding and resting places-such as tidal flats, Scirpus planiculmis habitat, and agricultural farmland-and climate change are major threats to BS, therefore countermeasures to such threats should be considered in future estuary management plans.