• 한국통신학회논문지
• /
• 제32권9B호
• /
• pp.569-576
• /
• 2007

GOSST 문제에 대한 이전 휴리스틱의 성능 개선을 위한 새로운 제안이 본 논문에서 제시된다. 이 문제는 다양한 등급의 서비스를 제공할 수 있는 통신 네트워크의 설계 등에 적용될 수 있다. GOSST 문제는 G-Condition을 만족하는 최소 구축비용의 네트워크를 찾는 것으로 NP-HARD 문제에 포함된다. 우리는 이전의 연구에서 이 문제와 관련된 두개의 휴리스틱을 발표하였다. 본 연구에서는 스타이너 트리 생성 시 이용되는 G-Node와 제거되는 에지의 선택 방법을 제안하고, 이를 기존의 휴리스틱에 접목한 새로운 휴리스틱을 구현한다. 실험 결과는 이 휴리스틱이 이전 것에 비해 우수함을 나타내는데, 새 지역적 배치 휴리스틱은 17%, 새 전역적 배치 휴리스틱은 14%의 네트워크 구축비용 절감비율의 증가를 보였다.

• 한국멀티미디어학회논문지
• /
• 제16권7호
• /
• pp.897-904
• /
• 2013

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• 한국컴퓨터산업학회논문지
• /
• 제8권4호
• /
• pp.237-244
• /
• 2007

무선 센서 네트워크에서는 네트워크 부하를 줄이기 위해 다수의 소스 노드가 전송한 데이터를 중간 노드에서 병합하여 전송하는 라우팅 기법을 사용한다. 기존의 DD-G(Directed Diffusion-Greedy) 데이터병합 라우팅 기법은 데이터 병합 노드의 에너지 효율을 고려하여 단일 경로를 구축함으로써 에너지 소모를 줄일 수 있었다. 하지만 싱크 노드에 근접할수록 에너지 소모가 집중되거나 통신 지연이 증가하는 문제점이 있다. 이러한 문제점을 해결하기 위해 본 논문에서는 부하 분산을 고려하여 다중 데이터 병합 경로를 구축하는 새로운 데이터 병합 라우팅 기법을 제안한다. 이 기법은 싱크 노드 주변의 네트워크 부하 집중을 분산시키고, 데이터 손실에 대한 재전송 비용을 감소시키기 위해 다중 경로를 이용한다.

• 전기학회논문지
• /
• 제65권12호
• /
• pp.2218-2224
• /
• 2016

Opportunistic routing is designed for an environment where there is no stable end-to-end routing path between source node and destination node, and messages are forwarded via intermittent contacts between nodes and routed using a store-carry-forward mechanism. In this paper, we consider PRoPHET(Probabilistic Routing Protocol using History of Encounters and Transitivity) protocol as a base opportunistic routing protocol and propose an efficient context-aware opportunistic routing protocol by using the context information of delivery predictability and node type, e.g., pedestrian, car, and tram. In the proposed protocol, the node types of sending node and receiving node are checked. Then, if either sending node or receiving node is tram, messages are forwarded by comparing the delivery predictability of receiving node with predefined delivery predictability thresholds depending on the combination of sending node and receiving node types. Otherwise, messages are forwarded if the delivery predictability of receiving node is higher than that of sending node, as defined in PRoPHET protocol. Finally, we analyze the performance of the proposed protocol from the aspect of delivery ratio, overhead ratio, and delivery latency. Simulation results show that the proposed protocol has better delivery ratio, overhead ratio, and delivery latency than PRoPHET protocol in most of the considered simulation environments.

• Structural Engineering and Mechanics
• /
• 제17권1호
• /
• pp.87-97
• /
• 2004

In gradient-dependent plasticity theory, the yield strength depends on the Laplacian of an equivalent plastic strain measure (hardening parameter), and the consistency condition results in a differential equation with respect to the plastic multiplier. The plastic multiplier is then discretized in addition to the usual discretization of the displacements, and the consistency condition is solved simultaneously with the equilibrium equations. The disadvantage is that the plastic multiplier requires a Hermitian interpolation that has four degrees of freedom at each node. Instead of using a Hermitian interpolation, in this article, a 3-node incompatible (trigonometric) interpolation is proposed for the plastic multiplier. This incompatible interpolation uses only the function values of each node, but it is continuous across element boundaries and its second-order derivatives exist within the elements. It greatly reduces the degrees of freedom for a problem, and is shown through a numerical example on localization to yield good results.

• 정보통신설비학회논문지
• /
• 제8권1호
• /
• pp.40-46
• /
• 2009

This paper presents a self-sustaining system, and an effective method in enhancing overall energy efficiency. The proposed system consists of the two major nodes: a slave node, which contains the environment information (e.g., temperature, humidity, etc.); and a master node, which communicates with the slave nodes, and transmit the slave node's information to users. All slave nodes are under control of the master node. Each slave node uses two power sources: the piezoelectric power generator (PPG); and the continuous wave from the master node. The paper highlights the basic operational principle, each node's specifications, and experimental data for performance verification. The two nodes successfully communicate each other in a range of 3.3m (maximal range), where the user's computer is wired the master node.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.4041-4059
• /
• 2019

Key establishment method based on channel reciprocity for time division duplex (TDD) system has earned a vital consideration in the majority of recent research. While most of the cellular systems rely on frequency division duplex (FDD) systems, especially the 5G network, which is not characterized by the channel reciprocity feature. This paper realizes the generation of a group secret key for multi-terminals communicated through a wireless network in FDD mode, by utilizing the nature of the physical layer for the wireless links between them. I consider a new group key generation approach, which using bitwise XOR with a modified pairwise secret key generation approach not based on the channel reciprocity feature. Precisely, this multi-node secret key agreement technique designed for three wireless network topologies: 1) the triangle topology, 2) the multi-terminal star topology, and 3) the multi-node chain topology. Three multi-node secret key agreement protocols suggest for these wireless communication topologies in FDD mode, respectively. I determine the upper bound for the generation rate of the secret key shared among multi-node, for the three multi-terminals topologies, and give numerical cases to expose the achievement of my offered technique.

• 한국정보과학회논문지:정보통신
• /
• 제35권4호
• /
• pp.355-366
• /
• 2008

본 논문에서는 3G 이동통신망과 WiBro 망간 수직 핸드오버 지원을 위한 mobile SCTP (mSCTP) 핸드오버 기법 적용방안을 제안한다. 제안하는 이종망간 mSCTP 핸드오버 기법의 성능분석을 위해 이동 단말에서 mSCTP 핸드오버를 자동적으로 지원하는 시스템을 개발하였다. 리눅스 기반 테스트베드 실험을 통해 핸드오버 지연 관점에서 성능을 분석하고 실험결과를 Mobile IP 핸드오버 기법과 비교하였다. 실험결과, 이종망간 중첩영역에서 이동 단말의 체류시간이 충분히 클 때 mSCTP 핸드오버 지연시간이 상당히 감소될 수 있고, 또한 Mobile IP 보다 상대적으로 더 좋은 핸드오버 성능을 보여주고 있음을 알 수 있었다.

• 대한전자공학회논문지TC
• /
• 제41권8호
• /
• pp.35-43
• /
• 2004

AAL2 전송 방식은 3G WCDMA 망에서 Node-B와 RNC사이에서 음성 및 데이터 트래픽을 전송하는데 사용되고 있다. AAL2의 성능을 분석하기 위하여 이산 마코프 체인 모델을 이용하여 음성 트래픽의 압축밀도와 대역이득을 분석하였으며, 시뮬레이션을 통하여 이 결과를 검증하였다. 또한 집선기에서 AAL2 다중화기의 성능을 세부적으로 분석하였다. 분석에 의하여 Node-B에서의 최적의 Timer_CU를 결정하기 위한 근거를 제안하였으며, 대역이득의 측면에서 집선기에서의 부가적인 AAL2 다중화기의 이점이 매우 작다는 것을 확인하였다. 또한 Node-B와 Iub인터페이스의 집선기에서 AAL2를 사용했을 때 데이터 트래픽의 경우 음성 트래픽에 비하여 그 이점이 매우 작다는 것을 알 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권2호
• /
• pp.974-987
• /
• 2018

This paper presents a novel and efficient data transmission scheme based on mobile edge computing for the massive IoT environments which should support various type of services and devices. Based on an accurate and precise synchronization process, it maximizes data transmission throughput, and consistently maintains a flow's latency. To this end, the proposed efficient software defined data transmission scheme (ESD-DTS) configures and utilizes synchronization zones in accordance with the 4 usage cases, which are end node-to-end node (EN-EN), end node-to-cloud network (EN-CN), end node-to-Internet node (EN-IN), and edge node-to-core node (EdN-CN); and it transmit the data by the required service attributes, which are divided into 3 groups (low-end group, medium-end group, and high-end group). In addition, the ESD-DTS provides a specific data transmission method, which is operated by a buffer threshold value, for the low-end group, and it effectively accommodates massive IT devices. By doing this, the proposed scheme not only supports a high, medium, and low quality of service, but also is complied with various 5G usage scenarios. The essential difference between the previous and the proposed scheme is that the existing schemes are used to handle each packet only to provide high quality and bandwidth, whereas the proposed scheme introduces synchronization zones for various type of services to manage the efficiency of each service flow. Performance evaluations show that the proposed scheme outperforms the previous schemes in terms of throughput, control message overhead, and latency. Therefore, the proposed ESD-DTS is very suitable for upcoming 5G networks in a variety of massive IoT environments with supporting mobile edge computing (MEC).