• Smart Structures and Systems
• /
• 제21권2호
• /
• pp.225-234
• /
• 2018

E-Health allows you to supersede the central patient wireless healthcare system. Wireless Body Sensor Network (WBSN) is the first phase of the e-Health system. In this paper, we aim to understand e-Health architecture and configuration, and attempt to minimize energy consumption and latency in transmission routing protocols during restrictive latency in data delivery of WBSN phase. The goal is to concentrate on polling protocol to improve and optimize the routing time interval and schedule communication to reduce energy utilization. In this research, two types of network models routing protocols are proposed - elemental and clustering. The elemental model improves efficiency by using a polling protocol, and the clustering model is the extension of the elemental model that Destruct Supervised Decision Tree (DSDT) algorithm has been proposed to solve the time interval conflict transmission. The simulation study verifies that the proposed models deliver better performance than the existing BSN protocol for WBSN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권2호
• /
• pp.649-663
• /
• 2012

We propose a percolation based M2M networking architecture and its data transmission method. The proposed network architecture can be server-free and router-free, which allows us to operate routing efficiently with percolations based on six degrees of separation theory in small world network modeling. The data transmission can be divided into two phases: routing and data transmission phases. In the routing phase, probe packets will be transmitted and forwarded in the network thus multiple paths are selected and performed based on the constriction of the maximum hop number. In the second phase, the information will be encoded, say, with the fountain codes, and transmitted using the paths generated in the first phase. In such a way, an efficient routing and data transmission mechanism can be built, which allow us to construct a low-cost, flexible and ubiquitous network. Such a networking architecture and data transmission can be used in many M2M communications, such as the stub network of internet of things, and deep space networking, and so on.

• 산업공학
• /
• 제20권2호
• /
• pp.204-215
• /
• 2007

This paper addresses vehicle routing planning in freight container transportation systems where a number of loaded containers are to be delivered to their destination places. The system under consideration is static in that all transportation requirements are predetermined at the beginning of a planning horizon. A two-phased procedure is presented for freight container transportation. In the first phase, the optimal model is presented to determine optimal total time to perform given transportation requirements and the minimum of number of vehicles required. Based on the results from the optimal model, in the second phase, ASA(Accelerated Simulated Annealing) algorithm is presented to perform all transportation requirements with the least number of vehicles by improving initial vehicle routing planning constructed by greedy method. It is found that ASA algorithm has an excellent global searching ability through various experiments in comparison with existing methods.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.448-450
• /
• 2005

A ubiquitous network allows all users to access and exchange information of any kind freely at any time, from anywhere, and from any appliance through the use of broadband and mobile access. Bluetooth commincation can provide the missing wireless extension to the heterogeneous network, allowing a more ubiquitous access. In this point of view, the BT specifications define ways for which each BT device can set up multiple connections with neighboring devices to communicate in a multi-hop fashion. this paper provides insights on the Bluetooth technology and on some limitations of the scatternet formations. so that, we describe a new multi-hop routing protocol for the establishment of scatternets. this protocol defines rules for forming a multi-hop topology in two phases. the first phase, topology discovery, concerns the discovery of the node's depth from a root node initiating inquiry process. the second phase forms scatternet topology based on the result of topology discovery.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5322-5342
• /
• 2016

In vehicle-to-vehicle (V2V) networks, where selfishness degrades node activity, countermeasures for collaboration enforcement must be provided to enable application of a sage and efficient network environment. Because vehicular networks feature both high mobility and various topologies, selfish behavior judgment and establishment of a stable routing protocol become intensely challenging. In this paper, a two-phase-based generous cooperative routing protocol (called GEC) is presented for V2V networks to provide resistance to selfishness. To detect selfish behaving vehicles, a packet forwarding watchdog and an average connection rate based on the multipath weight method are used, where evidence is gathered from different watchdogs. Then, multihop relay decisions are made using a generous cooperative algorithm based on game theory. Finally, through buffering of the multiple end-to-end paths and judicious choice of optimal cooperative routes, route maintenance phase is capable of dealing with congestion and rapidly exchanging traffic. Specifically, it is proved that the GEC is theoretically subgame perfect. Simulation results show that for V2V networks with inherently selfish nodes, the proposed method isolates uncooperative vehicles and is capable of accommodating both the mobility and congestion circumstances by facilitating information dissemination and reducing end-to-end delay.

• 한국통신학회논문지
• /
• 제24권7B호
• /
• pp.1239-1251
• /
• 1999

본 논문에서는 대규모 고속 통신망에서 분산 멀티미디어 응용을 지워하기 위한 효율적인 QoS-근거 계층적 도메인간 라우팅 방식을 제안하고 그 성능을 분석하기 위하여 모의실험을 수행하였다. QoS-근거 라우팅 문제는 다중척도 최단거리 문제로 변형될 수 있으며 이는 NP-complete로 알려져 있다[21, 30]. 제안되는 라우팅 방식은 두 단계로 이루어져 있다. 첫 번째 단P에서 고려중인 통신망을 그래프로 변형한다. 제안된 변형 방법은 기존의 라우팅 방식에서는 완전히 무시되거나 혹은 부분적으로 고려되었던 통신망의 위상도 고려한다. 두 번째 단계에서는 응용이 요구하는 QoS를 만족하는 가용한 경로를 구축된 그래프 상에서 찾기 위하여 원시 노드를 나타내는 vertex로부터 출발하여 깊이우선방식과 비슷하게 탐색하는 경험적 알고리즘이 연결단위로 수행된다. 또한 그래프상의 각 vertex에서 edge를 방문하는 순서를 결정하기 위한 규칙을 제안한다. 이 규칙은 각 QoS 파라미터의 요구되는 QoS 수준에 대한 최소 정규화된 여유도에 근거한다. 제안된 라우팅 방식은 PNNI-형태의 계층적 라우팅 방식을 확장한 것으로 다중척도를 가지는 경로 선택을 구체적으로 언급하였다.

• 대한전자공학회논문지TC
• /
• 제47권5호
• /
• pp.40-52
• /
• 2010

이동 애드 혹 네트워크는 인스턴트하고 자가 발견적인 특성과 함께 임시적이며 변화가 심한 연결성을 가진다. 토폴로지와 루트 변화가 빈번한 까닭에 일반 네트워크 용 라우팅 기법으로는 좋은 성능을 기대하기 어렵다. 노드의 증가에 따라, 또는 노드의 빠른 이동성에 따라 라우팅 프로토콜의 성능 저하가 발생한다. 본 논문에서는 MANET의 실시간 환경 변화에 적응적인 라우팅 프로토콜을 살펴본다. 먼저, 여러 다른 환경에서 두 가지 대표적 라우팅 프로토콜의 성능을 확인한다. 이어서, 성능 테스트로 얻어진 데이터를 분석하여 다중 모든 라우팅 프로토콜 선택 레퍼런스를 구축한다. 이 레퍼런스는 모든 노드에서 주기적으로 라우팅 환경을 체크할 때 사용된다. 다중 모드 라우팅 프로토콜 적용 방법을 사용함으로써 노드는 주기적으로 네트워크 환경을 체크하고 레퍼런스와 비교하여 성능저하를 최소화 할 수 있는 대체 라우팅 프로토콜을 결정하고 네트워크 전반에 걸쳐 적용한다. 제안한 기법은 OPNET 네트워크 모델링 시뮬레이션으로 그 성능을 확인하고 평가한다. 실험결과, 적응적으로 변화하는 다중 모드 라우팅 프로토콜 적용 기법이 네트워크 환경변화에 매우 효과적으로 사용될 수 있음을 확인하였으며 네트워크의 대역 이용비 측면에서도 우수한 것으로 나타났다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.120-127
• /
• 2002

The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.

• 한국콘텐츠학회논문지
• /
• 제6권2호
• /
• pp.84-92
• /
• 2006

본 논문에서는 영역 부호화 방식을 사용하는 다단계 상호연결망(MIN)에서의 효율적인 멀티캐스팅 알고리즘을 제안한다. 제안된 알고리즘은 원하는 멀티캐스트 목적지로 메시지를 보내기 위해, 네트워크에서 메시지를 최대 두 번을 순환시키는 순환 기법을 사용한다 이 알고리즘은 멀티캐스트 메시지의 복사 단계와 라우팅 단계인 두 순환 단계로 구성된다. 첫 번째 단계에서 출발지는 다수의 목적지 영역을 포함시키는 영역으로 메시지를 전송하고, 이들 목적지는 이 단계에서 메시지를 수신하여 저장한다 나머지 목적지들은 두 번째 단계에서 메시지를 최종적으로 수신한다. 본 알고리즘은 이 방법으로 전체 트래픽의 양을 줄임으로써 성능을 향상시킬 수 있다. 또한, 알고리즘의 성능을 멀티캐스트 목적지당 평균 순환 회수와 목적지당 평균 링크 수의 관점에서 기존의 알고리즘과 비교하여 평가한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1276-1295
• /
• 2023

Sensor networks are now an essential aspect of wireless communication, especially with the introduction of new gadgets and protocols. Their ability to be deployed anywhere, especially where human presence is undesirable, makes them perfect choices for remote observation and control. Despite their vast range of applications from home to hostile territory monitoring, limited battery power remains a limiting factor in their efficacy. To analyze and transmit data, it requires intelligent use of available battery power. Several studies have established effective routing algorithms based on clustering. However, choosing optimal cluster heads and similarity measures for clustering significantly increases computing time and cost. This work proposes and implements a simple two-phase technique of route creation and maintenance to ensure route reliability by employing nature-inspired ant colony optimization followed by the fuzzy decision engine (FDE). Benchmark methods such as PSO, ACO and GWO are compared with the proposed HRCM's performance. The objective has been focused towards establishing the superiority of proposed work amongst existing optimization methods in a standalone configuration. An average of 15% improvement in energy consumption followed by 12% improvement in latency reduction is observed in proposed hybrid model over standalone optimization methods.