• Title/Summary/Keyword: Distributed Sensor Network

Search Result 364, Processing Time 0.027 seconds

Energy-efficient data transmission technique for wireless sensor networks based on DSC and virtual MIMO

  • Singh, Manish Kumar;Amin, Syed Intekhab
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.341-350
    • /
    • 2020
  • In a wireless sensor network (WSN), the data transmission technique based on the cooperative multiple-input multiple-output (CMIMO) scheme reduces the energy consumption of sensor nodes quite effectively by utilizing the space-time block coding scheme. However, in networks with high node density, the scheme is ineffective due to the high degree of correlated data. Therefore, to enhance the energy efficiency in high node density WSNs, we implemented the distributed source coding (DSC) with the virtual multiple-input multiple-output (MIMO) data transmission technique in the WSNs. The DSC-MIMO first compresses redundant source data using the DSC and then sends it to a virtual MIMO link. The results reveal that, in the DSC-MIMO scheme, energy consumption is lower than that in the CMIMO technique; it is also lower in the DSC single-input single-output (SISO) scheme, compared to that in the SISO technique at various code rates, compression rates, and training overhead factors. The results also indicate that the energy consumption per bit is directly proportional to the velocity and training overhead factor in all the energy saving schemes.

A Secure Energy-Efficient Routing Scheme Using Distributed Clustering in Wireless Sensor Networks (무선 센서 네트워크에서 분산 클러스터링을 이용한 안전한 에너지 효율적인 라우팅 기술)

  • Cheon, EunHong;Lee, YonSik
    • Convergence Security Journal
    • /
    • v.16 no.5
    • /
    • pp.3-9
    • /
    • 2016
  • The wireless sensor networks have become an economically viable monitoring solution for a wide variety of civilian and military applications. The main challenge in wireless sensor networks is the secure transmission of information through the network, which ensures that the network is secure, energy-efficient and able to identify and prevent intrusions in a hostile or unattended environment. In that correspondence, this paper proposes a distributed clustering process that integrates the necessary measures for secure wireless sensors to ensure integrity, authenticity and confidentiality of the aggregated data. We use the notion of pre-distribution of symmetric and asymmetric keys for a secured key management scheme, and then describe the detailed scheme which each sensor node within its cluster makes use of the pre-distribution of cryptographic parameters before deployment. Finally, we present simulation results for the proposed scheme in wireless sensor network.

USN Channel Establishment Algorithm for Sensor Authentication and Anti-collision (센서 인증과 충돌 방지를 위한 USN 채널 확립 알고리즘)

  • Rhee, Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.44 no.3
    • /
    • pp.74-80
    • /
    • 2007
  • Advances in electronic and computer technologies have paved the way for the proliferation of WSN(wireless sensor networks). Accordingly, necessity of anti-collusion and authentication technology is increasing on the sensor network system. Some of the algorithm developed for the anti-collision sensor network can be easily adopted to wireless sensor network platforms and in the same time they can meet the requirements for sensor networks like: simple parallel distributed computation, distributed storage, data robustness and auto-classification of sensor readings. To achieve security in wireless sensor networks, it is important to be able to establish safely channel among sensor nodes. In this paper, we proposed the USN(Ubiquitous Sensor Network) channel establishment algorithm for sensor's authentication and anti-collision. Two different data aggregation architectures will be presented, with algorithms which use wavelet filter to establish channels among sensor nodes and BIBD (Balanced Incomplete Block Design) which use anti-collision methods of the sensors. As a result, the proposed algorithm based on BIBD and wavelet filter was made for 98% collision detection rate on the ideal environment.

Distributed Construction of Connected Cover Graph in Wireless Sensor Networks

  • Le, Duc Tai;Duc, Thang Le;Hwang, Boram;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.04a
    • /
    • pp.605-606
    • /
    • 2012
  • In this paper, we consider the problem of scheduling sensor activity to prolong the network lifetime while guaranteeing both discrete target coverage and connectivity among all the active sensors and the sink, called connected target coverage (CTC) problem. We proposed a distributed scheme called Distributed Lifetime-Maximizing Scheme (DLMS) to solve the CTC problem. Our proposed scheme significantly reduces the cost of the construction of the connected cover graphs in comparison with the some conventional schemes. In addition, the energy consumption is more balanced so that the network lifetime will be increased. Our simulation results show that DLMS scheme performs much better than the conventional schemes in terms of the network lifetime.

HDF: Hybrid Debugging Framework for Distributed Network Environments

  • Kim, Young-Joo;Song, Sejun;Kim, Daeyoung
    • ETRI Journal
    • /
    • v.39 no.2
    • /
    • pp.222-233
    • /
    • 2017
  • Debugging in distributed environments, such as wireless sensor networks (WSNs), which consist of sensor nodes with limited resources, is an iterative and occasionally laborious process for programmers. In sensor networks, it is not easy to find unintended bugs that arise during development and deployment, and that are due to a lack of visibility into the nodes and a dearth of effective debugging tools. Most sensor network debugging tools are not provided with effective facilities such as real-time tracing, remote debugging, or a GUI environment. In this paper, we present a hybrid debugging framework (HDF) that works on WSNs. This framework supports query-based monitoring and real-time tracing on sensor nodes. The monitoring supports commands to manage/control the deployed nodes, and provides new debug commands. To do so, we devised a debugging device called a Docking Debug-Box (D2-Box), and two program agents. In addition, we provide a scalable node monitor to enable all deployed nodes for viewing. To transmit and collect their data or information reliably, all nodes are connected using a scalable node monitor applied through the Internet. Therefore, the suggested framework in theory does not increase the network traffic for debugging on WSNs, and the traffic complexity is nearly O(1).

Research Directions for Efficient Query Processing over Sensor Data Streams (센서 데이터 스트림 환경에서 효율적인 질의처리 연구방향)

  • An, Dong-Chan
    • KSCI Review
    • /
    • v.14 no.2
    • /
    • pp.199-204
    • /
    • 2006
  • The sensor network is a wireless network of the sensor nodes which sensing, computation and communication ability. Each sensor nodes create the data items by sensor nodes above one. Like this feature, the sensor network is similar to distributed data base system. The sensor node of the sensor network is restricted from the power and the memory resources is the biggest weak point and is becoming the important research object. In this paper, We try to see efficient sensor data stream management method and efficient query processing method under the restricted sensor network environment.

  • PDF

Connectivity-Based Distributed Localization in Wireless Sensor Network (무선 센서 네트워크에서 연결성 정보만을 이용하여 노드 위치를 추정하는 분산 알고리즘)

  • Kwon Oh-Heum;Song Ha-Joo;Kim Sook-Yeon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.4 s.100
    • /
    • pp.525-534
    • /
    • 2005
  • We present several distributed algorithms for localizing nodes of a wireless sensor network. Our algorithms determine locations of nodes based on the connectivity between nodes. The basic idea behind our algorithms is to estimate distances between nearby nodes by counting their common neighbors. We analyze the performance of our algorithms experimentally. The results of experiments show that our algorithms achieve performance improvements upon the existing algorithms

Soft Fault Detection Using an Improved Mechanism in Wireless Sensor Networks

  • Montazeri, Mojtaba;Kiani, Rasoul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4774-4796
    • /
    • 2018
  • Wireless sensor networks are composed of a large number of inexpensive and tiny sensors used in different areas including military, industry, agriculture, space, and environment. Fault tolerance, which is considered a challenging task in these networks, is defined as the ability of the system to offer an appropriate level of functionality in the event of failures. The present study proposed an intelligent throughput descent and distributed energy-efficient mechanism in order to improve fault tolerance of the system against soft and permanent faults. This mechanism includes determining the intelligent neighborhood radius threshold, the intelligent neighborhood nodes number threshold, customizing the base paper algorithm for distributed systems, redefining the base paper scenarios for failure detection procedure to predict network behavior when running into soft and permanent faults, and some cases have been described for handling failure exception procedures. The experimental results from simulation indicate that the proposed mechanism was able to improve network throughput, fault detection accuracy, reliability, and network lifetime with respect to the base paper.

A Study on Cluster Head Selection Based on Distance from Sensor to Base Station in Wireless Sensor Network (무선센서 네트워크에서 센서와 기지국과의 거리를 고려한 클러스터 헤드 선택기법)

  • Ko, Sung-Won;Cho, Jeong-Hwan
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.27 no.10
    • /
    • pp.50-58
    • /
    • 2013
  • In Wireless Sensor Network, clustering scheme is used to prolong the lifetime of WSN by efficient usage of energy of sensor. In the distributed clustering protocol just like LEACH, every sensor in a network plays a cluster head role once during each epoch. So the FND is prolonged. But, even though every sensor plays a head role, the energy consumed by each sensor is different because the energy consumed increases according to the distance to the Base Station by the way of multiple increase. In this paper, we propose a mechanism to select a head depending on the distance to Base Station, which extends the timing of FND occurrence by 68% compared to the LEACH and makes network stable.

A Java Virtual Machine for Sensor Networks (센서 네트워크를 위한 자바 가상 기계)

  • Kim, Seong-Woo;Lee, Jong-Min;Lee, Jung-Hwa;Shin, Jin-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.1
    • /
    • pp.13-20
    • /
    • 2008
  • Sensor network consists of a large number of sensor node distributed in the environment being sensed and controlled. The resource-constrained sensor nodes tend to have various and heterogeneous architecture. Thus, it is important to make its software environment platform-independent and reprogrammable. In this paper, we present BeeVM, a Java operating system designed for sensor networks. BeeVM offers a platform-independent Java programming environment with its efficiently executable file format and a set of class APIs for basic operating functions, sensing and wireless networking. BeeVM's high-level native interface and layered network subsystem allow complex program for sensor network to be short and readable. Our platform has been ported on two currently popular hardware platforms and we show its effectiveness through the evaluation of a simple application.