• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2231-2252
• /
• 2012

With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1606-1623
• /
• 2015

Optical switching will be applied in datacenter networks because electronic switching is costly and power-consuming. In this paper, considering the ring-based interconnection using optical switching in the core of a datacenter, we study the home circuit (HC) construction for the labeled optical burst switching with home circuit (LOBS-HC), a new paradigm trying to share wavelengths among the HCs from the same source. In particular, aiming to construct HCs dynamically and properly, a scheme named optimal path matching and symmetric HC matching (OPM-SHM) is proposed. The main idea of OPM-SHM is to dynamically construct HCs by sharing wavelength(s) not only among the same-source HCs but also with symmetric HCs which have different sources other than the original LOBS-HC features. The simulation results demonstrate that OPM-SHM achieves better performance than some other methods in terms of burst loss rate and wavelength utilization of physical links. More specially, it maintains good load balancing for the datacenter network using an LOBS-HC ring. In addition, due to the symmetric feature of SHM, the proposed scheme can decrease the upper bound of the average hop count of the routing paths to half of the ring size.

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

Communication cost is the most important factor in Wireless Sensor Networks (WSNs), as exchanging control keying messages consumes a large amount of energy from the constituent sensor nodes. Time-based Dynamic Keying and En-Route Filtering (TICK) can reduce the communication costs by utilizing local time values of the en-route nodes to generate one-time dynamic keys that are used to encrypt reports in a manner that further avoids the regular keying or re-keying of messages. Although TICK is more energy efficient, it employs no re-encryption operation strategy that cannot determine whether a healthy report might be considered as malicious if the clock drift between the source node and the forwarding node is too large. Secure SOurce-BAsed Loose Synchronization (SOBAS) employs a selective encryption en-route in which fixed nodes are selected to re-encrypt the data. Therefore, the selection of encryption nodes is non-adaptive, and the dynamic network conditions (i.e., The residual energy of en-route nodes, hop count, and false positive rate) are also not focused in SOBAS. We propose an energy efficient selection of re-encryption nodes based on fuzzy logic. Simulation results indicate that the proposed method achieves better energy conservation at the en-route nodes along the path when compared to TICK and SOBAS.

• 디지털산업정보학회논문지
• /
• 제11권4호
• /
• pp.61-68
• /
• 2015

MANET has various vulnerability in wireless network and is more vulnerable in security because central management is not performed. In particular, routing attack may decrease performance of the overall network because the mobile node acts as a router. In this paper, we proposed authentication technique for improving the reliability of the network by increasing the integrity of the routing control packet and blocking effectively attacks that occur frequently in the inside. The proposed technique is consisted of two authentication methods of ZCN and N2N. ZCN authentication method is to elect CA nodes and monitor the role of the CA nodes. N2N authentication method is for an integrity check on the routing packets between nodes. Index key is determined by combining the hop count value to shared key table issued from CA in order to increase the robustness of the internal attack. Also, the overhead of key distribution was reduced by distributing a shared key to nodes certificated from CA. The excellent performance of the proposed method was confirmed through the comparison experiments.

• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• 대한전자공학회논문지TC
• /
• 제42권9호
• /
• pp.57-64
• /
• 2005

블루투스는 마스터와 슬레이브 간에 피코넷을 구성하며, 피코넷 네부에서는 시분할 방법으로 통신을 하며 이러한 피코넷이 모여 스캐터넷을 구성한다. 블루투스의 통신은 주파수 홉핑을 사용하기 때문에 여러개의 피코넷이 존재하거나 많은 수의 장치가 연결될 경우에는 스캐터넷이 필요하다. 블루투스 기술규격에는 스캐터넷의 형성 방법에 대하여 구체적으로 정의하지 않고있다. 기존에 제안되고 있는 스캐터넷 형성알고리즘은 스캐터넷의 토폴로지가 트리형태가 되도록 구성한다. 그렇지만 기존의 방법은 트리를 구성함에 있어서 스캐터넷 통신의 기본단위가 피코넷이라는 블루투스 통신의 특성을 간과하고 있다. 본 논문에서는 스캐터넷을 이루고 있는 피코넷에서 효율적인 전송률을 보장할 수 있는 형태로 트리를 구성함으로써, 스캐터넷 전체의 평균 전송효율을 높이는 방법을 제안한다.

• 한국정보통신학회논문지
• /
• 제6권1호
• /
• pp.30-35
• /
• 2002

동적 라우팅은 최적경로를 선택하고 라우팅테이블을 업데이트 하기 위해 라우팅 프로토콜을 사용한다. 가장 널리 사용되는 라우팅 프로토콜은 거리벡터 알고리즘을 이용한 라우팅인포메이션 프로토콜(RIP)이다. RIP는 최적경로서 최저 흡수의 경로를 취한다. 하지만 이 RIP는 매우 심각한 단점을 가지고 있다. 그것은 15 흡수 이상의 목적지에 대한 네트워크의 라우팅테이블을 유지할 수 없다는 것이다. 이를 극복하기 위해 TCP/IP에서 개발된 링크상태 프로토콜인 OSPF가 사용된다. OSPF는 큰 네트워크에 적합하고 RIP가 갖은 단점들을 극복 했다. 본 논문은 동일한 네트워크에서 메세지 전달과 지연, 링크 사용율, 메세지 전달갯수 같은 두 프로토콜사이의 트래픽과 링크효율을 분석하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2014년도 추계학술발표대회
• /
• pp.196-198
• /
• 2014

Wireless Sensor Networks(WSN) 기반의 Border Surveillance Networks(BSN)는 다양한 제한조건을 동반하며 침입 혹은 환경 등을 감시함을 목적으로 하고 있기 때문에 이벤트 발생시 신뢰적인 데이터 전송은 매우 중요한 부분을 차치하게 된다. 본 논문에서 적용한 대표적인 요구기반 라우팅 방법인 Ad hoc On-demand Distance Vector Routing(AODV)는 BSN 에 적용하였을 경우 홉 수(Hop Count)를 메트릭으로 최적의 경로를 계산하고 선택하여 Uni-Path 로 데이터를 전송하게 된다. 이때 AODV 는 Uni-path 로 데이터 전송을 진행하게 되며 링크의 단절이 빈번히 발생하는 BSN 의 환경적 요인으로 데이터 전송의 신뢰성이 감소하게 될 것이며 이는 비효과적인 데이터 전송을 야기하게 된다. 따라서 본 논문에서는 Multi-path 개념을 도입하여 데이터 전송 시 링크단절에 의해 발생하는 시간의 지연을 줄이고 더욱 신뢰성 있게 데이터를 전송할 수 있는 방법을 제안한다. 제안하는 방법은 송, 수신하는 두 노드의 전송범위에 공통으로 속한 노드들이 전송되는 데이터를 중복 전송하게 된다. 그리하여 링크의 단절이 일어날 경우 발생하는 경로 재 탐색 및 경로복구의 발생 빈도를 줄이고 동시에 데이터 전송률을 증가시켜 신뢰적인 데이터 전송을 하게 된다.

• Journal of Information Processing Systems
• /
• 제10권2호
• /
• pp.176-192
• /
• 2014

The realization of Wireless Multimedia Sensor Networks (WMSNs) has been fostered by the availability of low cost and low power CMOS devices. However, the transmission of bulk video data requires adequate bandwidth, which cannot be promised by single path communication on an intrinsically low resourced sensor network. Moreover, the distortion or artifacts in the video data and the adherence to delay threshold adds to the challenge. In this paper, we propose a two stage Quality of Service (QoS) guaranteeing scheme called Prioritized Multipath WMSN (PMW) for transmitting H.264 encoded video. Multipath selection based on QoS metrics is done in the first stage, while the second stage further prioritizes the paths for sending H.264 encoded video frames on the best available path. PMW uses two composite metrics that are comprised of hop-count, path energy, BER, and end-to-end delay. A color-coded assisted network maintenance and failure recovery scheme has also been proposed using (a) smart greedy mode, (b) walking back mode, and (c) path switchover. Moreover, feedback controlled adaptive video encoding can smartly tune the encoding parameters based on the perceived video quality. Computer simulation using OPNET validates that the proposed scheme significantly outperforms the conventional approaches on human eye perception and delay.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.281-286
• /
• 2009

The proposed technique uses cyclic frame structure, where three periods such as beacon period (BP), mesh contention access period (MCAP) and slotted period (SP) are in a data frame. This paper studies on a mechanism to allow communication nodes (6lowpan) in a PAN with different logical channel for global healthcare applications monitoring technology. The proposed super framework structure system has installed 6lowpan sensor nodes to communicate with each other. The basic idea is to time share logical channels to perform 6lowpan sensor node. The concept of 6lowpan sensor node and various biomedical sensors fixed on the patient BAN (Body Area Network) for monitoring health condition. In PAN (hospital area), has fixed gateways that received biomedical data from 6lowpan (patient). Each 6lowpan sensor node (patient) has IP-addresses that would be directly connected to the internet. With the help of IP-address service provider can recognize or analyze patient data from all over the globe by the internet service provider, with specific equipments i.e. cell phone, PDA, note book. The NS-2.33 result shows the performance of data transmission delay and data delivery ratio in the case of hop count in a PAN (Personal Area Networks).