scispace - formally typeset
Proceedings ArticleDOI

A heterogeneous routing protocol based on a new stable clustering scheme

Reads0
Chats0
TLDR
A new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network is proposed and a new active clustering scheme is presented to help build a stable hierarchical structure, which is fundamental toheterogeneous routing protocols.
Abstract
A mobile ad hoc network (MANET) is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Research has demonstrated its performance bottleneck both theoretically and through simulation experiments. Building a physically hierarchical ad hoc network is a very promising way to achieve scalability. Routing is critical to operate such a hierarchical structure efficiently. Previous research has been solely focusing on extending popular routing schemes developed for the homogeneous ad hoc network. We propose a new heterogeneous routing protocol specifically designed for the hierarchical ad hoc network. We also present a new active clustering scheme to help build a stable hierarchical structure, which is fundamental to heterogeneous routing protocols. Simulation results using GloMoSim show that our routing and clustering scheme gives good performance. The results also provide some insight into new possible designs of routing protocols and mobile network architectures for MANETs when large scale is desired.

read more

Citations
More filters
Proceedings ArticleDOI

Network Stochastic Optimization for Large Virtual Environment

TL;DR: A backbone network infrastructure, Generic Blackboard (GBB), implemented by ST Electronics (Training & Simulation System) Pte Ltd, is described on how a better interconnectivity can be achieved, providing optimum avenues for exchange of information.
Dissertation

Improvement of routing protocol in wireless sensor network for energy consumption to maximize network lifetime

TL;DR: Cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field is introduced and achieves an obvious improvement on the network lifetime.
Proceedings ArticleDOI

The Optimum Number of OSPF Areas for MANETs

TL;DR: Promising results from employing multiple OSPF areas as an efficient mean to enhance the scalability of MANETs are presented and an analytical model is developed to capture the relationship between the number of areas and the flooding overhead.
Journal ArticleDOI

Energy consumption pattern and scalability of routing protocols for heterogeneous MANETs

TL;DR: An analysis of AODV, DSR, AOMDV and CBRP protocols for heterogeneous MANETs shows that CBRP as compare to other protocols performs better and as a second choice, especially for large traffic, AomDV is the best protocol.
Proceedings ArticleDOI

Multi-mode tracking of a group of mobile agents

TL;DR: In this article, the authors proposed a group-based multi-mode tracking algorithm, which takes the group size and resource availability into consideration and determines the best solution at any particular time instance.
References
More filters
Proceedings ArticleDOI

Ad-hoc on-demand distance vector routing

TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Journal ArticleDOI

The capacity of wireless networks

TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.

Dynamic Source Routing in Ad Hoc Wireless Networks.

TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Book ChapterDOI

Dynamic Source Routing in Ad Hoc Wireless Networks

TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
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.
Related Papers (5)