• Title/Summary/Keyword: distributed sensor network

Search Result 365, Processing Time 0.038 seconds

Cost-Effective and Distributed Mobility Management Scheme in Sensor-Based PMIPv6 Networks with SPIG Support (센서기반 프록시 모바일 IPv6 네트워크에서 SPIG를 이용한 비용효과적인 분산 이동성관리 기법)

  • Jang, Soon-Ho;Jeong, Jong-Pil
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.211-221
    • /
    • 2012
  • The development of wireless sensor networks (WSNs) is progressed slowly due to limited resources, but it is in progress to the development of the latest IP-based IP-WSN by the development of hardware and power management technology. IPv6 over Low power WPAN (6LoWPAN) is capable of IPv6-built low-power devices. In these IP-based WSNs, existing IP-based techniques which was impossible in WSNs becomes possible. 6LoWPAN is based on the IEEE 802.15.4 sensor networks and is a IPv6-supported technology. Host-based mobility management scheme in IP-WSNs are not suitable due to the additional signaling, network-based mobility management scheme is more suitable. In this paper, we propose an enhanced PMIPv6-based route optimization scheme which consider multi-6LoWPAN network environments. All SLMA (Sensor Local Mobility Anchor) of the 6LoWPAN domain are connected with the SPIG (Sensor Proxy Internetworking Gateway) and performs distributed mobility control for the 6LoWPAN-based inter-domain operations. All information of SLMA in 6LoWPAN domain is maintained by SMAG (Sensor Mobile Access Gateway), and then is performed the route optimization quickly. The status information of the route optimization from SPIG is stored to SLMA and it is supported without additional signaling.

A Solution for Reducing Transmission Latency through Distributed Duty Cycling in Wireless Sensor Networks (무선 센서 네트워크에서 수신구간 분산 배치를 통한 전송지연 감소 방안)

  • Kim, Jun-Seok;Kwon, Young-Goo
    • 한국ITS학회:학술대회논문집
    • /
    • v.2007 no.10
    • /
    • pp.225-229
    • /
    • 2007
  • Recently, wireless sensor networks are deployed in various applications range from simple environment monitoring systems to complex systems, which generate large amount of information, like motion monitoring, military, and telematics systems. Although wireless sensor network nodes are operated with low-power 8bit processor to execute simple tasks like environment monitoring, the nodes in these complex systems have to execute more difficult tasks. Generally, MAC protocols for wireless sensor networks attempt to reduce the energy consumption using duty cycling mechanism which means the nodes periodically sleep and wake. However, in the duty cycling mechanism. a node should wait until the target node wakes and the sleep latency increases as the number of hops increases. This sleep latency can be serious problem in complex and sensitive systems which require high speed data transfer like military, wing of airplane, and telematics. In this paper, we propose a solution for reducing transmission latency through distributed duty cycling (DDC) in wireless sensor networks. The proposed algorithm is evaluated with real-deployment experiments using CC2420DBK and the experiment results show that the DDC algorithm reduces the transmission latency significantly and reduces also the energy consumption.

  • PDF

Self Organization of Sensor Networks for Energy-Efficient Border Coverage

  • Watfa, Mohamed K.;Commuri, Sesh
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.57-71
    • /
    • 2009
  • Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

Delay and Energy Efficient Data Aggregation in Wireless Sensor Networks

  • Le, Huu Nghia;Choe, Junseong;Shon, Minhan;Choo, Hyunseung
    • Annual Conference of KIPS
    • /
    • 2012.04a
    • /
    • pp.607-608
    • /
    • 2012
  • Data aggregation is a fundamental problem in wireless sensor networks which attracts great attention in recent years. Delay and energy efficiencies are two crucial issues of designing a data aggregation scheme. In this paper, we propose a distributed, energy efficient algorithm for collecting data from all sensor nodes with the minimum latency called Delay-aware Power-efficient Data Aggregation algorithm (DPDA). The DPDA algorithm minimizes the latency in data collection process by building a time efficient data aggregation network structure. It also saves sensor energy by decreasing node transmission distances. Energy is also well-balanced between sensors to achieve acceptable network lifetime. From intensive experiments, the DPDA scheme could significantly decrease the data collection latency and obtain reasonable network lifetime compared with other approaches.

A design of the wireless sensor network routing improved security method (무선 센서 네트워크 라우팅 보안 강화 기법의 설계)

  • Kim, Woo-Jin;Khi, Ara
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.11a
    • /
    • pp.101-106
    • /
    • 2010
  • As a part of preparing the sniffing attack, this routing method presented in this thesis decreases the risk rates of the leaking of information through separating valid data and transmitting by a multi-path. then data is transmitted from start node to destination node on distributed sensor network. The level of reduction in leaking of information by the sniffing attack is proved by experimental result thich compare the case described above with the case of transmitting whole data with the single path by simulation, and the algorithm for choosing the routing path is showed by proof of the theorem.

  • PDF

An Energy Efficient Distributed Approach-Based Agent Migration Scheme for Data Aggregation in Wireless Sensor Networks

  • Gupta, Govind P.;Misra, Manoj;Garg, Kumkum
    • Journal of Information Processing Systems
    • /
    • v.11 no.1
    • /
    • pp.148-164
    • /
    • 2015
  • The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

FuzzyGuard: A DDoS attack prevention extension in software-defined wireless sensor networks

  • Huang, Meigen;Yu, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.7
    • /
    • pp.3671-3689
    • /
    • 2019
  • Software defined networking brings unique security risks such as control plane saturation attack while enhancing the performance of wireless sensor networks. The attack is a new type of distributed denial of service (DDoS) attack, which is easy to launch. However, it is difficult to detect and hard to defend. In response to this, the attack threat model is discussed firstly, and then a DDoS attack prevention extension, called FuzzyGuard, is proposed. In FuzzyGuard, a control network with both the protection of data flow and the convergence of attack flow is constructed in the data plane by using the idea of independent routing control flow. Then, the attack detection is implemented by fuzzy inference method to output the current security state of the network. Different probabilistic suppression modes are adopted subsequently to deal with the attack flow to cost-effectively reduce the impact of the attack on the network. The prototype is implemented on SDN-WISE and the simulation experiment is carried out. The evaluation results show that FuzzyGuard could effectively protect the normal forwarding of data flow in the attacked state and has a good defensive effect on the control plane saturation attack with lower resource requirements.

Design an Indexing Structure System Based on Apache Hadoop in Wireless Sensor Network

  • Keo, Kongkea;Chung, Yeongjee
    • Annual Conference of KIPS
    • /
    • 2013.05a
    • /
    • pp.45-48
    • /
    • 2013
  • In this paper, we proposed an Indexing Structure System (ISS) based on Apache Hadoop in Wireless Sensor Network (WSN). Nowadays sensors data continuously keep growing that need to control. Data constantly update in order to provide the newest information to users. While data keep growing, data retrieving and storing are face some challenges. So by using the ISS, we can maximize processing quality and minimize data retrieving time. In order to design ISS, Indexing Types have to be defined depend on each sensor type. After identifying, each sensor goes through the Indexing Structure Processing (ISP) in order to be indexed. After ISP, indexed data are streaming and storing in Hadoop Distributed File System (HDFS) across a number of separate machines. Indexed data are split and run by MapReduce tasks. Data are sorted and grouped depend on sensor data object categories. Thus, while users send the requests, all the queries will be filter from sensor data object and managing the task by MapReduce processing framework.

Distributed Authentication Model using Multi-Level Cluster for Wireless Sensor Networks (무선센서네트워크를 위한 다중계층 클러스터 기반의 분산형 인증모델)

  • Shin, Jong-Whoi;Yoo, Dong-Young;Kim, Seog-Gyu
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.3
    • /
    • pp.95-105
    • /
    • 2008
  • In this paper, we propose the DAMMC(Distributed Authentication Model using Multi-level Cluster) for wireless sensor networks. The proposed model is that one cluster header in m-layer has a role of CA(Certificate Authority) but it just authenticates sensor nodes in lower layer for providing an efficient authentication without authenticating overhead among clusters. In here, the m-layer for authentication can be properly predefined by user in consideration of various network environments. And also, the DAMMC uses certificates based on the threshold cryptography scheme for more reliable configuration of WSN. Experimental results show that the cost of generation and reconfiguration certification are decreased but the security performance are increased compared to the existing method.

  • PDF

Efficient Distributed Broadcast Schemes using Sensor Networks in Road Network Environments (도로 네트워크 환경에서 센서 네트워크를 이용한 효율적인 분산 브로드캐스트 기법)

  • Jang, Yong-Jin;Lee, Jin-Ju;Park, Jun-Ho;Seong, Dong-Ook;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.1
    • /
    • pp.26-33
    • /
    • 2011
  • In ubiquitous environments that numerous mobile objects exist, the location-based services have risen as an important application field. For efficient location-based services, various techniques with broadcast schemes have been studied. However, they were mainly concerned with the implementation of a broadcast index and did not consider techniques for reducing the size of the entire broadcast data. Therefore, this paper proposes a data distribution broadcast scheme based on sensor networks that considers the mobile patterns of an object in road network environments. In this paper we also propose a road network based sensor clustering technique for the efficiency of the proposed distributed broadcast scheme. In order to show the superiority of the proposed scheme, we compare it with the existing broadcast scheme in various environments.