• Title/Summary/Keyword: Short Range Wireless Networks

Search Result 45, Processing Time 0.02 seconds

Study on Local Wireless Network Data Structure for Sludge Multimeter (슬러지 멀티미터를 위한 근거리무선네트워크 데이터구조 설계 연구)

  • Jung, Soonho;Kim, Younggi;Lee, Sijin;Lee, Sunghwa;Park, Taejun;Byun, Doogyoon;Cha, Jaesang
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.2
    • /
    • pp.96-100
    • /
    • 2014
  • Recently, the management system of wastewater treatment facility has magnified due to the stringent regulations for the protection of the environment, and a sewage treatment plant efficiency and research of the car development are activated in large facilities or industrial park. however, the existing sewerage disposal system and specific water quality monitoring network reliability for real-time transmission of this building is insufficient. In this paper, we proposed a local wireless network design for sludge multi meter data collection and control for measuring the concentration of the sludge efficiently. Also, the collected data over the local wireless network to transmitted to the central monitoring system and accumulate the data in real time to calculate statistics is possible to monitor the status of the sewage treatment facilities. The proposed system uses a short-range wireless networks of IEEE 802.15.4 and configures an IEEE 802.11 network which can monitor real-time status in central system. Also, we install a sludge multimeter and communication network in sewage treatment facilities and confirm the usefulness of the proposed technique by demonstrating its effectiveness.

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 Coexistence Mitigation Scheme in IEEE 802.15.4-based WBAN (IEEE 802.15.4 기반 WBAN의 공존 문제 완화 기법)

  • Choi, Jong-hyeon;Kim, Byoung-seon;Cho, Jin-sung
    • Journal of Internet Computing and Services
    • /
    • v.16 no.3
    • /
    • pp.1-11
    • /
    • 2015
  • WBAN(Wireless Body Area Network) operating around the human body aims at medical and non-medical service at the same time. and it is the short-range communication technology requiring low-power, various data rate and high reliability. Various studies is performing for IEEE 802.15.4, because IEEE 802.15.4 can provide high compatibility for operate WBAN among communication standard satisfiable these requirements. Meanwhile, in the case of coexisting many IEEE 802.15.4-based WBAN, signal interference and collision are the main cause that is decreasing data reliability. but IEEE 802.15.4 Standard does not consider about coexistence of many networks. so it needs improvement. In this paper, To solve about this problem, identify coexistence problem of IEEE 802.15.4-based WBAN by preliminary experiments. and propose a scheme to mitigate the reliability decrease at multiple coexistence WBAN. The proposed scheme can be classified in two steps. The first step is avoidance to collision on the CFP through improving data transmission. The second step is mitigation collision through converting channel access method. Proposed scheme is verified the performance by performing comparison experiment with Standard-based WBAN.

Designed and Development of Location Tracking System by The Short-Range Radio Frequency Relay Algorithm (근거리 RF중계알고리즘에 의한 구내 위치추적시스템 연구)

  • Park, Sang-Min;Lee, Gong;Lee, Sang-Keun
    • Convergence Security Journal
    • /
    • v.8 no.3
    • /
    • pp.73-81
    • /
    • 2008
  • We can find easily about researches or technical development that deal with grasping the location of an object with GPS(Global Positioning System) in order to use them as a useful information. Most researches or technical development on application of tracing have been developed for the purpose of tracing objects in broad area as physical distribution or transportation, but recently, there are many researches on tracing materials in premise area as a fork lift, carts, or the equipment of work. In general, a system that utilizes location information of objects needs data communication network to transmit location data and it ensures data communication network by using common networks(SK, LG, KFT) or wireless LAN. However these two methods need monthly payment for the rental fee or require considerable amount of investment for the early stage so it is difficult to use them merely for tracing premise subjects. This study was conducted to build a tracing system for premise area by local area RF relay algorithm with low cost applying RF relay algorithm to local area wireless communication(ZIGBEE, 424MHz, Bluetooth, 900MHz) system in order to supplement these demerits and included relay algorithm, RF locating information terminal, local area RF gab-fillers, a plan for collection server of locating information, and the way of realization as they are needed in this system. I consider that this study would be applicable with flexibility in the industry area that needs tracing solution within a specific area or needs ensuring data communication network, to transmit data in ubiquitous environment, by easier and more rapid way with lower cost.

  • PDF

Performance Analysis and Comparison of Stream Ciphers for Secure Sensor Networks (안전한 센서 네트워크를 위한 스트림 암호의 성능 비교 분석)

  • Yun, Min;Na, Hyoung-Jun;Lee, Mun-Kyu;Park, Kun-Soo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.5
    • /
    • pp.3-16
    • /
    • 2008
  • A Wireless Sensor Network (WSN for short) is a wireless network consisting of distributed small devices which are called sensor nodes or motes. Recently, there has been an extensive research on WSN and also on its security. For secure storage and secure transmission of the sensed information, sensor nodes should be equipped with cryptographic algorithms. Moreover, these algorithms should be efficiently implemented since sensor nodes are highly resource-constrained devices. There are already some existing algorithms applicable to sensor nodes, including public key ciphers such as TinyECC and standard block ciphers such as AES. Stream ciphers, however, are still to be analyzed, since they were only recently standardized in the eSTREAM project. In this paper, we implement over the MicaZ platform nine software-based stream ciphers out of the ten in the second and final phases of the eSTREAM project, and we evaluate their performance. Especially, we apply several optimization techniques to six ciphers including SOSEMANUK, Salsa20 and Rabbit, which have survived after the final phase of the eSTREAM project. We also present the implementation results of hardware-oriented stream ciphers and AES-CFB fur reference. According to our experiment, the encryption speeds of these software-based stream ciphers are in the range of 31-406Kbps, thus most of these ciphers are fairly acceptable fur sensor nodes. In particular, the survivors, SOSEMANUK, Salsa20 and Rabbit, show the throughputs of 406Kbps, 176Kbps and 121Kbps using 70KB, 14KB and 22KB of ROM and 2811B, 799B and 755B of RAM, respectively. From the viewpoint of encryption speed, the performances of these ciphers are much better than that of the software-based AES, which shows the speed of 106Kbps.