• Title/Summary/Keyword: Sensor nodes

Search Result 2,025, Processing Time 0.032 seconds

Improvement of CH selection of WSN Protocol

  • Lee, WooSuk;Jung, Kye-Dong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.6 no.3
    • /
    • pp.53-58
    • /
    • 2017
  • A WSN (Wireless Sensor Network) is a network that is composed of wireless sensor nodes. There is no restriction on the place where it can be installed because it is composed wirelessly. Instead, sensor nodes have limited energy. Therefore, to use the network for a long time, energy consumption should be minimized. Several protocols have been proposed to minimize energy consumption, and the typical protocol is the LEACH protocol. The LEACH protocol is a cluster-based protocol that minimizes energy consumption by dividing the sensor field into clusters. Depending on how you organize the clusters of sensor field, network lifetimes may increase or decrease. In this paper, we will improve the network lifetime by improving the cluster head selection method in LEACH Protocol.

Design Strategy of Low-Power Node by Analyzing the Hardware Modules in Surveillance and Reconnaissance Sensor Networks (감시정찰 센서네트워크에서 하드웨어 모듈의 소모전력 분석을 통한 저전력 노드 설계 전략)

  • Kim, Yong-Hyun;Yeo, Myung-Ho;Chung, Kwangsue
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.6
    • /
    • pp.761-769
    • /
    • 2012
  • In this paper, we propose a low-power design strategy to minimize energy-consumption for surveillance and reconnaissance sensor networks. The sensor network consists of many different nodes with various operations such as target detection, packet relay, video monitoring, changing protocols, and etc. Each sensor node consists of sensing, computing, communication, and power components. These components are integrated on a single or multiple boards. Therefore, the power consumption of each component can be different on various operation types. First, we identified the list of components and measured power consumption for them from the first prototype nodes. Next, we focus on which components are the main sources of energy consumption. We propose many energy-efficient approaches to reduce energy consumption for each operation type.

Self-Organization Routing Protocol supporting Node moving in Wireless Sensor Network (무선 센서 네트워크에서의 노드 이동을 지원하는 자가 구성 라우팅 프로토콜)

  • Kim, Yong;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1035-1037
    • /
    • 2009
  • Common to use fixed-node sensor network and wireless sensor networks, unlike the recent move of the node happens frequently. These wireless sensor networks by taking into account the mobility of sensor nodes dynamically self-configurable routing protocol is required. In this paper, a fixed-node configuration and energy efficiency in the self-LEACH protocol is based on the useful movement of the nodes of the cluster is dynamically self-configuring routing protocols offer M-LEACH.

  • PDF

Adaptive Power Control based Efficient Localization Technique in Mobile Wireless Sensor Networks (모바일 무선 센서 네트워크에서 적응적 파워 조절 기반 효율적인 위치인식 기법)

  • Lee, Joa-Hyoung;Jung, In-Bum
    • The KIPS Transactions:PartC
    • /
    • v.16C no.6
    • /
    • pp.737-746
    • /
    • 2009
  • Given the increased interest in ubiquitous computing, wireless sensor network has been researched widely. The localization service which provides the location information of mobile user, is one of important service provided by sensor network. Many methods to obtain the location information of mobile user have been proposed. However, these methods were developed for only one mobile user so that it is hard to extend for multiple mobile users. If multiple mobile users start the localization process concurrently, there could be interference of beacon or ultrasound that each mobile user transmits. In the paper, we propose APL(Adaptive Power Control based Resource Allocation Technique for Efficient Localization Technique), the localization technique for multiple mobile nodes based on adaptive power control in mobile wireless sensor networks. In APL, collision of localization between sensor nodes is prevented by forcing the mobile node to get the permission of localization from anchor nodes. For this, we use RTS(Ready To Send) packet type for localization initiation by mobile node and CTS(Clear To Send) packet type for localization grant by anchor node. NTS(Not To Send) packet type is used to reject localization by anchor node for interference avoidance and STS(Start To Send) for synchronization between 모anchor nodes. At last, the power level of sensor node is controled adaptively to minimize the affected area. The experimental result shows that the number of interference between nodes are increased in proportion to the number of mobile nodes and APL provides efficient localization.

Secure Key Management Protocol in the Wireless Sensor Network

  • Jeong, Yoon-Su;Lee, Sang-Ho
    • Journal of Information Processing Systems
    • /
    • v.2 no.1
    • /
    • pp.48-51
    • /
    • 2006
  • To achieve security in wireless sensor networks (WSN), it is important to be able to encrypt messages sent among sensor nodes. We propose a new cryptographic key management protocol, which is based on the clustering scheme but does not depend on the probabilistic key. The protocol can increase the efficiency to manage keys since, before distributing the keys by bootstrap, the use of public keys shared among nodes can eliminate the processes to send or to receive keys among the sensors. Also, to find any compromised nodes safely on the network, it solves safety problems by applying the functions of a lightweight attack-detection mechanism.

A Multiple-Disseminators Determining Mechanism for Fast Code Dissemination in Wireless Sensor Networks (무선 센서 네트워크에서 빠른 코드분배를 위한 다수분배자 선정 방법)

  • Kim, Mi-Hui;Hong, June-S.
    • Journal of Information Technology Services
    • /
    • v.10 no.2
    • /
    • pp.247-257
    • /
    • 2011
  • In this paper, we propose a multiple-disseminators determining mechanism for Efficient Code Dissemination with low-delay(ECoDi) for wireless sensor networks (WSN). Code dissemination is in the spotlight as an important research issue since sensor nodes are necessary for updating new software remotely or fixing bugs dynamically. In particular, the time factor for code dissemination is the most important factor in order that the normal operation of nodes can be continuously performed as soon as finishing the dissemination. For this factor, ECoDi determines the set of disseminators through regression analysis based on the size of distributed code and the time of past unicasts and broadcasts. Then it transmits the entire code as a unicast to multiple disseminators, and the disseminators broadcast the code to the remaining neighbor nodes. Performance results on a testbed show that ECoDi reduces dissemination time significantly compared to a conventional scheme.

A Balanced Energy Consumption Strategy using a Smart Base Station in Wireless Sensor Networks (무선 센서 네트워크에서 스마트기지국을 이용한 균형된 에너지소비 방안)

  • Park, Sun-Young
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.4
    • /
    • pp.458-465
    • /
    • 2014
  • In this paper, we propose a strategy to distribute the energy consumption over the network. The proposed strategy is based on geographic routing. We use a smart base station that maintains the residual energy and location information of sensor nodes and selects a head node and an anchor node using this information. A head node gathers and aggregates data from the sensor nodes in a target region that interests the user. An anchor node then transmits the data that was forwarded from the head node back to the smart base station. The smart base station extends network lifetime by selecting an optimal head node and an optimal anchor node. We simulate the proposed protocol and compare it with the LEACH protocol in terms of energy consumption, the number of dead nodes, and a distribution map of dead node locations.

Clustering Algorithm of Hierarchical Structures in Large-Scale Wireless Sensor and Actuator Networks

  • Quang, Pham Tran Anh;Kim, Dong-Seong
    • Journal of Communications and Networks
    • /
    • v.17 no.5
    • /
    • pp.473-481
    • /
    • 2015
  • In this study, we propose a clustering algorithm to enhance the performance of wireless sensor and actuator networks (WSANs). In each cluster, a multi-level hierarchical structure can be applied to reduce energy consumption. In addition to the cluster head, some nodes can be selected as intermediate nodes (INs). Each IN manages a subcluster that includes its neighbors. INs aggregate data from members in its subcluster, then send them to the cluster head. The selection of intermediate nodes aiming to optimize energy consumption can be considered high computational complexity mixed-integer linear programming. Therefore, a heuristic lowest energy path searching algorithm is proposed to reduce computational time. Moreover, a channel assignment scheme for subclusters is proposed to minimize interference between neighboring subclusters, thereby increasing aggregated throughput. Simulation results confirm that the proposed scheme can prolong network lifetime in WSANs.

Hierarchical Routing Algorithm for Improving Survivability of WSAN

  • Cho, Ji-Yong;Choi, Seung-Kwon;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.2
    • /
    • pp.51-60
    • /
    • 2016
  • This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.

A Hexagon Model-based Efficient Beacon Scheduling Approach for Wireless Sensor Networks

  • Lee, Taekkyeun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.9
    • /
    • pp.43-50
    • /
    • 2018
  • In this paper, we propose a hexagon model-based efficient beacon frame scheduling approach for wireless sensor networks. The existing beacon frame scheduling approaches use a lot of slots and subslots for the beacon frame scheduling. Thus, the data from source nodes are not efficiently delivered to a sink node. Also in case a sink node needs to broadcast a beacon frame to the nodes in the network, delivering the beacon frame to the network nodes is not efficient as well. Thus, to solve the problem, we use a hexagon model to find the number of slots and subslots for the beacon frame scheduling. By using them for the beacon frame scheduling, the proposed approach performs better than other approaches in terms of the data transmission delay, the number of received data, the beacon transmission delay and the number of relaying the beacon frames.