• 한국컴퓨터정보학회논문지
• /
• 제11권1호
• /
• pp.195-201
• /
• 2006

본 논문에서는 Ad Hoc Network에서 사용되는 proactive 라우팅 프로토콜과 reactive 라우팅 프로토콜의 혼합인 hybrid 라우팅 프로토콜에 대해 제안하였다. 본 논문에서는 기존의 hybrid라우팅 프로토콜이 ZRP와는 달리 Ad hoc 네트워크를 구성하는 노드들 중에 네트워크 서비스를 제공해주는 특별한 노드를 설정하여 라우팅 하는 방법을 제안한다. 이러한 역할을 해주는 특별한 노드를 본 논문에서는 C-Node라 부른다. C-Node를 이용한 라우팅으로 기존의 라우팅 프로토콜보다 경로 설정 시간과 flooding시간을 줄임으로서 효율적인 라우팅을 수행할 수 있게 된다.

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

In Wireless Sensor Network, various routing protocols were employed by our Research and Development community to improve the energy efficiency of a network as well as to control the traffic by considering the terms, i.e. Packet delivery rate, the average end-to-end delay, network routing load, average throughput, and total energy consumption. While maintaining network connectivity for a long-term duration, it's necessary that routing protocol must perform in an efficient way. As we discussed Optimized Link State Routing protocol between all of them, we find out that this protocol performs well in the large and dense networks, but with the decrease in network size then scalability of the network decreases. Whenever a link breakage is encountered, OLSR is not able to periodically update its routing table which may create a redundancy problem. To resolve this issue in the OLSR problem of redundancy and predict link breakage, an enhanced protocol, i.e. S-OLSR (More Scalable OLSR) protocol has been proposed. At the end, a comparison among different existing protocols, i.e. DSR, AODV, OLSR with the proposed protocol, i.e. S-OLSR is drawn by using the NS-2 simulator.

• 한국멀티미디어학회논문지
• /
• 제21권5호
• /
• pp.592-598
• /
• 2018

In wireless sensor networks where there is no centralized base station, each node has limited transmission range and the multi-hop routing for transmitting data to the destination is the one of the important technical issues. In particular, the wireless sensor network is not powered by external power source but operates by its own battery, so it is required to maximize the network life through efficient use of energy. To balance the power consumption, the residual power based adaptive power control is required in routing protocol. In this paper, we propose a routing protocol that prolongs the network lifetime by balancing the power consumption among the nodes by controlling the transmit power according to the residual power. We evaluate the proposed routing protocol using extensive simulation, and the results show that the proposed routing scheme can balance the power consumption and prolong network lifetime.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.295-306
• /
• 2010

Network lifetime is a critical issue in Wireless Sensor Networks (WSNs). In which, a large number of sensor nodes communicate together to perform a predetermined sensing task. In such networks, the network life time depends mainly on the lifetime of the sensor nodes constituting the network. Therefore, it is essential to balance the energy consumption among all sensor nodes to ensure the network connectivity. In this paper, we propose an energy-efficient data routing protocol for wireless sensor networks. Contrary to the protocol proposed in [6], that always selects the path with minimum hop count to the base station, our proposed routing protocol may choose a longer path that will provide better distribution of the energy consumption among the sensor nodes. Simulation results indicate clearly that compared to the routing protocol proposed in [6], our proposed protocol evenly distributes the energy consumption among the network nodes thus maximizing the network life time.

• 한국산업정보학회논문지
• /
• 제13권2호
• /
• pp.28-34
• /
• 2008

본 논문에서는 센서네트워크를 위한 라우팅 프로토콜인 EAR의 문제점을 제안하고 이를 효율적으로 해결하기 위한 에너지 효율적인 라우팅 프로토콜을 제안한다. 본 논문에서 제안한 라우팅 프로토콜은 노드들 간의 흡수와 에너지 고갈유무, 그리고 에너지 보유량을 동시에 고려함으로서 EAR에 존재하는 잠재적인 네트워크 분할이나 센싱 홀과 같은 문제점을 효율적으로 해결할 수 있다. 본 논문에서 제안한 라우팅 프로토콜은 기존의 라우팅 프로토콜의 문제점을 효율적으로 해결하면서 장점을 그대로 유지할 수 있는 특징을 갖는다.

• 한국정보통신학회논문지
• /
• 제17권8호
• /
• pp.1820-1826
• /
• 2013

산업현장에서 가장 많이 사용하고 있는 이기종 필드 센서 네트워크의 경우 센서간 통신은 CAN 통신 방식을 기반으로 버스형 구조로 설계되어 있다. 이러한 네트워크는 버스형 구조 특성상 거리 벡터 라우팅 프로토콜을 지원하고 있으며, 또한 이기종 네트워크를 지원할 경우 별도의 라우팅 테이블을 두어 변환하는 방식을 지원한다. 하지만 이러한 네트워크는 확장의 제한 및 늦은 전송처리속도 문제로 인해 네트워크 효율성 저하에 원인이 되고 있다. 그래서 본 논문에서는 네트워크의 확장성 및 높은 전송 처리속도를 보장하기 위한 새로운 CAN 라우팅 프로토콜을 제안한다. 제안하는 라우팅 프로토콜은 RIPv2 기반으로 설계되었으며, 거리 벡터 라우팅 프로토콜의 단점을 보안하기 위해 우선순위 부여 및 부가 기능을 부여할 수 있는 구간을 두는 방식을 지원하도록 설계하였다. 본 논문에서 제안하는 방식의 효율성 증가를 검증하기 위해 CAN 통신 기반으로 이기종 필드 센서 네트워크를 구축하여 데이터 전송률을 측정하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 춘계학술발표대회
• /
• pp.1609-1612
• /
• 2004

Ad hoc network is a kind of new wireless network paradigm for mobile hosts. Ad Hoc wireless networks consist of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. Mobile hosts rely on each other to keep the network connected. Each host is not only mobile hosts but also router. So how to design a routing protocol is the most important problem. Dynamic source routing is a kind of routing protocol. In this paper we suggest a new automatic route shortening method and an energy-aware routing mechanism based on DSR.

• 디지털산업정보학회논문지
• /
• 제5권3호
• /
• pp.59-67
• /
• 2009

This paper proposes a improved bitmap routing protocol, which finds the best energy efficient routing path by minimizing the network overheads and prolongs the overall network lifetime. Jung proposed a bitmap scheme for sensor networks. His scheme uses a bitmap table to represent the connection information between nodes. However, it has a problem that the table size is depends on the number of nodes in the sensor networks. The problem is very serious in the sensor node with a limited memory. Thereby, this paper proposes a improved bitmap routing protocol to solve the problem in Jung's scheme. Proposed protocol over the memory restricted sensor network could optimize the size of bitmap table by applying the deployed network property. Proposed protocol could be used in the diversity of sensor networks due to it has minimum memory overheads.

• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.207-213
• /
• 2021

Networks in Mobile ad hoc contain distribution and do not have a predefined structure which practically means that network modes can play the role of being clients or servers. The routing protocols used in mobile Ad-hoc networks (MANETs) are characterized by limited bandwidth, mobility, limited power supply, and routing protocols. Hybrid routing protocols solve the delay problem of reactive routing protocols and the routing overhead of proactive routing protocols. The Ant Colony Optimization (ACO) algorithm is used to solve other real-life problems such as the travelling salesman problem, capacity planning, and the vehicle routing challenge. Bio-inspired methods have probed lethal in helping to solve the problem domains in these networks. Hybrid routing protocols combine the distance vector routing protocol (DVRP) and the link-state routing protocol (LSRP) to solve the routing problem.

• International Journal of Computer Science & Network Security
• /
• 제21권12호
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.