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

A Flexible Framework for Hierarchical Clustering on Wireless Sensor Networks

Yi Gong
TL;DR: This thesis introduces, implements and evaluates a novel flexible hierarchical clustering algorithm on middleware layer based on Publish/Subscribe paradigm to provide the five features, scalability, energy efficiency, fault tolerance, load balancing and multi-level clustering.
Journal ArticleDOI

Exploiting Heterogeneity in Ad Hoc networks with Antenna Arrays

TL;DR: This work proposes a solution that allows a few more resourceful nodes (highly connected, non-energyconstrained, and with low mobility) to improve the overall network performance in terms of end-to-end delay, connectivity and, especially, energy consumption.

Analysis of Fault Tolerance using Clustering Scheme for Wireless Sensor Network

TL;DR: This work presents a self-organizing, single hop clustering scheme, which is based on partitioning sensor networks into several disjoint cliques, an effective method to achieve fault tolerance, scalability, load balancing, routing etc.
Journal Article

East Algorithm For A-MAC Wireless Body Area Networks

TL;DR: Simulation results show that the proposed scheme effectively adapts transmission Power level to changing link quality with less control packets overhead and energy consumption as compared to classical approach with single region in which maximum transmitter Power level assigned to compensate temperature variation.
Journal ArticleDOI

Remove the black-hole attack in mobile ADHOC network using Threshold Based Technique

S. K. Yadav, +1 more
TL;DR: The enhanced AODV routing protocol based on the principle of thresholding using the concept of reference node selection process to simulate in NS2.34 simulators and measure some standard parameter such as PDR, throughput, overload and E2E delivery ratio.
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)