• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2020-2037
• /
• 2017

In order to improve the energy efficiency of n-Epidemic routing protocol in opportunistic networks, in which a stable end-to-end forwarding path usually does not exist, a novel adjustment strategy for parameter n is proposed using learning atuomata principle. First, nodes dynamically update the average energy level of current environment while moving around. Second, nodes with lower energy level relative to their neighbors take larger n avoiding energy consumption during message replications and vice versa. Third, nodes will only replicate messages to their neighbors when the number of neighbors reaches or exceeds the threshold n. Thus the number of message transmissions is reduced and energy is conserved accordingly. The simulation results show that, n-Epidemic routing protocol with the proposed adjustment method can efficiently reduce and balance energy consumption. Furthermore, the key metric of delivery ratio is improved compared with the original n-Epidemic routing protocol. Obviously the proposed scheme prolongs the network life time because of the equilibrium of energy consumption among nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.248-251
• /
• 2011

무선 센서 네트워크는 다양한 응용 분야와 환경에 배치되기 때문에, 악의적인 목적을 가진 사용자의 공격에 손쉽게 노출되어 있다. 선택적 전달 공격은 센서 네트워크에서 발생 할 수 있는 가장 대표적인 라우팅 공격 중의 하나로, 데이터 패킷의 정상적인 전달을 차단하여 상황 인지 및 이에 대한 대응을 지연시킨다. 기존에 제안된 탐지 기법은 패킷 전달 경로 상에 감시 노드를 선정하고, 패킷이 전송 될 때마다 인증메시지를 소스 노드에게 전송하여 공격 발생 여부를 탐지한다. 하지만, 패킷을 전송할 때 마다 공격 탐지를 수행하기 때문에 한정된 에너지를 바탕으로 동작하는 센서 네트워크에 적합하지 못하다. 본 논문에서는 탐지율을 충분히 유지하면서도 높은 에너지 효율성 위해 센서 네트워크의 특성을 고려한 선택적 전달 공격 탐지 기법을 제안한다. 제안하는 기법에서는 기존 기법에서와 같이 즉시 탐지를 수행하는 대신에 패킷 전송 시간을 고려한 네트워크 모니터링을 수행하고, 공격 받았을 가능성이 있는 경로에 대해서만 지연탐지를 수행한다. 본 논문의 우수성을 보이기 위해서 시뮬레이션을 통해 성능 평가를 수행하였으며, 그 결과 기존 기법에 비해 탐지율이 평균 약 15% 향상되었고, 네트워크의 에너지 소모량이 평균 약 54% 감소하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.37-45
• /
• 2004

In this paper we propose Clustered Group Multicast by Clustering Algorithm in Wireless Mobile Ad-hoc Network. The proposed scheme applies to Weighted Cluster Algorithm Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base station. In ad hoc network muting protocol because of limited bandwidth and high mobility robust, simple and energy consume minimal. WCGM method uses a base structure founded on combination weighted value and applies combination weight value to cluster header keeping data transmission by seeped flooding, which is the advantage of the exiting FGMP method. Because this method has safe and reliable data transmission, it shows the effect to decrease both overhead to preserve transmission structure and overhead for data transmission.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.13-20
• /
• 2005

An ad hoc wireless networks forms temporary network without the aid of fixed networks or centralized administration with a collection of wireless mobile hosts. In this case, it is necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. This paper presents an efficient cluster-based routing protocol scheme for ad hoc networks. The cluster is used for path setup and data delivery. Our cluster-based routing algorithm is designed for the improvement of the load balance. Our simulation results show the improved performance for low mobility networks comparing with the previous works.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1922-1940
• /
• 2019

IP address lookup is a function to determine nexthop for a given destination IP address. It takes an important role in modern routers because of its computation time and increasing Internet traffic. TCAM-based IP lookup approaches can exploit the capability of parallel searching but have a limitation of its size due to latency, power consumption, updatability, and cost. On the other hand, multibit trie-based approaches use SRAM which has relatively low power consumption and cost. They reduce the number of memory accesses required for each lookup, but it still needs several accesses. Moreover, the memory efficiency and updatability are proportional to the number of memory accesses. In this paper, we propose a novel architecture using an Indexed Multibit Trie (IMT) which is based on combined TCAM and SRAM. In the proposed architecture, each lookup takes at most two memory accesses. We present how the IMT is constructed so as to be memory-efficient and fast updatable. Experiment results with real-world forwarding tables show that our scheme achieves good memory efficiency as well as fast updatability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2589-2609
• /
• 2021

Segment routing (SR) is a highly implementable approach for traffic engineering (TE) with high flexibility, high scalability, and high stability, which can be established upon existing network infrastructure. Thus, when a network failure occurs, it can leverage the existing rerouting methods, such as rerouting based on Interior Gateway Protocol (IGP) and fast rerouting with loop-free alternates. To better exploit these features, we propose a high-performance and easy-to-deploy method SRUF (Segment Routing under Uncertain Failures). The method is inspired by the Value-at-Risk (VaR) theory in finance. Just as each investment risk is considered in financial investment, SRUF also considers each traffic distribution scheme's risk when forwarding traffic to achieve optimal traffic distribution. Specifically, SRUF takes into account that every link may fail and therefore has inherent robustness and high availability. Also, SRUF considers that a single link failure is a low-probability event; hence it can achieve high performance. We perform experiments on real topologies to validate the flexibility, high-availability, and load balancing of SRUF. The results show that when given an availability requirement, SRUF has greater load balancing performance under uncertain failures and that when given a demand requirement, SRUF can achieve higher availability.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1178-1181
• /
• 2009

Geographic forwarding algorithms을 사용하는 Georouting protocol에서는 route maintenance을 위해서 고정된 주기마다 beacon message을 이웃노드에 전송하는 fixed periodical beacon based route algorithm을 사용하여 mobile node 정보를 습득한다. Fixed periodical beacon scheme에서의 기존 연구 이슈는 이웃노드 정보의 신뢰성을 유지하기 위해서 다양한 mobility environment 환경에 맞도록 beacon 전송주기를 적절히 결정하는 연구가 진행되어 왔다. 이와 같은 연구에서는 long periodical interval 사용 시 이웃노드의 위치정보 error을 발생시킬 확률이 높으며 또한 short periodical interval 의 경우 네트워크 내에 high route overhead 을 유발시키는 단점을 가지고 있다. 따라서 고정된 주기 방법은 다양한 mobility environment에 잘 적용되지 못하며 또한 mobility environment 에서 발생하는 route maintenance 내에 이웃노드 정보에 대한 불확실성 문제가 빈번이 발생하여 경로 설정에 잘못된 정보를 제공하여 경로 신뢰성(path reliability)과 낮은 전송률 (transmission rate)을 야기한다. 본 논문에서는 이런 이웃노드 정보의 불확실성 문제를 극복하기 위해서 mobile node가 스스로 자신의 위치를 체크하여 routing table을 능동적으로 갱신하는 방법을 이용하여 이 문제를 극복할 수 있도록 하였다. 모의 실험은 ns2를 이용하여 실시하였으며 결과는 low/high mobility scenario에서는 기존 방법 보다 routing overhead 을 줄이면서 높은 전송률 (transmission rate)을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.671-672
• /
• 2011

비 신뢰적이고 비 대칭적인 무선 링크를 갖는 무선센서네트워크에서 데이터전송이 성공했음에도 ACK 메시지 전송 실패로 발생하는 불필요한 데이터 재전송을 피해 에너지 효율을 높이는 전송기법들이 제안되었다. 이러한 전송기법의 하나인 Probability-based Data Forwarding(PDF)기법에서 기대 전송 횟수 임계치를 설정해 임계값만큼 데이터를 재전송 하였다면 더 이상 재전송하지 않음으로 불필요한 에너지 낭비를 줄인다. 하지만 PDF 는 데이터 전송 횟수만을 고려함으로, 여전히 ACK 메시지의 신뢰성 있는 전송을 보장하지 못한다. 따라서 본 논문은 에너지 효율적인 PDF 기법에 비 대칭적 무선 노드의 특성을 고려하여 ACK 메시지 전송 시 사용되는 역방향 링크의 신뢰성이 낮다면 높은 신뢰성의 역방향 링크를 갖는 노드들을 선택하여 멀티 홉으로 송신 노드에게 ACK 메시지를 전송하는 기법을 적용한다. 이를 통해 불필요한 데이터 전송을 줄여 에너지의 낭비를 줄이고 무선센서네트워크의 수명을 연장한다.

• Journal of Internet Computing and Services
• /
• v.6 no.3
• /
• pp.85-95
• /
• 2005

Whereas the traditional multicast schemes based on Mobile IP can support a limited number of very large multicast groups, the Xcast protocol can support a very large number of small multicast groups, In the Xcast, the source node encodes the list of destinations in the Xcast header. Therefore, the maximum packet size in the network limits the number of destinations that a Xcast packet may have. In this paper, an enhanced Xcast protocol is proposed to solve the multicast group size limitation of the existing Xcast protocol in providing multicast service for mobile nodes. Moreover, the SIP (a very flexible control plane protocol) is integrated with the proposed multicast scheme to provide mobility awareness on the application layer. The simulation results verify that the proposed multicast scheme not only increases the packet delivery ratio and the data packet forwarding efficiency but also achieves low latency of packets in the network.

• Journal of Advanced Navigation Technology
• /
• v.11 no.1
• /
• pp.118-126
• /
• 2007

An ad hoc network is a system of wireless mobile nodes that dynamically self-organize in arbitrary and temporary network topologies allowing people and devices to internetwork without any preexisting communication infrastructure. Although ad hoc network is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; ad hoc networks are known to be particularly vulnerable to security attack. It is difficult to establish a centralized key distribution center and a trusted certification authority to provide cryptographic keys and digital certificates to nodes. To prevent attacks in ad hoc routing protocols, many algorithms have been used. In this paper, we have depicted a secure framework for multipath routing in wireless multihop network, which is comprehensive solution for secure data forwarding in wireless multihop networks. With the simulation results, the proposed scheme is compared with existing source routing scheme.