• Title/Summary/Keyword: network node

Search Result 4,033, Processing Time 0.038 seconds

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.

Interpretation and Statistical Analysis of Ethereum Node Discovery Protocol (이더리움 노드 탐색 프로토콜 해석 및 통계 분석)

  • Kim, Jungyeon;Ju, Hongteak
    • KNOM Review
    • /
    • v.24 no.2
    • /
    • pp.48-55
    • /
    • 2021
  • Ethereum is an open software platform based on blockchain technology that enables the construction and distribution of distributed applications. Ethereum uses a fully distributed connection method in which all participating nodes participate in the network with equal authority and rights. Ethereum networks use Kademlia-based node discovery protocols to retrieve and store node information. Ethereum is striving to stabilize the entire network topology by implementing node discovery protocols, but systems for monitoring are insufficient. This paper develops a WireShark dissector that can receive packet information in the Ethereum node discovery process and provides network packet measurement results. It can be used as basic data for the research on network performance improvement and vulnerability by analyzing the Ethereum node discovery process.

A Load Balancing Method Using Mesh Network Structure in the Grid Database (그리드 데이터베이스에서 메쉬 연결구조를 이용한 부하 분산)

  • Lee, Soon-Jo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.5
    • /
    • pp.97-104
    • /
    • 2010
  • In this paper, mesh network structure is applied to solve the load balancing problems in the Grid database. Data of the Grid database is replicated to several node for enhanced performance. Therefore, load balancing for user's query is selected node that evaluated workload in it. Existing researches are using passive load balancing method that selected another node after then node overflowed workload. It is inefficient to be applied to Gird database that has a number of node and user's queries almost changes dynamically. The proposed method connected each node which includes the same data through mesh network structure. When user's query occurs, it select node that has the lowest workload. The performance evaluation shows that proposed method performs better than the existing methods.

A Study on Hierarchical Communication Method for Energy Efficiency in Sensor Network Environment (센서 네트워크 환경에서 에너지 효율을 위한 계층적 통신 기법에 관한 연구)

  • Son, Min-Young;Kim, Young-Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.8
    • /
    • pp.889-897
    • /
    • 2014
  • With the development of wireless communication and sensor technology, sensor network applications in various fields have been applied. To minimize the power consumption of sensors in sensor network is one of the important factors in oder to extend the system life. The power consumption of each sensor within sensor network can be different depending on the communication method between head(sink) node and its node. In this paper, we propose a new hierarchical communication method to minimize the power consumption of each sensor. The proposed method divides the area of sensor network into four areas using divide-and-conquer method and selects the nearest node to head node in each area as a child node of the node. Next the hierarchical tree in the same way is constructed recursively until each area is no longer divided. Each sensor can communicate to head node using this hierarchical tree. The proposed results were compared with the previous methods through simulation, and showed excellent results in the energy efficiency of sensor network.

Base Station Assisted Optimization of Hierarchical Routing Protocol in Wireless Sensor Network (WSN 에서 베이스스테이션을 이용한 계층적 라우팅 프로토콜 최적화)

  • Kusdaryono, Aries;Lee, Kyoung-Oh
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.564-567
    • /
    • 2011
  • Preserving energy of sensor node in wireless sensor network is an effort to prolong the lifetime of network. Energy of sensor node is very crucial because battery powered and irreplaceable. Energy conservation of sensor node is an effort to reduce energy consumption in order to preserve resource for network lifetime. It can be achieved through efficient energy usage by reducing consumption of energy or decrease energy usage while achieving a similar outcome. In this paper, we propose optimization of energy efficient base station assisted hierarchical routing protocol in wireless sensor network, named BSAH, which use base station to controlled overhead of sensor node and create clustering to distribute energy dissipation and increase energy efficiency of all sensor node. Main idea of BSAH is based on the concept of BeamStar, which divide sensor node into group by base station uses directional antenna and maximize the computation energy in base station to reduce computational energy in sensor node for conservation of network lifetime. The performance of BSAH compared to PEGASIS and CHIRON based of hierarchical routing protocol. The simulation results show that BSAH achieve 25% and 30% of improvement on network lifetime.

Power-Aware Dynamic Source Routing in Wireless Ad-hoc Networks (무선 애드혹 망에서의 전력 인식 동적 소스 라우팅)

  • 정혜영;신광욱;임근휘;이승학;윤현수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.519-531
    • /
    • 2004
  • Ad-hoc networks are temporary wireless systems composed of mobile nodes without any fixed infrastructure. The life time of each node in the ad-hoc network significantly affects the life time of whole ad-hoc network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all mobile nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Power-Aware Dynamic Source Routing (PADSR) which selects the best path to make the life time of the network be longer. In PADSR, when a source node finds a path to the destination node, it selects the best path that makes nodes in the network live evenly long. To find the best path, PADSR considers the consumption of transmission energy and residual battery capacity of nodes upon the path. Consequently the network lives longer if we use PADSR.

A Message Broadcast Scheme using Contention Window in Vehicular Ad-hoc Network (차량 애드혹 네트워크에서 경쟁윈도우를 이용한 메시지 브로드캐스트 기법)

  • Kim, Tae-Hwan;Hong, Won-Kee;Kim, Hie-Cheol
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.423-434
    • /
    • 2007
  • Vehicular ad-hoc network (VANET), a kind of mobile ad-hoc network (MANET), is a key technology for building intelligent transportation system (ITS). VANET is automatically and temporarily established through vehicle-to-vehicle communication without network infrastructure. It has the characteristics that frequent changes of network topology and node density are occurred and messages are disseminated through several relay nodes in the network. Due to frequent change of network topology and node density, however, VANET requires an effective relay node selection scheme to disseminate messages through the multi-hop broadcast. In this paper, we propose a contention window based multi-hop broadcast scheme for VANET. Each node has an optimized contention window and competes with each other for a relay node. The experimental results show that the proposed scheme has a better performance than the distance-based deterministic broadcast scheme in terms of message propagation delay and network traffic.

The Proposal and Implementation of Wireless Smart Sensor Node and NCAP System based on the IEEE 1451 (IEEE 1451 기반의 Wireless Smart Sensor Node와 NCAP 시스템의 제안과 구현)

  • Heo, Jung-Il;Lim, Su-Young;Seo, Jung-Ho;Kim, Woo-Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.5
    • /
    • pp.28-37
    • /
    • 2007
  • IEEE 1451 standard defines an interface for network and transducer. In this paper, We propose an architectural model to configure data acquisition system and wireless smart sensor node based on IEEE 1451 standard. Proposed Network Capable Application Processor(NCAP) supports the task of data acquisition and communication for smart sensor node and network. The NCAP is able to reconfigure without interrupting the functionality of the wireless sensor node and receives the critical information of transducer using the DB. Smart sensor node is able to provide the basic information of sensor in digital format. This digital format is called Transducer Electronic Data Sheet(TEDS), is capable of plug-and-play capability of wireless sensor node and the NCAP. We simplify the format of TEDS and template to apply to wireless network environment. information of TEDS and template is transmitted using ad-hoc routing. This study system uses body temperature sensor and ECG(Electrocardiogram) sensor to provide the medical information service. The format of template is selected by data sheet of the sensor and reconfigured to accurately describe the property of the sensor. DB of NCAP is possible to register new template and information of the property as developing new sensor.

A Range-based Relay Node Selecting Algorithm for Vehicular Ad-hoc Network (차량 애드혹 네트워크를 위한 영역 기반 릴레이 노드 선택 알고리즘)

  • Kim Tae-Hwan;Kim Hie-Cheol;Hong Won-Kee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.88-98
    • /
    • 2006
  • VANET has several different characteristics from MANET such as high mobility of nodes and frequent change of node density and network topology. Due to these characteristics, the network topology based protocol, often used in MANET, can not be applied to VANET. In this paper, we propose an emergency warning message broadcast protocol using range based relay node selecting algorithm which determines the minimal waiting time spent by a given node before rebroadcasting the received warning message. Because the time is randomly calculated based on the distance between sender node and receiver node, a node chosen as a relay node is assured to have a minimal waiting time, even though it is not located at the border of radio transmission range. The proposed emergency warning message broadcast protocol has low network traffic because it does not need to exchange control messages for message broadcasting. In addition, it can reduce End-to-End delay under circumstances of low node density and short transmission range in VANET.

Localization Algorithm for Wireless Sensor Networks Based on Modified Distance Estimation

  • Zhao, Liquan;Zhang, Kexin
    • Journal of Information Processing Systems
    • /
    • v.16 no.5
    • /
    • pp.1158-1168
    • /
    • 2020
  • The distance vector-hop wireless sensor node location method is one of typical range-free location methods. In distance vector-hop location method, if a wireless node A can directly communicate with wireless sensor network nodes B and C at its communication range, the hop count from wireless sensor nodes A to B is considered to be the same as that form wireless sensor nodes A to C. However, the real distance between wireless sensor nodes A and B may be dissimilar to that between wireless sensor nodes A and C. Therefore, there may be a discrepancy between the real distance and the estimated hop count distance, and this will affect wireless sensor node location error of distance vector-hop method. To overcome this problem, it proposes a wireless sensor network node location method by modifying the method of distance estimation in the distance vector-hop method. Firstly, we set three different communication powers for each node. Different hop counts correspond to different communication powers; and so this makes the corresponding relationship between the real distance and hop count more accurate, and also reduces the distance error between the real and estimated distance in wireless sensor network. Secondly, distance difference between the estimated distance between wireless sensor network anchor nodes and their corresponding real distance is computed. The average value of distance errors that is computed in the second step is used to modify the estimated distance from the wireless sensor network anchor node to the unknown sensor node. The improved node location method has smaller node location error than the distance vector-hop algorithm and other improved location methods, which is proved by simulations.