• Journal of Communications and Networks
• /
• 제12권4호
• /
• pp.358-365
• /
• 2010

We develop a low complexity cooperative diversity protocol for low energy adaptive clustering hierarchy (LEACH) based wireless sensor networks. A cross layer approach is used to obtain spatial diversity in the physical layer. In this paper, a simple modification in clustering algorithm of the LEACH protocol is proposed to exploit virtual multiple-input multiple-output (MIMO) based user cooperation. In lieu of selecting a single cluster-head at network layer, we proposed M cluster-heads in each cluster to obtain a diversity order of M in long distance communication. Due to the broadcast nature of wireless transmission, cluster-heads are able to receive data from sensor nodes at the same time. This fact ensures the synchronization required to implement a virtual MIMO based space time block code (STBC) in cluster-head to sink node transmission. An analytical method to evaluate the energy consumption based on BER curve is presented. Analysis and simulation results show that proposed cooperative LEACH protocol can save a huge amount of energy over LEACH protocol with same data rate, bit error rate, delay and bandwidth requirements. Moreover, this proposal can achieve higher order diversity with improved spectral efficiency compared to other virtual MIMO based protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.123-144
• /
• 2014

Wireless sensor networks are generally deployed for specific applications to accomplish certain objectives over a period of time. To fulfill these objectives, it is crucial that the sensor network continues to function for a long time, even if some of its nodes become faulty. Energy efficiency and fault tolerance are undoubtedly the most crucial requirements for the design of an information extraction protocol for any sensor network application. However, most existing software agent based information extraction protocols are incapable of satisfying these requirements because of static agent itineraries and large agent sizes. This paper proposes an Information Extraction protocol based on Multiple software Agents with Dynamic Itineraries (IEMADI), where multiple software agents are dispatched in parallel to perform tasks based on the query assigned to them. IEMADI decides the itinerary for an agent dynamically at each hop using local information. Through mathematical analysis and simulation, we compare the performance of IEMADI with a well known static itinerary based protocol with respect to energy consumption and response time. The results show that IEMADI provides better performance than the static itinerary based protocols.

• Journal of Communications and Networks
• /
• 제13권2호
• /
• pp.160-166
• /
• 2011

In u-healthcare services based on wireless body sensor networks, reliable connection is very important as many types of information, including vital signals, are transmitted through the networks. The transmit power requirements are very stringent in the case of in-body networks for implant communication. Furthermore, the wireless link in an in-body environment has a high degree of path loss (e.g., the path loss exponent is around 6.2 for deep tissue). Because of such inherently bad settings of the communication nodes, a multi-hop network topology is preferred in order to meet the transmit power requirements and to increase the battery lifetime of sensor nodes. This will ensure that the live body of a patient receiving the healthcare service has a reduced level of specific absorption ratio (SAR) when exposed to long-lasting radiation. We propose an efficientmethod for delivering delay-intolerant data packets over multiple hops. We consider forward error correction (FEC) in an erasure correction mode and develop a mathematical formulation for packet-level scheduling of delay-intolerant FEC packets over multiple hops. The proposed method can be used as a simple guideline for applications to setting up a topology for a medical body sensor network of each individual patient, which is connected to a remote server for u-healthcare service applications.

• 한국전자통신학회논문지
• /
• 제18권4호
• /
• pp.579-586
• /
• 2023

무선 센서 네트워크(Wireless Sensor Network : WSN)는 저가의 소형 센서를 활용해서 무선으로 사용되기 때문에 제한된 배터리 전력을 가지고 있다. 배터리를 교체할 수 없으므로 센서 노드의 수명은 배터리의 수명과 직결되므로 전력을 효율적으로 사용하여 네트워크의 수명을 극대화해야 한다. 본 연구에서는 대표적인 에너지 효율적 라우팅 프로토콜인 PEGASIS(: Power-Efficient Gathering in Sensor Information System)를 기반으로 싱크 노드로부터의 거리에 따라 계층화하여 하나의 체인이 아닌 다중 체인을 구성하는 프로토콜을 제안한다. 제안하는 프로토콜은 노드 간 전송 거리를 줄여서 불필요한 에너지 소모를 막아 네트워크 수명을 높일 수 있음을 확인하였다.

• 대한임베디드공학회논문지
• /
• 제18권2호
• /
• pp.67-73
• /
• 2023

Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

• 한국정보과학회논문지:데이타베이스
• /
• 제36권1호
• /
• pp.8-21
• /
• 2009

무선 센서 네트워크는 작은 크기의 센서 노드들과 베이스 스테이션으로 구성된다. 센서 노드들은 에너지를 지속적으로 공급받기 어려운 특성을 가지고 있기 때문에 제한된 에너지를 최대한 효율적으로 사용해야 한다. 센서 네트워크에서 정보를 얻을 때는 질의를 작성하는데, 여러 개의 질의가 센서 네트워크에 요청되었을 때 이들의 실행을 최적화시키면 센서 노드의 에너지 소비량을 줄일 수 있다. 본 논문에서는 센서 네트워크에 여러 개의 질의가 요청될 때, 질의 간의 포함관계를 활용하여 질의 실행을 최적화시키는 기법을 제안한다. 제안하는 기법은 질의가 새로 요청될 때, 센서 네트워크에서 실행 중인 질의들 중 새로 요청된 질의의 결과를 조합해낼 수 있는 질의들의 집합을 찾아낸다. 이 집합은 질의들의 샘플 주기, 프로젝션되는 어트리뷰트들, 그리고 조건절을 기준으로 구성된다. 이 집합에 속한 질의들의 결과로부터 새 질의를 센서 네트워크에서 실행시켰을 때와 동일한 결과를 유도해낼 수 있으면, 새 질의를 센서 네트워크에 전달하지 않고, 이 집합에 속한 질의들의 결과를 재활용하여 베이스 스테이션에서 결과를 조합해낸다.

• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.676-682
• /
• 2011

Sybil attack can disrupt proper operations of wireless sensor network by forging its sensor node to multiple identities. To protect the sensor network from such an attack, a number of countermeasure methods based on RSSI (Received Signal Strength Indicator) and LQI (Link Quality Indicator) have been proposed. However, previous works on the Sybil attack detection do not consider the fact that Sybil nodes can change their RSSI and LQI strength for their malicious purposes. In this paper, we present a Sybil attack detection method based on a transmission power range. Our proposed method initially measures range of RSSI and LQI from sensor nodes, and then set the minimum, maximum and average RSSI and LQI strength value. After initialization, monitoring nodes request that each sensor node transmits data with different transmission power strengths. If the value measured by monitoring node is out of the range in transmission power strengths, the node is considered as a malicious node.

• Journal of Communications and Networks
• /
• 제11권4호
• /
• pp.406-415
• /
• 2009

In this work, we consider performance modeling of a wireless sensor network with a time division multiple access (TDMA) media access protocol with slot reuse. It is assumed that all the nodes are peers of each other and they have two modes of operation, active and sleep modes. We model the sensor network as a Jackson network with unreliable nodes with on and off states. Active and sleep modes of sensor nodes are modeled with on and off states of unreliable nodes. We determine the joint distribution of the sensor node queue lengths in the network. From this result, we derive the probability distribution of the number of active nodes and blocking probability of node activation. Then, we present the mean packet delay, average sleep period of a node and the network throughput. We present numerical results as well as simulation results to verify the analysis. Finally, we discuss how the derived results may be used in the design of sensor networks.

• 산업기술연구
• /
• 제26권A호
• /
• pp.147-152
• /
• 2006

Wireless Sensor Networks provide a new paradigm for sensing and disseminating information from various environments, with the potential to serve many and diverse applications. Recent advancement in wireless communications and electronics has enabled the development of low-cost sensor networks. The sensor networks can be used for various application areas. For different application areas, there are different technical issues that researchers are currently resolving. The current state of the art of sensor networks is captured in this article, where solutions are discussed under their related protocol stack layer sections. This article also points out the open research issues and intends to spark new interests and developments in this field. In order to evaluate the application of field monitoring system, lab tests, field test and FEM analysis are conducted. Therefore the accuracy of RFID wireless sensor data is verified.

• 인터넷정보학회논문지
• /
• 제10권1호
• /
• pp.159-173
• /
• 2009

일반적으로 무선 센서 네트워크는 다수의 노드들을 무작위로 배포하여 데이터를 수집하기 때문에 각 노드로부터 수집되는 데이터뿐만 아니라 계측하는 노드의 위치 또한 매우 중요하다. 무선 센서 네트워크를 구성하는 노드들은 저비용, 저성능의 장치들로 구성되어 있어 위치 측정을 위한 전용 장치를 노드에 추가하는 것은 매우 어렵다. 그러므로 무선센서 네트워크에서 저비용으로 노드의 위치를 정확히 측정하는 것은 매우 중요한 기술이다. 본 연구에서는 위치 측정의 정확성을 높이고, 다수의 센서에 대해서도 정해진 시간 내에 위치를 결정할 수 있는 확장 가능한 상호 협력 위치 측정 시스템을 제안한다. 그리고 시뮬레이션을 통하여 성능, 정확성, 확장성이 우수함을 보였다.