• Title/Summary/Keyword: wireless data broadcasting

Search Result 291, Processing Time 0.023 seconds

A Study on the Effect of Redundant Transmission and Interleaving for WLAN Internet Local Broadcasting (무선랜 인터넷 지역 방송에서 복수전송과 인터리빙 효과 연구)

  • Oh, Jongtaek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.43-48
    • /
    • 2012
  • In As the proliferation of wireless LAN and smart devices like smart phone, the importance of the wireless Internet local broadcasting service is increasing. In order to provide broadcasting data for the multiple devices, one-way roadcasting technology which could not support re-transmission, should be used and the receiving frame error is major problem. Furthermore unlicense devices cause interference to the receiver, burst frame error tends to be happened. In this paper, new method to overcome the burst and random frame error is proposed and the effect is analyzed.

A Flooding Scheme Based on Packet Reception Counts for Ad Hoc Networks (애드혹 네트워크에서 패킷 수신 횟수에 기반한 확률적 플러딩 알고리즘)

  • Song, Tae-Kyu;Kang, Jeong-Jin;Ahn, Hyun-Sik
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.197-203
    • /
    • 2011
  • Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

Performance Evaluation of WiMedia UWB MAC Protocol Algorithm Supporting Mixed Video and Shipboard Control Data Traffic

  • Jeon, Dong-Keun;Lee, Yeonwoo
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.53-63
    • /
    • 2016
  • This paper applies WiMedia UWB network into a wireless ship area network (WSAN) so as to support high-quality multimedia services on board and reliable instrument control information as well, since the need for mixed high-quality video traffic and shipboard control data traffic is essential for a high-cost valued digital ship. Thus, in this paper, prioritized contention access (PCA) and distributed reservation protocol (DRP) based on WiMedia UWB (ECMA-368) MAC protocols are combined and proposed to such mixed traffic environment, by varying the portions of superframe according to traffic type. It is shown that the proposed WiMedia UWB MAC protocol can provide reliable mixed video and shipboard control data traffic as well.

A Method to Customize Cluster Member Nodes for Energy-Efficiency in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율을 위한 클러스터 멤버 노드 설정 방법)

  • Nam, Chooon-Sung;Jang, Kyung-Soo;Shin, Dong-Ryeol
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.15-21
    • /
    • 2009
  • The goal of wireless sensor networks is to collect sensing data on specific region over wireless communication. Sink node gathers all local sensing data, processes and transmits them to users who use sensor networks. Generally, senor nodes are low-cost, low power devices with limited sensing, computation and wireless communication capabilities. And sensor network applies to multi-hop communication on large-scale network. As neighboring sensor nodes have similar data, clustering is more effective technique for 'data-aggregation'. In cluster formation technique based on multi-hop, it is necessary that the number of cluster member nodes should be distributed equally because of the balance of cluster formation To achieve this, we propose a method to customize cluster member nodes for energy-efficiency in wireless sensor networks.

  • PDF

The Routing Algorithm for Wireless Sensor Networks with Random Mobile Nodes

  • Yun, Dai Yeol;Jung, Kye-Dong;Lee, Jong-Yong
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.4
    • /
    • pp.38-43
    • /
    • 2017
  • Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

A Hierarchical Bitmap-based Spatial Index use k-Nearest Neighbor Query Processing on the Wireless Broadcast Environment (무선방송환경에서 계층적 비트맵 기반 공간 색인을 이용한 k-최근접 질의처리)

  • Song, Doo-Hee;Park, Kwang-Jin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.1
    • /
    • pp.203-209
    • /
    • 2012
  • Recently, k-nearest neighbors query methods based on wireless broadcasting environment are actively studied. The advantage of wireless broadcasting environment is the scalability that enables collective query processing for unspecified users connected to the server. However, in case existing k-NN query is applied in wireless broadcasting environment, there can be a disadvantage that backtracking may occur and consequently the query processing time is increasing. In this paper proposes a hierarchical bitmap-based spatial index in order to efficiently process the k-NN queries in wireless broadcasting environment. HBI reduces the bitmap size using such bitmap information and tree structure. As a result, reducing the broadcast cycle can reduce the client's tuning time and query processing time. In addition, since the locations of all the objects can be detected using bitmap information, it is possible to tune to necessary data selectively. For this paper, a test was conducted implementing HBI to k-NN query and the proposed technique was proved to be excellent by a performance evaluation.

Research on Efficiency of Interest-Data Handshaking in Wireless Content-Centric Networks (무선 Content-Centric Network에서의 Interest-Data Handshaking의 효율성에 대한 연구)

  • Lee, Seung-Jin;Park, Chan-Min;Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.81-86
    • /
    • 2014
  • Content Centric Network (CCN) is one of candidate technologies for the future Information Centric Networks. Recently, adopting CCN concept to wireless networks has extensively been studied. One of the well-known studies is Enhanced-Content-centric multiHop wireless NETwork (E-CHANET), which proposes efficient methods to deliver contents adopting CCN concept over wireless environment. In E-CHANET, in order for a provider to send a data packet, one interest packet from a consumer is required. In this paper, efficiency of data-interest handshaking in E-CHANET has been investigated. It is compared with a method using only one interest packet for all data packets through simulations. As results, while the handshaking provides transmission reliability, it increses content down load time too much.

High-performance Mobile Transmission Rate and Physical Layer Linear Error Correction Performance Verification (고성능 모바일의 전송율 향상을 위한 무선 통신 시스템의 물리계층 선형에러 성능 검증)

  • Chung, Myungsug;Lee, Jooyeoun;Jeong, Taikyeong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.3
    • /
    • pp.19-26
    • /
    • 2017
  • In this paper, a Linear Error Correction Code, Which is Applicable to Next Generation Wireless Communication System Technology, is Constructed Based on Performance Comparison and Transmission Based on the Premise of High Performance Mobile Rate Enhancement System. This is Because Data Rates are Becoming an Important Issue in Reed-Solomon Codes and Linear Error Code (LDPC) Used in the Physical Layer of Digital Communication and Broadcasting Technologies. Therefore, this paper Simulates the Performance of Reed - Solomon Code and LDPC Applied to Mobile Broadcasting DVB (Digital Video Broadcasting) System and Mobile Broadcasting in Digital Communication and Broadcasting, At this time, Technical Aspects of the Transmission Efficiency and Performance of the LDPC Replacing the Existing Reed-Solomon Code have been Verified from the Viewpoint of Efficiency.

A Novel encrypted XML streaming technique for indexing data on multiple channels

  • Vinay K. Ahlawat;Gaurav Agarwal;Vikas Goel;Kueh Lee Hui;Mangal Sain
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.7
    • /
    • pp.1840-1867
    • /
    • 2024
  • In this study, we focus on addressing the functional domain of research related to indexing XML data in wireless networks, emphasizing ensuring data confidentiality. The abstract outlines a novel indexing method designed for broadcasting encrypted XML data over wireless networks. The proposed technique involves two channels: one for indexing and another for transmitting the actual XML data. The method ensures data security by encrypting the XML stream, allowing mobile devices to access only authorized bits based on their access permissions. Despite an increase in data access time and device tuning time, the study concludes that the proposed indexing technique significantly enhances the security of transmitting XML data over mobile wireless networks.

A link control method using self relay signal in wireless sensor networks (무선 센서 네트워크에서 자기 전달 신호를 활용한 전송 제어 방법)

  • Kim, Seung-Cheon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.37-43
    • /
    • 2009
  • Reliability should be assured to support the stable ubiquitous sensor network services in wireless sensor networks. Data transmission reliability is the most important one in the reliability factors in USN. When we consider the wireless communication environment of sensor networks, data transmission reliability requires the performance improvement. For this, this paper introduces the method that can handle the reliability and the performance together. The proposed scheme uses the self relay signal between sensor nodes to deliver the ACK and the next data is scheduled to be sent on acceptance of this self relay signal. For the evaluation of the performance improvement, the analysis and the simulation have been done.

  • PDF