• 한국통신학회논문지
• /
• 제37B권9호
• /
• pp.778-786
• /
• 2012

무선 센서네트워크에서 사용하는 센서는 PIR, 이미지, 전자파 센서와 같은 지향성 센서와 진동, 음향, 자기센서와 같은 비지향성 센서로 구분할 수 있다. 지향성 센서의 성능을 보장하기 위해서는 센서의 설치위치는 가시선이 보장되는 곳에 설치가 되어야 하므로 노드 설치 위치는 지표면보다 높은 곳에 설치가 된다. 비지향성 센서 중 진동센서의 경우 센서 특성상 지표면에 설치가 되어야 한다. 이로 인해 지표면에 설치되는 비지향성 센서는 통신 장애로 인하여 네트워크 연결성 문제가 발생한다. 본 논문에서는 센서 고유특성을 살려서 커버리지를 최대화하고, 센서노드의 설치높이를 고려한 토폴로지 구성을 통해 네트워크 연결성을 최대화할 수 있는 방법을 제안한다. 제안하는 방법은 비지향성 센서는 지표면에 배치하고, 지향성 센서는 나무나 폴대와 같은 물체를 이용하여 지상에 설치하여 센서 커버리지를 최대화 한다. 그리고 설치높이가 낮은 센서노드는 설치높이가 높은 센서노드에 우선 연결하고, 설치높이가 높은 센서노드는 설치높이가 높은 센서노드와 연결하는 토폴로지를 구성하여 네트워크 연결성을 최대화하는 것이다. 시뮬레이션을 통해 제안방법을 검증하였으며, 커버리지와 네트워크 연결성에서 성능이 향상됨을 확인하였다.

• 전자통신동향분석
• /
• 제38권2호
• /
• pp.36-45
• /
• 2023

Segment routing (SR) is a source-based routing architecture in which a node steers packets adhering to service and topological requirements. Using programmable segments, SR enables end-to-end service connectivity to satisfy the network constraints of various services. SR can be implemented with both MPLS and IPv6 dataplanes. This survey presents the overview of SR for IPv6 dataplane (SRv6), network programming technologies based on SRv6, and the SR deployment status.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2178-2181
• /
• 2003

Active networks allow active node’s functionality to be extended dynamically through the use of active extensions. This flexible architecture facilitates the deployment of new network protocols and services. However, the active nature of a network also raises serious safety and security concerns. These concerns must be addressed before active networks can be deployed. In this paper we look at how we can control active extension’s access to different active nodes. Specifically, the authentication between active nodes is very important in this case. We use unique identity each node has for transferring access policies between active nodes. In this paper, we suggest a new method of transferring access policies performing authentications using identities between active nodes.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2009년도 정보통신설비 학술대회
• /
• pp.219-220
• /
• 2009

Many surveillance cameras used in security system are controlled with RS-485 communication protocol. In this situation, if RS-485 connection can be replaced with wireless connection using sensor network technology, an installation will become ease because of no wired connection and also a deployment of cameras will become free. This paper explains about the design of wireless sensor node and the necessary implementation for an operation, which can be replacing RS-485 connection for the development of CCTV control system based on wireless sensor network. The hardware platform of sensor node was designed based on MicaZ and the software was developed based on TinyOS. To control surveillance cameras deployed on wide area, the supporting of multi-hop also was implemented. With the result of experiment deploying on real environment, it was revealed that the controller could control cameras quickly with wireless.

• Journal of information and communication convergence engineering
• /
• 제16권1호
• /
• pp.6-11
• /
• 2018

It is important to find the random estimation points in wireless sensor network. A link quality indicator (LQI) is part of a network management service that is suitable for a ZigBee network and can be used for localization. The current quality of the received signal is referred as LQI. It is a technique to demodulate the received signal by accumulating the magnitude of the error between ideal constellations and the received signal. This proposed model accepts any number of random estimation point in the network and calculated its nearest anchor centroid node pair. Coordinates of the LQI sphere are calculated from the pair and are added iteratively to the initially estimated point. With the help of the LQI and weighted centroid localization, the proposed system finds the position of target node more accurately than the existing system by solving the problems related to higher error in terms of the distance and the deployment of nodes.

• Journal of Information Processing Systems
• /
• 제9권3호
• /
• pp.477-488
• /
• 2013

Wireless Sensor Networks (WSNs) are comprised of sensor nodes that forward data in the shape of packets inside a network. Proficient packet forwarding is a prerequisite in sensor networks since many tasks in the network, together with redundancy evaluation and localization, depend upon the methods of packet forwarding. With the motivation to develop a fault tolerant packet forwarding scheme a Self-Localized Packet Forwarding Algorithm (SLPFA) to control redundancy in WSNs is proposed in this paper. The proposed algorithm infuses the aspects of the gossip protocol for forwarding packets and the end to end performance of the proposed algorithm is evaluated for different values of node densities in the same deployment area by means of simulations.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.667-676
• /
• 2014

Connectivity is a crucial quality of service measure in wireless sensor networks. However, the network is always at risk of being split into several disconnected components owing to the sensor failures caused by various factors. To handle the connectivity problem, this paper introduces an in-advance mechanism to prevent network partitioning in the initial deployment phase. The approach is implemented in a distributed manner, and every node only needs to know local information of its 1-hop neighbors, which makes the approach scalable to large networks. The goal of the proposed mechanism is twofold. First, critical nodes are locally detected by the critical node detection (CND) algorithm based on the concept of maximal simplicial complex, and backups are arranged to tolerate their failures. Second, under a greedy rule, topological holes within the maximal simplicial complex as another potential risk to the network connectivity are patched step by step. Finally, we demonstrate the effectiveness of the proposed algorithm through simulation experiments.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.571-578
• /
• 1998

In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
• /
• pp.412-414
• /
• 2005

Because a sensor node must operate on a tiny battery, the goal to eliminate energy inefficiencies leads the current researchers excavating for new techniques to advocate. As sensor networks edge closer towards wide spread deployment, security issues become a central concern. So far much research has focused on making sensor networks feasible and useful, and has not concentrated much on security issues especially computationally inexpensive techniques. In this paper we introduce a simple scheme relying on one-way hash-functions that greatly enhances location privacy by changing traceable identifiers on every read getting by with only a single, unreliable message exchange. Thereby the scheme is safe from many threats like eavesdropping, message interception, spoofing, and replay attacks.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 춘계학술대회
• /
• pp.646-648
• /
• 2010

A Sensor Node in Wireless Sensor Network has very limited resources such as processing capability, memory capacity, battery power, and communication capability. When the communication between any two sensor nodes are required to be secured, the symmetric key cryptography technique is used for its advantage over public key cryptography in terms of requirement of less resources. Keys are pre-distributed to each sensor node from a set of keys called key pool before deployment of sensors nodes. Combinatorial design helps in a great way to determine the way keys are drawn from the key pool for distributing to individual sensor nodes. We study various deterministic key predistribution techniques that are based on combinatorial design.