• Title/Summary/Keyword: 통신링크

Search Result 1,998, Processing Time 0.025 seconds

Energy-Efficient Multipath Routing Protocol for Supporting Mobile Events in Wireless Sensor Networks (무선 센서 네트워크에서 이동 이벤트를 지원하기 위한 에너지 효율적인 멀티패스 라우팅 프로토콜)

  • Kim, Hoewon;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.455-462
    • /
    • 2016
  • Wireless sensor networks have been researched to gather data about events on sensor fields from sources at sinks. Multipath routing is one of attractive approaches to reliably send data against the problem of frequent breakages on paths from sources to sinks due to node and link failures. As mobile events such as humans, animals, and vehicles are considered, sources may be continuously generated according to the movement of the mobile event. Thus, mobile events provide new challenging issue in multipath routing. However, the research on multipath routing mainly focus on both efficient multipath construction from sources to static sinks and fast multipath reconstruction against path breakages. Accordingly, the previous multipath routing protocols request each source continuously generated by a mobile event to construct individual multipath from the source to sinks. This induces the increase of multipath construction cost in the previous protocols in proportion to the number of source. Therefore, we propose efficient multipath routing protocol for supporting continuous sources generated by mobile events. In the proposed protocol, new source efficiently reconstructs its multipath by exploiting the existing multipath of previous sources. To do this, the proposed protocol selects one among three reconstruction methods: a local reconstruction, a global partial one, and a global full one. For a selection decision, we provide an analytical energy consumption cost model that calculates the summation of both the multipath reconstruction cost and the data forwarding cost. Simulation results show that the proposed protocol has better performance than the previous protocol to provide multipath routing for mobile events.

Energy and Delay-Efficient Multipath Routing Protocol for Supporting Mobile Sink in Wireless Sensor Networks (무선 센서 네트워크에서 이동 싱크를 지원하기 위한 다중 경로 라우팅 프로토콜)

  • Lee, Hyun Kyu;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.12
    • /
    • pp.447-454
    • /
    • 2016
  • The research on multipath routing has been studied to solve the problem of frequent path breakages due to node and link failures and to enhance data delivery reliability in wireless sensor networks. In the multipath routing, mobile sinks such as soldiers in battle fields and rescuers in disaster areas bring about new challenge for handling their mobility. The sink mobility requests new multipath construction from sources to mobile sinks according to their movement path. Since mobile sinks have continuous mobility, the existing multipath can be exploited to efficiently reconstruct to new positions of mobile sinks. However, the previous protocols do not address this issue. Thus, we proposed an efficient multipath reconstruction protocol called LGMR for mobile sinks in wireless sensor networks. The LGMR address three multipath reconstruction methods based on movement types of mobile sinks: a single hop movement-based local multipath reconstruction, a multiple hop movement-based local multipath reconstruction, and a multiple hop movement-based global multipath reconstruction. Simulation results showed that the LGMR has better performance than the previous protocol in terms of energy consumption and data delivery delay.

An Enhanced WLAN MAC Protocol for Directional Broadcast (지향성 브로드캐스트를 위한 무선 LAN MAC 프로토콜)

  • Cha, Woo-Suk;Cho, Gi-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.1
    • /
    • pp.16-27
    • /
    • 2006
  • The wireless transmission medium inherently broadcasts a signal to all neighbor nodes in the transmission range. Existing asynchronous MAC protocols do not provide a concrete solution for reliable broadcast in link layer. This mainly comes from that an omni-directional broadcasting causes to reduce the network performance due to the explosive collisions and contentions. This paper proposes a reliable broadcast protocol in link taller based on directional antennas, named MDB(MAC protocol for Directional Broadcasting). This protocol makes use of DAST(Directional Antennas Statement Table) information and D-MACA(Directional Multiple Access and Collision Avoidance) scheme through 4-way handshake to resolve the many collision problem wit]1 omni-directional antenna. To analyze its performance, MDB protocol is compared with IEEE 802.11 DCF protocol [9] and the protocol 2 of reference [3], in terms of the success rate of broadcast and the collision rate. As a result of performance analysis through simulation, it was confirmed that the collision rate of the MDB protocol is lower than those of IEEE 802.11 and the protocol 2 of reference [3], and that the completion rate of broadcast of MDB protocol is higher than those of IEEE 802.11 and the protocol 2 of reference [3].

Different Heterogeneous IoT Data Management Techniques for IoT Cloud Environments (IoT 클라우드 환경을 위한 서로 다른 이기종의 IoT 데이터 관리 기법)

  • Cho, Sung-Nam;Jeong, Yoon-Su
    • Journal of Convergence for Information Technology
    • /
    • v.10 no.12
    • /
    • pp.15-21
    • /
    • 2020
  • Although IoT systems are used in a variety of heterogeneous environments as cloud environments develop, all IoT devices are not provided with reliable protocols and services. This paper proposes an IoT data management technique that can extend the IoT cloud environment to an n-layer multi-level structure so that information collected from different heterogeneous IoT devices can be efficiently sorted and processed. The proposed technique aims to classify and process IoT information by transmitting routing information and weight information through wireless data link data collected from heterogeneous IoT devices. The proposed technique not only delivers information classified from IoT devices to the corresponding routing path but also improves the efficiency of IoT data processing by assigning priority according to weight information. The IoT devices used in the proposed technique use each other's reliable protocols, and queries for other IoT devices locally through a local cloud composed of hierarchical structures have features that ensure scalability because they maintain a certain cost.y channels of IoT information in order to make the most of the multiple antenna technology.

A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces (장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법)

  • Lim, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.10
    • /
    • pp.1404-1415
    • /
    • 2022
  • The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

A development of DS/CDMA MODEM architecture and its implementation (DS/CDMA 모뎀 구조와 ASIC Chip Set 개발)

  • 김제우;박종현;김석중;심복태;이홍직
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.6
    • /
    • pp.1210-1230
    • /
    • 1997
  • In this paper, we suggest an architecture of DS/CDMA tranceiver composed of one pilot channel used as reference and multiple traffic channels. The pilot channel-an unmodulated PN code-is used as the reference signal for synchronization of PN code and data demondulation. The coherent demodulation architecture is also exploited for the reverse link as well as for the forward link. Here are the characteristics of the suggested DS/CDMA system. First, we suggest an interlaced quadrature spreading(IQS) method. In this method, the PN coe for I-phase 1st channel is used for Q-phase 2nd channels and the PN code for Q-phase 1st channel is used for I-phase 2nd channel, and so on-which is quite different from the eisting spreading schemes of DS/CDMA systems, such as IS-95 digital CDMA cellular or W-CDMA for PCS. By doing IQS spreading, we can drastically reduce the zero crossing rate of the RF signals. Second, we introduce an adaptive threshold setting for the synchronization of PN code, an initial acquistion method that uses a single PN code generator and reduces the acquistion time by a half compared the existing ones, and exploit the state machines to reduce the reacquistion time Third, various kinds of functions, such as automatic frequency control(AFC), automatic level control(ALC), bit-error-rate(BER) estimator, and spectral shaping for reducing the adjacent channel interference, are introduced to improve the system performance. Fourth, we designed and implemented the DS/CDMA MODEM to be used for variable transmission rate applications-from 16Kbps to 1.024Mbps. We developed and confirmed the DS/CDMA MODEM architecture through mathematical analysis and various kind of simulations. The ASIC design was done using VHDL coding and synthesis. To cope with several different kinds of applications, we developed transmitter and receiver ASICs separately. While a single transmitter or receiver ASC contains three channels (one for the pilot and the others for the traffic channels), by combining several transmitter ASICs, we can expand the number of channels up to 64. The ASICs are now under use for implementing a line-of-sight (LOS) radio equipment.

  • PDF

Performance Evaluation of a Dynamic Bandwidth Allocation Algorithm with providing the Fairness among Terminals for Ethernet PON Systems (단말에 대한 공정성을 고려한 이더넷 PON 시스템의 동적대역할당방법의 성능분석)

  • Park Ji-won;Yoon Chong-ho;Song Jae-yeon;Lim Se-youn;Kim Jin-hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.980-990
    • /
    • 2004
  • In this paper, we propose the dynamic bandwidth allocation algorithm for the IEEE802.3ah Ethernet Passive Optical Network(EPON) system to provide the fairness among terminals, and evaluate the delay-throughput performance by simulation. For the conventional EPON systems, an Optical Line Termination (OLT) schedules the upstream bandwidth for each Optical Network Unit (ONU), based on its buffer state. This scheme can provide a fair bandwidth allocation for each ONU. However, it has a critical problem that it does not guarantee the fair bandwidth among terminals which are connected to ONUs. For an example, we assume that the traffic from a greedy terminal increases at a time. Then, the buffer state of its ONU is instantly reported to the OLT, and finally the OW can get more bandwidth. As a result, the less bandwidth is allocated to the other ONUs, and thus the transfer delay of terminals connected to the ONUs gets inevitably increased. Noting that this unfairness problem exists in the conventional EPON systems, we propose a fair bandwidth allocation scheme by OLT with considering the buffer state of ONU as welt as the number of terminals connected it. For the performance evaluation, we develop the EPON simulation model with SIMULA simulation language. From the result of the throughput-delay performance and the dynamics of buffer state along time for each terminal and ONU, respectively, one can see that the proposed scheme can provide the fairness among not ONUs but terminals. Finally, it is worthwhile to note that the proposed scheme for the public EPON systems might be an attractive solution for providing the fairness among subscriber terminals.

Development of JPEG2000 Viewer for Mobile Image System (이동형 의료영상 장치를 위한 JPEG2000 영상 뷰어 개발)

  • 김새롬;정해조;강원석;이재훈;이상호;신성범;유선국;김희중
    • Progress in Medical Physics
    • /
    • v.14 no.2
    • /
    • pp.124-130
    • /
    • 2003
  • Currently, as a consequence of PACS (Picture Archiving Communication System) implementation many hospitals are replacing conventional film-type interpretations of diagnostic medical images with new digital-format interpretations that can also be saved, and retrieve However, the big limitation in PACS is considered to be the lack of mobility. The purpose of this study is to determine the optimal communication packet size. This was done by considering the terms occurred in the wireless communication. After encoding medical image using JPGE2000 image compression method, This method embodied auto-error correction technique preventing the loss of packets occurred during wireless communication. A PC class server, with capabilities to load, collect data, save images, and connect with other network, was installed. Image data were compressed using JPEG2000 algorithm which supports the capability of high energy density and compression ratio, to communicate through a wireless network. Image data were also transmitted in block units coeded by JPEG2000 to prevent the loss of the packets in a wireless network. When JPGE2000 image data were decoded in a PUA (Personal Digital Assistant), it was instantaneous for a MR (Magnetic Resonance) head image of 256${\times}$256 pixels, while it took approximately 5 seconds to decode a CR (Computed Radiography) chest image of 800${\times}$790 pixels. In the transmission of the image data using a CDMA 1X module (Code-Division Multiple Access 1st Generation), 256 byte/sec was considered a stable transmission rate, but packets were lost in the intervals at the transmission rate of 1Kbyte/sec. However, even with a transmission rate above 1 Kbyte/sec, packets were not lost in wireless LAN. Current PACS are not compatible with wireless networks. because it does not have an interface between wired and wireless. Thus, the mobile JPEG2000 image viewing system was developed in order to complement mobility-a limitation in PACS. Moreover, the weak-connections of the wireless network was enhanced by re-transmitting image data within a limitations The results of this study are expected to play an interface role between the current wired-networks PACS and the mobile devices.

  • PDF