• Title/Summary/Keyword: Base stations

Search Result 637, Processing Time 0.033 seconds

Limit Analysis of the Distance between DU and RU in 4G FDD Mobile Communication Systems (FDD 방식의 4G 이동통신 기지국에서 DU와 RU간 한계거리 분석)

  • Kim, Sung-Man
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.7 no.1
    • /
    • pp.135-139
    • /
    • 2012
  • A majority of 4G Mobile communication manufacturers have launched separated-type base stations composed of DU (digital unit) and RU (ratio unit). DUs are usually installed in the central office, while RUs with antennas are installed on the top of building or pole. Therefore, the allowable distance between DU and RU is very important for cell planning. In this paper, we analyze the allowable distance between DU and RU induced by closed-loop MIMO (mulitple input multiple output) technology in 4G FDD (frequency division duplexing) mobile communication systems. In conclusion, the distance limit between DU and RU is dependent on the frequency of the wireless communication, and the allowable distance is about 11 km when assuming the operating frequency is 2 GHz.

Finger Printing Based Radio Positioning Scheme for Maritime Safety (수상 안전을 위한 Finger Printing 기반 무선 위치추적 기술)

  • Seok, Keun Young;Ryu, Jong Yeol;Lee, Jung Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.7
    • /
    • pp.1001-1008
    • /
    • 2018
  • In this paper, we propose an efficient location tracking scheme using wireless signals for various situations in marine environment that requires location information for many reasons such as lifesaving, accident prevention, and facility management. Our proposed location tracking scheme not only monitors user's location, but also minimizes the risk under the user's limited battery power budget. The position of a user can be obtained at base stations from the strengths of the received signals from the user. In this case, it may require to prevent the user from getting out of the predetermined safe area. For each location in the safe area, we define a risk function, which is influenced by many factors such as location accuracy, depth, flow rate, and geometry. Our proposed scheme is based on finger printing technique and aims at minimizing the average risk of each user in the safe area.

A Design of Efficient Cluster Sensor Network Using Approximate Steiner Minimum Tree (근사 최소 스타이너 트리를 이용한 효율적인 클러스터 센서 네트워크의 구성)

  • Kim, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.17A no.2
    • /
    • pp.103-112
    • /
    • 2010
  • Cluster sensor network is a sensor network where input nodes crowd densely around some nuclei. Steiner minimum tree is a tree connecting all input nodes with introducing some additional nodes called Steiner points. This paper proposes a mechanism for efficient construction of a cluster sensor network connecting all sensor nodes and base stations using connections between nodes in each belonged cluster and between every cluster, and using repetitive constructions of approximate Steiner minimum trees. In experiments, while taking 1170.5% percentages more time to build cluster sensor network than the method of Euclidian minimum spanning tree, the proposed mechanism whose time complexity is O($N^2$) could spend only 20.3 percentages more time for building 0.1% added length network in comparison with the method of Euclidian minimum spanning tree. The mechanism could curtail the built trees' average length by maximum 3.7 percentages and by average 1.9 percentages, compared with the average length of trees built by Euclidian minimum spanning tree method.

Performance Simulations of Wireless Grid Communication Networks

  • Abdulsam, Ibraheem Read;Kim, Se Mog;Rhee, Jong Myung
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.2
    • /
    • pp.18-22
    • /
    • 2014
  • Satellite communications consist of communications between base stations of the ground and satellites. For efficient satellite communications, ground networks should be organically utilized. Grid networks are frequently used in and outside the country for wireless communications. The performance of wireless communications is determined by mobility, topography, and jamming signals. Therefore, continuous studies of grid networks are necessary for the utilization of next period satellite networks. Since military communications are used based on wireless systems, they can be considered as a sample of utilization of grid networks. Therefore, this paper presented the results of simulations conducted for the improvement of the performance of the grid networks used in military communications that employing the OSPF, a popular routing protocol for military applications. First we investigate the effects of changing the bit error rate (BER) and number of routers. Then we discuss the effects of maximum segment size (MSS) on network behavior and stability. In this way, we can determine the appropriate MSS for a grid network under various values of BER and number of routers. Such results can be also applied to commercial grid network evaluations.

Improved Throughput Scaling of Large Ultra-Wide Band Ad Hoc Networks (거대 초 광 대역 애드 혹 네트워크에서의 개선된 용량 스케일링)

  • Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.2
    • /
    • pp.303-310
    • /
    • 2014
  • We show improved throughput scaling laws for an ultra-wide band (UWB) ad hoc network, in which n wireless nodes are randomly located. First, we consider the case where a modified hierarchical cooperation (HC) strategy is used. Then, in a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent ${\alpha}$ for certain operating regimes due to the power-limited characteristics. It also turns out that the HC protocol is dominant for 2 < ${\alpha}$ < 3 while using the nearest multihop (MH) routing leads to a higher throughput for ${\alpha}{\geq}3$. Second, the impact and benefits of infrastructure support are analyzed, where m base stations (BSs) are regularly placed in UWB networks. In this case, the derived throughput scaling depends on ${\alpha}$ due to the power-limited characteristics for all operating regimes. Furthermore, it is shown that the total throughput scales linearly with parameter m as m is larger than a certain level. Hence, the use of either HC or infrastructure is helpful in improving the throughput of UWB networks in some conditions.

Performance Analysis of TCP using DSR Routing Protocols in Ad-hoc Mobile Network (DSR 라우팅 프로토콜을 사용한 Ad-hoc 무선망에서의 TCP 성능 분석)

  • Park, Seung-Seob;Yuk, Dong-Cheol
    • The KIPS Transactions:PartC
    • /
    • v.9C no.5
    • /
    • pp.647-654
    • /
    • 2002
  • Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other supporting communication facilities (such as base stations, etc.). Therefore, the topology of an Ad-hoc network frequently changes due to the movement of mobile host, which nay lead to sudden packet loss. Recently, the large amount of research has focused on the routing protocols needed in such an environment. In this paper, TCP Reno, Sack, and Tahoe versions are analysed using DSR protocol which is the representative On-Demand routing protocol in Ad-hoc wireless network. As the result of this simulation, we know that TCP Reno relatively has higher throughput than that of Sack and Tahoe, and TCP Reno has more stable performance than that of TCP Tahoe and Sack, regardless of the speed of mobile node and the size of topology.

Geographic and Energy Aware Geocasting in Ad-Hoc Networks (Ad-Hoc 네트워크에서 위치와 에너지를 고려한 지오캐스팅 알고리즘)

  • Lee Ju-Young
    • Journal of Internet Computing and Services
    • /
    • v.5 no.2
    • /
    • pp.75-84
    • /
    • 2004
  • Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

  • PDF

Price-based Resource Allocation for Virtualized Cognitive Radio Networks

  • Li, Qun;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4748-4765
    • /
    • 2016
  • We consider a virtualized cognitive radio (CR) network, where multiple virtual network operators (VNOs) who own different virtual cognitive base stations (VCBSs) share the same physical CBS (PCBS) which is owned by an infrastructure provider (InP), sharing the spectrum with the primary user (PU). The uplink scenario is considered where the secondary users (SUs) transmit to the VCBSs. The PU is protected by constraining the interference power from the SUs. Such constraint is applied by the InP through pricing the interference. A Stackelberg game is formulated to jointly maximize the revenue of the InP and the individual utilities of the VNOs, and then the Stackelberg equilibrium is investigated. Specifically, the optimal interference price and channel allocation for the VNOs to maximize the revenue of the InP and the optimal power allocation for the SUs to maximize the individual utilities of the VNOs are derived. In addition, a low‐complexity ±‐optimal solution is also proposed for obtaining the interference price and channel allocation for the VNOs. Simulations are provided to verify the proposed strategies. It is shown that the proposed strategies are effective in resource allocation and the ±‐optimal strategy achieves practically the same performance as the optimal strategy can achieve. It is also shown that the InP will not benefit from a large interference power limit, and selecting VNOs with higher unit rate utility gain to share the resources of the InP is beneficial to both the InP and the VNOs.

Evaluation of Accuracy and Effectiveness of Real-Time Kinematic GPS Surveying Technology Using Carrier Phase Observations (반송파 위상관측을 이용한 실시간 Kinematic GPS 측량기법의 정확도와 효용성 평가)

  • 이진덕;정한상
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.17 no.3
    • /
    • pp.301-309
    • /
    • 1999
  • Real-time kinematic (RTK) GPS surveying which allows centimeter level accuracy of three-dimensional coordinates without post-processing has become recognized as a major advance in GPS technology. Employing On-The-Fly initialization technique, the RTK system can escape from cycle slip problems that have affected as a main obstacle factor in traditional kinematic and static approaches. The objective of this research was to evaluate accuracy and effectiveness of the RTK-GPS surveying. First, the continuous RTK observation of a base line was conducted for the purpose of finding out the repeatability of the RTK surveying and the results which were then compared against results from static surveying showed RMS errors of $\pm{3mm}\;and\;\pm{13mm}$ for their respective horizontal and vertical components. On a test network of 30 stations covering the small area, the results of RTK testing were compared against those from not only post-processing kinematic and rapid-static surveyings but conventional surveyings and also the efficiency of RTK were analyzed. In addition, geoid heights which were derived by combination of GPS and spirit leveling about all of the points within the network were compared against those derived by the PNU95 and EGM96 models respectively.

  • PDF

Survey of Perkinsus olseni infection in Manila clam, Ruditapes philippinarum in 2009 on the west and south coast of Korea using PCR technique (PCR 기법을 이용한 2009년 우리나라 서해안과 남해안 바지락, Ruditapes philippinarum의 Perkinsus olseni 감염에 관한 보고)

  • Lee, Nam-Sil;Hwang, Jee-Youn;Choi, Dong-Lim;Park, Myoung-Ae
    • Journal of fish pathology
    • /
    • v.23 no.2
    • /
    • pp.145-153
    • /
    • 2010
  • Prevalence of a protozoan parasite Perkinsus olseni in Manila clam Ruditapes philippinarum was surveyed from July to December 2009 on the west and south coast of Korea. P. olseni infection was diagnosed using two primer sets, P.olseni NTS Forward/P.olseni NTS Reverse set and PolsITS-140F/PolsITS-600R set in polymerase chain reaction(PCR). The results using PolsITS-140F and PolsITS-600R primer set was retained up to 60% at all stations from July to December, except for Padori. Especially, Goheung showed 100% prevalence from October to December. The results about comparison of the 4 station's DNA sequences which were analyzed from PCR products(457bp) using PolsITS-140F and PolsITS-600R primer set, there were only 2base differences at Sunjedo.