• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.958-961
• /
• 2007

최근, 이용이 확산되고 있는 WLAN의 커버리지를 경제적으로 용이하게 해 주는 무선 메쉬망의 연구 및 구축이 활발하다. 기존 IEEE 802.11 표준이나, MANET 또는 WSN을 위해 개발된 프로토콜들이 사용될 수 있지만, 메쉬 WLAN의 몇 가지 요구사항이 다름으로 인해, 그대로 적용될 경우 망의 성능이 제한 되기 때문에, 아직도 많은 연구쟁점들이 해결되어야 한다. 본 논문은 무선 메쉬망 고유의 요구사항을 고려하여 물리계층과 링크계층의 연구쟁점을 살펴 본다.

• 대한전자공학회논문지TC
• /
• 제47권7호
• /
• pp.135-142
• /
• 2010

무선 메쉬 네트워크는 자가 구성 및 자가 관리가 가능한 애드혹 네트워크의 유비쿼터스 특성을 반영한 접속 기술이다. 본 논문에서는 무선 메쉬 네트워크에서 경로상의 노드들이 매 홉 단위로 전달 받은 데이터의 송신을 인증할 수 있고 무결성을 검증할 수 있는 방안을 제안한다. 제안하는 방식에서는 무선 메쉬 네트워크의 통신 인프라를 구성하는 노드와 데이터의 송신, 수신 및 릴레이 역할을 수행하는 무선 애드혹 네트워크의 사용자 노드를 구분하여 서로 다른 인증 기술을 적용한다. 즉, 무선 백본을 형성하는 경로 상에서 적용되는 홉 기반 인증 방안과 애드혹 네트워크의 경로 상에 위치한 노드들 간의 홉 단위 인증 방안이 다르게 적용된다. 이를 통해 기존에 제안되었던 MANET의 데이터 인증 방안에 비해 보안 설정 및 유지의 복잡도가 적고 백본을 구성하는 구간에서 빠르게 인증이 수행되기 때문에 송신에서 수신까지의 데이터 전달 지연이 적은 장점이 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2512-2529
• /
• 2015

Wireless mesh networks (WMNs) provide an efficient and flexible method to the field of wireless networking, but also bring many security issues. A mesh point may lose all of its available links during its movement. Thus, the mesh point needs to handover to a new mesh point in order to obtain access to the network again. For multi-domain WMNs, we proposed a new ID-based signcryption scheme and accordingly present a novel ID-based handover protocol for mesh points. The mutual authentication and key establishment of two mesh points which belong to different trust domains can be achieved by using a single one-round message exchange during the authentication phase. The authentication server is not involved in our handover authentication protocol so that mutual authentication can be completed directly by the mesh points. Meanwhile, the data transmitted between the two mesh points can be carried by the authentication messages. Moreover, there are no restrictions on the PKG system parameters in our proposed multi-domain ID-based signcryption scheme so our handover scheme can be easily applied to real WMNs circumstances. Security of the signcryption scheme is proved in the random oracle model. It shows that our protocol satisfies the basic security requirements and is resistant to existing attacks based on the security of the signcryption. The analysis of the performance demonstrates that the protocol is efficient and suitable for the multi-domain WMNs environment.

• 한국콘텐츠학회논문지
• /
• 제11권9호
• /
• pp.17-25
• /
• 2011

무선망의 적용분야가 활성화되기 시작하면서 보안 분야의 연구 또한 활발해지고 있다. 본 논문에서는 이동메쉬 노드가 언제 어디서든지 안전한 네트워크 접속을 확보할 수 있는 인증 기법을 소개한다. 특히, 로밍 상황에서 메쉬 노드가 안전한 접속을 확보하려면 홈과 외부 도메인 사이의 인증 교류 문제와 외부 도메인들 사이의 인증 교류 문제를 효과적으로 고려해야 한다. 제안한 인증 방법의 새로운 특징으로는 홈과 외부 도메인 사이의 직접적인 연결이나 교류 없이도 안전한 로밍 접속 인증을 제공할 수 있다는 점이다. 홈과 외부도메인의 연결에 관계없이, 메쉬 노드의 인증을 수행하는 외부 도메인 라우터는 인접하는 또 다른 외부 도메인을 선택하여 접촉하는 방식을 사용한다. 물론, 접촉대상인 외부 도메인 라우터 그룹에는 메쉬 노드의 방문기록을 보유한 라우터들만이 포함된다. 본 인증 방식의 성능을 평가하기 위하여 분석적인 기법을 사용하였고 기존 방식들과 비교하였다. 평가 결과, 제안한 방식이 인증 응답 시간 및 인증 서비스 제공 능력 측면에서 비교 대상 기법에 비하여 우수한 성능을 보유함을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.2103-2120
• /
• 2011

In this research, we consider the replication strategy for the applications of video streaming in wireless mesh networks (WMNs). In particular, we propose a closed-form of optimal replication densities for a set of frames of a video streaming by exploiting not only the skewed access probability of each frame but also the skewed loss probability and skewed encoding rate-distortion information. The simulation results demonstrate that our method improves the replication performance in terms of user-perceived quality (UPQ) which includes: 1) minimum average maximum reconstructed distortion for high peak signal-to-noise ratio (PSNR), 2) small reconstructed distortion fluctuation among frames for smooth playback, and 3) reasonable average maximum transmission distance for continuous playback. Furthermore, the proposed strategy consumes smaller storage capacity compared to other existing optimal replication strategies. More importantly, the effect of encoding rate is carefully investigated to show that high encoding rate does not always gain high performance of replication for video streaming.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권11호
• /
• pp.1909-1928
• /
• 2011

Node cooperation during packet forwarding operations is critically important for fair resource utilization in Community Wireless Mesh Networks (CoWMNs). In a CoWMN, node cooperation is achieved by using fairness protocols specifically designed to detect and isolate malicious nodes, discourage unfair behavior, and encourage node participation in forwarding packets. In general, these protocols can be split into two groups: Incentive-based ones, which are managed centrally, and use credit allocation schemes. In contrast, reputation-based protocols that are decentralized, and rely on information exchange among neighboring nodes. Centrally managed protocols inevitably suffer from scalability problems. The decentralized, reputation-based protocols lacks in detection capability, suffer from false detections and error propagation compared to the centralized, incentive-based protocols. In this study, we present a new fairness protocol management scheme, called Hybrid FPMS that captures the superior detection capability of incentive-based fairness protocols without the scalability problems inherently expected from a centralized management scheme as a network's size and density grows. Simulation results show that Hybrid FPMS is more efficient than the current centralized approach and significantly reduces the network delays and overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권9호
• /
• pp.4205-4227
• /
• 2018

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

• Journal of Communications and Networks
• /
• 제12권1호
• /
• pp.67-73
• /
• 2010

Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

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

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.