• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11B
• /
• pp.1607-1617
• /
• 2010

In this paper we propose MA-CBRP, mesh adaptive algorithm for wireless mesh networks. MA-CBRP is a hybrid algorithm based on ad-hoc CBRP protocol. In MA-CBRP, the mesh router periodically sends the ANN message as like Hello-message in CBRP. ANN message allows to all clients periodically store a route towards the mesh-router and renewal information in their routing cache. While CBRP periodically reply Hello-message, MA-CBRP does not reply to achieve less overhead. After receiving ANN message, mesh client send JOIN message to mesh router when the route towards mesh router changed. at the same time Register the entry to mesh router, it can achieve to reduce overhead of control the route and shorten the time to find route. consequently, MA-CBRP shows 7% reduced overhead and shortened time to find route than CBRP with regardless of clients number.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.155-162
• /
• 2010

To ensure accurate measurements of wireless network performance, it should be collected real-time data which are transmitted between a large number of nodes in the actual network environment. Therefore, it is necessary to develop simulation tool for finding optimal network system design method such as media access control, routing technique, ad-hoc algorithm of node deployment while overcoming spatial and temporal constraints. Our research attempts to provide an improved architecture and design method of simulation tool for wireless network is an application of multi-threading technique in these issues. We finally show that usability of the proposed simulator by comparing results derived from same test environment in the wireless LAN model of our simulator and widely used network simulation package, NS-2.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.1
• /
• pp.196-201
• /
• 2018

Recently, various infrastructure-less IoT networking schemes have been studied to construct local IoT networks based on self-organization. This is, because RPL protocol, which is to support infrastructure based network construction is used to construct local IoT networks. Thus, a self-organization networking and ad hoc path between client and server in local IoT networks is not supported in basis RPL protocol. In this paper, we propose a self-organization networking scheme which support infrastructure-less based IoT network construction in low-power and lossy network based IoT environments consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Through simulation, we show that the proposed self-organization networking scheme improves the performance, in terms of the number of packets generated for end-to end data transmission and the end-to-end delay, compared to basis RPL protocol.

• Convergence Security Journal
• /
• v.18 no.5_1
• /
• pp.53-58
• /
• 2018

MANET transmits data by hop-by-hop method because it is composed of mobile nodes without support of any infrastructure. Its structure is very similar to a block chain. However, it is exposed to various threats such as data tampering or destruction by malicious nodes because of transmission method. So, ensuring the integrity of transmitted data is an important complement to MANET. In this paper, we propose a method to apply the block chain technique in order to protect the reliability value of the nodes consisting the network from malicious nodes. For this, hierarchical structure of a cluster type is used. Only cluster head stores the reliability information of the nodes in a block and then, this can be spread. In addition, we applied block generation difficulty automatic setting technique using the number of nodes selecting cluster head and the reliability of cluster head to prevent the spread of wrong blocks. This can prevent block generation and spread by malicious nodes. The superior performance of the proposed technique can be verified by comparing experiments with the SAODV technique.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.25-27
• /
• 2006

블루투스는 무선 홈 네트워킹을 구성하는 하나의 기술로 자리를 잡았지만, 기존의 홈 네트워킹을 구성하는 IRDA, 무선랜, Home RF, ZigBee 등에 비하여 블루투스 사용으로 인한 큰 이득이 없어 이용되지 않는 것이 현재 블루투스가 직면한 문제이다. 비슷한 통신반경을 지원하는 IRDA와 비교하면 가격과 전력소비에서 블루투스의 이점이 떨어지고, 다중 연결을 지원하는 장점에도 불구하고 10m 내의 전송 반경으로는(저 전력 사용 시) 집안을 전부 커버할 수 없기 때문에 무선랜에 비해 홈 네트워킹에서 이용성이 떨어지는 것이 사실이다. 하지만 이런 블루투스의 AD-HOC 라우팅을(1:1 혹은 1:다) 위한 블루투스 프로토콜 스택에 라우팅 프로토콜 스택을 추가함으로써 블루투스가 장착된 정보 가전기기는 주변으로부터 라우팅 정보를 수집하게 되고 라우팅 테이블을 구성할 수 있게 된다. 그러므로 전송 범위의 이상적인 설계에서 무선랜보다 넓어지게 되므로 홈 네트워킹에서 블루투스 사용의 단점이 보안됨은 물론 집안을 하나의 WEB처럼 구성할 수 있게 된다. 이에 다른 기술에 비한 저렴한 가격, 접속의 용이성, 저 전력 소비 둥과 같은 기존의 장점에 전송 거리의 단점이 보안된 블루투스 라우팅 프로토콜 기술은 IRDA, 무선랜보다 기술적 우위를 가짐으로써 홈 네트워킹에 적용이 많아지리라 예상할 수 있다. 더 나아가 블루투스 기술이 포함되어 있는 모바일 기기가 정점 늘어남에 따라 모바일 기기와의 연동에 의한 홈 네트워킹이 실생활에 적용되리라 예측되며, 집뿐만 아니라 어디에서나 다른 모바일 기기와 연결되어 네트워크를 이루는 유비쿼터스 네트워킹이 실현 될 수 있으리라 본다.-filtered CU)과는 비슷한 결과를 보였다. 결과적으로 제안된 방법은 전통적인 켑스트럴 평균 차감법에 기반하여 효과적인 채널 정규화가 가능하다는 것을 보였다.ttention since the operation of local autonomy in Korea. This trend focuses on ′visual landscape planning′, and it is expected to grow drastically in the near future. Therefore, it is recommended that we promote the more elaborate methodology of ′visual landscape planning′, which also includes the ecological and cultural aspects of the environment. 7월 시료에는 ethane, ethyl formate, trans-2-hexenal의 순서로 그 함량이 많았으며, hydrocarbon류가 전체성분의 30.42%를 차지하였다. 8월 시료는 benzyl alcohol, ethyl formate 및 trans-2-hexenal의 순서로 많이 함유되어 있었으며, ester류가 35.60%를 차지하였다. 또한 9월 시료에도 ester류가 32.92%를 차지하였으며 ethyl acetate, benzyl alcohol, ethane 및 trans-2-hexenal의 순서로 함량이 높았다.to isolate the major component of silkworm powder, which exerts blood glucose-lowering e

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.4
• /
• pp.53-64
• /
• 2009

Inter-vehicular communication that propagates information without infrastructures has drawn a lot of interest. However, it is difficult to apply conventional ad-hoc routing protocols directly in inter-vehicular communication due to frequent changes in the network topology caused by high mobility of the vehicles. MMFP(Multi-hop MAC Forwarding) is a unicast forwarding protocol that transport packets based on the reachability information instead of path selection or position information. However, delivering public safety messages informing road conditions such as collision, obstacles and fog through inter-vehicular communication requires broadcast rather than unicast since these messages contain information valuable to most drivers within a close proximity. Flooding is one of the simplest methods for multi-hop broadcast, but it suffers from reduced packet delivery-ratio and high transmission delay due to an excessive number of duplicated packets. This paper presents two multi-hop broadcast protocols for inter-vehicular communication that extend the MMFP. UMHB(Unreliable Multi-Hop Broadcast) mitigates the duplicated packets of MMFP by limiting the number of nodes to rebroadcast packets. UMHB, however, still suffers from low delivery ratio. RMHB(Reliable Multi-Hop Broadcast) uses acknowledgement and retransmission in order to improve the reliability of UMHB at the cost of increase in transmission delay, which we show through simulation is within an acceptable range for collision avoidance application.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.41-47
• /
• 2009

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The power consumption imbalance among sensor nodes may cause a network partition and failures where the transmission from some sensors to the sink node could be blocked. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications and can drastically affect the network's communication energy dissipation. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Our improved cluster head selection method ensures that energy is consumed evenly among the nodes in the network, thereby increasing the network lifetime. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 10.36% and 24.05% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively and also prolongs the network lifetime.