• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1344-1367
• /
• 2014

Mobile traffic is increasing a masse because of the propagation of the Internet and the development of wireless mobile technology. Accordingly, the Network Local Mobility Management (NETLMM) working group [1] of the Internet Engineering Task Force (IETF) has standardized Proxy Mobile IPv6 (PMIPv6) [2] as a protocol for accomplishing the transmissibility of mobile terminals. PMIPv6 is a network-led IP-based mobility management protocol, which can control terminal mobility without depending on the type of access system or the capability of the terminal. By combining PMIPv6 and the mobility of Session Initiation Protocol (SIP), we can establish terminal mobility and session mobility through a more effective route. The mobility function can be improved and the overlap of function reduced as compared to that in the case of independent operation. PMIPv6 is appropriate for a non-real-time service using TCP, and SIP is appropriate for a real-time service using RTP/UDP. Thus, in the case of a terminal using both services, an effective mobility management is possible only by using PMIPv6 together with SIP. In order to manage mobility in this manner, researches on PMIPv6-SIP are in progress. In line with this trend, this paper suggests a new PMIPv6-SIP architecture where when a mobile terminal conducts a handover, a network-led handover while maintaining the session without the addition of a special function or middleware is possible along with effective performance evaluation through mathematical modeling by comparing the delay and the packet loss that occur during the handover to the Pure-SIP.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5229-5252
• /
• 2016

With proliferation of diverse network access technologies, users demands are also increasing and service providers are offering a Quality of Service (QoS) to satisfy their customers. In roaming, a mobile node (MN) traverses number of available networks in the heterogeneous wireless networks environment and a single operator is not capable to fulfill the demands of user. It is crucial task for MN for selecting a best network from the list of networks at any time anywhere. A MN undergoes a network selection situation frequently when it is becoming away from the home network. Multiple Attribute Group Decision (MAGD) method will be one of the best ways for selecting target network in heterogeneous wireless networks (4G). MAGD network selection process is predominantly dependent on two steps, i.e., attribute weight, decision maker's (DM's) weight and aggregation of opinion of DMs. This paper proposes Multi-Attribute Intuitionistic Fuzzy Group Decision Method (MAIFGDM) using TOPSIS for the selection of the suitable candidate network. It is scalable and is able to handle any number of networks with large set of attributes. This is a method of lower complexity and is useful for real time applications. It gives more accurate result because it uses Intuitionistic Fuzzy Sets (IFS) with an additional parameter intuitionistic fuzzy index or hesitant degree. MAIFGDM is simulated in MATLAB for its evaluation. A comparative study of MAIFDGM is also made with TOPSIS and Fuzzy-TOPSIS in respect to decision delay. It is observed that MAIFDGM have low values of decision time in comparison to TOPSIS and Fuzzy-TOPSIS methods.

• 한국정보과학회논문지:시스템및이론
• /
• 제32권10호
• /
• pp.491-498
• /
• 2005

서비스 거부 공격이란 서비스를 제공하는데 있어 필요한 컴퓨팅 및 통신 자원을 고갈시키는 공격으로 원천적으로 해결하기가 매우 힘든 것으로 알려져 있다. TCP는 연결 설정 과정에 있어 서비스 거부 공격을 당할 수 있는 문제점을 가지고 있다. TCP는 연결 설정이 완료될 때까지 각 연결 설정 단계의 상태를 큐에 저장하고 있다가 연결 설정이 완료되면 연결된 소켓을 어플리케이션으로 전달한다. 공격자는 수많은 연결 요청을 보내고 이 요청에 대한 연결 과정을 완료하지 않음으로 해서 이 큐를 가득 차게 해 다른 정상적인 연결 요청을 받아들일 수 없도록 할 수 있다. 본 논문에서는 이러한 서비스 거부 공격을 차단하기 위한 확장 TCP를 제안하고 이를 리눅스 상에서 구현하였다. 제안한 확장 TCP는 연결 설정이 종료될 때까지는 연결 설정 과정에 대한 상태를 큐에 유지하지 않도록 함으로써 서비스 거부 공격을 막을 수 있도록 하였다. 제안된 확장 TCP를 위해 TCP의 3-way handshake 과정을 일부 수정하고 이를 리눅스 커널에 구현하였으며 그 성능을 실험해 본 결과 정상적인 서비스 환경에서는 수정전의 TCP의 연결 처리 속도에 비해 $0.05\%$정도의 지연이 있었지만 SYN Flood 공격이 이루어지고 있는 상황에서는 아무런 영향을 받지 않았다

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1567-1587
• /
• 2014

Virtual Machine (VM) resource management is crucial to satisfy the Quality of Service (QoS) demands of various multimedia services in a media cloud platform. To this end, this paper presents a VM resource allocation model that dynamically and optimally utilizes VM resources to satisfy QoS requirements of media-rich cloud services or applications. It additionally maintains high system utilization by avoiding the over-provisioning of VM resources to services or applications. The objective is to 1) minimize the number of physical machines for cost reduction and energy saving; 2) control the processing delay of media services to improve response time; and 3) achieve load balancing or overall utilization of physical resources. The proposed VM allocation is mapped into the multidimensional bin-packing problem, which is NP-complete. To solve this problem, we have designed a Mixed Integer Linear Programming (MILP) model, as well as heuristics for quantitatively optimizing the VM allocation. The simulation results show that our scheme outperforms the existing VM allocation schemes in a media cloud environment, in terms of cost reduction, response time reduction and QoS guarantee.

• 한국수산과학회지
• /
• 제14권4호
• /
• pp.265-268
• /
• 1981

길이 250cm, 간격 10cm의 25개의 수동계 직선배열 hydrophone을 0, $\pm1$의 거형파 weighting을 부가하여 신호와 weighting과의 convolution을 구하고 이것을 동기가산하는 방법으로 얻는 방향검출과 spectrum분석은 그 실현방법을 증대시키고 정현파 weighting을 부가하는 것보다 3dB정 도 낮으나 지향성을 준 방향보다 타방향의 spectrum성분의 Power level을 적어도 16dB 정도 이상 억제할 수가 있었다. 또 신호까지 0, $\pm1$의 거형파로 바꾸는 경우는 전술한 성분을 적어도 8 dB 이상 억제할 수 있었다.

• 한국통신학회논문지
• /
• 제31권4A호
• /
• pp.385-392
• /
• 2006

차세대 이동통신시스템은 초고속의 다양한 이동 멀티미디어 서비스를 제공하는 것을 목표로 하는 바 이러한 초고속의 서비스를 요구하는 다수의 사용자를 수용하려면 셀의 크기를 더욱 즐여서 무선 자원의 재사용성을 증대시켜야 한다. 이런 환경에서는 핸드오버가 빈번히 발생하고 이로 인해 허용 가능한 핸드오버 처리 지연 시간을 감소시켜 결국 패킷 손실과 핸드오버 실패를 초래하게 된다. 또한 패킷 손실을 보상하기 위한 재전송이 필요하게 되어 시스템의 성능을 저하시킨다. 본 논문에서는 차세대 이동 통신망에서 이음매 없는(seamless) 멀티미디어 서비스를 제공하기 위한 방안의 하나로서, 이동 단말기의 셀 내 위치와 이동방향에 대한 정보를 퍼지 기법에 의해 추정하고 이를 바탕으로 핸드오버 요구 전에 핸드오버 설정 절차를 미리 수행하는 핸드오버 기법을 제안하고 시뮬레이션에 의해 성능을 분석한다.

• 한국통신학회논문지
• /
• 제40권4호
• /
• pp.678-691
• /
• 2015

최근 정보통신 생태계는 스마트 기기의 대중화와 대용량 데이터 스트리밍을 필요로 하는 다양한 인터넷 서비스들의 출현과 함께 인터넷 및 모바일 데이터 트래픽이 급속도로 증가하게 되었다. 이에 따라 원활한 인터넷 접속문제, 네트워크의 혼잡 및 정체, 그리고 통신사업자들의 지속적인 네트워크 투자 비용증대 등 다양한 문제들이 초래되었다. 이렇게 데이터 중심의 패러다임으로 변화된 통신 생태계 속에서 초기 상호접속체제들은 사업자들 간 균형 있는 혜택과 공정한 분배 그리고 차세대 네트워크 구축을 위한 경제적 유인을 형성할 수 없다는 측면에서 논란이 가중되고 있다. 따라서 더욱 복잡해진 All-IP 네트워크 환경에 부합할 수 있는 진화된 인터넷 상호접속체제의 도입이 필요한 상황이다. 이에 본 연구에서는 국내 인터넷 상호접속제도의 핵심이슈를 발굴하고 인터넷 초기에서 현재까지의 인터넷 상호접속체제를 전반적으로 분석한 후, 실증연구를 통하여 트래픽 최적화, 비용 최적화, 네트워크 투자 최적화의 세 가지 측면에 부합될 수 있는 인터넷 상호접속체제를 제시하고자 한다.

• Journal of Communications and Networks
• /
• 제14권6호
• /
• pp.640-652
• /
• 2012

Many studies have investigated the smart grid architecture and communication models in the past few years. However, the communication model and architecture for a smart grid still remain unclear. Today's electric power distribution is very complex and maladapted because of the lack of efficient and cost-effective energy generation, distribution, and consumption management systems. A wireless smart grid communication system can play an important role in achieving these goals. In this paper, we describe a smart grid communication architecture in which we merge customers and distributors into a single domain. In the proposed architecture, all the home area networks, neighborhood area networks, and local electrical equipment form a local wireless mesh network (LWMN). Each device or meter can act as a source, router, or relay. The data generated in any node (device/meter) reaches the data collector via other nodes. The data collector transmits this data via the access point of a wide area network (WAN). Finally, data is transferred to the service provider or to the control center of the smart grid. We propose a wireless cooperative communication model for the LWMN.We deploy a limited number of smart relays to improve the performance of the network. A novel relay selection mechanism is also proposed to reduce the relay selection overhead. Simulation results show that our cooperative smart grid (coopSG) communication model improves the end-to-end packet delivery latency, throughput, and energy efficiency over both the Wang et al. and Niyato et al. models.