Journal ArticleDOI
A Proposal of B-Tree Based Routing Algorithm for Monitoring Systems with Regular Movements in MANETs
Byoung-Kug Kim,Doo-Seop Eom +1 more
Reads0
Chats0
TLDR
This paper proposes a routing protocol based on the binary-tree shaped network, which derives from the general table driven methods’ routing manners with DSDV families of MANETs and verifies whether the protocol would be efficiently used in such networks through its performance evaluations with simulation results.Abstract:
Routing Protocols in MANETs have been researched for peer-to-peer services in general. Furthermore, these protocols have been concerned with the fairness service amongst nodes' peers. However, most of those protocols aren't suitable for the data communication especially in hierarchical networks, where the most data flows are vertical like a monitoring system. Furthermore, for the monitoring system, amongst the nodes, one of them (a.k.a. root node) should be employed as a gateway to connect to Internet. Thus, most reporting data from certain nodes are delivered to the root node. Likewise, data should be delivered to the message originator nodes for responsibility. Therefore, a new routing protocol for such networks including the monitoring system is strongly required. This paper proposes a routing protocol based on the binary-tree shaped network, which derives from the general table driven methods' routing manners with DSDV families of MANETs. In conclusion, we verify whether our protocol would be efficiently used in such networks through its performance evaluations with simulation results.read more
Citations
More filters
Journal ArticleDOI
An Efficient Data Dissemination Method over Wireless Ad-Hoc Networks
TL;DR: An efficient method which leverages user interests and location information to support data dissemination in wireless ad hoc networks is proposed and the experimental results show that the proposed method outperforms the existing methods.
Journal ArticleDOI
Subarea tree routing algorithm based infrastructure for mobile ad-hoc networks
TL;DR: The main objective of this paper is creating a dynamic sub-area tree infrastructure for Mobile Ad hoc Networks (MANET), which uses the hierarchical procedure to divide the whole network into many geographical sub- area networks.
References
More filters
Ad hoc On-Demand Distance Vector (AODV) Routing
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Proceedings ArticleDOI
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Optimized Link State Routing Protocol (OLSR)
Thomas Clausen,Philippe Jacquet +1 more
TL;DR: The Optimized Link State Routing protocol is an optimization of the classical link state algorithm tailored to the requirements of a mobile wireless LAN and provides optimal routes (in terms of number of hops).
Proceedings ArticleDOI
A highly adaptive distributed routing algorithm for mobile wireless networks
V.D. Park,M.S. Corson +1 more
TL;DR: The proposed protocol is a new distributed routing protocol for mobile, multihop, wireless networks that is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks.
Book
Ad Hoc Networking
TL;DR: In this article, the authors present a series of technical papers about ad hoc networks from a variety of laboratories and experts, and explain the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity.
Related Papers (5)
Mobile ad-hoc network routing protocols: methodologies and applications
Scott F. Midkiff,Tao Lin +1 more