• Title/Summary/Keyword: wireless networks

Search Result 5,165, Processing Time 0.031 seconds

Efficient Coverage Guided IoT Firmware Fuzzing Technique Using Combined Emulation (복합 에뮬레이션을 이용한 효율적인 커버리지 가이드 IoT 펌웨어 퍼징 기법)

  • Kim, Hyun-Wook;Kim, Ju-Hwan;Yun, Joobeom
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.5
    • /
    • pp.847-857
    • /
    • 2020
  • As IoT equipment is commercialized, Bluetooth or wireless networks will be built into general living devices such as IP cameras, door locks, cars and TVs. Security for IoT equipment is becoming more important because IoT equipment shares a lot of information through the network and collects personal information and operates the system. In addition, web-based attacks and application attacks currently account for a significant portion of cyber threats, and security experts are analyzing the vulnerabilities of cyber attacks through manual analysis to secure them. However, since it is virtually impossible to analyze vulnerabilities with only manual analysis, researchers studying system security are currently working on automated vulnerability detection systems, and Firm-AFL, published recently in USENIX, proposed a system by conducting a study on fuzzing processing speed and efficiency using a coverage-based fuzzer. However, the existing tools were focused on the fuzzing processing speed of the firmware, and as a result, they did not find any vulnerability in various paths. In this paper, we propose IoTFirmFuzz, which finds more paths, resolves constraints, and discovers more crashes by strengthening the mutation process to find vulnerabilities in various paths not found in existing tools.

Performance Evaluation and Enhancement of Transmission Technique in Wireless Sensor Networks (무선센서네트워크에서 성능측정을 통한 전송방식의 문제점 분석 및 개선)

  • Lim, Dong-Sun;Lee, Joa-Hyoung;Jung, In-Bum
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1311-1321
    • /
    • 2010
  • Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In this paper, we propose SET(SendDoneEventbasedTransmission Technique)which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed. In SET, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission time. Therefore SET could provide high packet transmission rate given large amount of packets.

A RSU-Aided Resource Search and Cloud Construction Mechanism in VANETs (차량 네트워크에서 RSU를 이용한 리소스 검색 및 클라우드 구축 방안)

  • Lee, Yoonhyeong;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.3
    • /
    • pp.67-76
    • /
    • 2020
  • With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.

Development of a Prototype Patient Monitoring System with Module-Based Bedside Units and Central Stations: Overall Architecture and Specifications (모듈형 환자감시기와 중앙 환자감시기로 구성되는 환자감시시스템 시제품의 개발: 전체구조 및 사양)

  • Woo, E.J.;Park, S.H.;Jun, B.M.;Moon, C.W.;Lee, H.C.;Kim, S.T.;Kim, H.J.;Seo, J.J.;Chae, K.M.;Park, J.C.;Choi, K.H.;Lee, W.J.;Kim, K.S.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1996 no.05
    • /
    • pp.315-319
    • /
    • 1996
  • We have developed a prototype patient monitoring system including module-based bedside units, interbed network, and central stations. A bedside unit consists of a color monitor and a main CPU unit with peripherals including a module controller. It can also include up to 3 module cases and 21 different modules. In addition to the 3-channel recorder module, six different physiological parameters of ECG, respiration, invasive blood pressure, noninvasive blood pressure, body temperature, and arterial pulse oximetry with plethysmogaph are provided as parameter modules. Modules and a module controller communicate with up to 1Mbps data rate through an intrabed network based on RS-485 and HDLC protocol. Bedside units can display up to 12 channels of waveforms with any related numeric informations simultaneously. At the same time, it communicates with other bedside units and central stations through interbed network based on 10Mbps Ethernet and TCP/IP protocol. Software far bedside units and central stations fully utilizes gaphical user interface techniques and all functions are controlled by a rotate/push button on bedside unit and a mouse on central station. The entire system satisfies the requirements of AAMI and ANSI standards in terms of electrical safety and performances. In order to accommodate more advanced data management capabilities such as 24-hour full disclosure, we are developing a relational database server dedicated to the patient monitoring system. We are also developing a clinical workstation with which physicians can review and examine the data from patients through various kinds of computer networks far diagnosis and report generation. Portable bedside units with LCD display and wired or wireless data communication capability will be developed in the near future. New parameter modules including cardiac output, capnograph, and other gas analysis functions will be added.

  • PDF

Education Equipment for FPGA Design of Sensor-based IOT System (센서 기반의 IOT 시스템의 FPGA 설계 교육용 장비)

  • Cho, Byung-woo;Kim, Nam-young;Yu, Yun-seop
    • Journal of Practical Engineering Education
    • /
    • v.8 no.2
    • /
    • pp.111-120
    • /
    • 2016
  • Education equipment for field programmable gate array (FPGA) design of sensor-based IOT (Internet Of Thing) system is introduced. Because sensors have different interfaces, several types of interface controller on FPGA need. Using this equipment, several types of interface controller, which can control ADC (analog-to-digital converter) for analog sensor outputs and $I^2C$ (Inter-Integrated Circuit), SPI (Serial Peripheral Interface Bus), and GPIO (General-Purpose Input/Output) for digital sensor outputs, can be designed on FPGA. Image processing hardware using image sensors and display controller for real and image-processed images or videos can be design on FPGA chip. This equipment can design a SOC (System On Chip) consisting of a hard process core on Linux OS and a FPGA block for IOT system which can communicate with wire and wireless networks. Using the education equipment, an example of hardware design using image sensor and accelerometer is described, and an example of syllabus for "Digital system design using FPGA" course is introduced. Using the education equipment, students can develop the ability to design some hardware, and to train the ability for the creative capstone design through conceptual, partial-level, and detail designs.

A Crossover Node Discovery and Local Repair Mechanism for Reducing the Signaling Delay of Resource Reservation on HMIPv6 Networks (HMIPv6 네트워크에서 자원예약 시그널링 지연을 줄이기 위한 크로스오버 노드 발견 및 지역적 자원 갱신 방안)

  • Byun, Hae-Sun;Lee, Mee-Jeong
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.37-44
    • /
    • 2008
  • In order to minimize the signaling delay for a resource reservation on the new routing path after the handover of Mobile Node(MN) is completed, it is important to discover the crossover node where the old and new routing paths meet. With the 크로스오버 노드 being found, the signaling messages only need to be transferred on the changed part of the end-to-end path. The crossover node is generally discovered using the end-to-end Session ID(SID) of the established session between MN and Correspondent Node(CN). However, in the Hierarchical Mobile IPv6(HMIPv6) network, if the Mobile Anchor Point (MAP) reserves the resource by aggregate with the Home Agent(HA), the crossover node discovery cannot be performed in the general way since the aggregate SID that has established between the previous MAP and HA is different from the that of the current MAP and HA after MN's handover. In this paper, we propose a mechanism to discover the crossover node within the tunnel between the MAP and the HA in an HMIPv6 network, assuming that the Next Steps in Signaling(NSIS) is deployed for the resource reservation and the aggregate reservation is applied over the MAP and HA tunnel. The local repair required for the change of path is performed upon the crossover node discovery. The simulation results show that the proposed scheme reduces the signaling delay for the reservation and outperforms the existing scheme with respect to throughput during the handover.

A review on recent advances in water and wastewater treatment facilities management for earthquake disaster response (지진발생 대응을 위한 상하수도시설 관리 및 기술 현황에 대한 고찰)

  • Park, Jungsu;Choi, June-Seok;Kim, Keugtae;Yoon, Younghan;Park, Jae-Hyeoung
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.34 no.1
    • /
    • pp.9-21
    • /
    • 2020
  • The proper operation and safety management of water and wastewater treatment systems are essential for providing stable water service to the public. However, various natural disasters including floods, large storms, volcano eruptions and earthquakes threaten public water services by causing serious damage to water and wastewater treatment plants and pipeline systems. Korea is known as a country that is relatively safe from earthquakes, but the recent increase in the frequency of earthquakes has increased the need for a proper earthquake management system. Interest in research and the establishment of legal regulations has increased, especially since the large earthquake in Gyeongju in 2016. Currently, earthquakes in Korea are managed by legal regulations and guidelines integrated with other disasters such as floods and large storms. The legal system has long been controlled and relatively well managed, but technical research has made limited progress since it was considered in the past that Korea is safe from earthquake damage. Various technologies, including seismic design and earthquake forecasting, are required to minimize possible damages from earthquakes, so proper research is essential. This paper reviews the current state of technology development and legal management systems to prevent damages and restore water and wastewater treatment systems after earthquakes in Korea and other countries. High technologies such as unmanned aerial vehicles, wireless networks and real-time monitoring systems are already being applied to water and wastewater treatment processes, and to further establish the optimal system for earthquake response in water and wastewater treatment facilities, continuous research in connection with the Fourth Industrial Revolution, including information and communications technologies, is essential.

Performance Analysis of Siding Window based Stream High Utility Pattern Mining Methods (슬라이딩 윈도우 기반의 스트림 하이 유틸리티 패턴 마이닝 기법 성능분석)

  • Ryang, Heungmo;Yun, Unil
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.53-59
    • /
    • 2016
  • Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

A Cluster-Organizing Routing Algorithm by Diffusing Bitmap in Wireless Sensor Networks (무선 센서 네트워크에서의 비트맵 확산에 의한 클러스터 형성 라우팅 알고리즘)

  • Jung, Sangjoon;Chung, Younky
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.2
    • /
    • pp.269-277
    • /
    • 2007
  • Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

  • PDF

A Centralized Deployment Protocol with Sufficient Coverage and Connectivity Guarantee for WSNs (무선 센서 네트워크에서 유효 커버리지 및 접속성 보장을 위한 중앙 집중형 배치 프로토콜)

  • Kim, Hyun-Tae;Zhang, Gui-Ping;Kim, Hyoung-Jin;Joo, Young-Hoon;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.6
    • /
    • pp.683-690
    • /
    • 2006
  • Reducing power consumption to extend network lifetime is one of the most important challenges in designing wireless sensor networks. One promising approach to conserving system energy is to keep only a minimal number of sensors active and put others into low-powered sleep mode, while the active sensors can maintain a connected covet set for the target area. The problem of computing such minimum working sensor set is NP-hard. In this paper, a centralized Voronoi tessellation (CVT) based approximate algorithm is proposed to construct the near optimal cover set. When sensor's communication radius is at least twice of its sensing radius, the covet set is connected at the same time; In case of sensor's communication radius is smaller than twice of its sensing radius, a connection scheme is proposed to calculate the assistant nodes needed for constructing the connectivity of the cover set. Finally, the performance of the proposed algorithm is evaluated through theoretical analysis and extensive numerical experiments. Experimental results show that the proposed algorithm outperforms the greedy algorithm in terms of the runtime and the size of the constructed connected cover set.