• 제목/요약/키워드: Wireless Sensor Network(WSNs)

검색결과 278건 처리시간 0.023초

Network Coding-based Maximum Lifetime Algorithm for Sliding Window in WSNs

  • Sun, Baolin;Gui, Chao;Song, Ying;Chen, Hua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1298-1310
    • /
    • 2019
  • Network coding (NC) is a promising technology that can improve available bandwidth and packet throughput in wireless sensor networks (WSNs). Sliding window is an improved technology of NC, which is a supplement of TCP/IP technology and can improve data throughput and network lifetime on WSNs. This paper proposes a network coding-based maximum lifetime algorithm for sliding window in WSNs (NC-MLSW) which improves the throughput and network lifetime in WSN. The packets on the source node are sent on the WSNs. The intermediate node encodes the received original packet and forwards the newly encoded packet to the next node. Finally, the destination node decodes the received encoded data packet and recovers the original packet. The performance of the NC-MLSW algorithm is studied using NS2 simulation software and the network packet throughput, network lifetime and data packet loss rate were evaluated. The simulations experiment results show that the NC-MLSW algorithm can obviously improve the network packet throughput and network lifetime.

Efficient Approach for Maximizing Lifespan in Wireless Sensor Networks by Using Mobile Sinks

  • Nguyen, Hoc Thai;Nguyen, Linh Van;Le, Hai Xuan
    • ETRI Journal
    • /
    • 제39권3호
    • /
    • pp.353-363
    • /
    • 2017
  • Recently, sink mobility has been shown to be highly beneficial in improving network lifetime in wireless sensor networks (WSNs). Numerous studies have exploited mobile sinks (MSs) to collect sensed data in order to improve energy efficiency and reduce WSN operational costs. However, there have been few studies on the effectiveness of MS operation on WSN closed operating cycles. Therefore, it is important to investigate how data is collected and how to plan the trajectory of the MS in order to gather data in time, reduce energy consumption, and improve WSN network lifetime. In this study, we combine two methods, the cluster-head election algorithm and the MS trajectory optimization algorithm, to propose the optimal MS movement strategy. This study aims to provide a closed operating cycle for WSNs, by which the energy consumption and running time of a WSN is minimized during the cluster election and data gathering periods. Furthermore, our flexible MS movement scenarios achieve both a long network lifetime and an optimal MS schedule. The simulation results demonstrate that our proposed algorithm achieves better performance than other well-known algorithms.

Bayesian Rules Based Optimal Defense Strategies for Clustered WSNs

  • Zhou, Weiwei;Yu, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권12호
    • /
    • pp.5819-5840
    • /
    • 2018
  • Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.

Design, Analysis and Implementation of Energy-efficient Broadcast MAC Protocols for Wireless Sensor Networks

  • Kang, Young-Myoung;Lim, Sang-Soon;Yoo, Joon;Kim, Chong-Kwon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권6호
    • /
    • pp.1113-1132
    • /
    • 2011
  • In wireless sensor networks (WSNs), most energy saving asynchronous MAC protocols are custom tailored for unicast communications only. However, broadcast protocols are very commonly used in WSNs for a variety of functionalities, such as gathering network topology information, event monitoring and query processing. In this paper, we propose a novel low-power asynchronous broadcast MAC protocol called Alarm Broadcast (A-CAST). A-CAST employs the strobe preamble that specifies the residual waiting time for the following data transmission. Each receiver goes back to sleep upon hearing the strobe preamble for the residual time duration, to conserve energy and to wake up just before data transmission starts. We compute the energy consumption of A-CAST via rigorous mathematical analysis. The analytic results show that A-CAST outperforms B-CAST, a simple broadcast extension of the well-known B-MAC. We also implement A-CAST on sensor motes and evaluated its performance through real experiments. Our experimental results show that A-CAST reduces the energy consumption by up to 222% compared to the previously proposed protocols.

A Beeline Routing Protocol for Heterogeneous WSN for IoT-Based Environmental Monitoring

  • Sahitya, G.;Balaji, N.;Naidu, C.D.
    • International Journal of Computer Science & Network Security
    • /
    • 제22권10호
    • /
    • pp.67-72
    • /
    • 2022
  • A wireless sensor network (WSN), with its constrained sensor node energy supply, needs an energy-efficient routing technique that maximises overall system performance. When rumours are routed using a random-walk routing algorithm, which is not highly scalable, spiral pathways may appear. Because humans think a straight line is the quickest route between two sites and two straight lines in a plane are likely to intersect, straight-line routing (SLR) constructs a straight path without the aid of geographic information. This protocol was developed for WSNs. As a result, sensor nodes in WSNs use less energy when using SLR. Using comprehensive simulation data, we show that our upgraded SLR systems outperform rumour routing in terms of performance and energy conservation.

무선센서네트워크에서 익명의 사용자 인증과 키동의 기법에 대한 가장 공격 (Impersonation Attacks on Anonymous User Authentication and Key Agreement Scheme in Wireless Sensor Networks)

  • 최해원;김현성
    • 디지털융복합연구
    • /
    • 제14권10호
    • /
    • pp.287-293
    • /
    • 2016
  • 무선센서네트워크는 다양한 응용을 가지고 있고 아주 넓은 지역에 배치된다. 특히, 이들 네트워크는 잠재적인 위험을 포함한 환경에 배치됨으로 이에 대한 보안 이슈를 해결하기 위한 많은 노력이 있다. 최근에 무선센서네트워크에서 대칭키암호시스템에 기반한 익명의 사용자 인증과 키동의 기법 (AUAKAS)이 제안되었다. AUAKAS는 가장공격을 포함한 다양한 공격에 안전하다고 주장하였다. 하지만 본 논문은 AUAKAS가 게이트웨이에 등록된 정당한 사용자에 의하여 사용자 가장 공격과 게이트웨이 가장 공격에 취약함을 보인다. 본 논문의 보안 분석은 다양한 새로운 보안 기법의 설계에 있어서 미리 고려할 중요한 특성 분석에 있어서 도움을 줄 수 있을 것이다.

무선 센서 네트워크를 위한 Hop-by-Hop 기반의 신뢰성 있는 혼잡제어 기법 설계 (A Design of Hop-by-Hop based Reliable Congestion Control Protocol for WSNs)

  • 허관;김현태;나인호
    • 한국정보통신학회논문지
    • /
    • 제10권6호
    • /
    • pp.1055-1059
    • /
    • 2006
  • 무선 센서 네트워크의 센서 노드는 브로드캐스트 방식을 사용하여 수집한 데이터를 이웃한 다른 센서노드로 전달하기 때문에 데이터 중복성 문제가 발생한다. 데이터 중복성은 네트워크 로드를 가중시키며 데이터 손실의 원인이 되며, 이러한 문제점은 데이터 전송의 신뢰성과 네트워크 혼잡 회피간의 상충조건에 의해 발생한다. 따라서 무선 센서 네트워크에서 효율적으로 혼잡제어를 수행하기 위해서는 신뢰성 있는 전송(reliable transmission), 무선 손실(wireless loss), 혼잡 손실(congestion loss) 등과 같은 여러 요소를 고려한 신뢰성 있는 혼잡제어 기법이 필요하다. 본 논문에서는 Hop-by-Hop 순서 번호, DSbACK(Delayed and Selective ACK, Buffer Condition)을 사용하여 신뢰성 있는 전송을 보장하고 불필요한 전송을 최소화한 에너지 절약형 혼잡 제어 기법으로 HRCCP(Hop-by-Hop Reliable Congestion Control Protocol)를 제안하여 무선 센서 네트워크에서 신뢰성 있는 전송과 흔잡 제어가 동시에 이루어 질수 있도록 하였다.

Data Sorting-based Adaptive Spatial Compression in Wireless Sensor Networks

  • Chen, Siguang;Liu, Jincheng;Wang, Kun;Sun, Zhixin;Zhao, Xuejian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권8호
    • /
    • pp.3641-3655
    • /
    • 2016
  • Wireless sensor networks (WSNs) provide a promising approach to monitor the physical environments, to prolong the network lifetime by exploiting the mutual correlation among sensor readings has become a research focus. In this paper, we design a hierarchical network framework which guarantees layered-compression. Meanwhile, a data sorting-based adaptive spatial compression scheme (DS-ASCS) is proposed to explore the spatial correlation among signals. The proposed scheme reduces the amount of data transmissions and alleviates the network congestion. It also obtains high compression performance by sorting original sensor readings and selectively discarding the small coefficients in transformed matrix. Moreover, the compression ratio of this scheme varies according to the correlation among signals and the value of adaptive threshold, so the proposed scheme is adaptive to various deploying environments. Finally, the simulation results show that the energy of sorted data is more concentrated than the unsorted data, and the proposed scheme achieves higher reconstruction precision and compression ratio as compared with other spatial compression schemes.

Formal Models of Module Linking Mechanisms for a Single Address Space

  • 김희철;홍원기
    • 한국산업정보학회논문지
    • /
    • 제19권2호
    • /
    • pp.51-58
    • /
    • 2014
  • As WSNs(Wireless Sensor Networks) are being deployed widely in diverse application areas, their management and maintenance become more important. Recent sensor node software takes modular software architectures in pursuit of flexible software management and energy efficient reprogramming. To realize an flexible and efficient modular architecture particularly on resource constrained mote-class sensor nodes that are implemented with MCUs(Micro-Controller Units) of a single address space. an appropriate module linking model is essential to resolve and bind the inter-module global symbols. This paper identifies a design space of module linking model and respectively their implementation frameworks. We then establish a taxonomy for module linking models by exploring the design space of module linking models. Finally, we suggest an implementation framework respectively for each module linking model in the taxonomy. We expect that this work lays the foundations for systematic innovation toward more flexible and efficient modular software architectures for WSNs.

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

  • 장순호;정종필
    • 한국인터넷방송통신학회논문지
    • /
    • 제12권4호
    • /
    • pp.211-221
    • /
    • 2012
  • 한정된 자원으로 인해 개발이 더디게 진행되어오던 무선 센서 네트워크(Wireless Sensor Network)가 하드웨어 및 전원관리 기술의 발달로 인해 최근 IP를 기반으로 하는 IP-WSN으로 개발되고 있다. 그 방안으로 저 전력 장치에 IPv6를 탑재할 수 있는 6LoWPAN (IPv6 over Low power WPAN)이 주목받고 있다. 이런 IP 기반의 센서 네트워크에서는 기존 무선 센서 네트워크에서는 불가능하던 IP 기반의 기법들이 가능해진다. 6LoWPAN은 IEEE 802.15.4를 기반으로 하는 센서 네트워크에 IPv6를 지원하기 위한 기술이다. 호스트 기반의 이동성 관리 기법은 IP-WSN에 부가적인 시그널링으로 인해 적합하지 않고, 네트워크 기반의 이동성 관리 기법이 적합하다. 따라서 본 논문에서는 다중 6LoWPAN 네트워크 환경을 고려한 PMIPv6 기반의 향상된 경로 최적화 방안을 제안한다. 6LoWPAN 도메인의 모든 SLMA(Sensor Local Mobility Anchor)는 SPIG(Sensor Proxy Internetworking Gateway)에 연결되어 6LoWPAN도메인 간 분산 이동성 제어를 수행한다. 6LoWPAN 도메인 내 모든 SLMA의 정보를 SMAG(Sensor Mobile Access Gateway)가 유지하도록 하여 신속하게 경로 최적화를 수행하도록 하였으며, SLMA에 경로 최적화 상태 정보를 SPIG로부터 수신받아 저장하여 추가적인 시그널링 없이 경로 최적화를 지원하도록 한다.