• Title/Summary/Keyword: network node

Search Result 4,033, Processing Time 0.022 seconds

Design and Implementation of an Electrocardiogram Measurement System Using Sensor Network (센서네트워크를 이용한 심전도 측정시스템의 설계 및 구현)

  • Kim, Jeong-Won
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.186-194
    • /
    • 2008
  • This paper has implemented a ubiquitous healthcare system that can measure and check the electrocardiogram of a human body in anytime and anywhere. The implemented prototype is composed of electrocardiogram measurement terminal, data gathering base node, and medical information server. The implemented node constructs a sensor network using the Zigbee protocol and the TinyOS is installed on each node. The data gathering base node is linux-based node that can transfer sensed medial data through wireless LAN. And, the medical information server stores the processed medical data and can promptly notify the urgent status to the connected medical team. Through experiment, we confirmed the possibility of ubiquitous healthcare system based on sensor network using the Zigbee.

Design of a set of One-to-Many Node-Disjoint and Nearly Shortest Paths on Recursive Circulant Networks

  • Chung, Ilyong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.7
    • /
    • pp.897-904
    • /
    • 2013
  • The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

An Efficient Routing Protocol for Mobile Sinks in Sensor Networks (센서 네트워크에서 모바일 싱크를 위한 효율적인 라우팅 기법)

  • Wu, Mary
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.4
    • /
    • pp.640-648
    • /
    • 2017
  • Sensors have limited resources in sensor networks, so efficient use of energy is important. In order to use the energy of the sensor node efficiently, researches applying mobile sink to the sensor network have been actively carried out. The sink node moves the sensor network, collects data from each sensor node, which spread the energy concentrated around the sink node, thereby extending the entire life cycle of the network. But, when the sink node moves, it requires a reset of the data transmission path, which causes a lot of control messages and delays. In this paper, we propose a CMS(Cluster-based Mobile Sink) method to support the movement of mobile sink in a cluster sensor environment. The proposed scheme minimizes an amount of control messages without resetting the routing paths of entire sensor networks by supporting the sink mobility path using the neighbor cluster list. And, it simplifies the routing path setup process by setting a single hop path between clusters without a gateway. The experiment results show that the proposed scheme has superior energy efficiency in processing and network structure, compared with existing clustering and mesh routing protocols.

Analysis of DDoS Prevention Algorithm in Mobile Ad-hoc Network (MANET 환경에서의 DDoS 공격방지 알고리즘 분석)

  • Kim, Dong-Chul
    • Convergence Security Journal
    • /
    • v.13 no.1
    • /
    • pp.11-17
    • /
    • 2013
  • In this paper, the information security requirements in the mobile ad-hoc network(MANET) are presented, and the algorithm to establish the protection node(gateway) is proposed to prevent the distributed denial of service(DDoS). The information security technology and security threats in the MANET are presented, and protection node is decided to minimize the total cost through the sending nodes and receiving nodes by way of protection node. To set up the protection node, the minimization algorithms of maximum cost and the average cost between the protection node and receiving nodes are compared with the optimal solutions, in which optimal solution is found out by all enumeration method. From the results, the total cost between the sending and receiving nodes is minimized under the average cost minimization algorithm rather than the using of the maximum cost.

Construction of Wireless Sensor Network for Intelligent Home (지능형 홈을 위한 무선 센서 네트워크 구성)

  • Whang Se-Hee;Jang In-Hun;Sim Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.15 no.6
    • /
    • pp.695-700
    • /
    • 2005
  • In the sensor network, a lot of sensor nodes are scattered sparsely and organizes a united communication network between each node. After that, environmental information around each sensor node are gathered and analyzed. Because each node operates under resource constraint, the efficiency and hardware specification of a node should be maximized. There exist technical constraints until now but recent technical progress in IC fabrication and wireless network enables to construct a tiny embedded system, which has the properties of low cost, low power consumption, multi functions. Wireless sensor network becomes a modern research field with technical improvements, is studied in numerous laboratories, and is called as diverse different project names - Wireless Integrated Network Sensors (WINS), Mobile Ad hoc NETwork (MANET), Ubiquitous Sensor Network (USN). TinyOS is one of leading project and is widely used. In this paper, we suggest a sensor network, which uses TinyOS platforms and aims for context awareness in a home environment.

Intrusion detection agents on the wireless network design (무선네트워크 상에서의 침입탐지 에이전트 설계)

  • Yun, Dong Sic
    • Convergence Security Journal
    • /
    • v.13 no.1
    • /
    • pp.59-70
    • /
    • 2013
  • Along with the rapid development of the wireless network (Wireless Network) technology for secure wireless communications, security problems have emerged as an important issue. In order to operate the wireless network intrusion detection system detects the agent installed on each wireless node should be. Ad-hoc network structures scattered in the AP over a wireless network without the node is a structure that makes it possible to communicate to connect. Intrusion detection agent to be installed on the node, and the corresponding energy consumption occurs when the survival time is reduced. On a node that can monitor a lot of traffic in order to increase the effect of intrusion detection, an intrusion detection agent should be placed. Therefore, in this paper, by taking advantage of the structure of Ad-hoc wireless network, considering the maximum living time of the network, while at the same time, the effectiveness of intrusion detection and intrusion detection by proposing a plan for installing the agent. Also improve the system performance by reducing the network load on each network, a system designed for data aggregation to reduce data redundancy, network energy consumption by reducing.

Intelligent Clustering Mechanism for Efficient Energy Management in Sensor Network (센서 네트워크에서의 효율적 에너지 관리를 위한 지능형 클러스터링 기법)

  • Seo, Sung-Yun;Jung, Won-Soo;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.4
    • /
    • pp.40-48
    • /
    • 2007
  • MANET constructs a network that is free and independent between sensor nodes without infrastructure. Also, there are a lot of difficulties to manage data process, control etc.. back efficiently from change of topology by transfer of sensor node that compose network. Especially, because each sensor node must consider mobility certainly, problem about energy use happens. To solve these problem, mechanisms that compose cluster of cluster header and hierarchic structure between member were suggested. However, accompanies inefficient energy consumption because sensing power level of sensor node is fixed and brings energy imbalance of sensor network and shortening of survival time. In this paper, I suggested intelligent clustering mechanism for efficient energy management to solve these problem of existent Clustering mechanism. Proposed mechanism corresponds fast in network topology change by transfer of sensor node, and compares in existent mechanism in circumstance that require serial sensing and brings elevation survival time of sensor node.Please put the abstract of paper here.

Speed Optimized Implementation of HUMMINGBIRD Cryptography for Sensor Network

  • Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.6
    • /
    • pp.683-688
    • /
    • 2011
  • The wireless sensor network (WSN) is well known for an enabling technology for the ubiquitous environment such as real-time surveillance system, habitat monitoring, home automation and healthcare applications. However, the WSN featuring wireless communication through air, a resource constraints device and irregular network topology, is threatened by malicious nodes such as eavesdropping, forgery, illegal modification or denial of services. For this reason, security in the WSN is key factor for utilizing the sensor network into the commercial way. There is a series of symmetric cryptography proposed by laboratory or industry for a long time. Among of them, recently proposed HUMMINGBIRD algorithm, motivated by the design of the well-known Enigma machine, is much more suitable to resource constrained devices, including smart card, sensor node and RFID tags in terms of computational complexity and block size. It also provides resistance to the most common attacks such as linear and differential cryptanalysis. In this paper, we implements ultra-lightweight cryptography, HUMMINGBIRD algorithm into the resource constrained device, sensor node as a perfectly customized design of sensor node.

The Design of Active Sensor Language on Active Network and Implementation of Its Interpreter (능동네트워크 상의 능동센서 언어 설계 및 인터프리터 구현)

  • 양윤심;배철성;정민수;이영석
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1245-1255
    • /
    • 2003
  • Request for network becomes complicated gradually and network traffic is increasing, To overcome this situation, the structure of network node should be changed to accept new service quickly and economically by executing program code in node itself. Active Network's research can use net resources more properly because of executing program within node itself. In this paper, we design a programming language, namely ASL, for Active Sensor to describe function and behavior of active sensor. We also design and implement the interpreter for proposed ASL.

  • PDF

The Relation of CLR and Blocking Probability for CBR Traffic in the Wireless ATM Access Network

  • Lee, Ha-Cheol;Lee, Byung-Seub
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1158-1163
    • /
    • 2002
  • In this paper it is focused on the relation between CLR (Cell Loss Ratio) and blocking probability, GoS(Grade of Services) parameters in the wireless ATM (Asynchronous Transfer Mode) access network which consists of access node and wireless channel. Traffic model of wireless ATM access network is based on the cell scale, burst scale and call connection level. The CLR equation due to buffer overflow for wireless access node is derived for CBR (Constant Bit Rate) traffic. The CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived. The relation between access network CLR and blocking probability is analyzed for CBR traffic.