• Title/Summary/Keyword: Sensor nodes

Search Result 2,025, Processing Time 0.026 seconds

Practical Node Deployment Scheme Based on Virtual Force for Wireless Sensor Networks in Complex Environment

  • Lu, Wei;Yang, Yuwang;Zhao, Wei;Wang, Lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.990-1013
    • /
    • 2015
  • Deploying sensors into a target region is a key issue to be solved in building a wireless sensor network. Various deployment algorithms have been proposed by the researchers, and most of them are evaluated under the ideal conditions. Therefore, they cannot reflect the real environment encountered during the deployment. Moreover, it is almost impossible to evaluate an algorithm through practical deployment. Because the deployment of sensor networks require a lot of nodes, and some deployment areas are dangerous for human. This paper proposes a deployment approach to solve the problems mentioned above. Our approach relies on the satellite images and the Virtual Force Algorithm (VFA). It first extracts the topography and elevation information of the deployment area from the high resolution satellite images, and then deploys nodes on them with an improved VFA. The simulation results show that the coverage rate of our method is approximately 15% higher than that of the classical VFA in complex environment.

A Time Synchronization Protocol of Sensor Nodes Combining Flooding-Routing Protocol with Bidirectional LTS (플러딩 라우팅 프로토콜과 양방향 LTS를 결합한 센서 노드의 시간 동기화 기법)

  • Shin, Jae-Hyuck;Oh, Hyun-Su;Jeon, Joong-Nam
    • The KIPS Transactions:PartC
    • /
    • v.18C no.2
    • /
    • pp.119-126
    • /
    • 2011
  • In wireless sensor networks Time synchronization used to be performed after routing tree is constructed. It results in increasing the number of packets and energy consumption. In this paper, we propose a time synchronization algorithm combined with flooding routing tree construction algorithm, which applies LTS (Lightweight Time Synchronization) information packed into the forwarding and backward routing packets. Furthermore, the proposed algorithm compensates the time error due to clock drift using the round time with fixed period. We prove that the proposed algorithm could synchronize the time of among sensor nodes more accurately compared to TSRA (Time Synchronization Routing Algorithm) using NS2 simulation tool.

An Energy Efficient and Fair MAC Protocol Using Preamble Counting for Wireless Sensor Networks (무선 센서 네트워크의 MAC 프로토콜에서 에너지 효율성과 공정성 향상을 위한 기법 연구)

  • Lee, Dong-Ho;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.2
    • /
    • pp.149-157
    • /
    • 2008
  • Since wireless sensor networks consist of nodes with the constrained battery, energy efficient MAC operation is one of the important issues. Low duty cycle operation is critical to conserve energy in wireless sensor network MAC protocol. Some paper proposed a new approach to low power listening, which employs a short preamble to further reduce energy consumption and to reduce latency. But short preamble suffers from unfair channel access problem since there was no consideration for contention between transmission nodes. Preamble counting proposes a solution to each of these problems by employing node selection information. Simulation results show that the preamble counting provides an improved energy efficiency and fairness of packet delivery.

A Design of Environment monitoring Server Based Wireless Mesh Networks (Wireless Mesh Networks 기반 환경감시서버 설계)

  • Im, Hyeok-Jin;Ju, Hui-Dong;Lee, Meong-Hun;Yoe, Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.671-674
    • /
    • 2007
  • USN (Ubuquitous Sensor Network) identifies that networks are able to gather information from various kinds of sensors with RF. In the USN, it is important that sensor nodes deliver stable data by overcoming limited transmission distance and by setting optimum routes. In this paper, we propose a method to overcome the limited distance of sensor nodes using Wireless Mesh Networks. With this method, environmental monitoring system for u-farm support stable data transmission by applying MAP of Wireless Mesh Networks.

  • PDF

Efficient Energy management through Relay-Transsmission and Cluster Division in Wireless Sensor Network (무선 센서네트워크에서 중계전송과 클러스터 분할법을 사용한 효율적인 에너지 관리)

  • Kim, Jae-Sueng;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.401-405
    • /
    • 2007
  • In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

  • PDF

Digital Signature Model of Sensor Network Using Hash Chain (해쉬체인을 이용한 센서네트워크의 디지털서명 모델)

  • Kim, Young-Soo;Cho, Seon-Goo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2459-2464
    • /
    • 2009
  • In sensor network there are no nodes or servers that are exclusively responsible for packet forwarding and routing. Instead, sensor nodes participating in network communications perform these activities. Thus, they are vulnerable to the alteration and forgery of message in the process of packet forwarding and routing. To solve this problem, a security to ensure authentication and integrity of routing and forwarding messages should be required. To do this, we propose the hash chain-based digital signature model where it takes less time to compute in generating and verifying the digital signature model, unlike he public key-based digital signature model, and verify if this model is proper by comparing computation times between tow models.

A Study on the location tracking system by using Zigbee in wireless sensor network (무선 센서네트워크에서 Zigbee를 적용한 위치추정시스템 구현에 관한연구)

  • Jung, Suk;Kim, Hwan-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.9
    • /
    • pp.2120-2126
    • /
    • 2010
  • This paper aims to realize the location tracking system using the Zigbee in the wireless sensor network. The wireless sensor network offers the user-oriented location tracking service in the ubiquitous environment. The location tracking service can track the location of an object or a person and provides it. The location tracking system realized in this paper can be used inside or outside without any black-out areas to measure the location of the moving nodes. In tracking inside the RSSI signals use and in tracking outside will connect with the GPS signals to track the location. Also, by using Zigbee, the wireless sensor network environment was established and by obtaining the location of the moving nodes, the real-time tracking is possible.

Communication coverage-aware cluster head election algorithm for Hierarchical Wireless Sensor Networks (계층형 무선센서 네트워크에서 통신영역을 고려한 클러스터 헤드 선출 알고리즘)

  • Lee, Doo-Wan;Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.527-530
    • /
    • 2010
  • WSN is composed of a lot of small sensors with the limited hardware resources. In WSN, at the initial stage, sensor nodes are randomly deployed over the region of interest, and self-configure the clustered networks by grouping a bunch of sensor nodes and selecting a cluster header among them. Specially, in WSN environment, in which the administrator's intervention is restricted, the self-configuration capability is essential to establish a power-conservative WSN which provides broad sensing coverage and communication coverage. In this paper, we propose a communication coverage-aware cluster head election algorithm for Herearchical WSNs which consists of communication coverage-aware of the Base station is the cluster head node is elected and a clustering.

  • PDF

Management Scheme of Sensor Network using Circular Coordinates (원형 좌표계를 이용한 센서네트워크 키 관리 기법)

  • Hong, Seong-Sik;Ryou, Hwang-Bin
    • Convergence Security Journal
    • /
    • v.6 no.2
    • /
    • pp.71-80
    • /
    • 2006
  • Sensor network is made from very small and restrictive-power nodes, and they collect some information of environment like as thermal and tremor, etc. And they transfer the information to each other. Generally, supporting the Security service of sensor network is a difficult work, because the nodes have very small cpu-power and low electronic-power. So, More effective management scheme will needed for the maintenance of stability. In this paper, we propose the location based management scheme with circular coordinates. We were make the with the relative location information from one node to other. The new scheme show more simple and effective result then the other method for key management.

  • PDF

Energy Efficient Clustering Scheme in Sensor Networks using Splitting Algorithm of Tree-based Indexing Structures (트리기반 색인구조의 분할 방법을 이용한 센서네트워크의 에너지 효율적인 클러스터 생성 방법)

  • Kim, Hyun-Duk;Yu, Bo-Seon;Choi, Won-Ik
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.10
    • /
    • pp.1534-1546
    • /
    • 2010
  • In sensor network systems, various hierarchical clustering schemes have been proposed in order to efficiently maintain the energy consumption of sensor nodes. Most of these schemes, however, are hardly applicable in practice since these schemes might produce unbalanced clusters or randomly distributed clusters without taking into account of the distribution of sensor nodes. To overcome the limitations of such hierarchical clustering schemes, we propose a novel scheme called CSM(Clustering using Split & Merge algorithm), which exploits node split and merge algorithm of tree-based indexing structures to efficiently construct clusters. Our extensive performance studies show that the CSM constructs highly balanced clustering in a energy efficient way and achieves higher performance up to 1.6 times than the previous clustering schemes, under various operational conditions.