• 한국통신학회논문지
• /
• 제36권6A호
• /
• pp.568-576
• /
• 2011

본 논문에서는 OFDMA(Orthogonal Frequency Division Multiple Access)기반의 WMN(Wireless Mesh Network)에서 분산 MR(distributed Mesh Router)간 TDoA(Time Difference of Arrival)에 의한 ISI(Inter-Symbol Interference) 및 ICI(Inter-Carrier Interference) 간섭을 완화시키기 위한 자원할당 기법을 제안한다. WMN에서 서로 다른 지연 시간에 따른 ISI와 ICI의 영향을 최소화하기 위하여 각 MR별로 자원할당에 따른 SINR을 정의하고, 이를 바탕으로 fairness를 고려한 자원 할당 기법을 제안한다. 제안된 자원할당 기법은 기존의 기법과 비교하여 WMN에서 BER 성능을 크게 향상시킬 수 있음을 모의실험을 통하여 확인한다.

• 한국지능시스템학회논문지
• /
• 제15권6호
• /
• pp.695-700
• /
• 2005

센서 네트워크는 많은 센서 노드들을 산개시켜 놓은 다음 노드들끼리 통신망을 구성하고 주위 환경 정보를 수집하고 분석한다. 각 노드들은 제한된 자원 내에서 지정된 일을 수행해야 하기 때문에 효율성이 극대화되어야 하고 하드웨어 자체의 성능도 뛰어나야 한다. 지금까지 기술적인 제약이 있었지만 최근 If 제조 기술과 무선 네트워크 기술의 급속한 발달로 인해 저렴하면서 전력소비가 적고 다양한 기능을 하는 소형 임베디드 시스템을 구성할 수 있게 되었다. 기술 발전과 함께 무선 센서 네트워크는 새로운 연구 분야로서 자리매김하였고 현재 여러 연구실에서 연구되어지고 있으며, 제각기 다른 이름으로 다양하게 불리고 있다. Wireless Integrated Network Sensors (WINS), Mobile Ad hoc NETwork (MANET), Ubiquitous Sensor Network (USN). 현재 센서 네트워크 분야에서 TinyOS가 널리 이용되고 있다. 본 논문에서는 TinyOS와 그 플랫폼을 이용해서 가정 내에서 컨텍스트 인식을 위한 센서 네트워크를 구성하고자 한다.

• 제어로봇시스템학회논문지
• /
• 제3권5호
• /
• pp.542-554
• /
• 1997

In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2422-2443
• /
• 2020

This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

• Asian-Australasian Journal of Animal Sciences
• /
• 제13권3호
• /
• pp.401-412
• /
• 2000

Like other livestock, monogastric animals are essential components of the farming systems in the tropical countries. Pigs, chicken and ducks are by far the most important animals in the culture of the peoples of developing countries in the tropics. Traditionally these animals are raised in small farms and they are also the bulk producers of meat, eggs etc. in the tropics. In many countries the farmers of these small farms are unable to meet the requirement set by financial institution and other loan giving agencies for agricultural loan. Thus, the small farmers can get neither the opportunity to generate sufficient income to support the family nor to extend the livestock activities. The production systems are characterized by small number of animals with no or minimal inputs, low outputs and periodic destruction of animals by disease. Typically the litter size or flocks are small in number with each household containing 5-6 pigs and 7-10 poultry. Animals are owned by individual households and mostly maintained under a scavenging systems with little or no inputs for housing, feeding or health care. Because of the nature of this production system, productivity of these animals is rather low. The low level of inputs is due to a lack of capital and a low risk oriented outlook. The feed resource base for monogastric is scavenging and consists of household waste, roots and tuber, grain by-products and anything edible found in the immediate environment. Usually farmers select breeding gilts from their own female piglets or to a lesser extent, buy them from neighbors for natural mating. As regards poultry attempts have been made to increase egg and meat production by improving local poultry birds by upgrading and crossbreeding with exotic germ plasma in the tropics. Animal disease present a major constraint to animal production in the tropical region and the extent of the losses due to disease is very high.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권5호
• /
• pp.360-370
• /
• 2009

태양 에너지 기반 센서 네트워크는 배터리 기반과는 다른 에너지 최적화 기법이 필요하다. 태양 에너지는 주기적으로 계속해서 공급되므로, 기본적으로는 센서 시스템을 영원히 동작하게 할 수 있지만, 공급되는 에너지양의 불확실성과 이를 저장하는 배터리의 용량 제한 등 고려해야 할 사항이 많다. 이 논문에서 우리는 태양 에너지 기반 센서 네트워크를 위한 안정적인 스토리지 시스템인 SolarSS를 제안한다. SolarSS는 계층적인 구조로 되어 있는데 각 계층마다 센싱 데이터의 수집, 노드 고장으로 인한 데이터 손실을 줄이기 위한 데이터 복제, 그리고 리소스 고갈로 인한 데이터 손실을 줄이기 위한 데이터 균등화 기능이 포함되어 있다 특히, 우리 시스템은 사용 가능한 에너지의 양에 따라 활성화/비활성화 되는 계층을 동적으로 결정하고, 데이터의 손실을 최소화하기 위한 효율적인 리소스(에너지 및 저장 공간) 할당 기법과 데이터 분배 기법을 제공한다.

• 한국통신학회논문지
• /
• 제31권10C호
• /
• pp.1011-1022
• /
• 2006

최근 유무선 네트워크는 IP 코어망을 중심으로 가입자망의 형태를 가지는 BcN(Broadband convergence Network)로 진화되고 있으며, 이와 함께 인간 외부환경의 감지를 수행할 유비쿼터스 센서네트워크(USN : Ubiquitous Sensor Network)가 새로이 연구되어 오고 있다. 감지하는 대부분의 데이터의 경우에 악의를 가진 노드에게 노출되거나 위변조 되어서는 안될 정보들이기 때문에 센서네트워트에서 에너지 효율을 고려한 정보보호 기법을 요구한다. 본 논문에서는 임의의 센서노드부터 싱크까지의 에너지 효율적이고 안전한 데이터 전달을 위한 정보보호기법으로, 단순한 해쉬함수의 계산을 중심으로 에너지 소모를 줄이는 키관리기법을 제안하였다. 제안하는 키관리기법의 보안성 분석을 위하여 만족해야 하는 보안성에 대해 정의 증명하였으며, 에너지효율성을 측정하였다. 각 기법은 기존의 관련연구와 비교 분석하여 본 논문에서 제안한 기법이 우수함을 증명하였다.

• Animal Systematics, Evolution and Diversity
• /
• 제29권2호
• /
• pp.99-114
• /
• 2013

Phylogeographic and feeding ecological studies of seven terrestrial mustelid species (Carnivora, Mustelidae), the Japanese marten Martes melampus, the sable Martes zibellina, the Japanese badger Meles anakuma, the ermine or the stoat Mustela erminea, the Japanese weasel Mustela itatsi, the least weasel Mustela nivalis, and the Siberian weasel Mustela sibirica, representing four biogeographic patterns in the Japanese archipelagos (Hokkaido, Honshu-Shikoku-Kyushu, Tsushima, and Hokkaido-Honshu), were reviewed in order to clarify causes for the faunal assemblage processes of those mustelid species in Japan. Here, three main constraints were extracted as important factors on the mustelid assemblage. First, fundamental evolutionary differences maintained by niche conservatism in each ecologically diversified lineage ("evolutionary constraint") would enable the species to co-occur without any major problem (coexistence among Martes, Meles, and Mustela species). Second, "ecological constraints" would force two closely related species to be allopatric by competitive exclusion (Mu. itatsi and Mu. sibirica) or to be sympatric by resource partitions (Mu. erminea and Mu. nivalis). Third and most importantly, "geological constraints" would allow specific species to be embraced by a particular geographic region, primarily deciding which species co-occurs. The allopatric distribution of two Martes species in Japan would have been established by the strong effect of the geological separation in Tsugaru Strait. Elucidating both phylogeny and ecology of co-existing species in a community assemblage is important to know which species possess distinct lineage and which ecological traits are adapted to local environments, fulfilling the requirement of the field of conservation biology that endemism and adaptation should both be considered. The Japanese archipelagos would, therefore, provide valuable insight into the conservation for small carnivoran species.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6214-6242
• /
• 2019

Routing in mobile ad hoc networks is performed in a distributed fashion where each node acts as host and router, such that it forwards incoming packets for others without relying on a dedicated router. Nodes are mostly resource constraint and the users are usually inclined to conserve their resources and exhibit selfish behaviour by not contributing in the routing process. The trust and reputation models have been proposed to motivate selfish nodes for cooperation in the packet forwarding process. Nodes having bad trust or reputation are detected and secluded from the network, eventually. However, due to the lack of proper identity management and use of non-persistent identities in ad hoc networks, malicious nodes can pose various threats to these methods. For example, a malicious node can discard the bad reputed identity and enter into the system with another identity afresh, called whitewashing. Similarly, a malicious node may create more than one identity, called Sybil attack, for self-promotion, defame other nodes, and broadcast fake recommendations in the network. These identity-based attacks disrupt the overall detection of the reputation systems. In this paper, we propose a reputation-based scheme that detects selfish nodes and deters identity attacks. We address the issue in such a way that, for normal selfish nodes, it will become no longer advantageous to carry out a whitewash. Sybil attackers are also discouraged (i.e., on a single battery, they may create fewer identities). We design and analyse our rationale via game theory and evaluate our proposed reputation system using NS-2 simulator. The results obtained from the simulation demonstrate that our proposed technique considerably diminishes the throughput and utility of selfish nodes with a single identity and selfish nodes with multiple identities when compared to the benchmark scheme.

• 한국컴퓨터정보학회논문지
• /
• 제12권3호
• /
• pp.147-153
• /
• 2007

태스크 스케줄링은 여러 개의 수행 가능한 태스크 중에서 하나의 태스크를 선정하여 프로세서에 할당하는 중요한 역할을 한다. 실시간 시스템에서 경성 실시간 태스크를 적시에 스케줄링하지 못하면 시스템이 다운되는 최악의 상태가 발생하므로 실시간 시스템은 효율성, 자원 및 속도 등의 문제 외에도 시간 제약도 진지하게 고려해야 한다. 본 논문에서는 L-RE 좌표를 이용하여 실시간 다중프로세서 시스템에서의 새로운 우선순위 기준 스케줄링 알고리즘을 제안한다. L-RE 좌표 알고리즘은 태스크의 스케줄링 효율을 높이기 위해 고안 되었으며 우선순위를 할당하는데 데드라인과 함께 유휴시간을 고려하고 있다. 시뮬레이션 결과는 LR-E 알고리즘이 EDF보다 스케줄의 원활성을 높이고 또 LLF보다는 문맥교환 수를 줄일 수 있음을 보여준다.