• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1317-1341
• /
• 2021

Nowadays, the Internet of Things (IoT) is adopted to enable effective and smooth communication among different networks. In some specific application, the Wireless Sensor Networks (WSN) are used in IoT to gather peculiar data without the interaction of human. The WSNs are self-organizing in nature, so it mostly prefer multi-hop data forwarding. Thus to achieve better communication, a cross-layer routing strategy is preferred. In the cross-layer routing strategy, the routing processed through three layers such as transport, data link, and physical layer. Even though effective communication achieved via a cross-layer routing strategy, energy is another constraint in WSN assisted IoT. Cluster-based communication is one of the most used strategies for effectively preserving energy in WSN routing. This paper proposes a Bio-inspired cross-layer routing (BiHCLR) protocol to achieve effective and energy preserving routing in WSN assisted IoT. Initially, the deployed sensor nodes are arranged in the form of a grid as per the grid-based routing strategy. Then to enable energy preservation in BiHCLR, the fuzzy logic approach is executed to select the Cluster Head (CH) for every cell of the grid. Then a hybrid bio-inspired algorithm is used to select the routing path. The hybrid algorithm combines moth search and Salp Swarm optimization techniques. The performance of the proposed BiHCLR is evaluated based on the Quality of Service (QoS) analysis in terms of Packet loss, error bit rate, transmission delay, lifetime of network, buffer occupancy and throughput. Then these performances are validated based on comparison with conventional routing strategies like Fuzzy-rule-based Energy Efficient Clustering and Immune-Inspired Routing (FEEC-IIR), Neuro-Fuzzy- Emperor Penguin Optimization (NF-EPO), Fuzzy Reinforcement Learning-based Data Gathering (FRLDG) and Hierarchical Energy Efficient Data gathering (HEED). Ultimately the performance of the proposed BiHCLR outperforms all other conventional techniques.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.500-517
• /
• 2017

In this paper, an improved zone-based routing protocol for heterogeneous wireless sensor networks is proposed. The proposed protocol has fixed the sized zone according to the distance from the base station and used a dynamic clustering technique for advanced nodes to select a cluster head with maximum residual energy to transmit the data. In addition, we select an optimal route with minimum energy consumption for normal nodes and conserve energy by state transition throughout data transmission. Simulation results indicated that the proposed protocol performed better than the other algorithm by reducing energy consumption and providing a longer network lifetime and better throughput of data packets.

• ETRI Journal
• /
• 제33권3호
• /
• pp.355-365
• /
• 2011

IPTV broadcast channels and video content distribution are increasingly saturating network paths. New solutions based on inter-domain multicast protocols could contribute to the enhancement of multimedia content distribution over the Internet. The aim of this paper is to propose new capabilities for an existing inter-domain multicast protocol, the Protocol Independent Multicast-Sparse Mode. We describe the modified protocol and analyze its behavior using newly developed tools based on an open-source software simulator. The resulting protocol does not require topology information, which is advantageous for easier deployment. In addition, the adopted solution avoids inherent problems with inter-domain multicast routing, such as multiple paths and path asymmetries.

• 융합보안논문지
• /
• 제9권4호
• /
• pp.35-41
• /
• 2009

현재 인터넷에서 사용중인 라우팅 프로토콜 중 대표적인 프로토콜인 기존의 BGP 프로토콜의 보안을 강화하는 연구들의 비교를 통해 BGP 프로토콜에 문제점으로 부각되고 있는 AS-Path, IP Fake, DRDoS 등의 BGP 프로토콜을 사용할 때 반드시 필요한 정보이지만 악의적인 공격 또는 잘못된 설정으로 인해 전세계 인터넷 망을 동작하지 못하게 할 수 있는 위협적인 사항에 대한 보안성에 대해 분석한다.

• 한국산업정보학회논문지
• /
• 제13권1호
• /
• pp.68-75
• /
• 2008

Ad hoc 네트워크는 구성이 변하기 쉬운 환경이므로 불법 노드가 네트워크 자원소비 및 경로방해 등의 동작이 용이하므로 라우팅 프로토콜 보호가 필요하다. 본 논문에서는 대칭키 암호화 방식을 이용하여 효율적이고 안전한 경로발견 프로토콜을 제안한다. 제안한 프로토콜은 대칭키 암호화 방식을 이용하여 각 홉에서 처리하는 연산량을 줄이며 경로응답 시 암/복호화 과정이 있어 정당한 홉을 가장한 active 공격에 강하다.

• 한국전자통신학회논문지
• /
• 제9권3호
• /
• pp.329-334
• /
• 2014

최근에 전기자동차의 상용화가 머지않은 상황에서 운전자를 위한 다양한 전자적 기능들이 개발되어지고 있다. 특히, 뇌파(EEG)를 통하여 운전자의 상태를 모니터링하면서 졸음방지나 건강상태를 실시간으로 점검하는 기능들이 있다. 자동차 운전자의 뇌파를 의료기관 서버에 전송하여 관련 기능들을 제공할 수 있는데 이때 자동차간 또는 자동차와 노변장치간의 원활한 통신기능이 필수적이다. 따라서 본 논문에서는 도심의 교차로환경에서 원활한 EEG 통신기능을 제공하는 라우팅 프로토콜을 제시하기 위해 AODV, DSR, GRP, OLSR, TORA와 같은 5가지의 라우팅 프로토콜로 운영되는 무선통신망을 각각 설계하고 이를 OPnet 네트워크 시뮬레이션을 통하여 성능을 평가하고 결과를 제시하고자 한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2011년도 춘계학술대회
• /
• pp.197-200
• /
• 2011

저전력 애드혹 네트워크에서 네트워크 노드들은 한정된 에너지와 자원을 기반으로 동작하기 때문에, 이를 고려한 다양한 라우팅 알고리즘이 제시되었다. 본 논문은 저전력 애드혹 네트워크의 노드 간 데이터 및 명령을 전송하기 위한 경로 설정 기법에 관한 것으로, 저전력 애드혹 네트워크의 속성을 적용한 경로 비용 함수를 정의하고 네트워크의 특성에 따라 제안된 경로 비용 함수가 유연하게 적용될 수 있도록 하는 동적 라우팅 프로토콜을 제안한다. 제안된 라우팅 프로토콜의 성능 분석은 QualNet 네트워크 시뮬레이터에서 수행되었다.

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

• Journal of Communications and Networks
• /
• 제14권1호
• /
• pp.91-103
• /
• 2012

Network mobility (NEMO) based on mobile IP version 6 has been proposed for networks that move as a whole. Route optimization is one of the most important topics in the field of NEMO. The current NEMO basic support protocol defines only the basic working mode for NEMO, and the route optimization problem is not mentioned. Some optimization schemes have been proposed in recent years, but they have limitations. A new NEMO route optimization scheme-involving a combination of the optimized route cache protocol (ORC) and reverse routing header (RRH) and the use of a quota mechanism for optimized sessions (OwR)-is proposed. This scheme focuses on balanced performance in different aspects. It combines the ORC and RRH schemes, and some improvements are made in the session selection mechanism to avoid blindness during route optimization. Simulation results for OwR show great similarity with those for ORC and RRH. Generally speaking, the OwR's performance is at least as good as that of the RRH, and besides, the OwR scheme is capable of setting up optimal routing for a certain number of sessions, so the performance can be improved and the cost of optimal routing in nested NEMO can be decreased.

• Industrial Engineering and Management Systems
• /
• 제15권3호
• /
• pp.268-277
• /
• 2016

Load balancing is a significant technique to prolong a network's lifetime in sensor network. This paper introduces a hybrid approach named as Load Distributing Hybrid Routing Protocol (LDHRP) composed with a border node routing protocol (BDRP) and greedy forwarding (GF) strategy which will make the routing effective, especially in mobility scenarios. In an existing solution, because of the high network complexity, the data delivery latency increases. To overcome this limitation, a new approach is proposed in which the source node transmits the data to its respective destination via border nodes or greedily until the complete data is transmitted. In this way, the whole load of a network is evenly distributed among the participating nodes. However, border node is mainly responsible in aggregating data from the source and further forwards it to mobile sink; so there will be fewer chances of energy expenditure in the network. In addition to this, number of hop counts while transmitting the data will be reduced as compared to the existing solutions HRLBP and ZRP. From the simulation results, we conclude that proposed approach outperforms well than existing solutions in terms including end-to-end delay, packet loss rate and so on and thus guarantees enhancement in lifetime.