• Title/Summary/Keyword: limited flooding

Search Result 67, Processing Time 0.025 seconds

Limited Flooding Scheme in Mobile Sensor Networks

  • Lee, Ick-Soo;Lee, Eung-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.10
    • /
    • pp.1225-1230
    • /
    • 2015
  • Mobile Sensor Networks (MSN) is composed of a distributed collection of mobile sensor nodes, each of which has sensing, computation, communication and locomotion capabilities. Since the routing path can be broken when some nodes on the path move to other position, MSN may have a high rate of communication failure. So, MSN has to provide a means for low-cost and low-power routing to support mobility of sensor nodes. In this paper, a limited flooding scheme for routing in MSN is proposed to allow efficient energy utilization without requiring any complicated tasks for path maintenance.

Restricted Multi-path Flooding for Efficient Data Transmission in Wireless Sensor Networks (무선 센서 네트워크 상에서 효율적인 데이터 전송을 위한 제한된 다중경로 플러딩)

  • Cho Hyun-Tae;Baek Yun-Ju
    • 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.

In Vitro Culture and Factors Affecting Population Changes of Ditylenchus destructor of Ginseng (인삼의 Ditylenchus destructor 선충의 인공배양 및 밀도에 영향을 주는 요인)

  • 김영호;오승환
    • Korean Journal Plant Pathology
    • /
    • v.11 no.1
    • /
    • pp.39-46
    • /
    • 1995
  • Ditylenchus destructor isolated from diseased ginseng roots was cultured on ginseng calli, fungal mycelium (Fusarium solani), carrot discs and radish sprouts. Effects of temperature, organic material and flooding on the nematode population changes were examined. D. destructor multiplied readily on the culture media except radish sprout medium, and was cultured best on the fungal culture at 2$0^{\circ}C$. Feeding of the fungal hypha and radish root hairs, molting and mating in the fungal culture medium were observed. Addition of organic materials (perilla, sesame, soybean and ginseng leaves) in soil significantly increased Aphelenchus avenae and saprophytic nematode populations, while D. destructor populations changed little and the nematode population growths were limited by the organic amendments (except sesame leaves). The nematode populations in soil including D. destructor were decreased by flooding. The results indicate that D. destructor may survive but not multiply readily in soil without host plants and that it can be effectively controlled by flooding.

  • PDF

An Efficient On-Demand Routing Approach with Directional Flooding for Wireless Mesh Networks

  • Kum, Dong-Won;Le, Anh-Ngoc;Cho, You-Ze;Toh, Chai Keong;Lee, In-Soo
    • Journal of Communications and Networks
    • /
    • v.12 no.1
    • /
    • pp.67-73
    • /
    • 2010
  • Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

QoS-Aware Bounded Flooding RWA Algorithm in the Next Generation Optical Internet based on DWDM Networks (DWDM기반의 차세대 광인터넷에서 QoS 기반의 제한적 플러딩 RWA 알고리즘에 관한 연구)

  • Kim Yong-Seong;Lee Jae-Dong;Hwang Jin-Ho;Woo Chong-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.8 s.350
    • /
    • pp.1-14
    • /
    • 2006
  • Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.

An Adaptive Flooding Scheme using N-hop Look-ahead in MANET (MANET에서 N-hop 사전조사를 이용한 적응적인 플러딩 기법)

  • Jong, Jong-Hyeok;Oh, Im-Geol
    • 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.

  • PDF

Power Aware Greedy Perimeter Stateless Routing Protocol for Wireless Ad Hoc Network (무선 Ad Hoc 네트워크을 위한 위치정보 기반 에너지 고려 라우팅 프로토콜)

  • Lee, Byung-Geon;Yoon, Won-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.7
    • /
    • pp.62-66
    • /
    • 2008
  • In this paper we have proposed a power aware location based routing protocol for wireless ad hoc network. The existing greedy perimeter stateless routing (GPSR) has some problems which are certain node overloaded and void situation. The proposed power aware greedy perimeter stateless routing (PAGPSR) protocol gives a solution for these problems in GPSR. PAGPSR uses power aware and geographically informed neighbor selection to route a packet towards the destination. It also gives a solution for the fundamental problem in geographical routing called communication void. It considers residual energy of battery and distance to the destination for the next hope node selection. When it encounters a void it starts limited-flooding to select next hop node. To evaluate the performance of our protocol we simulated PAGPSR in ns-2. Our simulation results show that our protocol achieves longer network lifetime compared with greedy perimeter stateless routing (GPSR).

A Suitable Packet Time-To-Live Value for ZigBee Packets (지그비 패킷을 위한 최적의 패킷유지시간 설정 방법)

  • Lee, Kwang-Koog;Jeon, Yeong-Ho;Shin, Jin-Gyu;Park, Hong-Seong
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.154-156
    • /
    • 2006
  • These days wireless sensor networks receive much attention from industry and researchers on various fields. The challenge is that wireless sensor networks have limited resources. Nevertheless, the route discovery in ZigBee sensor networks is performed by simple flooding when the original racket is rebroadcasted at least once by every node in a network. Such uncontrolled flooding generates an excessive number of packets competing for the media and causes a high collision rate. In this article, we propose a suitable packet Time-To-Live value to solve problems of uncontrolled flooding in ZigBee networks. It is shown that more sufficient route discovery in a ZigBee network can save network resources and lengthen the life of a sensor network.

  • PDF

A study on a ballast optimization algorithm for onboard decision support system (선내탑재 의사결정지원 시스템을 위한 발라스트 최적화 알고리즘에 관한 연구)

  • Shin Sung-Chul
    • Journal of Navigation and Port Research
    • /
    • v.29 no.10 s.106
    • /
    • pp.865-870
    • /
    • 2005
  • Because there are only a limited number of means of action that are available for the master to pursue in the event of flooding, onboard decision support system has been required. The majority of systems activated during a flooding emergency (such as watertight and semi-watertight doors, bulkhead valves, dewatering pumps etc.) almost exclusively aim to restore a sufficiently high level of subdivision to prevent flooding from spreading through the ship. Even though assuming the flooding scenario is not catastrophic, the use of ballast tanks can be an additional and very effective tool to ensure both prevention of flooding spreading and also improve ship stability. This paper describes an optimization algorithm devised to choose the set of ballast tanks that should be filled in order to achieve an optimal response to a flooding accident.

An Energy-efficient Data Dissemination Protocol in Wireless Sensor Networks (무선 센서 네트워크에서 에너지 효율적인 데이타 전달 프로토콜)

  • Yi, Seung-Hee;Lee, Sung-Ryoul;Kim, Chong-Kwon
    • 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.