• Title/Summary/Keyword: Wireless Broadcast

Search Result 385, Processing Time 0.023 seconds

Design and Development of Framework for Local Heavy Rainfall Forecasting Service using Wireless Data Broadcasting (무선 데이터 방송을 이용한 국지성 폭우 예보 서비스 프레임워크의 설계와 구현)

  • Im, Seokjin;Choi, JinTak
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.223-228
    • /
    • 2015
  • Korean climate becoming increasingly subtropical by climate warming makes local heavy rainfall frequently. To avoid damages from the local heavy rainfall, we need a forecasting service for a great number of clients. However, there is not the framework for the service based on wireless data broadcasting yet. In this paper, we design and implement a service framework for local heavy rainfall forecasting using wireless data broadcast. The developed service framework has scalability that can adopt various data scheduling and indexing schemes. We show the efficiency of the proposed framework to forecast local heavy rainfall through a simulation study.

A Comparison of TDMA, Dirty Paper Coding, and Beamforming for Multiuser MIMO Relay Networks

  • Li, Jianing;Zhang, Jianhua;Zhang, Yu;Zhang, Ping
    • Journal of Communications and Networks
    • /
    • v.10 no.2
    • /
    • pp.186-193
    • /
    • 2008
  • A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.

A Distributed Indexing Scheme for Wireless Data Broadcasting of Health Information FHIR Resources (의료 정보 FHIR 리소스 무선 데이터 방송을 위한 분산 인덱싱 기법)

  • Im, Seokjin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.3
    • /
    • pp.23-28
    • /
    • 2017
  • FHIR, next-generation standard for health information exchange, allows to exchange health information fast and to provide various health services. In this paper, we propose an indexing scheme of FHIR resources for adopting the resources to wireless data broadcasting with a secure channel. That scheme keeps the information of users to support to download FHIR resources from the secure wireless broadcast channel and the information on the resources. Using the proposed index, massive users can download their desired FHIR resources with less energy in short time. With simulation studies, we show the proposed indexing scheme outperforms other scheme broadcasting FHIR resources.

PROPOSAL OF TRACKING LAN ANTENNA USING IMAGE SENSOR

  • Uranishi, Yuki;Ikeda, Sei;Shimada, Hideki;Manabe, Yoshitsugu;Chihara, Kunihiro
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.742-745
    • /
    • 2009
  • This paper proposes a wireless LAN antenna system that tracks an object automatically by using image-based tracking. The proposed system consists of a camera and a pan-tilt unit in addition to a directional wireless LAN antenna. The camera and the directional antenna are set in same direction and they are set on the pan-tilt unit. A target object which has a wireless LAN receiver is tracked by using images captured by the camera. And the directional antenna faces in same direction as the camera by the pan-tilt unit. Therefore, the directional antenna keeps pointing the receiver, and a transmitting efficiency is improved. A result of a fundamental experiment shows that a receiver attached to a flying airship was tracked by a prototype of the proposed antenna system. The airship flied about, and the proposed antenna system was set on a roof of a building. The experimental result indicates an effectiveness of the proposed system compared to the conventional directional LAN antenna.

  • PDF

NETWORK-ADAPTIVE ERROR CONTROL FOR VIDEO STREAMING OVER WIRELESS MULTI-HOP NETWORKS

  • Bae, Jung-Tae;Kim, Jong-Won
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.385-389
    • /
    • 2009
  • Multi-hop wireless mesh networks (WMNs) suffer from significant packet losses due to insufficient available bandwidth and high channel error probability. To conquer packet losses, end-to-end (E2E) error control schemes have been proposed. However, in WMNs, E2E error control schemes are not effective in adapting to the time-varying network condition due to large delay. Thus, in this paper, we propose a network-adaptive error control for video streaming over WMNs that flexibly operates E2E and hop-by-hop (HbH) error control according to network condition. Moreover, to provide lightweight support at intermediate nodes for HbH error control, we use path-partition-based adaptation. To verify the proposed scheme, we implement it and evaluate its transport performance through MPEG-2 video streaming over a real IEEE 802.11a-based WMN testbed.

  • PDF

Allowable Interference Criteria Between Digital FWSs (디지털 FWS간 허용 간섭 기준)

  • Lee, Ki-Hwan;Lee, Joo-Hwan;Suh, Kyoung-Whoan;Song, Ju-Bin
    • Journal of Broadcast Engineering
    • /
    • v.13 no.4
    • /
    • pp.479-487
    • /
    • 2008
  • The method to determine allowable interference criteria is required due to new digital FWSs(Fixed Wireless Systems) adding to allowable frequency bands, besides current FWSs and digital FWSs. In this paper, we suggested a method to define allowable interference between digital FWSs. Types of interference for FWS were defined and channel characteristics were analyzed. Allowable interference criteria were analyzed using the suggested method for M-ary QAM modulations, which is typical modulation technique of digital FWS.

A Hierarchical Sequential Index Scheme for Range Queries in Wireless Location-based Services (무선 위치기반서비스에서 영역질의처리를 위한 계층적 인덱스기법)

  • Park, Kwang-Jin
    • Journal of Internet Computing and Services
    • /
    • v.11 no.1
    • /
    • pp.15-20
    • /
    • 2010
  • In this paper, we propose a novel approach to reduce spatial query access latency and energy consumption by leveraging results from nearby peers in wireless broadcast environments. We propose a three-tier Hierarchical Location-Based Sequential access index, called HLBS, which provides selective tuning (pruning and searching entries) without pointers using a linear accessing structure based on the location of each data object. The HLBS saves search cost and index overhead, since the small index size with a sequential index structure results in low access latency overhead and facilitates efficient searches for sequential-access media (wireless channels with data broadcast). Comprehensive experiments illustrate that the proposed scheme is more efficient than the previous techniques in terms of energy consumption.

Neighbor Knowledge Exchange Reduction using Broadcast Packet in Wireless Ad hoc Networks (방송 패킷을 활용한 무선 애드혹 네트워크의 이웃 정보 전송절감)

  • Choi, Sun-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.7
    • /
    • pp.1308-1313
    • /
    • 2008
  • Neighbor knowledge in wireless ad hoc networks provides important functionality for a number of protocols. The neighbor knowledge is acquired via Hello packets. Hello packets are periodically broadcasted by the nodes which want to advertise their existence. Usage of periodic Hello packet, however, is a big burden on the wireless ad hoc networks. This paper deals with an approach where each node acquires neighbor knowledge by observing not only Hello packets but also broadcasting packets. Analysis and computer simulation results show that the method using broadcast packets offers significant improvement over the method using Hello packet only. When the required hello packet transmission interval and the average broadcasting interval are equal, the overhead reduction is about 42%.

An Efficient Adaptive Bitmap-based Selective Tuning Scheme for Spatial Queries in Broadcast Environments

  • Song, Doo-Hee;Park, Kwang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1862-1878
    • /
    • 2011
  • With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.