• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.767-768
• /
• 2006

In this paper we propose a new routing protocol, which takes residue energy of nodes into account in order to prevent node failures resulting from energy shortage. Our routing protocol examines the smallest value of node residue energy ($E_m$) from each of all possible routing paths and selects the path which has the largest value of $E_m$. We prove, through simulation, that our routing protocol extends the lifetime of nodes which have limited amount of energy, reducing chances of path replacement. It is also shown that our proposed protocol helps alleviate network performance degradation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.469-477
• /
• 2008

The standard routing protocol of MANET(Mobile Ad-hoc NETwork), AODV(Ad-hoc On-demand Distance Vector), only considers the shortest path for routing, which may cause traffic concentration to a node at the critical path. Hence, the battery of the node will be dissipated rapidly to reduce the lifetime of the whole network. In this paper, power dissipation considered AODV is proposed for fair energy distribution in MANET, and verified using the computer simulation.

• Smart Structures and Systems
• /
• v.14 no.4
• /
• pp.617-641
• /
• 2014

The energy constraint is still a common issue for the practical application of wireless sensors, since they are usually powered by batteries which limit their lifetime. In this paper, a practical compound energy efficiency strategy is proposed and realized in the implementation of a real time wireless sensor platform. The platform is intended for wireless structural monitoring applications and consists of three parts, wireless sensing unit, base station and data acquisition and configuration software running in a computer within the Matlab environment. The high energy efficiency of the wireless sensor platform is achieved by a proposed adaptive radio transmission power control algorithm, and some straightforward methods, including adopting low power ICs and high efficient power management circuits, low duty cycle radio polling and switching off radio between two adjacent data packets' transmission. The adaptive transmission power control algorithm is based on the statistical average of the path loss estimations using a moving average filter. The algorithm is implemented in the wireless node and relies on the received signal strength feedback piggybacked in the ACK packet from the base station node to estimate the path loss. Therefore, it does not need any control packet overheads. Several experiments are carried out to investigate the link quality of radio channels, validate and evaluate the proposed adaptive transmission power control algorithm, including static and dynamic experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.116-122
• /
• 2009

Mobile Wireless Sensor Network is an organized collection of sensor nodes and mobile sink nodes, in which the sensor node transmits the signal to the sink node. In real environment, there are many cases in which sinks have mobility caused by the people, the vehicle and etc. Since all nodes in the sensor networks have limited energy, many researches have been done in order to prolong the lifetime of the entire network. In this paper we propose Dynamic Local Update-based Routing Protocol(D-LURP) that prolong the lifetime of the entire network to efficiently maintain frequent location update of mobile sink static sensor nodes in Mobile WSNs. When the sink node moves out of the local broadcasting area the proposed D-LURP configures dynamically the local update area consisted of the new local broadcasting area and the previous dissemination node(DN) and find the path between the DN and the sink node, instead of processing a new discovering path like LURP. In this way the processing of broadcasting sink node's location information in the entire network will be omitted. and thus less energy will be consumpted. We compare the performances of the proposed scheme and existing Protocols.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.216-220
• /
• 2008

Sensor nodes in wireless network have several limitations such as lack of energy resource and network bandwidth. There are many researches to extend lifetime of sensor network and enhance availability. However, most of the previous researches didn't consider the mobile sink node. Those researches aren't suitable in the environment having mobile sinks. In this paper. we propose a scheme that reduces communication overheads and energy consumptions and improves reliability in routing path setup. Proposed scheme has excellent scalability without degrading performance in environment where many sink nodes exist and/or the network size is huge. Proposed scheme saves the energy consumption up to 70% in comparison with the previous grid-based and cluster-based protocol. As a result, proposed scheme increases the lifetime of sensor network and enhances availability of wireless sensor network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.21-29
• /
• 2010

In Ad-Hoc Networks, the limited energy is the key issue for longer network operation time. To solve this problem, various energy-aware routing techniques have been proposed including PSR (Power-aware Source Routing), HPSR (Hirachical Power-aware Source Routing), and etc. Those techniques generally select the most adequate route considering the energy consumption so that the energy efficiency can be improved. However, There are problems in those techniques that traffic can be concentrated in some specific area in a network. In this paper, a new energy aware routing technique called MPSR is proposed to achieve longer network lifetime and fewer rerouting attempts.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.677-683
• /
• 2006

If a node stops functioning in an ad-hoc wireless network, routing paths involving the node will also fail, when construction of replacement routes is required. A major cause of node failure is energy exhaustion, and route replacements may in turn lead to successive node failures by making more nodes consume their energy. The result could be performance degradation of networks. Therefore it is important to ensure that nodes with limited remaining energy are not included in route construction from the beginning. In this paper we propose a new routing protocol, which takes residue energy of nodes into account in order to prevent node failures resulting from energy shortage. Our routing protocol examines the smallest value of node residue energy ($E_{m}$) from each of all possible routing paths and selects the path which has the largest value of $E_{m}$. We prove, through simulation, that our routing protocol extends the lifetime of nodes which have limited amount of energy, reducing chances of path replacement. It is also shown that our proposed protocol helps alleviate network performance degradation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.453-461
• /
• 2010

A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.155-163
• /
• 2007

In this paper, Though sensors of Ubiquitous Middle-ware System based on RFID/USN can usually be reacted from six mouths to two years, they can be exhausted their power of storage battery only one day by communication rates and ranges. That is, the lifetime of sensor node is depended on how much spending power under wireless communication that can communicate its sensing data to its destination. Therefore, it is necessary that each sensor should be designed the Routing path to its destination, in order to remote collecting data. But, in order to improve lifetime of sensor node and modify inner setting, it is opposite to simple searching path method of sensor node by entering external commands. accordingly, 1:n sensor arrangement of n form command and data send-receive that is possible simulation do without interference other sensors and research to different sensor data analysis and conversion ways to convert Sensing data that accept from sensors to actuality information.