• ETRI Journal
• /
• 제37권2호
• /
• pp.380-386
• /
• 2015

Guaranteeing quality of service over a multihop wireless network is difficult because end-to-end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section-based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay-and energy-efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.

• 한국통신학회논문지
• /
• 제28권6B호
• /
• pp.523-532
• /
• 2003

GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

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

• Journal of Communications and Networks
• /
• 제9권3호
• /
• pp.282-295
• /
• 2007

Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.

• Journal of Communications and Networks
• /
• 제4권4호
• /
• pp.351-362
• /
• 2002

In this paper, we introduce a new approach to the minimum energy routing (MER) for next generation (NG) multihop wireless networks. We remove the widely used assumption of deterministic, distance-based channel model is removed, and analyze the potentials of MER within the context of the realistic channel model, accounting for shadowing and fading. Rather than adopting the conventional unrealistic assumption of perfect power control in a distributed multihop environment, we propose to exploit inherent spatial diversity of mobile terminals (MT) in NG multihop networks and to combat fading using transmit diversity. We propose the cooperation among MTs, whereby couples of MTs cooperate with each other in order to transmit the signal using two MTs as two transmit antennas. We provide the analytical framework for the performance analysis of this scheme in terms of the feasibility and achievable transmit power reduction. Our simulation result indicate that significant gains can be achieved in terms of the reduction of total transmit power and extension of network lifetime. These gains are in the range of 20-100% for the total transmit power, and 25-90% for the network lifetime, depending on the desired error probability. We show that our analytical results provide excellent match with our simulation results. The messaging load generated by our scheme is moderate, and can be further optimized. Our approach opens the way to a new family of channel-aware routing schemes for multihopNG wireless networks in fading channels. It is particularly suitable for delivering multicast/ geocast services in these networks.

• 대한전자공학회논문지TC
• /
• 제48권1호
• /
• pp.45-49
• /
• 2011

협력적 다중 홉 통신은 열악한 무선 통선 환경인 수중 음향 네트워크 환경에서 보다 더 효율적인 통신을 제공한다. 그러나 이러한 협력적 다중 홉 통신은 초기 시간 구간에서 협력 노드 개수 부족으로 인하여 초기 노드에서 오류가 난 선호를 받을 확률이 높고, 오류 선호가 계속적으로 전송되므로 오류 확률증가가 예상된다. 이와같은 문제점을 해결하기 위하여 본 논문에서는 초기 시간 구간에서 파운틴 코드를 적용하여 성능을 개선시킬 수 있음을 모의실험을 통해 보인다. 또한 주파수와 거리에 따른 성능을 송신전력의 관점에서 보고 모의실험을 통해 성능을 보인다.

• 대한임베디드공학회논문지
• /
• 제8권6호
• /
• pp.329-337
• /
• 2013

In multihop routed ad hoc networks, the conventional store-and-forward delivery has been used. However, we may ask a question: "Is the store-and-forward delivery still the best?" This paper presents a pipeline-through MAC (PT-MAC) protocol for ad hoc networks, in which nodes have two 3-channel interfaces in order to use limited radio resources efficiently and improve network performance. The proposed protocol reduces end-to-end delay significantly in multihop routed transmission by exploiting a novel pipeline-through technique rather than using the conventional store-and-forward. This results in improved network performance without increasing control overhead. Our extensive performance study shows that the proposed PT-MAC shows 20-40 percent shorter end-to-end delay and 25-55 percent better goodput compared to the IEEE 802.11 DCF with two 3-channel interfaces.

• 한국정보과학회논문지:정보통신
• /
• 제27권1호
• /
• pp.12-21
• /
• 2000

순열 방사형 그래프는 다중 홉 광 통신망을 설계하고자 할 때 요구되는 설계 요구사항(예를 들면 노드/간선의 대칭성, 낮은 직경, 경로 배정의 간단성 등)을 만족시킬 수 있는 여러 특성을 가지고 있다. 본 논문에서는 다중 홉 광 통신망의 새로운 논리적 토폴로지로써 순열 방사형 그래프 모델을 기반으로 하는 순열 방사형 광 통신망을 제안한다. 제안한 구조에서는 다중 스타 커플러의 사용과 망의 그룹화를 통해서 파장 재사용성, 확장성을 향상시켰다. 또한 기존 관련 연구와의 비교 분석을 통해서 제안한 구조가 제한된 파장수로 좀더 많은 노드의 수용을 요구하는 응용분야에 사용될 수 있는 대안 논리적 토폴로지임을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권1호
• /
• pp.24-51
• /
• 2011

When supporting both voice and TCP in a wireless multihop network, there are two conflicting goals: to protect the VoIP traffic, and to completely utilize the remaining capacity for TCP. We investigate the interaction between these two popular categories of traffic and find that conventional solution approaches, such as enhanced TCP variants, priority queues, bandwidth limitation, and traffic shaping do not always achieve the goals. TCP and VoIP traffic do not easily coexist because of TCP aggressiveness and data burstiness, and the (self-) interference nature of multihop traffic. We found that enhanced TCP variants fail to coexist with VoIP in the wireless multihop scenarios. Surprisingly, even priority schemes, including those built into the MAC such as RTS/CTS or 802.11e generally cannot protect voice, as they do not account for the interference outside communication range. We present VAGP (Voice Adaptive Gateway Pacer) - an adaptive bandwidth control algorithm at the access gateway that dynamically paces wired-to-wireless TCP data flows based on VoIP traffic status. VAGP continuously monitors the quality of VoIP flows at the gateway and controls the bandwidth used by TCP flows before entering the wireless multihop. To also maintain utilization and TCP performance, VAGP employs TCP specific mechanisms that suppress certain retransmissions across the wireless multihop. Compared to previous proposals for improving TCP over wireless multihop, we show that VAGP retains the end-to-end semantics of TCP, does not require modifications of endpoints, and works in a variety of conditions: different TCP variants, multiple flows, and internet delays, different patterns of interference, different multihop topologies, and different traffic patterns.

• Journal of Communications and Networks
• /
• 제12권5호
• /
• pp.433-441
• /
• 2010

Multihop transmission is a promising technique that helps in achieving broader coverage (excellent network connectivity) and preventing the impairment of wireless channels. This paper proposes a cluster-based multihop wireless network that makes use of the advantages of multihop relaying, i.e., path loss gain, and partial relay selection in each hop, i.e., spatial diversity. In this partial relay selection, the node with the maximum instantaneous channel gain will serve as the sender for the next hop. With the proposed protocol, the transmit power and spectral efficiency can be improved over those in the case of direct transmission and conventional multihop transmission. Moreover, at a high signal-to-noise ratio (SNR), the performance of the system with at least two nodes in each cluster is dependent only on the last hop and not on any of the intermediate hops. For a practically feasible decode-and-forward relay strategy, a compact expression for the probability density function of the end-to-end SNR at the destination is derived. This expression is then used to derive closed-form expressions for the outage probability, average symbol error rate, and average bit error rate for M-ary square quadrature amplitude modulation as well as to determine the spectral efficiency of the system. In addition, the probability of SNR gain over direct transmission is investigated for different environments. The mathematical analysis is verified by various simulation results for demonstrating the accuracy of the theoretical approach.