• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.189-197
• /
• 2016

Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.4
• /
• pp.43-50
• /
• 2010

Vehicle-to-Vehicle (V2V) is a special type of vehicle ad-hoc network (VANET), and known as a solution to provide communication among vehicles and reduce vehicle accidents. Geographical routing protocols as Greedy Perimeter Sateless Routing (GPSR) are very suitable for the V2V communication due to special characters of highway and device for vehicles. However, the GPSR has problem that appears local maximum by some stale neighbor nodes in the greedy mode of the GPSR. It can lose transmission data in recovery mode, even if the problem is can be solved by the recovery mode of the GPSR. We therefore propose a Greedy Perimeter Reliable Routing (GPRR), can provide more reliable data transmission, to resolve the GPSR problem in the V2V environment. Simulation results using ns-2 shown that the GPRR reveals much better performance than the GPSR by remarkably reducing the local maximum rate in the greedy mode.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.51-54
• /
• 2013

센서 네트워크는 주변의 환경 정보를 수집하여 사용자에게 제공함으로써 지능적인 처리를 가능하게 하는 시스템이다. 센서 네트워크를 구성하는 센서 노드들은 메모리, 연산 능력, 에너지 등 자원 측면에서 제약을 갖고 있으며 무선 통신을 사용하므로 센서 네트워크 환경에서는 각종 보안 위협이 발생할 수 있다. 선택적 전달 공격에서 네트워크 내의 훼손 노드는 자신을 지나는 이벤트 보고서 중 전체 또는 일부를 제거함으로써 중요한 이벤트 정보가 싱크 노드까지 도달하지 못하도록 한다. 선택적 전달 공격을 방어하기 위한 기존 라우팅 기법은 많은 에너지 소비를 유발한다는 단점이 존재한다. 본 논문에서는 지형 기반의 라우팅 프로토콜인 Greedy Perimeter Stateless Routing (GPSR) 프로토콜을 기반으로 선택적 전달 공격 발생 지점을 우회할 수 있는 방법을 제안한다. 제안 기법은 선택적 전달 공격이 발생하는 환경에서 에너지 효율적으로 소스 노드에서 기지 노드까지 이벤트 보고서를 신뢰성 있게 전달하는데 활용될 수 있다.

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

GPSR은 차량간 ad hoc 네트워크에서 위치기반 라우팅을 위하여 개발된 알고리즘이다. GPSR에서의 라우팅은 Greedy Forwarding을 사용하지만 차량 밀도가 높은 VANET환경에서는 한계가 있다. 이러한 한계를 극복하기 위하여 본 논문에서는 새로운 프로토콜을 제안하였다. 본 논문에 제시된 기법은 밀도가 높은 환경과 밀도가 낮은 환경에서의 가중치를 설정하여 current node, next-hop node 그리고 destination node 간의 관계를 반영한 값들을 구하고 그 중에서 최소치 값을 가지는 next-hop을 선택한다. 특히 가중치를 기반으로 하면 차량이 밀집되거나 희박한 환경하에서 GPSR 보다 더 최적화된 경로를 찾아낸다. 성능평가는 수학적 모델과 네트워크 시뮬레이터인 NS를 이용하여 본 모델에 기반한 고속도로 시뮬레이션을 진행하였다. 결과적으로 볼 때, 본 논문에 제시된 기법은 시간 지연 측면에서 GPSR보다 나은 결과를 보여 주었다.

• 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).

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1649-1654
• /
• 1991

In 1995 the VSOP satellite, which is called MUSES-B in Japan, will be launched under the VLBI Space Observatory Programme(VSOP) promoted by ISAS(Institute of Space and Astronautical Science) of Japan. We are now developing the GPS Receiver(GPSR) and On-board Orbit Determination System. This paper describes the GPS(Global Positioning System), VSOP, GPSR(GPS Receiver system) configuration and the results of the GPS system analysis. The GPSR consists of three GPS antennas and 5 channel receiver package. In the receiver package, there are two 16 bits microprocessing units. The power consumption is 25 Watts in average and the weight is 8.5 kg. Three GPS antennas on board enable GPSR to receive GPS signals from any NAVSTARs(GPS satellites) which are visible. NAVSATR's visibility is described as follows. The VSOP satellite flies from 1, 000 km to 20, 000 km in height on the elliptical orbit around the earth. On the other hand, the orbit of NAVSTARs are nearly circular and about 20, 000 km in height. GPSR can't receive the GPS signals near the apogee, because NAVSTARs transmit the GPS signals through the NAVSTAR's narrow beam antennas directed toward the earth. However near the perigee, GPSR can receive from 12 to 15 GPS signals. More than 4 GPS signals can be received for 40 minutes, which are related to GDOP(Geometric Dillusion Of Precision of selected NAVSTARs). Because there are a lot of visible NAVSTARs, GDOP is small near the perigee. This is a favorqble condition for GPSR. Orbit determination system onboard VSOP satellite consists of a Kalman filter and a precise orbit propagator. Near the perigee, the Kalman filter can eliminate the orbit propagation error using the observed data by GPSR. Except a perigee, precise onboard orbit propagator propagates the orbit, taking into account accelerations such as gravities of the earth, the sun, the moon, and other acceleration caused by the solar pressure. But there remain some amount of calculation and integration errors. When VSOP satellite returns to the perigee, the Kalman filter eliminates the error of the orbit determined by the propagator. After the error is eliminated, VSOP satellite flies out towards an apogee again. The analysis of the orbit determination is performed by the covariance analysis method. Number of the states of the onboard filter is 8. As for a true model, we assume that it is based on the actual error dynamics that include the Selective Availability of GPS called 'SA', having 17 states. Analytical results for position and velocity are tabulated and illustrated, in the sequel. These show that the position and the velocity error are about 40 m and 0.008 m/sec at the perigee, and are about 110 m and 0.012 m/sec at the apogee, respectively.

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.2
• /
• pp.213-218
• /
• 2006

In this paper, we evaluate and compare performance between position-based and non-position-based routing protocols in a vehicular ad-hoc network. The protocols evaluated in this paper for many performance evaluation aspects are a position-based routing protocol, GPSR (Greedy Perimeter Stateless Routing), and the non-position-based such as AODV (Ad-hoc On-Demand Distance Vector) and DSR (Dynamic Source Routing) protocols. The three protocol characteristics such as Packet Delivery Ratio, Latency of first packet per connection, and Average number of hops depending on distance are compared and evaluated. As the result of simulation, the AODV performed better than the DSR. However, due to the high mobility characteristic of a vehicular ad-hoc network, GPSR, the position-based routing performs better than the non-position-based routing protocols such as AODV and DSR in a vehicular ad-hoc network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2143-2149
• /
• 2010

An agent based geographic routing protocol is proposed to improve the well-known geographic routing protocol-GPSR routing protocol. In the proposed scheme, the agent is selected by sink node which concern about the source node's position as well as agent candidate's state. So packets will first be forwarded to agent and next step is to be forwarded to their final goal- sink node from agent. During the next hop selection process, nodes select their neighbors by considering not only position but also their average available buffer size. This results in efficient selection of next hop node in congestion area, and then increases the successful packet delivery ratio. The simulation is conducted for two scenarios: general number of connections and large number of connections in our map. Results show that new method with agent achieves improved performance in successful packet delivery ratio when compares to GPSR without our scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.25-31
• /
• 2009

In this paper we propose an improved energy aware greedy perimeter stateless routing protocol (EAGPSR) for wireless ad hoc network. The existing greedy perimeter stateless routine (GPSR) has some problems with overloaded node and void situation. The improved EAGPSR protocol is proposed to remedy these problems. It also gives the solution for the fundamental problem in geographical routine called void communication. It considers two parameters (Residual Energy of battery and distance to the destination) for the next hop selection. In order to use efficiently limited-energy of node in wireless ad hoc network, network lifetime is focused. To evaluate the performance of our protocol we simulated EAGPSR in ns-2. The simulation results show that the proposed protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR) and the existing Energy aware greedy perimeter stateless routing protocol (EAGPSR).