• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.136-146
• /
• 2006

In Wireless Sensor Network(WSN) a sensor node transfers sensing data to the base-node through multi-hop because of the limited transmission range. Also because of the limited energy of the sensor node, the sensor nodes are required to consume their energy evenly to prolong the lifetime of the network. LMPR is a routing protocol for WSN, LMPR configures the network autonomously based on level which is the depth from the base-node, and distributes the transmission and computation load of the network to each sensor node. This paper implements LMPR on TinyOS and experiments on the performance of LMPR in WSN. As the result, the average of the received rate of LMPR is 91.39% and LMPR distributes the load of the transmission and computation about 4.6 times compare to the shortest cost routing protocol. We expect LMPR evenly distributes the transmission and computation load of the network to each node, and the lifetime of the network will be longer than it used to be.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.1
• /
• pp.146-154
• /
• 2007

In this paper, we have presented a real-time transfer mechanism for the delay-sensitive data in WSNs (Wireless Sensor Networks). The existing methods for real-time data transfer select a path whose latency is shortest or the number of hops is least. Although the approaches of these methods are acceptable, they do not always work as efficiently as they can because they had no consideration for the link error rates. In the case of transmission failures on links, they can not guarantee the end-to-end real-time transfer due to retransmissions. Therefore, we have proposed an algorithm to select a real-time transfer path in consideration of the link error rates. Our mechanism estimates the 1-hop delay based on the link error rate between two neighboring nodes, which in turn enables the calculation of the expected end-to-end delay. A source node comes to choose a path with the shortest end-to-end delay as a real-time route, and sends data along the path chosen. We performed various experiments changing the link error rates and discovered that this proposed mechanism improves the speed of event-to-sink data transfer and reduces delay jitter. We also found that this mechanism prevents additional energy consumption and prolongs network lifetime, resulting from the elative reduction of transmission failures and retransmissions.

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.31-40
• /
• 2009

What are important in wireless sensor networks are reliable data transmission, energy efficiency of each node, and the maximization of network life through the distribution of load among the nodes. The present study proposed DSPR, a dynamic unique path routing machanism that considered these requirements in wireless sensor networks. In DSPR, data is transmitted through a dynamic unique path, which has the least cost calculated with the number of hops from each node to the sink, and the average remaining energy. At that time, each node monitors its transmission process and if a node detects route damage it changes the route dynamically, referring to the cost table, and by doing so, it enhances the reliability of the network and distributes energy consumption evenly among the nodes. In addition, when the network topology is changed, only the part related to the change is restructured dynamically instead of restructuring the entire network, and the life of the network is extended by inhibiting unnecessary energy consumption in each node as much as possible. In the results of our experiment, the proposed DSPR increased network life by minimizing energy consumption of the nodes and improved the reliability and energy efficiency of the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4738-4753
• /
• 2018

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.165-170
• /
• 2007

The main goal of research concerning clustering protocols is to minimize the energy consumption of each node and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols mainly focused on the design and formation of clusters, leaving the consideration of communication between the cluster head and the sink behind. In this paper, we propose efficient multi path routing algorithm by using MAC-NET Cross-layering. multi path needed only one tiny packet from sink to setup. In addition proposed algorithm can be used for any cluster-based hierarchical inter-clustering routing algorithm. The simulation results demonstrate that proposed algorithm extended the overall survival time of the network by reducing the load of cluster heads. The performance of proposed algorithm is less affected by the extension of sensing field than other inter-clustering operation.

• YAKHAK HOEJI
• /
• v.52 no.5
• /
• pp.331-344
• /
• 2008

Recently, the FDA (Food and Drug Administration) of the United States and many advanced countries remark biomarkers and surrogate endpoints as a critical path tool on model based drug development. Economic, technical and social profit on model based drug development like a reduction of the length of research and development have been achieved. Therefore we summarize previous studies about biomarkers and surrogate endpoints and suggest a development direction of therapeutic agents. In diabetes mellitus (DM) and osteoporosis, there are remarkable increases in number of patients and most of patients take medicine during their whole lifetime. For this reason, many patients with DM and osteoporosis have a tolerance on their medicine. We expect that research and development on biomarkers and surrogate endpoints will contribute to new drug development on DM and osteoporosis. Biomarkers for DM are blood levels of glucose, insulin, ${HbA}_{1c}$, CRP, alpha-glucosidase, adiponectin and DPP-4. Among these, validated surrogate endpoints for DM are blood levels of glucose, insulin and ${HbA}_{1c}$ Biomarkers for osteoporosis are BMD, BMC, trabecular volume, ICTP, DPD, osteocalcin, the activity of osteoclast and production of osteoblast. The validated surrogate endpoints for osteoporosis are BMD only. This review summarizes all suggested biomarkers and surrogate endpoints in DM and osteoporosis. The biomarkers are classified by drugs, and the method of validation for surrogate endpoints is suggested. This information would contribute to suggest a direction of DM and osteoporosis therapeutic agent development.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.839-842
• /
• 2011

Lately Various researches on energy harvesting techniques for wireless sensor networks have been performed to overcome the power limitation of sensor nodes. In wireless sensor networks with harvesting techniques, sensor nodes exploit environmental energy, such as solar or wind energy, as the power sources of the nodes. Existing energy constrained environment routing protocols may not be suitable for energy harvesting based wireless sensor networks because they do not consider the accumulated energy from harvesting devices. In addition, the paths which aren't dispersed shorten the network lifetime. Therefore, in this paper, the algorithm that the path between each node is dispersed is proposed. In case of using the algorithm to be proposed through the simulator it showed that path of the node is variously reflected.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.189-196
• /
• 2010

The LEACH does not use flooding method for data transmission and this makes low power consumption. So performance of the WSN is increased. On the other hand, QoS based algorithm which use restricted flooding method in WSN also achieves low power consuming rate by reducing the number of nodes that are participated in routing path selection. But when the data is delivered to the sink node, the LEACH choose a routing path which has a small hop count. And it leads that the performance of the entire network is worse. In the paper we propose a QoS based energy efficient clustering and routing algorithm in WSN. I classify the type of packet with two classes, based on the energy efficiency that is the most important issue in WSN. We provide the differentiated services according to the different type of packet. Simulation results evaluated by the NS-2 show that proposed algorithm extended the network lifetime 2.47 times at average. And each of the case in the class 1 and class 2 data packet, the throughput is improved 312% and 61% each.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.1-7
• /
• 2022

IoT technology that utilizes wireless body area networks (WBAN) and biosensors is an important field in the health industry to minimize resources and monitor patients. In order to integrate IoT and WBAN, a cooperative protocol that constitutes WBAN's limited sensor nodes and rapid routing for efficient data transmission is required. In this paper we propose an we propose an energy efficient and cooperative link energy-efficient routing strategy(LEERS) to solve the problems of redundant data transmission detection and limited network sensor lifetime extention. The proposed scheme considers the hop count node congestion level towards the residual energy sink and bandwidth and parameters. In addition, by determining the path cost function and providing effective multi-hop routing, it is shown that the existing method is improved in terms of residual energy and throughput