• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.703-712
• /
• 2015

This paper proposes the UIGRP, which can tackle the problem of the network disconnection and packet transmission delay caused by turning vehicles frequently in an urban intersection. The UIGRP was designed as follows. First, it calculates the direction of vehicles using the moving direction of vehicles and the location of a destination. Second, it makes the RSU measure the density of an urban intersection. Third, the TGF Algorithm in the UIGRP decides the data transmission paths by setting as an intermediate node, not only the vehicle that is moving in the direction where a destination node is located, but also the node that has the highest density. The TGF algorithm using a moving direction and density minimizes or removes the occurrence of local maximum problems that the existing Greedy Forwarding algorithm has. Therefore, the simulation result shows that UIGRP decreases the occurrence of local maximum problems by 3 and 1 times, and the packet transmission time by 6.12 and 2.04(ms), and increases the success rate of packet transmission by 15 and 3%, compared to the existing GPSR and GPUR.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.12
• /
• pp.1184-1191
• /
• 2009

Energy harvesting from environment can make the energy constrained systems such as sensor networks to sustain their lifetimes. However, environmental energy is highly variable with time, location, and other factors. Unlike the existing solutions, we solved this problem by allowing the sensor nodes with mobilizer to move in search of energy and recharge from remote energy station. In this paper we present and analyze a new harvesting aware framework for mobile sensor networks with remote energy station. The framework consists of energy model, motion control system and data transfer protocol. Among them, the objective of our data transfer protocol is to route a data packet geographically towards the target region and at the same time balance the residual energy and the link connectivity on nodes with energy harvesting. Our results along with simulation can be used for further studies and provide certain guideline for realistic development of such systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.321-325
• /
• 2008

Void areas(holes) as an inevitable phenomenon exist in geographic routing of wireless sensor networks, because the unpredictable and harsh nature application environment or uneven energy consumption. Most of the existing schemes for the issue tend to construct a static detour path to bypass a hole. The static detour path may lead to uneven energy consumption of the nodes on the perimeter of the hole; thus it may enlarge the hole. At the same time, traffic would concentrate on the peripheral node of the hole; thus the nodes on the perimeter of the hole tend to be depleted quietly. In previous work, we have proposed a hole geometric model to reduce the energy consumption and packet collisions of the nodes on the hole boundary. This scheme, however, still has the static detour path problem. Therefore, we extend the previous work by constructing a dynamic detour path hole geometric model for wireless sensor networks in this paper. The location of hole detour anchors is dynamically shifted according to Gaussian function, just generating dynamic hole detour paths.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.139-145
• /
• 2009

Recently P2P (Peer-to-Peer) networks and applications have been expanded to various field. However, because the construction of P2P network did not influence a underlying network topology or property, it may be inefficient. Especially, this inefficiency is more serious in MANET because MANET has narrow bandwidth and energy constraint. When we use a proactive routing protocol in MANET, we can know hop counts between two nodes. And, we can construct a P2P overlay network using this hop count information. However, In case of using hop count only, we can avoid a interference path selection problem and a zig-zag problem. We propose a method of improving P2P contents distribution using virtual positions. We calculate virtual positions from hop counts using the trigonometry. This method solves a interference path selection problem and a zig-zag problem. This method also allows a P2P network to influence underlying network topology. We adopt this method to a network which uses a virtual geographic routing, a proactive routing protocol, or a reactive routing protocol. We show that our proposed methods improve P2P contents distribution performance over MANET through a simulation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.325-336
• /
• 2005

Mobile ad hoc networks (MANET) are composed of moving wireless hosts which, within range of each other, form wireless networks. For communication to occur between hosts that are not within each other's range, routes involving intermediate nodes must be established; however, since the hosts may be in motion, a host that was part of a route may move away from its upstream and downstream partners, thus breaking the route. In this paper, we propose anticipated route maintenance (ARM) protocol with two extensions to route discovery based routing scheme: Extend the route when nodes on a link move apart from each other and they have common neighbor that can be 'inserted' in the path, and shrink route when a node discovers that one of its neighbor which is not the next hop is also on the same route several hops later on. By utilizing only local geographic information (now a part of some route finding algorithms), a host can anticipate its neighbor's departure and, if other hosts are available, choose a host to bridge the gap, keeping the path connected. We present a distributed algorithm that anticipates route failure and performs preventative route maintenance using location information to increase a route lifespan. The benefits are that this reduces the need to find new routes (which is very expensive) and prevents interruptions in service. As the density of nodes increases, the chance to successfully utilize our route maintenance approach increases, and so does the savings. We have compared the performance of two protocols, pure dynamic source routing (DSR) protocol and DSR with ARM. The simulation results show how ARM improves the functionality of DSR by preventing the links in the route from breaking. Packets delivery ratio could be increased using ARM and achieved approximately $\100%$ improvement. The simulations clarify also how ARM shows a noticeable improvement in dropped packets and links stability over DSR, even though there is more traffic and channel overhead in ARM.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.3
• /
• pp.316-320
• /
• 2008

Data dissemination schemes for wireless sensor networks, where sinks and event targets might be mobile, has been one of the active research fields. For doing that, stationary nodes gathered data on behalf of mobile sinks and the relayed data in previous studies. their schemes, however, lead to frequent query flooding and report congestion problems over sink moving. We propose a data dissemination protocol to solve both the query flooding and the report congestion problem. Our scheme improves the two shortcomings through sink location management. Finally, we prove effectiveness of our protocol through computer simulations.