• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.25-36
• /
• 2016

The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.

• Journal of Preventive Medicine and Public Health
• /
• v.22 no.1 s.25
• /
• pp.14-24
• /
• 1989

현재 중국에는 55개의 소수민족이 있으며, 그 인구총수는 6,700만을 초과한다. 중국정부는 특히 70년대 후반서부터 소수민족에 대한 일연의 보호정책을 쓰고 있으며 다수민족인 한족에 대하여 엄격히 실시하는 1가구 1자녀 정책에서도 소수민족을 제외하고 있다. 이에 따라 소수민족의 증가는 현저하게 늘었다. 그러나 전반적인 인구학적특성으로 보면 소수민족은 아직 후진성을 면하지 못하고 있다. 조선족이라고 일컫는 재중 우리교포는 한족을 포함하여 중국내 어느 민족과 비교하여도 인구학적으로 독특한 위치를 차지하는 경우가 많다. 예를 들어 인구증가율은 가장 낮으며 어느민족보다 앞서서 1970년대 중반에 이미 대치수준 이하의 출생률에 도달한 것으로 믿어지고 있다(Han 등, 1988). 문맹률은 최하이며 대학수업율은 최고로 높다(장(張), 1984). 사망률은 전소수민족중 가장 낮고 평균 수명은 가장 길다(Dowdle, 1984). 이렇게 재중 조선족은 인구학적으로 가장 선진적이기 때문에 1자녀 정책에 대한 수용 준비가 다른 민족보다 앞서 있다고 할 수 있겠다. 물론 조선족은 소수민족에 속하기 때문에 1자녀정책에 구애될 필요가 전혀 없다. 따라서 조선족 가정에서 1자녀만을 낳겠다는 서약을 하여 이른바 '독생자녀증'을 영수하면 이것은 한족의 경우와 달리 자율의사에 따른 것이라 할 수 있을 것이다. 이 논문에서는 다음 두가지를 다루기로 하겠다. 즉, 조선족이 인구학적으로 보아 딴 민족에 비하여 어떤 위치에 있으며, 또 중국의 중요인구정책인 1가정 1자녀제에 어떻게 반응하고 독생자녀증을 어떻게 수용하느냐 하는 것이다. 이 밖에 중국의 대소수민족 인구정책의 앞날에 대하여도 약간의 전망을 하여볼까 한다.스와 여기에 사용되는 신호 방식을 논의하고 있다. 그 외에도 전광 통신망 운용에 필요한 라우팅 및 파장할당 방법과 OXC를 이용한 그물형 망에서의 보호 및 복구에 대한 연구도 활발히 진행되고 있다.rotene 보충군에 비하여 유의적으로 높았으며 retinyl acetat와 B-carotene 보충군 사이에는 유의적인 차이가 없었다.3.17%로 가장 양호하였으나, 양파망과 염화비닐판을 수직으로 놓은 것은 각각 1.52%와 1.61%로 비교적 저조하였다. 수정 후 40일째부터 90일째까지 측정한 부착치패의 경과 일수에 따른 각장의 성장은 $SL=184.44e^{0.0335X}(r^2=0.9861)$의 회귀직선식으로서 나타났다. 중간육성 시험에서 수심별 성장을 분석한 결과, 비단가리비 치패는 저층보다 표층이 각장 5.92mm, 전중량 6.07g 정도 더 빨리 성장하였다. 시간으로 하여 l 주 44 시간을 기준으로 측정하면 통상질환관리 18.56시간, 지역사회 보건관리 5.67 시간, 모자보건 및 가족계획 5.52 시간, 사업 운영관리 및 지도 4.10시간, 지역사회 조직 및 개발 3.05 시간, 보건정보체계 개발 및 수집 2.94 시간, 사업계획 수립 2.89시간의 순으로 나타났다. 5) 보건진료원의 업무영역별 수행 소요시간의 상판판계를 살펴보면 지역사펴 조직 및 개발을 위 해 소요한 시간은 사엽계획 수립 소요시간 및 보건정 보체계 관리 소요시간과 순상관관계를, 사업 계획 수립 소요시간은 지역사회 보건관리, 모자보건 및 가족계획 관리 소요시간 및 보건정보체제 관리 소요시간과 순상관관계를 나타냈다. 또한 통상질환관리 소요시간은 지역 사회 조직 및 개발, 사업계획 수립, 지역사회 보건관리와 모자보건

• Journal of KIISE:Information Networking
• /
• v.29 no.6
• /
• pp.696-705
• /
• 2002

This paper presents a new copy network for multicast ATM switches. Many studies have been carried out up to date since the proposition of Lee's copy network. However, the overflows and cell conflicts within the switch have still been raised a problem in argument. In order to reduce those problems, we proposed a 3-dimensional multicast switching architecture which has shared buffers in this paper. The proposed architecture can reduce the overflows and cell conflicts through multiple paths and output ports even in the high load environments. Also, we proposed a cell splitting algorithm which handles the cell in the case of large fan-out, and a copy network to increase throughput by expanding the Lee's Broadcast Banyan Network(BBN). Cell copy uses the Boolean interval splitting algorithm and the multicast pattern of the cells according to the self-routing characteristics of the network. In the proposed copy network, we improve the problems such as overflow, cell splitting of large fanout, cell conflicts, etc., which were still existed in the Lee's network. The results of performance evaluation by computer simulation show that the proposed scheme has better throughput, cell loss rate and cell delay than the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1105-1114
• /
• 2010

The Proxy Mobile IPv6 (PMIPv6) has been standardized by the IETF NETLMM WG for network-based mobility management. The PMIPv6 can provide IP mobility for Mobile Nodes (MNs) with low handover latency and less wireless resource usage. But, since the PMIPv6 is basically designed for local mobility management, it cannot support directly global mobility management between different PMIPv6 domains. In the PMIPv6, since all traffic is routed through a Local Mobility Anchor (LMA), it causes a long end-to-end delay and triangular routing problem. Therefore, in this paper, we propose a fast network-based global mobility management scheme and route optimization scheme with a new network entity, called Global Mobility Agent (GMA). Numerical analysis and simulation results show that the proposed scheme is able to support global mobility between different public domains with low handover latency and low end-to-end delay, compared with the PMIPv6.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.59-69
• /
• 2005

Ad hoc network is the network which can be considered without a pre-constructed infrastructure, and a mobile node can join the network freely. However, the participation of the mobile nodes to the ad hoc network brings up much burden of re-computation for new routes, because it leads to losing the connection frequently. And, also, it causes serious security problem to be broadcasted wrong information by the malicious user. Therefore, it needs authentication against the mobile nodes. To make that Possible, we have two methods: single CA and distributed CA. In the case of CA method, the wireless network can be collapsed owing to expose the CA, but still the distributed CA method is a little more safe than previous one because it needs attacks toward a lot of CAs to collapse the network We can consider Secret Share scheme as the method that constructs the distributed CA system, but it is weak when the network size is too large. In this paper, we suggest hierarchical structure for the authentication method to solve this problem, and we will show the results of simulation for this suggestion.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.6
• /
• pp.41-49
• /
• 2022

The Internet Engineering Task Force (IETF) has standardized RPL (IPv6 Routing Protocol for Low-power Lossy Network) as a routing protocol for Low Power and Lossy Networks (LLNs), a low power loss network environment. RPL creates a route through an Objective Function (OF) suitable for the service required by LLNs and builds a Destination Oriented Directed Acyclic Graph (DODAG). Existing studies check the residual energy of each node and select a parent with the highest residual energy to build a DODAG, but the energy exhaustion of the parent can not avoid the network disconnection of the children nodes. Therefore, this paper proposes EC-RPL (Enhanced Connectivity-RPL), in which ta node leaves DODAG in advance when the remaining energy of the node falls below the specified energy threshold. The proposed protocol is implemented in Contiki, an open-source IoT operating system, and its performance is evaluated in Cooja simulator, and the number of control messages is compared using Foren6. Experimental results show that EC-RPL has 6.9% lower latency and 5.8% fewer control messages than the existing RPL, and the packet delivery rate is 1.7% higher.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.