• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.871-878
• /
• 2004

Recenty, there has been great interest in MANET from various areas. In this paper we focus on performance analysis of on demand routing protocols surf as DSR, AODV, and TORA in MANET. We have conducted several simulations concerned with application service data such as sensor, text. voice, and video data. And then, we have evaluated the performance of three protocols in a pre-designed ad hoc network, which is consisted of 20 nodes. As a result, we have obtained quantitative data for packet delivery fraction, average end to-end delay, routing load, channel utilization from upper layer and supportable routing protocol for application service data. The results can be used for designing specific-purposed ad-hoc networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.365-368
• /
• 2008

This paper presents a new concept of IP-based wireless sensor networks and also introduces a routing protocol that is based on clustering for global healthcare information system. Low-power wireless personal area networks (LoWPANs) conform the standard by IEEE 802.15.4-2003 to IPv6 that makes 6lowpan. It characterized by low bit rate, low power, and low cost as well as protocol for wireless connections. The 6lowpan node with biomedical sensor devices fixed on the patient body area network that should be connected to the gateway in personal area network. Each 6lowpan nodes have IP-addresses that would be directly connected to the internet. With the help of IP-address service provider can recognize or analysis patient biomedical data from anywhere on globe by internet service provider equipments such as cell phone, PDA, note book. The system has been evaluated by technical verification, clinical test, user survey and current status of patient. We used NS-2.33 simulator for our prototype and also simulate the routing protocols. The result shows the performance of biomedical data packets in multi-hope routing as well as represents the topology of the networks.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.10
• /
• pp.269-276
• /
• 2021

Recently, smart sensors are used in various environments, and the implementation of ad-hoc sensor networks (ASNs) is a hot research topic. Unfortunately, traditional sensor network routing algorithms focus on specific control issues, and they can't be directly applied to the ASN operation. In this paper, we propose a new routing protocol by using the Q-learning technology, Main challenge of proposed approach is to extend the life of ASNs through efficient energy allocation while obtaining the balanced system performance. The proposed method enhances the Q-learning effect by considering various environmental factors. When a transmission fails, node penalty is accumulated to increase the successful communication probability. Especially, each node stores the Q value of the adjacent node in its own Q table. Every time a data transfer is executed, the Q values are updated and accumulated to learn to select the optimal routing route. Simulation results confirm that the proposed method can choose an energy-efficient routing path, and gets an excellent network performance compared with the existing ASN routing protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.127-132
• /
• 2008

Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.199-204
• /
• 2008

Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.96-98
• /
• 2014

Wireless Sensor Network(WSN) is a wireless real-time information(Acquired from the sensor nodes that have the computing power and wireless communication capabilities.) collected, and to take advantage of processing techniques. Currently it is very diverse, such as environmental monitoring, health care, security, smart home, smart grid applications is that. Thus it is required in the wireless sensor network, the algorithm for the efficient use of the limited energy capacity. Suggested by the algorithm for selecting a cluster head node for a hybrid type and clustered, by comparing the amount of energy remaining and a connection between the nodes In this paper, we aim to increase efficiency and accuracy of the wireless sensor network.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.11-15
• /
• 2018

The application of Wireless Sensor Networks requires a wise utilization of limited energy resources. Therefore, a wide range of routing protocols with a motivation to prolong the lifetime of a network has been proposed in recent years. Hierarchical clustering based protocols have become an object of a large number of studies that aim to efficiently utilize the limited energy of network components. In this paper, the effect of mismatch in parameter estimation is discussed to evaluate the robustness of a distanced based algorithm called distributed clustering protocol in homogeneous and heterogeneous environment. For quantitative analysis, performance simulations for this protocol are carried out in terms of the network lifetime which is the main criteria of efficiency for the energy limited system.

• Journal of information and communication convergence engineering
• /
• v.19 no.3
• /
• pp.136-141
• /
• 2021

Research on wireless sensor networks has focused on the monitoring and characterization of large-scale physical environments and the tracking of various environmental or physical conditions, such as temperature, pressure, and wind speed. We propose a stochastic mobility model that can be applied to a MANET (Mobile Ad-hoc NETwork). environment, and apply this mobility model to a newly proposed clustering-based routing protocol. To verify its stability and durability, we compared the proposed stochastic mobility model with a random model in terms of energy efficiency. The FND (First Node Dead) was measured and compared to verify the performance of the newly designed protocol. In this paper, we describe the proposed mobility model, quantify the changes to the mobile environment, and detail the selection of cluster heads and clusters formed using a fuzzy inference system. After the clusters are configured, the collected data are sent to a base station. Studies on clustering-based routing protocols and stochastic mobility models for MANET applications have shown that these strategies improve the energy efficiency of a network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.942-949
• /
• 2016

Efficient routing protocols designed for Wireless Sensor Networks (WSN) can be extended and applied to Internet of Things (IoT) data routing, as IoT can be considered to be an extension from WSN. When the size of the data in IoT is often bigger than in conventional WSNs, existing cluster routing protocol such as LEACH may cause high data loss rate due to its incomplete load balancing. We present an enhanced LEACH-based protocol which can minimize the data loss which is an important performance measure in IoT. In our proposed protocol, the base station estimates the location of nodes by the trilateration technique to make sure optimal number of cluster heads and members in a deterministic manner. We evaluate our proposed protocol via computer simulations in terms of data loss rate and average network lifetime.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.7
• /
• pp.495-499
• /
• 2009

An underlying assumption in geographic routing protocols, periodic position exchange among neighbors has two problems: (1) unnecessary energy consumptions of nodes in regions without data delivery and (2) position invalidation of neighbors in forwarding data. Hence, this paper proposes an on-demand geographic routing protocol in mobile wireless sensor networks. The proposed protocol make a sender acquire position information of only necessary neighbors to reduce energy consumption in data forwarding time and determine an optimal node among them as a receiver for relaying data to a destination by considering their mobility. Simulation results show that the proposed protocol is more efficient than an existing geographic routing protocol.