• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.1
• /
• pp.63-71
• /
• 2013

In order to support mobility for sink groups, it is important to get the current location of a mobile sink group and then to offer the location to a source. Typically, previous works calculate a region including all member sinks by flooding; then, it notifies this region information to a source. However, flooding and location updates are periodically performed regardless of the group movement so that it causes considerable control overhead. In this paper, we propose an energy-efficient scheme supporting mobile sink groups. The proposed scheme obtains a location of a group without flooding. It exploits the inherent property of mobile sink groups which could approximate entire group movement by only partial member sinks movement. Also, the scheme learns group location by back-propagation learning method through exploiting overhearing feature in wireless communication environment. Our simulation studies show that the proposed scheme significantly improves in terms of energy consumption compared to the previous work.

• Journal of Korea Multimedia Society
• /
• v.16 no.9
• /
• pp.1077-1088
• /
• 2013

As broadcasting is the process that a node sends a packet to all nodes in the network. it is basic process used for discovering of a routes to a node and disseminating of control information message in Mobile Ad hoc NETwork (MANET). In this paper, we propose dynamically adjusted probabilistic mechanism based on distance ratio and node density for broadcasting in MANETs. The distance ratio can be calculated as the ratio of the radio strength length to the distance from sender of a node, and node density can be get from 1-hop nodes of neighbours. A mobile node receiving broadcast packets determines the probability of rebroadcasting considering distance ratio and node density of itself. Rebroadcast probability will be set as low value to a node which is located in nearby area of sender and has high 1-hop node density, So it reduces packets transmission caused by the early die-out of rebroadcast packets. Compared with the simple flooding and fixed probabilistic flooding by simulation, our approach shows better performances results. Proposed algorithm can reduce the rebroadcast packet delivery more than 30% without scanting reachability, where as it shows up to 96% reachability compared with flooding.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.213-220
• /
• 2008

In a distributed processing environment composed of many independent systems connected by networks, it is very important and difficult to make time synchronization between the systems. Especially in the USN environment the time synchronization is still more difficult than in general distributed processing environment because energy is limited and communication function is feeble. Even though of these difficulties, the USN environment requires higher precision of time synchronization. We of the typical applications requesting very strict time synchronization in USN is TDMA MAC. This paper proposes and evaluates a new time synchronization protocol HTSP(Hierarchical Time Synchronization Protocol) which is an advanced version of the FTSP(Flooding Time Synchronization Protocol) published recently. The time synchronization precision of the HTSP is equal to that of the FTSP, but the energy consumption of the HTSP is lower than that of the FTSP owing to the reduced number of broadcast messages. The simulation results show that the energy consumption of the HTSP is only 74% of that of the FTSP.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.62-66
• /
• 2008

In this paper we have proposed a power aware location based routing protocol for wireless ad hoc network. The existing greedy perimeter stateless routing (GPSR) has some problems which are certain node overloaded and void situation. The proposed power aware greedy perimeter stateless routing (PAGPSR) protocol gives a solution for these problems in GPSR. PAGPSR uses power aware and geographically informed neighbor selection to route a packet towards the destination. It also gives a solution for the fundamental problem in geographical routing called communication void. It considers residual energy of battery and distance to the destination for the next hope node selection. When it encounters a void it starts limited-flooding to select next hop node. To evaluate the performance of our protocol we simulated PAGPSR in ns-2. Our simulation results show that our protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.4
• /
• pp.482-487
• /
• 2008

In case of flooding, the underwater flight vehicle (UFV) executes the blowing by blowing ballast tanks off using high pressure air (HPA), while it also uses control planes and a propulsion unit to reduce the overshoot depth caused by a flooding and blowing sequence. However, the conventional whole HPA blow-off method lets the body on the surface after blowing despite slight flooding. This results in the unnecessary mission failure or body exposure. Therefore, it is necessary to keep the body at the near surface by the blowing control while reducing the overshoot depth. To solve this problem, an adaptive blowing control algorithm, which is based on the decomposition method expanding the expert knowledge in depth control and the adaptive method using fuzzy basis function expansion (FBFE), is proposed. To verify the performance of the proposed algorithm, the blowing control of UFV is performed. Simulation results show that the proposed algorithm effectively solves the problems in the UFV blowing control system online.

• Journal of Navigation and Port Research
• /
• v.37 no.4
• /
• pp.409-418
• /
• 2013

On the assumption of the rise of sea level, the inundation vulnerabilities on coastal areas of Korea are evaluated in different ways. The propose of this study is to find out the influences of sea level rise caused by global warming at Young-do coastal area, and to suggest the prevention schemes against the flooding damage caused by the sea level rise. The potential rates of sea level rise are assumed and with these rates the inundation vulnerabilities are simulated using CAD program. With the virtual maps, as the results of the previous CAD simulation, this study attempts to suggest the flood prevention schemes for each sector of damage-expected coastal area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6A
• /
• pp.600-610
• /
• 2010

In this paper, a multicast mechanism is proposed for intermittently disconnected networks where the nodes move forward in formation or within a limited area. The proposed scheme extends the well-known tree-based multicast routing mechanism called MAODV by modifying the tree construction and data delivery scheme. Especially, an algorithm is introduced which determines the flooding hop count k estimating the degree of the movement of children in the tree. The performance evaluation was done by the simulation and the proposed scheme was compared with MAODV and two multicast routing schemes for DTN (Disruption Tolerant Network) including the Epidemic routing and ST-multicast. The evaluation results show that our scheme improves the original MAODV from the aspect of tree reconstruction events and message delivery ratio. Compared with the Epidemic routing scheme, our scheme achieves 85% message delivery ratio with less than 50% message delivery overhead.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.197-203
• /
• 2011

Ad-hoc networks do not rely on a preexisting infrastructure such as Access Points(AP) in wireless network infrastructure. Instead each node participates in routing by forwarding data for other nodes. It makes required broadcasting to transmit packets to the whole network. In that part, each node tries to transmit data without any information about the other nodes. Therefore it causes duplication of transmission and waste of power. This paper presents adaptive probabilistic broadcasting schemes based on packet reception counts to alleviate the broadcast storm problem for wireless ad hoc networks. In this algorithm, each node calculates efficiency broadcast probability. Simulation results for the proposed flood algorithm are also presented.

• KIEAE Journal
• /
• v.15 no.1
• /
• pp.89-95
• /
• 2015

The centralized power supply system and rainwater treatment system, which are major infrastructure in modern cities, are showing their limitations in accommodating environment load due to climate changes that has aggravated recently. As a result, complex issues such as shortage of reserve power and urban flooding have emerged. As a single solution, decentralized systems such as a model integrating photovoltaic system and rooftop greening system are suggested. When these two systems are integrated and applied together, the synergy effect is expected as the rooftop greening has an effect of preventing urban flooding by controlling peak outflow and also reduces ambient temperature and thus the surface temperature of solar cells is lowered and power generation efficiency is improved. This study aims to compare and analyze the monitoring results of four algorithms that define correlations between micro-climate variables around rooftop greening and the surface temperature of solar cells and generate their significance. By doing so, this study seeks to present an effective algorithm that can estimate the surface temperature of solar cell that has direct impact on the efficiency of photovoltaic power generation by observing climate variables.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.371-378
• /
• 2010

In this paper, we propose a new energy-efficient routing algorithm for sensor networks that selects a least energy consuming path among the paths formed by node with highest remaining energy and provides long network lifetime and uniform energy consumption by nodes. The pair distribution of the energy consumption over all the possible routes to the base station is one of the design objectives. Also, an alternate route search mechanism is proposed to cope with the situation in which no routing information is available due to lack of remaining energy of the neighboring nodes. Simulation results show that our algorithm extends the network lifetime and enhances the network reliability by maintaining relatively uniform remaining energy distribution among sensor nodes.