• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권1호
• /
• pp.227-247
• /
• 2018

For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

• 한국통신학회논문지
• /
• 제30권6A호
• /
• pp.517-525
• /
• 2005

iSCSI(Internet Small Computer System Interface)는 블록 중심형 스토리지 접근 프로토콜로써, TCP/IP 네트워크를 통해 원격의 스토리지를 마치 자신의 로컬 상에 있는 블록 장치처럼 접근하는 기술이다. iSCSI는 이 같은 접근을 위해 표준 이더넷 스위치와 라우터를 사용하므로 기존의 수많은 이더넷 기술의 적용은 물론 거리 제한이 없는 스토리지 확장을 가능하게 하며, 이는 곧 무선 네트워크상으로의 적용이 가능함을 의미한다. 본 논문에서는 이 점에 착안, 유선 기반의 원격 스토리지 접근을 목적으로 디자인 되어진 iSCSI를 최근 유비쿼터스 컴퓨팅(Ubiquitos Computing)등으로 관심이 모아지고 있는 임베디드 리눅스 장치에 탑재하여 모바일 기기가 가지는 저장 공간 제약 극복의 대안과, 상대적으로 제한된 무선 네트워크상에서 iSCSI 프로토콜의 성능을 평가 및 분석함으로써 그 적용 가능성을 제시하고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2111-2131
• /
• 2015

Tiered wireless sensor network is a network model of flexibility and robustness, which consists of the traditional resource-limited sensor nodes and the resource-abundant storage nodes. In such architecture, collected data from the sensor nodes are periodically submitted to the nearby storage nodes for archive purpose. When a query is requested, storage nodes also process the query and return qualified data as the result to the base station. The role of the storage nodes leads to an attack prone situation and leaves them more vulnerable in a hostile environment. If any of them is compromised, fake data may be injected into and/or qualified data may be discarded. And the base station would receive incorrect answers incurring malfunction to applications. In this paper, an efficient verifiable top-k query processing scheme called EVTQ is proposed, which is capable of verifying the authentication and completeness of the results. Collected data items with the embedded information of ordering and adjacent relationship through a hashed message authentication coding function, which serves as a validation code, are submitted from the sensor nodes to the storage nodes. Any injected or incomplete data in the returned result from a corresponded storage node is detected by the validation code at the base station. For saving communication cost, two optimized solutions that fuse and compress validation codes are presented. Experiments on communication cost show the proposed method is more efficiency than previous works.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.359-374
• /
• 2010

The Future Internet that includes Real World Objects and the Internet of Things together with the more classic web pages will move communications from a nodecentric organization to an information-centric network allowing new a paradigm to take place. The 4WARD project initiated some works on the Future Internet. One of them is the creation of a Network of Information designed to enable more powerful semantic searches. In this paper, we propose a security solution for a model of information based on a semantic description and search of objects. The proposed solution takes into account both the access and the management of both objects and their descriptions.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2003년도 동계학술대회
• /
• pp.360-365
• /
• 2003

무선 단말기를 통한 멀티미디어 데이터의 이용증가로 인해 무선 단말기의 저장 용량 한계에 대한 문제가 제기되었다. 지속적으로 성장하고 있는 무선 인프라 상에서 사용자의 중요한 데이터를 완벽하게 보호하고 시스템 장애 시간을 최소화하여 사용자가 언제든 원하는 데이터를 저장하고, 제공받기 위해 SAN 보안 인프라 연구는 필수적이다.

• International Journal of Computer Science & Network Security
• /
• 제22권1호
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

• 스마트미디어저널
• /
• 제4권1호
• /
• pp.25-32
• /
• 2015

Powering wireless sensors with energy harvested from the environment is coming of age due to the increasing power densities of both storage and harvesting devices and the electronics performing energy efficient energy conversion. In order to maximize the functionality of the wireless sensor network, minimize missing packets, minimize latency and prevent the waste of energy, problems like congestion and inefficient energy usage must be addressed. Many sleep-awake protocols and efficient message priority techniques have been developed to properly manage the energy of the nodes and to minimize congestion. For a WSN that is operating in a strictly energy constrained environment, an energy-efficient transmission strategy is necessary. In this paper, we present a novel transmission priority decision scheme for a heterogeneous body sensor network composed of normal nodes and an energy harvesting node that acts as a cluster head. The energy harvesting node's decision whether or not to clear a normal node for sending is based on a set of metrics which includes the energy harvesting node's remaining energy, the total harvested energy, the type of message in a normal node's queue and finally, the implementation context of the wireless sensor network.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (A)
• /
• pp.323-324
• /
• 2008

• 한국전자거래학회지
• /
• 제18권3호
• /
• pp.107-123
• /
• 2013

무선센서 네트워크 환경에서 센서노드들에 대한 식별자 노출을 억제함으로써 익명성을 보장하고 실시간 인증, 인증의 경량화, 동기화 등이 요구되고 있다. 특히 무선 채널상에서 이루어지는 통신은 제3자에 의한 위치정보가 노출되거나 프라이버시 침해 및 보안상의 취약점이 존재한다. 익명성은 유 무선 네트워크 환경에서 중요한 문제로 폭넓게 연구되어왔다. 센서 노드는 노드간의 무선망 구성을 기본으로 하여 계산능력의 제한과 저장장치의 제한, 전력 장치의 소형화가 강조되고 있다. 본 논문에서는 생체기반의 D. He scheme을 개선하여 네트워크 성능 향상과 익명성을 보장하며 URSC(Unique Random Sequence Code)와 가변식별자(variable identifier)를 이용한 실시간 인증 프로토콜을 제안한다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권4호
• /
• pp.38-43
• /
• 2017

Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.