• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.208-216
• /
• 2007

Wireless Sensor Networks (WSNs) are characterized by low capacity on each nodes and links. Wireless links have high bit error rate (BER) parameter that changes frequently due to the changes on network topology, interference, etc. To guarantee reliability in an error-prone environment, a retransmission mechanism can be used. In this mechanism, the number of retransmissions is used as a parameter that controls reliability requirement level. In this paper, we propose an Error Adaptive Transport Protocol (EATP) for WSNs that updates the number of retransmissions regularly to guarantee reliability during bit error rate changes as well as to utilize energy effectively. The said algorithm uses local information, thus, it does not create overhead problem.

• International Journal of Internet, Broadcasting and Communication
• /
• v.7 no.1
• /
• pp.30-35
• /
• 2015

The most important factor within the wireless sensor network is to have effective network usage and increase the lifetime of the individual nodes in order to operate the wireless network more efficiently. Therefore, many routing protocols have been developed. The LEACH protocol presented by Wendi Hein Zelman, especially well known as a simple and efficient clustering based routing protocol. However, because LEACH protocol in an irregular network is the total data throughput efficiency dropped, the stability of the cluster is declined. Therefore, to increase the stability of the cluster head, in this paper, it proposes a stochastic cluster head selection method for improving the LEACH protocol. To this end, it proposes a SH-LEACH (Stochastic Cluster Head Selection Method-LEACH) that it is combined to the HEED and LEACH protocol and the proposed algorithm is verified through the simulation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.248-256
• /
• 2009

In this paper, under saturated traffic condition in a single-hop wireless sensor network, we present an analytic model that evaluates the performance of asynchronous MAC protocol which uses a preamble technique. Our model considers the impact of several important factors such as sleep cycle, the backoff mechanism and the number of contending nodes. After obtaining the cumulative backoff time of a sending node and expected delay of a receiving node, an iterative algorithm is presented for calculating the performance measures such as expected energy consumption usage per packet and latency. Simulation results show that the proposed analytic model can accurately estimate the performance measures under saturated traffic conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.147-161
• /
• 2012

In recent years, machine-to-machine (M2M) communications are under rapid development to meet the fast-increasing requirements of multi-type wireless services and applications. In order to satisfy M2M communications requirements, heterogeneous networks convergence appears in many areas, i.e., mobile cellular networks (MCNs) and wireless sensor networks (WSNs) are evolving from heterogeneous to converged. In this paper, we introduce the system architecture and application requirement for converged MCN and WSN, where mobile terminals in MCN are acting as both sensor nodes and gateways for WSN. And then, we discuss the joint optimization of converged networks for M2M communications. Finally, we discuss the technical challenges in the converged process of MCN and WSN.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1722-1729
• /
• 2008

This paper describes the contents about the efficient routing technique for improvement of transmission in Wireless Sensor Networks. Existing flat-based routing protocols have several problems like data overlap and implosion. Gossiping Algorithm in WSN is able to reduce the overhead and transmit packets through already set up the path but it takes place the data delivery and problem of worst-case. In this paper, we try to solve two problems that are data delivery and worst-case by selecting neighbor nodes using RSSI and number of linkage. The proposed model is available to real-mote and we confirmed the improvement of the performance against existing models.

• Journal of Information Processing Systems
• /
• v.13 no.5
• /
• pp.1320-1330
• /
• 2017

Wireless sensor networks for forest monitoring are typically deployed in fields in which manual intervention cannot be easily accessed. An interesting approach to extending the lifetime of sensor nodes is the use of energy harvested from the environment. Design constraints are application-dependent and based on the monitored environment in which the energy harvesting takes place. To reduce energy consumption, we designed a power management scheme that combines dynamic duty cycle scheduling at the network layer to plan node duty time. The dynamic duty cycle scheduling is realized based on a tier structure in which the network is concentrically organized around the sink node. In addition, the multi-paths preserved in the tier structure can be used to deliver residual packets when a path failure occurs. Experimental results show that the proposed method has a better performance.

• Journal of Korea Multimedia Society
• /
• v.21 no.11
• /
• pp.1288-1296
• /
• 2018

PBS(Pairwise Broadcast Synchronization) is a well-known synchronization scheme for WSN(Wireless Sensor Networks). As PBS needs the set of node-pairs for network-wide synchronization by over-hearing, GPA(Group-Wise Pair Selection Algorithm) was also proposed after PBS. However, GPA is complex and requires too many message transmissions, leading to much power consumption. Besides, GPA is not appropriate to topology change or mobile wireless sensor networks. So, we propose a new and energy-efficient pair-node selection algorithm for PBS. The proposed scheme's performance has been evaluated and compared with GPA by simulation. The results are shown to be better than GPA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.5
• /
• pp.662-665
• /
• 2020

Energy Efficiency in any WSN (Wireless Sensor Network) is a critical issue to elongate the life of the batteries equipped in sensors. LEACH(Low Energy Adaptive Clustering Hierarchy) is one of the mostly used routing algorithms which reduce the amount of transmitted data and save the energy in the network. In this paper, a new technique to select channels in routing algorithms is suggested and compared with the LEACH, ALEACH and PEGASIS. This technique forms clusters depending upon the node density as the deployement of the nodes is random. As a result, the proposed algorithm presents the better performance of the energy efficiency than those of the current algorithms.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.1016-1018
• /
• 2010

무선 센서 네트워크(Wireless Sensor Network)는 유비쿼터스 컴퓨팅 구현을 위한 기반 네트워크로 초경량, 저전력의 센서들로 구성된 무선 네트워크이다. 센서노드에서 센싱된 데이터는 싱크노드에 의하여 수집되어 사용자에게 제공된다. 이런 환경에서 서비스마다 다른 정보교환 방법을 사용하는 것은 사용자들에게 불편함을 주므로 사용자와 서비스 간의 원활한 정보공유 및 교환방법을 위한 표준화된 식별 체계가 필요하다.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.837-840
• /
• 2010

Wireless Sensor Networks have been proposed for several location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point to point distance estimates. Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we proposed a Coefficient Allocated DV-Hop (CA DV-Hop) algorithm which reduces node's location error by awarding a credit value with respect to number of hops of each anchor to an unknown node. Simulation results have verified the high estimation accuracy with our approach which outperforms the classical DV-Hop.