• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.534-539
• /
• 2005

The key in wireless sensor networks, which consist of a number of sensor nodes, is an energy efficiency. Many routing protocols have been proposed for prolonging network lifetime and reducing traffic in wireless sensor networks. Wireless sensor networks usually use wireless ad-hoc network protocols for routing, but these protocols are not well-suited for wireless sensor networks due to many reasons. In this paper, RM-flooding protocol is proposed for reducing routing overhead occurred when packet flooding. The nodes using this routing protocol can consume the limited energy effectively, and exchange information with remote nodes usulg information receiving from multipath. So, RM-flooding prolongs the network's lifetime.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.499-504
• /
• 2010

The flooding is the simplest and effective way to disseminate a packet to all nodes in a wireless sensor network (WSN). However, basic flooding makes all nodes transmit the packet at least once, resulting in the broadcast storm problem in a serious case, in turn network resources become severely wasted. Particularly, power is one of the most valuable resources of WSNs as nodes are powered by battery, then the waste of energy by the basic flooding lessens the lifetime of WSNs. In order to solve the broadcast storm problem, this paper proposes a dynamic probabilistic flooding that utilizes the neighbor information like the number of child and sibling nodes. Simulation results show that the proposed method achieves a higher packet delivery ratio with the similar number of duplicate packets as compared to existing schemes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.387-392
• /
• 2008

위치 기반 라우팅은 오직 지역적인 위치 정보를 기반으로 데이터를 전송한다. 이 기법은 소스가 목적지의 위치 정보를 알고 있다고 가정하면 에너지 효율적이고 단순하다. 그러나, 무선 센서 망에서 소스는 목적지인 싱크의 위치 정보를 알지 못한다. 따라서 위치 기반 라우팅의 장점을 살리기 위해서는 소스가 효율적으로 싱크의 위치 정보를 미리 획득하는 과정이 필요하다. 본 논문은 무선망에서 싱크의 위치정보 획득을 위한 제한적인 선형 플러딩 방안을 제안한다. 제안 방안에서 싱크와 소스는 각각 싱크 위치 획득을 위한 메시지를 정해진 방향으로 전송하며 두 메시지의 교차 지점에 위치한 노드는 소스에게 싱크의 위치 정보를 전송한다. 싱크의 위치 정보를 획득한 소스는 위치 기반 라우팅을 통해 싱크에게 데이터를 전송할 수 있다. 또한 망 내부에 가상 제한 플러딩 지역 구성이라는 추가 방안을 통해 두 메시지의 교차 지점 생성을 보장한다. 우리는 시뮬레이션을 통해 제안 방안이 지금까지의 방안보다 에너지 면에서 효율적이며 신뢰성 있다는 것을 증명한다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.4
• /
• pp.32-39
• /
• 2006

MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.17-28
• /
• 2008

Rapid transmission of packets is important in mobile ad hoc networks. Therefore, a flooding algorithm which can guarantee a short delay is useful in various ways of packet transmission. Flooding algorithm is one of the packet transmission methods that broadcasts a packet to all nodes within a transmission range. It does not rebroadcast the same packet which is already received from other nodes. Basically, flooding algorithm's advantages are that it simply writes an address and a sequence number in a packet, and it can be adapted for topological changes easily. However, the basic flooding algorithm has a shortcoming that causes excessive traffic because all nodes transmit a packet at least once. To solve this problem, research about flooding algorithms that constrains duplicated transmission of packets based on probabilistic and geographical information is going on. However, the existing algorithm cannot guarantee short delay and low traffic. To reduce a delay, in this paper we propose a flooding scheme where a node which receives a broadcasted packet chooses and allocates a priority to one of its neighbor nodes and then the node transmits the packet promptly to the node to whom the priority was given. Moreover, we propose a totally fresh a roach to constrain duplicated transmission by searching a node that already received the same packet by using node's geographical position information. Lastly, we compare the performance of the proposed algorithm with the existing algorithm through simulation. The results show that the proposed algorithm can distribute packets through a lower number of total packet transmissions and faster delivery time than the existing algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.804-808
• /
• 2010

In this paper, we propose Restricted Angle-control Flooding considered density network of sensor nodes and node‘s limit energy. Restricted Angle-control Flooding, increase energy efficiency by reducing unnecessary candidate nodes involved in forwarding closer to the destination. And The Hole when faced with our proposal to raise rates data through Hole Detection which is sender‘s forwarding area is extended or broadcast to the entire network. Compared to the traditional flooding, we show the superiority at the node’s energy consumption, data rate and network lifetime through the performance.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.165-174
• /
• 2006

Data dissemination using either flooding or legacy ad-hoc routing protocol is not realistic approach in the wireless sensor networks, which are composed of sensor nodes with very weak computing power, small memory and limited battery. In this paper, we propose the ELF(Energy-efficient Localized Flooding) protocol. The ELF is energy-efficient data dissemination protocol for wireless sensor networks. In the ELF protocol, there are two data delivery phases between fixed source and mobile sink node. The first phase, before the tracking zone, sensing data are forwarded by unicasting. After that, within the tracking zone, sensing data are delivered by localized flooding. Namely, the ELF Properly combines advantages from both unicasting and flooding. According to evaluation results by simulation, the proposed ELF protocol maintains very high data delivery ratio with using a little energy. Also, the property of average delay is better than others. From our research results, the ELF is very effective data dissemination protocol for wireless sensor networks.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.487-489
• /
• 2003

애드 혹 망은 유선 기반망 없이 무선 노드만으로 구성된 망을 말한다. 이러한 특징으로 인하여 빠른 망 구축을 가능하게 하지만, 망의 동적인 구조와 노드들의 이동성을 고려할 때 효율적인 데이터 전송을 위한 경로 유지는 중요한 문제로 대두된다. 본 논문에서는 애드 혹 라우팅 프로토콜 중의 하나인 AODV(Ad­hoc On­demand Distance Vector) 라우팅 프로토콜에서의 지역복구 (local repair) 시 경로설정 패킷의 플러딩 범위를 제한하는 범위 제한적(seeped) 플러딩을 이용한 효율적인 지역복구 기법을 제안한다. 이 방법의 경우 기존의 AODV 지역복구에 비해서 경로설정 오버헤드를 줄이고 데이터 전송률을 높일 수 있다.

• Proceedings of the KAIS Fall Conference
• /
• 2000.04a
• /
• pp.24-24
• /
• 2000

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.235-239
• /
• 2007

이동 애드 혹 망에서 노드들의 이동성은 멀티캐스트를 어렵게 한다. 많은 멀티캐스트 프로토콜에서 데이터 전달 구조 구성과 유지를 하기 위해 주기적인 플러딩이 널리 사용된다. 이런 주기적인 플러딩 메시지는 네트워크의 제어 비용을 심각하게 증가시키고, 에너지와 대역폭 자원을 낭비하게 한다. 데이터 전달구조 유지 부담을 줄이기 위해, 많은 비상태 멀티캐스트 프로토콜이 제안되었고 이 프로토콜들은 데이터패킷을 목적지로 보내기 위해 각각의 패킷 안에 목적지 주소 리스트를 적재한다. 그러나 데이터 패킷의 길이가 한정되어 있기 때문에, 목적지 주소 리스트 적재 정책은 프로토콜의 확장성을 제한한다. 이 논문에서는 이동 애드 혹 망을 위한 확장성이 있는 이동 기반 오버레이 멀티캐스트(SLAOM)라는 프로토콜을 제안한다. 이 프로토콜은 데이터 전달 구조 구성과 유지를 위한 주기적인 플러딩이 필요하지 않으며, 각각의 데이터 패킷에 목적지 주소 리스트를 적재할 필요도 없다. 시뮬레이션 결과는 우리의 프로토콜이 데이터 전송률과 제어 비용 면에서 다른 프로토콜들보다 뛰어남을 보여준다.