• Title/Summary/Keyword: 노드간 거리 데이터

Search Result 97, Processing Time 0.025 seconds

Implementation of a Sensor Node with Convolutional Channel Coding Capability (컨벌루션 채널코딩 기능의 센서노드 구현)

  • Jin, Young Suk;Moon, Byung Hyun
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.1
    • /
    • pp.13-18
    • /
    • 2014
  • Sensor nodes are used for monitoring and collecting the environmental data via wireless sensor network. The wireless sensor network with various sensor nodes draws attention as a key technology in ubiquitous computing. Sensor nodes has very small memory capacity and limited power resource. Thus, it is essential to have energy efficient strategy for the sensor nodes. Since the sensor nodes are operating on the same frequency bands with ISM frequency bands, the interference by the devices operating on the ISM band degrades the quality of communication integrity. In this paper, the convolutional code is proposed instead of ARQ for the error control for the sensor network. The proposed convolutional code was implemented and the BER performance is measured. For the fixed transmitting powers of -19.2 dBm and -25dBm, the BER with various communication distances are measured. The packet loss rate and the retransmission rate are calculated from the measured BER. It is shown that the porposed method obtained about 9~12% and 12-19% reduction in retransmission rate for -19.2 dBm and -25 dBm respectively.

A Clustering Technique to Minimize Energy Consumption of Sensor networks by using Enhanced Genetic Algorithm (진보된 유전자 알고리즘 이용하여 센서 네트워크의 에너지 소모를 최소화하는 클러스터링 기법)

  • Seo, Hyun-Sik;Oh, Se-Jin;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.2
    • /
    • pp.27-37
    • /
    • 2009
  • Sensor nodes forming a sensor network have limited energy capacity such as small batteries and when these nodes are placed in a specific field, it is important to research minimizing sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Clustering has been in the limelight as one of efficient techniques to reduce sensor nodes' energy consumption in sensor networks. However, energy saving results can vary greatly depending on election of cluster heads, the number and size of clusters and the distance among the sensor nodes. /This research has an aim to find the optimal set of clusters which can reduce sensor nodes' energy consumption. We use a Genetic Algorithm(GA), a stochastic search technique used in computing, to find optimal solutions. GA performs searching through evolution processes to find optimal clusters in terms of energy efficiency. Our results show that GA is more efficient than LEACH which is a clustering algorithm without evolution processes. The two-dimensional GA (2D-GA) proposed in this research can perform more efficient gene evolution than one-dimensional GA(1D-GA)by giving unique location information to each node existing in chromosomes. As a result, the 2D-GA can find rapidly and effectively optimal clusters to maximize lifetime of the sensor networks.

A Study on the Changes of the Restaurant Industry Before and After COVID-19 Using BigData (빅데이터를 활용한 코로나 19 이전과 이후 외식산업의 변화에 관한 연구)

  • Ahn, Youn Ju
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.6
    • /
    • pp.787-793
    • /
    • 2022
  • After COVID-19, with the emergence of social distancing, non-face-to-face services, and home economics, visiting dining out is rapidly being replaced by non-face-to-face dining out. The purpose of this study is to find ways to create a safe dining culture centered on living quarantine in line with the changing trend of the restaurant industry after the outbreak of COVID-19, establish the direction of food culture improvement projects, and enhance the effectiveness of the project. This study used TEXTOM to collect and refine search frequency, perform TF-IDF analysis, and Ucinet6 programs to implement visualization using NetDraw from January 1, 2018 to October 31, 2019 and December 31, 2021, and identified the network between nodes of key keywords. Finally, clustering between them was performed through Concor analysis. As a result of the study, if you check the frequency of searches before and after COVID-19, it can be seen that the COVID-19 pandemic greatly affects the changes in the restaurant industry.

Energy-Efficient Routing Protocol for Hybrid Ad Hoc Networks (하이브리드 애드 혹 네트워크에서의 에너지 효율성을 고려한 라우팅 알고리즘)

  • Park, Hye-Mee;Park, Kwang-Jin;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.133-140
    • /
    • 2007
  • Currently, as the requirement for high quality Internet access from anywhere at anytime is consistently increasing, the interconnection of pure ad hoc networks to fixed IP networks becomes increasingly important. Such integrated network, referred to as hybrid ad hoc networks, can be extended to many applications, including Sensor Networks, Home Networks, Telematics, and so on. We focus on some data communication problems of hybrid ad hoc networks, such as broadcasting and routing. In particular. power failure of mobile terminals is the most important factor since it affects the overall network lifetime. We propose an energy-efficient routing protocol based on clustering for hybrid ad hoc networks. By applying the index-based data broadcasting and selective tuning methods, the infra system performs the major operations related to clustering and routing on behalf of ad hoc nodes. The proposed scheme reduces power consumption as well as the cost of path discovery and maintenance, and the delay required to configure the route.

  • PDF

Realtime Media Streaming Technique Based on Adaptive Weight in Hybrid CDN/P2P Architecture

  • Lee, Jun Pyo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.3
    • /
    • pp.1-7
    • /
    • 2021
  • In this paper, optimized media data retrieval and transmission based on the Hybrid CDN/P2P architecture and selective storage through user's prediction of requestability enable seamless data transfer to users and reduction of unnecessary traffic. We also propose a new media management method to minimize the possibility of transmission delay and packet loss so that media can be utilized in real time. To this end, we construct each media into logical segments, continuously compute weights for each segment, and determine whether to store segment data based on the calculated weights. We also designate scattered computing nodes on the network as local groups by distance and ensure that storage space is efficiently shared and utilized within those groups. Experiments conducted to verify the efficiency of the proposed technique have shown that the proposed method yields a relatively good performance evaluation compared to the existing methods, which can enable both initial latency reduction and seamless transmission.

A TDMA-based Relay Protocol for Voice Communication on a Small Group (소규모 그룹에서의 음성 통신을 위한 TDMA 기반의 릴레이 프로토콜)

  • Hwang, Sangho;Park, Chang-Hyeon;Ahn, Byoungchul
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.1
    • /
    • pp.259-266
    • /
    • 2013
  • Since the wireless communications have a limited transmission, the devices just around a master node can exchange data. Though Bluetooth and Zigbee support ad hoc, they are not appropriate for real-time voice communications. In this paper, we present a TDMA-based relay protocol for several users to communicate simultaneously. The proposed protocol can relay data or voice to other nodes in real-time by the multi-hop transmission method using TDMA. And the proposed protocol improves the network performance by allocating different frequencies to the slaves depending on the routing path scheduled by the routing table. NS-2 simulation shows that the performance of the proposed protocol is good in terms of the transmission delay and pecket loss probability in the real-time voice transmission.

Channel Assignment and Routing using Traffic Profiles in Wireless Mesh Networks (무선 메쉬 네트워크에서 트래픽 프로파일을 고려하는 채널 할당 및 라우팅)

  • Park, Sook-Young;Lee, Sang-Kyu
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.5
    • /
    • pp.374-385
    • /
    • 2010
  • Wireless mesh networks can be deployed for various networks from home networking to last-mile broadband Internet access. Wireless mesh networks are composed of mesh routers and mesh clients. In these networks, static nodes form a multi-hop backbone of a large wireless access network that provides connectivity to end-users' mobile terminals. The network nodes cooperate with each other to relay data traffic to its destinations. In order to increase connectivity and better performance, researchers are getting interested in multi-channel and multi-interface wireless mesh networks. In these networks, non-overlapping multiple frequency channels are used simultaneously to increase the aggregate bandwidth available to end-users. Recently, researches have focused on finding suitable channel assignments for wireless network interfaces, equiped in a mesh node, together with efficient routing to improve overall system throughput in wireless mesh networks. This goal can be achieved by minimize channel interference. Less interference among using channels in a network guarantees more aggregated channel capacity and better connectivity of the networks. In this thesis, we propose interference aware channel assignment and routing algorithms for multi-channel multi-hop wireless mesh networks. We propose Channel Assignment and Routing algorithms using Traffic Profiles(CARTP) and Routing algorithms allowing detour routing(CARTP+2). Finally, we evaluate the performance of proposed algorithms in comparison to results from previous methods using ns-2 simulations. The simulation results show that our proposed algorithms can enhance the overall network performance in wireless mesh networks.

A Fog-based IoT Service Interoperability System using Blockchain in Cloud Environment (클라우드 환경에서 블록체인을 이용한 포그 기반 IoT 서비스 상호운용 시스템)

  • Kim, Mi Sun;Park, Yong Suk;Seo, Jae Hyun
    • Smart Media Journal
    • /
    • v.11 no.3
    • /
    • pp.39-53
    • /
    • 2022
  • Cloud of Things (CoT) can provide IoT applications with unlimited storage functions and processing power supported by cloud services. However, in a centralized cloud of things, it can create a single point of failure that can lead to bottleneck problems, outages of the CoT network. In this paper, to solve the problem of centralized cloud of things and interoperate between different service domains, we propose an IoT service interoperability system using distributed fog computing and blockchain technology. Distributed fog is used to provide real-time data processing and services in fog systems located at a geographically close distance to IoT devices, and to enable service interoperability between each fog using smart contracts and distributed ledgers of the blockchain. The proposed system provides services within a region close to the distributed fog entrusted with the service from the cloud, and it is possible to access the services of other fogs without going through the cloud even between fogs. In addition, by sharing a service right token issuance information between the cloud and fog nodes using a blockchain network, the integrity of the token can be guaranteed and reliable service interoperability between fog nodes can be performed.

Performance Comparison of Brain Wave Transmission Network Protocol using Multi-Robot Communication Network of Medical Center (의료센터의 다중로봇통신망을 이용한 뇌파전송망 프로토콜의 성능비교)

  • Jo, Jun-Mo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.1
    • /
    • pp.40-47
    • /
    • 2013
  • To verify the condition of patients moving in the medical center like hospital needs to be consider the various wireless communication network protocols and network components. Wireless communication protocols such as the 802.11a, 802.11g, and direct sequence has their specific characteristics, and the various components such as the number of mobile nodes or the distance of transmission range could affects the performance of the network. Especially, the network topologies are considered the characteristic of the brain wave(EEG) since the condition of patient is detected from it. Therefore, in this paper, various wireless communication networks are designed and simulated with Opnet simulator, then evaluated the performance to verify the wireless network that transmits the patient's EEG data efficiently. Overall, the 802.11g had the best performance for the wireless network environment that transmits the EEG data. However, there were minor difference on the performance result depends on the components of the topologies.

An Improved CBRP using Secondary Header in Ad-Hoc network (Ad-Hoc 네트워크에서 보조헤더를 이용한 개선된 클러스터 기반의 라우팅 프로토콜)

  • Hur, Tai-Sung
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.31-38
    • /
    • 2008
  • Ad-Hoc network is a network architecture which has no backbone network and is deployed temporarily and rapidly in emergency or war without fixed mobile infrastructures. All communications between network entities are carried in ad-hoc networks over the wireless medium. Due to the radio communications being extremely vulnerable to propagation impairments, connectivity between network nodes is not guaranteed. Therefore, many new algorithms have been studied recently. This study proposes the secondary header approach to the cluster based routing protocol (CBRP). The primary header becomes abnormal status so that the primary header can not participate in the communications between network entities, the secondary header immediately replaces the primary header without selecting process of the new primary header. This improves the routing interruption problem that occurs when a header is moving out from a cluster or in the abnormal status. The performances of proposed algorithm ACBRP(Advanced Cluster Based Routing Protocol) are compared with CBRP. The cost of the primary header reelection of ACBRP is simulated. And results are presented in order to show the effectiveness of the algorithm.

  • PDF