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

• 한국통신학회논문지
• /
• 제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권3호
• /
• pp.1034-1051
• /
• 2016

Mobility models are invaluable for determining the performance of routing protocols in opportunistic networks. The movement of nodes has a significant influence on the topological structure and data transmission in networks. In this paper, we propose a new mobility model called the campus-based community mobility model (CBCNM) that closely reflects the daily life pattern of students on a real campus. Consequent on a discovery that the pause time of nodes in their community follows a power law distribution, instead of a classical exponential distribution, we abstract the semi-Markov model from the movement of the campus nodes and analyze its rationality. Then, using the semi-Markov algorithm to switch the movement of the nodes between communities, we infer the steady-state probability of node distribution at random time points. We verified the proposed CBCNM via numerical simulations and compared all the parameters with real data in several aspects, including the nodes' contact and inter-contact times. The results obtained indicate that the CBCNM is highly adaptive to an actual campus scenario. Further, the model is shown to have better data transmission network performance than conventional models under various routing strategies.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.2936-2951
• /
• 2016

An emerging satellite technology, Operationally Responsive Space (ORS) is expected to provide a fast and flexible solution for emergency response, such as target tracking, dense earth observation, communicate relaying and so on. To realize large distance transmission, we propose the use of available relay satellites as relay nodes. Accordingly, we apply software defined network (SDN) technology to ORS networks. We additionally propose a satellite network architecture refered to as the SDN-based ORS-Satellite (Sat) networking scheme (SDOS). To overcome the issures of node failures and dynamic topology changes of satellite networks, we combine centralized and distributed routing mechanisms and propose a fast recovery routing algorithm (FRA) for SDOS. In this routing method, we use centralized routing as the base mode.The distributed opportunistic routing starts when node failures or congestion occur. The performance of the proposed routing method was validated through extensive computer simulations.The results demonstrate that the method is effective in terms of resoving low end-to-end delay, jitter and packet drops.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.3851-3866
• /
• 2015

The dynamic nature of opportunistic networks results in long delays, low rates of success for deliveries, etc. As such user experience is limited, and the further development of opportunistic networks is constrained. This paper proposes a prediction-based routing method for opportunistic networks (PB-OppNet). Firstly, using an ARIMA model, PB-OppNet describes the historical contact information between a node pair as a time series to predict the average encounter time interval of the node pair. Secondly, using an optimal stopping rule, PB-OppNet obtains a threshold for encounter time intervals as forwarding utility. Based on this threshold, a node can easily make decisions of stopping observing, or delivering messages when potential forwarding nodes enter its communication range. It can also report different encounter time intervals to the destination node. With the threshold, PB-OppNet can achieve a better compromise of forwarding utility and waiting delay, so that delivery delay is minimized. The simulation experiment result presented here shows that PB-OppNet is better than existing methods in prediction accuracy for links, delivery delays, delivery success rates, etc.

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

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

• Journal of Communications and Networks
• /
• 제16권2호
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2875-2893
• /
• 2015

Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

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

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