• Title/Summary/Keyword: Sensor nodes

Search Result 2,025, Processing Time 0.03 seconds

A Study on an Efficient Routing Algorithm for Wireless Sensor Network (무선 센서네트워크에서 효율적인 라우팅 알고리즘에 관한 연구)

  • Kim, Byoung-Chan;Yim, Jae-Hong;Choi, Hong-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.5
    • /
    • pp.887-898
    • /
    • 2009
  • Conventional routing protocols proposed for wireless sensor networks (WSNs) cannot fully accommodate the characteristics of WSNs. In particular, although it is possible to largely obtain benefits in the solution of energy consumption and global identification problems through applying position information, there are few protocols that actively apply such position information. In the case of geographical and energy aware routing (GEAR) that is a typical algorithm, which uses position information, it does not fully represent the characteristics of WSNs because it is limited to forward query messages and assumed as fixed network environments. The routing protocols proposed in this paper defines the direction of data, which is routed based on the position information of individual and target nodes, in which each node configures its next hop based on this direction and routes signals. Because it performs data-centric routing using position information, it does not require certain global identifications in order to verify individual nodes and is able to avoid unnecessary energy consumption due to the forwarding of packets by defining its direction.

Efficient Node Deployment Algorithm for Sequence-Based Localization (SBL) Systems (시퀀스 기반 위치추정 시스템을 위한 효율적 노드배치 알고리즘)

  • Park, Hyun Hong;Kim, Yoon Hak
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.658-663
    • /
    • 2018
  • In this paper, we consider node deployment algorithms for the sequence-based localization (SBL) which is recently employed for in-door positioning systems, Whereas previous node selection or deployment algorithms seek to place nodes at centrold of the region where more targets are likely to be found, we observe that the boundaries dividing such regions can be good locations for the nodes in SBL systems. Motivated by this observation, we propose an efficient node deployment algorithm that determines the boundaries by using the well-known K-means algorithm and find the potential node locations based on the bi-section method for low-complexity design. We demonstrate through experiments that the proposed algorithm achieves significant localization performance over random node allocation with a substantially reduced complexity as compared with a full search.

An MPR-based broadcast scheme using 3 channels for WSNs (무선 센서 네트워크에서 3개의 채널을 이용한 MPR 기반의 브로드캐스트 기법)

  • Lee, Ji-Hye;Lee, Ki-Seok;Kim, Chee-Ha
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1043-1049
    • /
    • 2009
  • Broadcast of sink node is used for network management, data collection by query and synchronization in wireless sensor networks. Simple flooding scheme induces the broadcast storm problem. The MPR based broadcast schemes reduce redundant retransmission of broadcast packets. MPR is a set of one hop neighbor nodes which have to relay broadcast message to cover all two hop neighbors. Though MPR can reduce redundant retransmission remarkably, it still suffers from energy waste problem caused by collision and duplicate packets reception. This paper proposes a new MPR based sink broadcast scheme using 3-channel. The proposed scheme reduces energy consumption by avoiding duplicate packet reception, while increases reliability by reducing collision probability remarkably. The results of analysis and simulation show that the proposed scheme is more efficient in energy consumption compared to the MPR based scheme. The result also shows that the proposed scheme reduces delivery latency by evading a contention with other relay nodes and improves reliability of broadcast message delivery by reducing collision probability.

Implementation of factory monitoring system using MQTT and Node-RED (MQTT와 Node-RED를 이용한 설비 모니터링 시스템의 구현)

  • Oh, Se-Chun;Kim, Tae-Hyung;Kim, Young-Gon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.4
    • /
    • pp.211-218
    • /
    • 2018
  • Recently, various technologies related to IIoT are introduced continuously due to the spread of IoT and smart factory industries. This paper proposes the construction of a two-way wireless network system for monitoring plant equipment using these various technologies. The main technologies used in this thesis are design techniques for micro sensor nodes to monitor facility conditions at various sites, MQTT technology for wireless communication between local server and sensor nodes and Node-RED based design technologies, which store data collected and can be easily presented to users via wired and wireless wires. In addition, a wireless two-way camera system was also implemented in which the screen images of the site can be viewed in the situation room according to the instructions of the situation room when determining abnormal conditions.

Clustering Algorithm for Efficient Energy Consumption in Wireless Sensor Networks (무선 센서 네트워크에서 효율적인 에너지 사용을 위한 클러스터링 알고리즘)

  • Na, Sung-Won;Choi, Seung-Kwon;Lee, Tae-Woo;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.6
    • /
    • pp.49-59
    • /
    • 2014
  • Recently, wireless sensor networks(WSNs) are widely used for intrusion detection and ecology, environment, atmosphere, industry, traffic, fire monitoring. In this paper, an energy efficient clustering algorithm is proposed. The proposed algorithm forms clusters uniformly by selecting cluster head that optimally located based on receiving power. Besides, proposed algorithm can induce uniform energy consumption regardless of location of nodes by multi-hop transmission and MST formation with limited maximum depth. Through the above, proposed algorithm elongates network life time, reduces energy consumption of nodes and induces fair energy consumption compared to conventional LEACH and HEED. The results of simulation show that the proposed clustering algorithm elongates network life time through fair energy consumption.

Implementation of CoAP Protocol for USN Environment (CoAP 프로토콜 구현과 USN 환경 적용)

  • Min, Kyoung-Ju;Kim, Yong-Woon;Yoo, Sang-Keun;Kim, Hyoung-Jun;Jung, Heo-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1189-1197
    • /
    • 2011
  • To manage sensing information such as temperature, humidity and so on efficiently, it is need to use special purpose protocol. In this reason, IETF WG proposed CoAP protocol, and it is on Internet draft. If it is possible to work on a specific protocol, sensor end-nodes and network devices will be managed efficiently. However, end-nodes have restricted resources, it is hard to applying to CoAP protocol directly. In this paper we analyse a CoAP protocol stack for USN. To verify this protocol quickly, at first we implemented CoAP protocol stack over PC environments. After the logical verification, we applied this protocol to the USN environment. To do this, we ported CoAP protocol to Cygwin environment, and proposed solutions for hardware dependencies, and it is verified through experiments.

S-RCSA : Efficiency Analysis of Sectored Random Cluster Header Selection Algorithm (섹터화된 랜덤 클러스터 헤더 선출 알고리즘 효율성 분석)

  • Kim, Min-Je;Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.831-834
    • /
    • 2011
  • LEACH(One of the leading algorithms in the field of WSN) for the life of the system, even by the number of all nodes to ensure that the cluster header. However, each round does not guarantee a certain number of cluster header. So sometimes cluster header is elected of small number or not elected. If cluster header number is to small, takes a heavy load on cluster header. And empty cluster is occur depending on the location of the cluster header. The algorithm proposed in this paper, the area of interest is divided into sectors. And randomly, cluster header be elected one the in each sector. When clustering the sensor nodes will belong to the nearest cluster header. So clustering is independent of the sector. This algorithm is guarantee a certain number of cluster header in each round. And has prevent occurrence of empty cluster.

  • PDF

Location Error Compensation in indoor environment by using MST-based Topology Control (MST 토폴로지를 이용한 실내 환경에서의 위치측정에러의 보상기법)

  • Jeon, Jong-Hyeok;Kwon, Young-Goo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.8
    • /
    • pp.1926-1933
    • /
    • 2013
  • Many localization algorithms have been proposed for Wireless Sensor Networks (WSNs). The IEEE 802.15.4a-based location-aware-system can provide precise ranging distance between two mobile nodes. The mobile nodes can obtain their exact locations by using accurate ranging distances. However, the indoor environments contain various obstacles which cause non-line-of-sight (NLOS) conditions. In NLOS condition, the IEEE 802.15.4a-based location-aware system has a large scale location error. To solve the problem, we propose location error compensation in indoor environment by using MST-based topology control. Experimental and simulation results show that the proposed algorithm improves location accuracy in NLOS conditions.

A Client Agent Framework for Dynamic Connection with Web Services (웹 서비스 동적 연동을 위한 클라이언트 에이전트 프레임워크)

  • Park, Young-Joon;Lee, Woo-Jin
    • The KIPS Transactions:PartA
    • /
    • v.16A no.5
    • /
    • pp.339-346
    • /
    • 2009
  • In order to connect web services, clients generally should use heavy frameworks such as .Net framework and Java run-time environment, which require high performance hardware resources like a personal computer. Therefore, it is impossible for sensor nodes to handle web services due to their limited resources. In this paper, a client agent framework is proposed for dynamically connecting web services in the client node with limited resources. A client agent, which is managed by the framework in other server, has full capability for connecting web services, while a real client has a simple connection module with the client agent. In this framework, a client agent is dynamically generated using the WSDL in the web service server. By using the framework, sensor nodes or mobile devices can enhance their functionalities and services by accessing web services with minimum resources.

Design Mobility Agent Module for Healthcare Application Service (헬스케어 응용 서비스를 위한 Mobility Agent 모듈 설계)

  • Nam, Jin-Woo;Chung, Yeong-Jee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.2
    • /
    • pp.378-384
    • /
    • 2008
  • The sensor network for the health care application service has the man or movable object as the main sensing object. In order to support inter-node interaction by the movement of such sensing objects, the node's dynamic function modification, dynamic self-configuration and energy efficiency must be considered. In this paper, the Agilla model which supports the dynamic function modification through the agent migration between nodes and LEACH protocol which guarantees the dynamic self-configuration and energy efficiency through the configuration of inter-node hierarchical cluster configuration are analyzed. Based on the results of the analysis, the Mobility Agent Middleware which supports the dynamic function modification between nodes is designed, and LEACH_Mobile protocol which guarantees the node nobility as the weakness of the existing LEACH protocol is suggested. Also, the routing module which supports the LEACH_Mobile protocol is designed and the interface for conjunction with Mobility Agent Middleware is designed. Then, it is definitely increase performance which un mobility node of transfer data rate through LEACH_Mobile protocol of simulation result.