• 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

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3472-3480
• /
• 2010

The Clustering technology of Energy efficiency wireless sensor network gets the energy efficiency by reducing the number of communication between sensor nodes and sink node. In this paper, First analyzed on the clustering technique of the distributed clustering protocol routing scheme LEACH (Low Energy Adaptive Clustering Hierarchy) and HEED (Hybrid, Energy-Efficient Distributed Clustering Approach), and based on this, new energy-efficient clustering technique is proposed for the cause the maximum delay of dead nodes and to increase the lifetime of the network. In the proposed method, the cluster head is elect the optimal efficiency node based on the residual energy information of each member node and located information between sink node and cluster node, and elected a node in the cluster head since the data transfer process from the data been sent to the sink node to form a network by sending the energy consumption of individual nodes evenly to increase the network's entire life is the purpose of this study. To verify the performance of the proposed method through simulation and compared with existing clustering techniques. As a result, compared to the existing method of the network life cycle is approximately 5-10% improvement could be confirmed.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1015-1024
• /
• 2011

Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1313-1329
• /
• 2015

In MANET, frequent route breaks lead to repeated route discovery process and this increases control packet overhead and packet drop. AODV-I improves performance of AODV by using the event driven approach which removes periodic Hello message. Unlike the Hello message, Interrupt message which is sent for each event can detect and predict the link failure because it allows node to know the status of the neighbor node. From this characteristics of Interrupt message, performance of AODV-I can be further improved by adding a processing procedures for each type of Interrupt message and it is also possible to improve AODV-I by adding the Backup path scheme because it originally has problems due to a single path of AODV. In this paper, we propose AODV-IB that combines improved Backup path scheme and Interrupt message approach of AODV-I in order to reduce transmission delay and the number of route discoveries. AODV-IB improves AODV-I by adding proper processing procedures for the link failure prediction and detection for each Interrupt message. We also implement improved Backup path strategy in AODV-IB by minimizing delay without additional Control packet. Simulation results, using the simulator QualNet 5.0, indicate that proposed AODV-IB performs better than AODV-I.

• Journal of Internet of Things and Convergence
• /
• v.2 no.2
• /
• pp.37-49
• /
• 2016

An IP address is used as a host identifier and a locator to bind hosts and applications to their location in existing Internet. Several protocols are proposed to eliminate this binding. Most of these protocols use IPv6-based host identifiers to maintain compatibility with existing Internet, but these identifiers cannot be handled by standard IPv6 routers because such identifiers are unroutable. Therefore, host identifiers need to be usually converted to locators at hosts, and the standard IPv6 protocol should be modified to interoperate with these protocols. In this paper, we propose a network-based host identifier locator separating scheme in software-defined networking. The proposed scheme separates the underlying network into Host Identity and IP domains in order to directly forward unroutable identifiers. The Host Identity domain operates as an overlaid network over IP domain, and it makes the unroutable identifiers to be routable using distributed hash table based routing strategy. For the evaluation, we compared the proposed scheme with the previous scheme using signaling costs and packet delivery costs. The result shows that the proposed scheme is more suitable in the recent mobile-based environments.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.