• 한국농공학회지
• /
• 제39권2호
• /
• pp.9-18
• /
• 1997

Abstract This paper presents a heuristic method for optimal design of water distribution system with multiple sources and potential links. In multiple source pipe network, supply rate at each source node affects the total cost of the system because supply rates are not uniquely determined. The Linear Minimum Cost Flow (LMCF) model may be used to a large scale pipe network with multiple sources to determine supply rate at each source node. In this study the heuristic method based on the LMCF is suggested to determine supply rate at each source node and then to optimize the given layout. The heuristic method in turn perturbs links in the longest path of the network to obtain the supply rates which make the optimal design of the pipe network. Once the best tree network is obtained, the frequency count of reconnecting links by considering link failure is in turn applied to form loop to enhance the reliability of the best tree network. A sample pipe network is employed to test the proposed method. The results show that the proposed method can yield a lower cost design than the LMCF alone and that the proposed method can be efficiently used to design irrigation systems or rural water distribution systems.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.655-659
• /
• 2010

In the conventional PNC scheme, the relay node requires simultaneous transmission of two source nodes with strict power control and carrier-phase matching between two received symbols. However, this pre-equalization process at source nodes is not practical in fading channels. In this letter, we propose a novel physical-layer network coding (PNC) scheme with log-likelihood ratio (LLR) conversion for fading channels, which utilizes not pre-equalizer at transmitters (source nodes) but joint detector at receiver (relay node). The proposed PNC requires only channel side information at the receiver (CSIR), which is far more practical assumption in fading channels. In addition, the proposed PNC scheme can use the conventional modulation scheme like M-QAM regardless of modulation order, while the conventional PNC scheme requires reconfiguration of modulation scheme at the source nodes for detection of the received signal at relay node. We consider the combination of the proposed PNC and channel coding, and find that the proposed PNC scheme is easily combined the linear channel codes such as turbo codes, LDPC, and convolutional codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 춘계학술발표대회
• /
• pp.1453-1456
• /
• 2004

PARO, a power-aware routing optimization mechanism, is proposed in [1] to minimize the transmission power needed to forward packets between wireless devices in ad hoc network. The mechanism works by redirecting the route to pass through one or more intermediate nodes on behalf on source-destination pairs, then reducing the end-to-end transmission power. This paper will show an extension of this model and provide an analysis of the geometrical area lying between source and destination in which the intermediate node elects to perform redirection. The duration the intermediate node stays in that area is also computed.

• 정보처리학회논문지C
• /
• 제14C권5호
• /
• pp.425-430
• /
• 2007

Mobile Ad hoc Networks(MANET)는 구조 특성상 경로 구성을 위해 필요할 때마다 경로 구성 메시지를 브로드캐스팅하여 경로 정보를 얻는 것이 경로 정보를 계속 유지하고 있는 것보다 효율적이다. MANET의 라우팅 프로토콜 중 하나인 AODV에서 소스 노드는 목적지 노드를 효율적으로 찾기 위해 Expanding Ring Search(ERS) 알고리즘을 사용한다. ERS 알고리즘은 네트워크의 혼잡을 줄이기 위해 네트워크 전체를 대상으로 RREQ 메시지를 브로드캐스팅하는 것이 아니라 소스 노드는 목적지 노드로부터 타이머가 만료될 때까지 RREP 메시지가 도착하지 않는다면 TTL 값을 점차적으로 늘이면서 RREQ 메시지를 브로드캐스팅한다. 기존의 AODV는 고정적인 NODE_TRAVERSAL_TIME 값을 사용하기 때문에 목적지 노드를 찾는데 많은 비용이 소요된다. 본 논문은 기존의 AODV 프로토콜에 추가되는 메시지 없이 헬로우(HELLO) 메시지를 이용하여 이웃 노드들과의 메시지 지연시간을 측정한다. 측정된 메시지 지연시간을 NODE_TRAVERSAL_TIME에 적용하여 최적의 NET_TRAVERSAL_TIME을 구하는 적응적인 확장 링 검색(AERS : Adaptive ERS) 알고리즘을 제안한다. 본 논문에서는 AERS를 이용하여 최적의 NET_TRAVERSAL_TIME을 구하고, 이를 이용하여 불필요한 메시지 발생을 억제함으로써 네트워크 성능을 향상 시킬 수 있다. 시뮬레이션을 통해 제안한 방식의 효율성을 입증한다.

• Journal of Electrical Engineering and Technology
• /
• 제13권3호
• /
• pp.1079-1088
• /
• 2018

A line overload emergency control strategy based on the source-load synergy coefficient is proposed in this paper. First, the definition of the source-load synergy coefficient is introduced. When line overload is detected, the source-load branch synergy coefficient and source-load distribution synergy coefficient are calculated according to the real-time operation mode of the system. Second, the generator tripping and load shedding control node set is determined according to the source-load branch synergy coefficient. And then, according to the line overload condition, the control quantity of each control node is determined using the Double Fitness Particle Swarm Optimization (DFPSO), with minimum system economic loss as the objective function. Thus load shedding for the overloaded line could be realized. On this basis, in order to guarantee continuous and reliable power supply, on the condition that no new line overload is caused, some of the untripped generators are selected according to the source-load distribution synergy coefficient to increase power output. Thus power supply could be restored to some of the shedded loads, and the economic loss caused by emergency control could be minimized. Simulation tests on the IEEE 10-machine 39-bus system verify the effectiveness and feasibility of the proposed strategy.

• 한국통신학회논문지
• /
• 제29권3A호
• /
• pp.276-287
• /
• 2004

Ad hoc 망은 기지국이나 엑세스 포인트(AP) 같은 인프라가 없는 무선이동통신기술이다. 즉, ad hoc 망에서는 이동노드들이 라우터와 서버의 역할을 모두 한다. 기존의 경로 재 설정 방법에서는 노드의 이동으로 인하여 경로가 끊어졌을 경우 송신노드는 경로를 다시 재 설정 해야한다. 하지만 경로가 끊어진 후 다시 재 설정하는 방법은 QoS를 보장해야하는 실시간 데이터 전송에서는 적합하지 않을 수 있다. 그러므로 본 논문에서는 경로가 끊어지는 것을 미리 예방하는 경로 재 설정 기법을 제안한다. 중간노드가 이동하면서 어떤 임계영역으로 들어가는 경우 자신의 다음 노드에게 핸드오프 패킷을 발생시키고, 핸드오프 패킷을 수신한 노드는 경로가 끊어지기 전에 경로요청패킷을 중간노드의 바로 이전노드에게 브로트캐스트 함으로써 중간 노드가 경로를 벗어나더라도 지속적으로 새로운 경로를 통하여 데이터 패킷을 전송할 수 있다.

• Journal of Communications and Networks
• /
• 제11권6호
• /
• pp.589-598
• /
• 2009

In wireless sensor networks, a node that reports information gathered from adjacent assets should relay packets appropriately so that its location context is kept private, and thereby helping ensure the security of the assets that are being monitored. Unfortunately, existing routing methods that counter the local eavesdropping-based tracing deal with a single asset, and most of them suffer from the packet-delivery latency as they prefer to take a separate path of many hops for each packet being sent. In this paper, we propose a routing method, greedy perimeter stateless routing-based source-location privacy with crew size w (GSLP-w), that enhances location privacy of the packet-originating node (i.e., active source) in the presence of multiple assets. GSLP-w is a hybrid method, in which the next-hop node is chosen in one of four modes, namely greedy, random, perimeter, and retreat modes. Random forwarding brings the path diversity, while greedy forwarding refrains from taking an excessively long path and leads to convergence to the destination. Perimeter routing makes detours that avoid the nodes near assets so that they cannot be located by an adversary tracing up the route path. We study the performance of GSLP-w with respect to crew size w (the number of packets being sent per path) and the number of sources. GSLP-w is compared with phantom routing-single path (PR-SP), which is a notable routing method for source-location privacy and our simulation results show that improvements from the point of the ratio of safety period and delivery latency become significant as the number of source nodes increases.

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

In this paper, a WDM metro ring consisting of access nodes with $FT-FR^n$ (Fixed Transmitter - n Fixed Receivers) is considered. A trade-off exists between node throughput and transmission fairness because the access nodes share wavelength channels. In order to eliminate the transmission unfairness and to increase throughput, the p-persistent medium access control (MAC) protocol is proposed: each node uses an empty optical slot to transmit a packet and make it available with the extraction of a transferred packet at the source access node, called source-stripping. The local empty slot can be used to transfer a head-of-line packet in the local buffer with probability p or it is used for the next downstream nodes with 1-p. The proposed MAC protocol provides better node throughput than the non-persistent protocol and exhibits better fairness index than the 1-persistent protocol in WDM ring networks. In addition, numerical analysis shows that the proposed MAC protocol maximizes the node throughput under uniform traffic conditions. For more detailed results, we use the network simulation under Poisson and self-similar traffic. Furthermore, unpredictable traffic constructed by the combination of the former and the latter is also considered. The reasonable probability of the p-persistent protocol for a given architecture can be determined through simulation.

• 정보처리학회논문지C
• /
• 제14C권5호
• /
• pp.395-402
• /
• 2007

무선센서네트워크는 센서필드안에서 어떤 이벤트를 센싱하는 수많은 센서노드들로 구성된다. 무선센서네트워크에서 이벤트를 인식한 소스노드와 이 값을 처리하는 싱크노드간에 데이터가 전송되며 싱크노드의 이동성을 고려한 에너지 효율적인 라우팅 기법이 필요하다. 본 연구 에서는 데이터패스 템플릿을 이용하여 미리 정해진 방향으로 소스노드로부터의 데이터공고, 싱크노드로부터의 데이터요구 메시지를 전송한다. 다음 단계로 센싱한 데이터를 단거리계산법을 사용하여 싱크노드에게 전송한다. 그리드 개념과 이동성 싱크가 존재하는 센서네트워크에 대한 기존의 TTDD 라우팅 프로토콜과 CBPER 프로토콜을 본 연구에서 제안한 SPDR 프로토콜과 시뮬레이션을 통하여 비교한 결과, 제안된 프로토콜이 기존의 TTDD나 CBPER보다 향상된 에너지 효율성을 가졌음을 보여준다.