• Title/Summary/Keyword: Sensor Node Deployment

Search Result 89, Processing Time 0.02 seconds

A Development of CCTV Control System Based on Wireless Sensor Network (무선 센서 네트워크 기반 CCTV 제어 시스템 연구)

  • Cho, Soo-Hyung;Kim, Dae-Hwan
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • 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.

  • PDF

Key Predistribution Schemes in Distributed Wireless Sensor Network (분산 무선 센서 네트워크에서의 선수 키 분배 방법)

  • Kim, Jung-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • 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.

  • PDF

Self-positioning fusion system based on estimation of relative coordinates

  • Cho, Hyun-Jong;Lee, Sung-Geun;Cho, Woong-Ho;Noh, Duck-Soo;Seo, Dong-Hoan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.38 no.5
    • /
    • pp.566-572
    • /
    • 2014
  • Recently, indoor navigation has been applied in large convention centers by using wireless sensor networks (WSNs), which provide not only a user's path to be traveled but also orientation and shopping information to increase user's convenience. This paper presents the localization system for estimating relative coordinates without pre-deployment of the reference node based on ultra wide band (UWB) ranging system, which is relatively suitable for indoor localization compared to other wireless communications, and azimuth sensor. The proposed localization system which consists of an azimuth sensor and a mobile node composed of three nodes estimates relative coordinates of the reference node without applying any recursive and time consumption algorithms. Also, in the process of estimating relative coordinates of the reference node, ranging errors are minimized through the proposed technique and the number of nodes can be reduced. Experimental results show the feasibility and validity of the proposed system.

Development of Mobile u-Healthcare System in WSN (무선센서네트워크 환경의 모바일 u-헬스케어 시스템 개발)

  • Lee, Seung-Chul;Chung, Wan-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4C
    • /
    • pp.338-346
    • /
    • 2012
  • Wireless sensor network (WSN) technology provides a variety of medical and healthcare solutions to assist detection and communication of body conditions. However, data reliability inside WSN might be influenced to healthcare routing protocol due to limited hardware resources of computer, storage, and communication bandwidth. For this reason, we have conducted various wireless communication experiments between nodes using parameters such as RF strength, battery status, and deployment status to get a optimal performance of mobile healthcare routing protocol. This experiment may also extend the life time of the nodes. Performance analysis is done to obtain some important parameters in terms of distance and reception rate between the nodes. Our experiment results show optimal distance between nodes according to battery status and RF strength, or deployment status and RF strength. The packet reception rate according to deployment status and RF strength of nodes was also checked. Based on this performance evaluation, the optimized sensor node battery and deployment in the developed our mobile healthcare routing protocol were proposed.

A Localization Algorithm for Underwater Wireless Sensor Networks Based on Ranging Correction and Inertial Coordination

  • Guo, Ying;Kang, Xiaoyue;Han, Qinghe;Wang, Jingjing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.4971-4987
    • /
    • 2019
  • Node localization is the basic task of underwater wireless sensor networks (UWSNs). Most of the existing underwater localization methods rely on ranging accuracy. Due to the special environment conditions in the ocean, beacon nodes are difficult to deploy accurately. The narrow bandwidth and high delay of the underwater acoustic communication channel lead to large errors. In order to reduce the ranging error and improve the positioning accuracy, we propose a localization algorithm based on ranging correction and inertial coordination. The algorithm can be divided into two parts, Range Correction based Localization algorithm (RCL) and Inertial Coordination based Localization algorithm (ICL). RCL uses the geometric relationship between the node positions to correct the ranging error and obtain the exact node position. However, when the unknown node deviates from the deployment area with the movement of the water flow, it cannot communicate with enough beacon nodes in a certain period of time. In this case, the node uses ICL algorithm to combine position data with motion information of neighbor nodes to update its position. The simulation results show that the proposed algorithm greatly improves the positioning accuracy of unknown nodes compared with the existing localization methods.

3D Node Deployment and Network Configuration Methods for Improvement of Node Coverage and Network Connectivity (커버리지와 네트워크 연결성 향상을 위한 3차원 공간 노드 배치 및 망 구성 방법)

  • Kim, Yong-Hyun;Kim, Lee-Hyeong;Ahn, Mirim;Chung, Kwangsue
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.9
    • /
    • pp.778-786
    • /
    • 2012
  • Sensors that are used on wireless sensor networks can be divided into two types: directional sensors, such as PIR, image, and electromagnetic sensors; and non-directional sensors, such as seismic, acoustic and magnetic sensors. In order to guarantee the line-of-sight of a directional sensor, the installation location of the sensor must be higher than ground level. Among non-directional sensors, seismic sensors should be installed on the ground in order to ensure the maximal performance. As a result, seismic sensors may have network connectivity problems due to communication failure. In this paper, we propose a 3D node deployment method to maximize the coverage and the network connectivity considering the sensor-specific properties. The proposed method is for non-directional sensors to be placed on the ground, while the directional sensor is installed above the ground, using trees or poles, to maximize the coverage. As a result, through the topology that the detection data from non-directional sensors are transmitted to the directional sensor, we can maximize the network connectivity. Simulation results show that our strategy improves sensor coverage and network connectivity.

Self-Localized Packet Forwarding in Wireless Sensor Networks

  • Dubey, Tarun;Sahu, O.P.
    • Journal of Information Processing Systems
    • /
    • v.9 no.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.

Distributed Prevention Mechanism for Network Partitioning in Wireless Sensor Networks

  • Wang, Lili;Wu, Xiaobei
    • Journal of Communications and Networks
    • /
    • v.16 no.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.

Location Privacy and Authentication for Low-cost Sensor Node Devices Using Varying Identifiers

  • Hamid Abdul;HONG Choong Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • 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.

  • PDF

A Secure Key Predistribution Scheme for WSN Using Elliptic Curve Cryptography

  • Rajendiran, Kishore;Sankararajan, Radha;Palaniappan, Ramasamy
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.791-801
    • /
    • 2011
  • Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.