• 대한전자공학회논문지TC
• /
• 제49권8호
• /
• pp.19-24
• /
• 2012

본 논문에서는 롱 홀 (long-haul) 다중 홉 무선 네트워크에서 단일 데이터 스트림에 대한 opportunistic 라우팅 기법의 성능분석을 수행한다. 성능분석에서는 네트워크 노드간의 링크 레벨 간섭을 고려한다. 일반적으로 opportunistic 라우팅 기법은 무선 다중 홉 네트워크의 성능을 크게 향상시킬 것으로 기대되어 왔고 이에 대한 성능향상 및 전송 기법에 대한 많은 연구가 수행되어 왔으나, 본 논문의 연구 결과는 롱 홀의 경우에는 opportunistic 라우팅의 성능향상 정도가 그리 크지 않다는 것을 보여준다. 이와 같은 연구 결과는 opportunistic 라우팅 기법은 구현의 복잡성을 고려할 경우에 롱 홀 환경에서는 적용하는 것이 적당치 않으며, 환경에 따라 short-haul 환경에 집중하여 적용해야 함을 의미한다.

• Journal of information and communication convergence engineering
• /
• 제12권3호
• /
• pp.135-139
• /
• 2014

Opportunistic routing was originally introduced in various multihop network environments to reduce the number of hops in such a way that, among the relays that decode the transmitted packet for the current hop, the one that is closest to the destination becomes the transmitter for the next hop. Unlike the conventional opportunistic routing case where there is a single active S-D pair, for an ad hoc network in the presence of fading, we investigate the performance of parallel opportunistic multihop routing that is simultaneously performed by many source-destination (S-D) pairs to maximize the opportunistic gain, thereby enabling us to obtain a logarithmic gain. We first analyze a cut-set upper bound on the throughput scaling law of the network. Second, computer simulations are performed to verify the performance of the existing opportunistic routing for finite network conditions and to show trends consistent with the analytical predictions in the scaling law. More specifically, we evaluate both power and delay with respect to the number of active S-D pairs and then, numerically show a net improvement in terms of the power-delay trade-off over the conventional multihop routing that does not consider the randomness of fading.

• 대한임베디드공학회논문지
• /
• 제14권4호
• /
• pp.177-186
• /
• 2019

In wireless sensor networks, the transmission success ratio would be decreased when the scale of the WSNs increased. To defeat this problem, we propose a multipath routing based on opportunistic routing for improving end-to-end reliability in large-scale wireless sensor networks. The proposed scheme exploits the advantages of existing opportunistic routing and achieves high end-to-end success ratio by branching like a multipath routing through local decision without information of the whole network. As a result of the simulation result, the proposed scheme shows a similar or higher end-to-end transmission success ratio and less energy consumption rather than the existing scheme.

• 전기학회논문지
• /
• 제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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1992-2008
• /
• 2018

Mobile opportunistic network is a kind of ad hoc networks, which implements the multi-hop routing communication with the help of contact opportunity brought about by the mobility of the nodes. It always uses opportunistic data transmission mode based on store-carry-forward to solve intermittent connect problem of link. Although many routing schemes have been proposed, most of them adopt the greedy transmission mode to pursue a higher delivery efficient, which result in unfairness extremely among nodes. While, this issue has not been paid enough attention up to now. In this paper, we analyzed the main factors that reflect fairness among nodes, modeled routing selection as a multiple attribute decision making problem, and proposed our Fairness-aware Routing Strategy, named FARS. To evaluate the performance of our FARS, extensive simulations and analysis have been done based on a real-life dataset and a synthetic dataset, respectively. The results show that, compared with other existing protocols, our FARS can greatly improve the fairness of the nodes when ensuring the overall delivery performance of the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권1호
• /
• pp.152-171
• /
• 2019

In opportunistic networks, nodes may appear some selfishness while transmitting the message, however, most of the existing research works consider the individual selfishness or social selfishness respectively, and these two types of selfishness may coexist in opportunistic networks. In this paper, we propose an Incentive Aware Routing based on Game Theory for selfish OPPNETs, named IAR-GT, which uses Rubinstein-Stahl bargaining game model to incentivize selfish nodes cooperation in data forwarding. IAR-GT scheme not only considers the resources of nodes, but also uses a new method to calculate the social ties between them. Trace-driven simulations show that our incentive aware routing scheme achieves better performances than comparing schemes under two types of selfishness coexistence environments.

• Journal of Communications and Networks
• /
• 제11권2호
• /
• pp.187-195
• /
• 2009

The application of mathematical analysis to the study of wireless ad hoc networks has met with limited success due to the complexity of mobility, traffic models and the dynamic topology. A scenario based universal mobile telecommunications system (UMTS) time division duplex (TDD) opportunistic cellular system with an ad hoc behaviour that operates over UMTS frequency division duplex (FDD) licensed cellular network is considered. In this paper, we present a new routing metric which overall improves system performance in terms of interference and routing which operate in an ad hoc network in an opportunistic manner. Therefore we develop a simulation tool that addresses the goal of analysis and assessment of UMTS TDD opportunistic radio system with ad hoc behavior in coexistence with a UMTS FDD primary cellular networks.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제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)
• /
• 제18권7호
• /
• pp.1795-1816
• /
• 2024

A Software-Defined Wireless Sensor Networks (SDWSNs) architecture is firstly proposed to address the issues of inflexible architecture strategies and low scalability of traditional WSNs in this article. The SDWSNs architecture involves the design of a software-defined sensor network model and a customized controller architecture, along with an analysis of the functionalities of each management module within the controller architecture. Secondly, to tackle limited energy problem of sensor nodes, a network coding opportunistic routing method (SDN-COR) is presented based on SDWSNs. This method incorporates considerations of coding opportunities, vertical distance, and remaining energy of nodes to design a metric for encoding opportunistic routing. By combining opportunistic forwarding mechanisms, candidate forwarding sets are selected and sorted based on priority to prioritize data transmission by higher-priority nodes. Simulation results indicate that, comparing with conventional methods, this approach achieves reduction in energy consumption by an average of 21.5%, improves network throughput by 24%, and extends network lifetime by 20%.

• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.806-817
• /
• 2016

Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.