• 전기학회논문지
• /
• 제65권12호
• /
• pp.2218-2224
• /
• 2016

Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제3권4호
• /
• pp.97-106
• /
• 2014

본 논문에서는 분산 무선인지 네트워크 환경에서 단일 홉 적용을 위하여 제안된 CR MAC 프로토콜들을 MANET 라우팅 프로토콜에 적용하기 위한 설계 방법을 제안한다. 고려하는 CR MAC 프로토콜들은 Opportunistic MAC (O-MAC)과 Opportunistic Periodic MAC (OP-MAC)이고, MANET 라우팅 프로토콜로서는 AODV를 사용한다. 이들은 OPNET을 사용하여 구현하였으며, O-MAC과 OP-MAC의 MAC 환경에서의 성능과 AODV를 적용하였을 때의 성능을 비교한다. 이를 통하여 단일 홉의 DCRN 환경을 기반으로 설계된 무선인지 MAC 프로토콜의 성능과 AODV 적용시의 성능의 관계를 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.2020-2037
• /
• 2017

In order to improve the energy efficiency of n-Epidemic routing protocol in opportunistic networks, in which a stable end-to-end forwarding path usually does not exist, a novel adjustment strategy for parameter n is proposed using learning atuomata principle. First, nodes dynamically update the average energy level of current environment while moving around. Second, nodes with lower energy level relative to their neighbors take larger n avoiding energy consumption during message replications and vice versa. Third, nodes will only replicate messages to their neighbors when the number of neighbors reaches or exceeds the threshold n. Thus the number of message transmissions is reduced and energy is conserved accordingly. The simulation results show that, n-Epidemic routing protocol with the proposed adjustment method can efficiently reduce and balance energy consumption. Furthermore, the key metric of delivery ratio is improved compared with the original n-Epidemic routing protocol. Obviously the proposed scheme prolongs the network life time because of the equilibrium of energy consumption among nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3064-3094
• /
• 2018

Currently, the Underwater Sensor Networks (UWSNs) is mainly an interesting area due to its ability to provide a technology to gather many valuable data from underwater environment such as tsunami monitoring sensor, military tactical application, environmental monitoring and many more. However, UWSNs is suffering from limited energy, high packet loss and the use of acoustic communication. In UWSNs most of the energy consumption is used during the forwarding of packet data from the source to the destination. Therefore, many researchers are eager to design energy efficient routing protocol to minimize energy consumption in UWSNs. As the opportunistic routing (OR) is the most promising method to be used in UWSNs, this paper focuses on the existing proposed energy efficient OR protocol in UWSNs. This paper reviews the existing proposed energy efficient OR protocol, classifying them into 3 categories namely sender-side-based, receiver-side-based and hybrid. Furthermore each of the protocols is reviewed in detail, and its advantages and disadvantages are discussed. Finally, we discuss potential future work research directions in UWSNs, especially for energy efficient OR protocol design.

• 디지털산업정보학회논문지
• /
• 제18권2호
• /
• pp.1-8
• /
• 2022

The message propagation between vehicles must be efficiently performed to quickly transmit information between vehicles in vehicle ad hoc networks (VANETs). Broadcasting can be the most effective solution for propagating these messages. However, broadcasting can cause broadcast storm problems, which can reduce the performance of the overall network. Therefore, rapid information delivery in VANET requires a method that can propagate messages quickly without causing the broadcast storm problems. This paper proposes a lightweight and opportunistic broadcast (LOB) protocol that leverages the features of opportunistic routing to propagate messages quickly while minimizing the load on the network in VANETs where the network topology changes frequently. LOB does not require any routing information like greedy forwarding scheme, and neighboring nodes at the farthest distance within the range of transmission nodes are likely to be selected as forwarding nodes, and multiple forwarding candidate nodes like opportunistic routing scheme can increase packet transmission rates. Simulation results using ns-2 showed that LOB outperformed existing broadcast protocols in terms of packet rate and packet delay.

• 한국통신학회논문지
• /
• 제40권10호
• /
• pp.2026-2034
• /
• 2015

무선 센서 망은 제한된 통신범위를 가지는 수많은 센서 노드들로 구성된다. 따라서 직접 통신이 가능하지 않은 노드들 사이에는 다중 홉으로 통신하게 되며, 이는 패킷 전달의 신뢰성을 저하시킨다. 다중경로 라우팅과 기회 라우팅은 무선 센서 망에서 신뢰성을 보장하기 위한 대표적인 연구들이다. 기존 방안들은 종단 간 홉 수가 작은 경우 효과적으로 신뢰성을 향상시키지만, 홉 수가 커질수록 성능이 급격히 떨어진다. 따라서 기존 방안들은 종단 간 홉 수가 큰 대규모 무선 센서 망에는 적합하지 않다. 본 논문에서는 대규모 무선 센서 망에서 신뢰성 보장을 위한 기회적 다중경로 라우팅 방안을 제안한다. 서로 다른 특성 때문에 다중경로 라우팅과 기회 라우팅을 동시에 적용하는 것은 매우 어렵다. 제안방안은 구간 단위의 라우팅을 통해 두 방안을 동시에 적용함으로써 종단 간 신뢰성을 크게 향상시킨다. 또, 기회적 다중경로 라우팅을 통해 요구되는 신뢰성을 보장하기 위해 구간 신뢰성 개념을 제안한다. 각 구간에서의 신뢰성을 요구되는 종단 간 신뢰성보다 높게 설정함으로써 종단 간 신뢰성을 보장할 수 있다. 성능 평가 결과는 제안방안이 기존 방안에 비해 대규모 무선 센서 망에서의 신뢰성 보장에 더 적합함을 보인다.

• 한국통신학회논문지
• /
• 제35권6A호
• /
• pp.538-546
• /
• 2010

This paper presents an overview of position-based routing algorithms. We analyze performances of routing algorithms such as Hybrid Opportunistic Forwarding (HOF), Opportunistic multi-hop routing (ExOR), Location based Geocasting and Forwarding (LGF), and Greedy Forwarding in nearest with forward Progress (GFP) routing algorithms to find the best one in terms of packet error rate and throughput efficiency over effects of fading and noise variance in wireless networks. The analyses in closed form expressions are confirmed by the simulation results, which fully agree to analysis results. Additionally, the simulation results indicate significant differences among algorithms when varying the average SNR or the number of relays.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2144-2165
• /
• 2016

In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제5권3호
• /
• pp.47-54
• /
• 2016

본 논문에서는 동적인 차량 애드혹 네트워크 환경에서 시간의 흐름에 따라 상황에 적응하는 효율적인 경로 설정을 위해 제한시간 협상 게임 기반의 확률적 라우팅 프로토콜 기법을 제안하였다. 제안된 기법은 주기적인 메시지로 차량 간 신뢰도와 링크유지시간을 구하고, 이를 통해 차량 간의 링크 만족도를 정의한다. 각 차량은 그 정보를 이용해 포워딩할 데이터가 발생한 경우 자신의 효용을 최대화 하기 위해 가장 좋은 차량을 선택하게 된다. 따라서 목적지까지 링크 만족도의 총 합인 경로 만족도를 최대화 하는 경로에 가중치를 부여해 선택될 확률을 높여준다. 또한 메시지를 우선순위로 나누고, 우선순위에 따라 메시지의 경쟁 윈도우를 다르게 적용하여 충돌률을 감소시켰다.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.