• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• International Journal of Computer Science & Network Security
• /
• 제24권5호
• /
• pp.119-128
• /
• 2024

The moveable ad hoc networks are untrustworthy and susceptible to any intrusion because of their wireless interaction approach. Therefore the information from these networks can be stolen very easily just by introducing the attacker nodes in the system. The straight route extent is calculated with the help of hop count metric. For this purpose, routing protocols are planned. From a number of attacks, the wormhole attack is considered to be the hazardous one. This intrusion is commenced with the help of couple attacker nodes. These nodes make a channel by placing some sensor nodes between transmitter and receiver. The accessible system regards the wormhole intrusions in the absence of intermediary sensor nodes amid target. This mechanism is significant for the areas where the route distance amid transmitter and receiver is two hops merely. This mechanism is not suitable for those scenarios where multi hops are presented amid transmitter and receiver. In the projected study, a new technique is implemented for the recognition and separation of attacker sensor nodes from the network. The wormhole intrusions are triggered with the help of these attacker nodes in the network. The projected scheme is utilized in NS2 and it is depicted by the reproduction outcomes that the projected scheme shows better performance in comparison with existing approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4738-4753
• /
• 2018

Efficient rendezvous node selection and routing algorithm (RNSRA) for wireless sensor networks with mobile sink that visits rendezvous node to gather data from sensor nodes is proposed. In order to plan an optimal moving tour for mobile sink and avoid energy hole problem, we develop the RNSRA to find optimal rendezvous nodes (RN) for the mobile sink to visit. The RNSRA can select the set of RNs to act as store points for the mobile sink, and search for the optimal multi-hop path between source nodes and rendezvous node, so that the rendezvous node could gather information from sensor nodes periodically. Fitness function with several factors is calculated to find suitable RNs from sensor nodes, and the artificial bee colony optimization algorithm (ABC) is used to optimize the selection of optimal multi-hop path, in order to forward data to the nearest RN. Therefore the energy consumption of sensor nodes is minimized and balanced. Our method is validated by extensive simulations and illustrates the novel capability for maintaining the network robustness against sink moving problem, the results show that the RNSRA could reduce energy consumption by 6% and increase network lifetime by 5% as comparing with several existing algorithms.

• 한국ITS학회 논문지
• /
• 제8권4호
• /
• pp.53-64
• /
• 2009

차량간 통신은 노변기지국(RSE)을 통하지 않고 차량탑재장치(OBE)간에 정보를 전달하는 기술로 많은 관심을 받고 있다. 차량간 통신네트워크는 차량의 높은 이동 속도로 인하여 토폴로지의 변화가 심하기 때문에 기존 애드혹 라우팅을 적용하기 어렵다. MMFP(Multi-hop MAC Forwarding)는 경로설정 과정과 위치정보를 사용하지 않고 목적지 노드의 도달 가능 정보를 사용하여 패킷을 전송하는 멀티 홉 유니 캐스트 포워팅 프로토콜이다. 그러나 공공 안전 서비스에서 차량간 통신을 통해 제공 될 수 있는 차량 충돌, 장애물, 안개 등에 대한 정보는 특정 운전자가 아닌 다수의 운전자에게 유용한 정보이기 때문에 유니캐스트보다 브로드캐스트로 전달하는 것이 효율적이다. 플러딩은 가장 단순한 형태의 멀티 홉 브로드 캐스트 방식으로 너무 많은 중복 패킷을 생성하여 패킷성공률 감소, 전송 지연 증가 등의 문제가 발생한다. 본 논문에서는 MMFP를 확장하여 차량간 통신 환경에서 멀티 홉 브로드캐스트 통신을 지원하는 두 가지 프로토콜을 제안한다. UMHB(Unreliable Multi-Hop Broadcast)는 일부 노드에게만 포워딩 의무를 부여하는 MMFP의 전송 방식을 기반으로 포워딩 노드의 수를 제한함으로써 플러딩의 중복 패킷 문제를 해결하나 신뢰성이 감소하는 문제가 있다. RMHB(Reliable Multi-Hop Broadcast)는 화인 응답과 재전송을 통해 UMHB의 비신뢰성 문제를 해결하나 전송 지연이 다소 증가한다. 그러나 RMHB의 지연 시간 증가는 충돌 방지 응용에는 문제가 되지 않음을 실험 결과를 분석하여 보인다.

• Journal of information and communication convergence engineering
• /
• 제7권2호
• /
• pp.185-192
• /
• 2009

In wireless mesh networks multi-rate technology environment, a mesh node can dynamically modify the data transmission rate on a particular link, in response to link distance, or more accurately, the perceived SNR ratio between neighbor nodes. In such networks, existing route selection schemes use a link quality metric. Thus, these schemes may easily result in the network being overloaded. In this paper, a new route metric is proposed; it considers both per-hop service delay and link quality at mesh nodes. In addition, the Load-Aware AODV (LA-AODV) protocol using the proposed metric is presented. The performance evaluation is performed by simulation using the OPNET simulator. It is demonstrated that the LA-AODV protocol outperforms the existing routing protocols using other existing route metrics in multi-rate WMN environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권2호
• /
• pp.901-923
• /
• 2017

Efficient key distribution and management mechanisms as well as lightweight ciphers are the main pillar for establishing secure wireless sensor networks (WSN). Several symmetric based key distribution protocols are already proposed, but most of them are not scalable, yet vulnerable to a small number of compromised nodes. In this paper, we propose an efficient and scalable key management and distribution framework, named KMMR, for large scale WSNs. The KMMR contributions are three fold. First, it performs lightweight local processes orchestrated into upward and downward tiers. Second, it limits the impact of compromised nodes to only local links. Third, KMMR performs efficient secure node addition and revocation. The security analysis shows that KMMR withstands several known attacks. We implemented KMMR using the NesC language and experimented on Telosb motes. Performance evaluation using the TOSSIM simulator shows that KMMR is scalable, provides an excellent key connectivity and allows a good resilience, yet it ensures both forward and backward secrecy. For a WSN comprising 961 sensor nodes monitoring a 60 hectares agriculture field, KMMR requires around 2.5 seconds to distribute all necessary keys, and attains a key connectivity above 96% and a resilience approaching 100%. Quantitative comparisons to earlier work show that KMMR is more efficient in terms of computational complexity, required storage space and communication overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.1770-1785
• /
• 2013

In this paper, a multi-hop transmission protocol based on parallel communication of secondary users (SUs) is proposed. The primary multi-hop network coexists with a set of SUs by cooperative spectrum sharing. The main optimization target of our protocol is the overall performance of the secondary system with the guarantee of the primary outage performance. The energy consumption of the primary system is reduced by the cooperation of SUs. The aim of the primary source is to communicate with the primary destination via a number of primary relays. SUs may serve as extra decode-and-forward relays for the primary network. When an SU acts as a relay for a primary user (PU), some other SUs that satisfy the condition for parallel communication are selected to simultaneously access the primary spectrum for secondary transmissions. For the proposed protocol, two opportunistic routing strategies are proposed, and a search algorithm to select the SUs for parallel communication is described. The throughput of the SUs and the PU is illustrated. Numerical results demonstrate that the average throughput of the SUs is greatly improved, and the end-to-end throughput of the PU is slightly increased in the proposed protocol when there are more than seven SUs.

• Journal of Information Technology Applications and Management
• /
• 제10권2호
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.373-376
• /
• 2008

무선 센서 네트워크의 센서 노드는 다양한 최소령 센서로 구성된 저전력, 저메모리, 저컴퓨터 능력을 갖고 있다. 따라서 최근 무선 센서 네트워크의 이슈는 실용적인 응용 분야에서의 에너지 보존과 네트워크 수명을 만족하는 설계 및 개발을 요구한다. 이러한 에너지 소비량과 네트워크 수명을 만족하기 위해서 효율적인 라우팅 프로토콜 연구가 지속되어야 한다. 본 논문에서는 무선 센서 네트워크의 LEACH, LEACH-C, MTE, 그리고 PEGASIS 라우팅 프로토콜에 대해서 비교 분석하였다. 각각의 프로토콜의 운영 시간, 밧데리 소모, 총 에너지 소모량을 비교한다.

• 한국산업정보학회논문지
• /
• 제25권1호
• /
• pp.1-11
• /
• 2020

본 논문은 큰 스케일의 무선센서네트워크(Wireless Sensor Networks: WSN)에서 클러스터링을 위한 제어 메시지의 최적화된 전송반경을 사용하여 전체 네트워크의 수명을 증가시키는 방법을 제안한다. 또한 스케일이 큰 네트워크에서 노드들의 제어 메시지의 최대 전송반경과 에너지 소모에 대하여 고찰한다. 이를 위하여 일반 노드가 소모하는 에너지와 클러스터 헤드가 소모하는 에너지의 함수 형태로 제어 메시지 전송반경을 분석하고, 이를 바탕으로 최적의 전송반경을 구하는 방법을 제시한다. 제안한 방법을 이용하여 싱글 홉 및 멀티 홉 등의 여러 WSN 라우팅 환경에서 시행한 시뮬레이션 성능 분석 결과를 바탕으로, 본 논문에서 제안한 방법이 기존의 방법들에 비하여 전체 네트워크의 수명을 더욱 길게 운용하는 것을 보였다.