• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.117-125
• /
• 2009

In hybrid wireless networks, a mobile node in MANET can communicate with other mobile nodes as well as nodes in the Internet. Hybrid mobile networks help to expand the application domains of MANET from limited areas, such as military applications to more diverse and general application areas. Previous routing protocols in hybrid wireless networks have not taken advantage of location information of nodes in a network. By using location information of nodes, a routing protocol can reduce the overhead of control messages for efficient network operations. This paper proposes a routing protocol for hybrid mobile networks, called Location-aided AODV+ (LAp) that is based on ADOV+ and takes advantage of node's location information. Performance evaluation shows that LAp performs better than ADOV+ when there are a sufficient number of nodes in a network for route establishments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.23-28
• /
• 2008

In this paper, we propose location-aided cooperative routing protocol (LACARP) for supporting power saving and stable route lifetime in mobile ad-hoc wireless sensor networks. The main ideas and features of the proposed routing protocol are as follows. First, the definition of the area of route search using location-based information to support power saving transmission. Second, the expect zone-based establishment of routing route within the area of route search. Third, the cooperative-aided transmission method. In the operation of data transmission over the established rout the datas are transmitted via both the established route and cooperative route aided by neighbor nodes. The performance evaluation using OPNET(Optimized Network Engineering Tool) shows the LACARP can improve the packet delivery ratio and power saving transmission efficiently.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.101-103
• /
• 2011

E-Health is one of the most promising applications of wireless sensor networks. This paper describes a prototype for e-Health systems. Based on the system, we propose the energy-balanced location-aided routing protocol. The location and energy information of the neighbor Coordinators is collected and stored in the neighbor discovery procedure. And then the Coordinator selects the most suitable neighbor to forward the data. The simulation results show that the proposed protocol has better performance than the three other routing protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1649-1654
• /
• 2017

The route request (RREQ) packet of the GAODV is propagated in a unicast-manner using the location of the destination, but the application of the GAODV is restricted by the assumption for the known destination's location. In this paper, we propose a virtual destination aided GAODV (VDA-GAODV) that alleviates the uncertainty of the destination's location due to the mobility. Instead of the known location of the destination, the VDA-GAODV disseminates a RREQ packet to an imaginary location on the line connecting the source and the destination. We derive an optimal imaginary destination that makes RREQ rebroadcasts cover the possible locations of the destination as much as possible. The VDA-GAODV enables the RREQ propagation to cover 95 % of the one-hop communication area centered at the originally known location of the destination, which is larger than that of the original GAODV by 23 %.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.76-82
• /
• 2007

Recently, researches related MANET are progressing dynamically in points of view which MANET need no additional infra and guarantee node mobility. Node mobility in MANET is becoming more important, as people interest in using Ad hoc network under a concept of node mobility as fast automobile not walking. when nodes move fast, there are many problems headed by high cost for searching destination and routing. To deal with this problems We propose new routing protocol, No path-Location Aided Routing (N-LAR). Our algorithm has a better performance in terms of end-to-end delay, packet delivery ratio in MANET with High mobility.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.266-274
• /
• 2003

One of the major issues in current on-demand routing protocols for ad hoc networks is the high resource consumed by route discovery traffic. In these protocols, flooding is typically used by the source to broadcast a route request (RREQ) packet in search of a route to the destination. Such network-wide flooding potentially disturbs many nodes unnecessarily by querying more nodes than is actually necessary, leading to rapid exhaustion of valuable network resources such as wireless bandwidth and battery power. In this paper, a simple optimization technique for efficient route discovery is proposed. The technique proposed herein is location-based and can be used in conjunction with the existing Location-Aided Routing (LAR) scheme to further reduce the route discovery overhead. A unique feature of our technique not found in LAR and most other protocols is the selective use of unicast instead of broadcast for route request/query transmission made possible by a novel reuse of routing and location information. We refer to this new optimization as the UNIQUE (UNIcast QUEry) technique. This paper studies the efficacy of UNIQUE by applying it to the route discovery of the Dynamic Source Routing (DSR) protocol. In addition, a comparative study is made with a DSR protocol optimized with only LAR. The results show that UNIQUE could further reduce the overall routing overhead by as much as 58% under highly mobile conditions. With less congestion caused by routing traffic, the data packet delivery performance also improves in terms of end-to-end delay and the number of data packets successfully delivered to their destinations.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.47-55
• /
• 2008

본 논문에서는 모바일 ad-hoc 무선 센서 네트워크[1]에서 안정된 경로의 설정 및 설정된 경로의 lifetime 을 효과적으로 지원하여 데이터 전송효율을 향상시키기 위한 협력 도움 라우팅 프로토콜(CARP: Cooperative_Aided Routing Protocol) 을 제안한다. 제안된 라우팅 프로토콜의 기본 아이디어 및 특징은 다음과 같다. 첫째, 소스노드와 목적지 노드 사이의 안정된 라우팅 경로의 설정이다. 본 연구에서는 모바일 노드들의 이동성 정보를 이용한 엔트로피 기반의 안정된 경로 설정방법을 제안 사용한다. 둘째, 협력도움 전송 방법이다[3][4][5]. 설정된 경로 위로 데이터 패킷을 전송 할 때 경로 lifetime과 SNR의 효과적인 지원으로 데이터 전송률을 증가시키기 위해 이웃 노드들로부터 협력 도움을 받는다. 셋째, 기존의 센서 네트워크는 주로 고정된 노드 환경에서 많은 연구가 되어 왔지만, 본 연구에서는 노드들의 이동성을 고려한 환경에서 연구가 이루어진다. 제안된 CARP 의 성능평가는 OPNET(Optimized Network Engineering Tool)을 사용하여 이루어졌으며 성능평가를 통하여 제안한 프로토콜은 안정된 경로의 설정 및 데이터 전송효율을 효과적으로 증가 시킬 수 있음을 알 수 있다.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.7B
• /
• pp.886-891
• /
• 2011

Multicast has been a key routing service for efficient data dissemination in underwater acoustic sensor networks. In sensor networks, there are several multicast routing protocol which reflects sensor network nature. However, existing routing scheme was not targeted at underwater acoustic sensor networks which is hard to provide battery continually. Therefore, a specialized routing algorithm is essential for acoustic sensor networks. In this paper, we propose angle aided multicast routing algorithm for decreasing routing computation complexity, including virtual Euclidean Steiner point. Simulation results show better performance than exist routing Position Based Multicast, Geographic Multicast Routing. such as low computation capability and limited power consumption.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.59-69
• /
• 2005

Ad hoc network is the network which can be considered without a pre-constructed infrastructure, and a mobile node can join the network freely. However, the participation of the mobile nodes to the ad hoc network brings up much burden of re-computation for new routes, because it leads to losing the connection frequently. And, also, it causes serious security problem to be broadcasted wrong information by the malicious user. Therefore, it needs authentication against the mobile nodes. To make that Possible, we have two methods: single CA and distributed CA. In the case of CA method, the wireless network can be collapsed owing to expose the CA, but still the distributed CA method is a little more safe than previous one because it needs attacks toward a lot of CAs to collapse the network We can consider Secret Share scheme as the method that constructs the distributed CA system, but it is weak when the network size is too large. In this paper, we suggest hierarchical structure for the authentication method to solve this problem, and we will show the results of simulation for this suggestion.