scispace - formally typeset
Proceedings ArticleDOI

An ad hoc network with mobile backbones

TLDR
This paper presents a design methodology to build a hierarchical large-scale ad hoc network using different types of radio capabilities at different layers and proposes a new stable clustering scheme to deploy the BN.
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. Recent research has demonstrated its performance bottleneck both theoretically and through simulation experiments and testbed measurement Building a physically hierarchical ad hoc network is a very promising way to achieve good scalability. In this paper, we present a design methodology to build a hierarchical large-scale ad hoc network using different types of radio capabilities at different layers. In such a structure, nodes are first dynamically grouped into multihop clusters. Each group elects a cluster-head to be a backbone node (BN). Then higher-level links are established to connect the BN into a backbone network. Following this method recursively, a multilevel hierarchical network can be established. Three critical issues are addressed in this paper. We first analyze the optimal number of BN for a layer in theory. Then, we propose a new stable clustering scheme to deploy the BN. Finally LANMAR routing is extended to operate the physical hierarchy efficiently. Simulation results using GloMoSim show that our proposed schemes achieve good performance.

read more

Citations
More filters
Journal ArticleDOI

A survey of clustering schemes for mobile ad hoc networks

TL;DR: This article presents a comprehensive survey of recently proposed clustering algorithms, which are classified based on their objectives and descriptions of the mechanisms, evaluations of their performance and cost, and discussions of advantages and disadvantages of each clustering scheme.
Journal ArticleDOI

Scalable routing protocols for mobile ad hoc networks

TL;DR: The article compares the scalability properties and operational features of the protocols and discusses challenges in future routing protocol designs.
Journal ArticleDOI

An effective key management scheme for heterogeneous sensor networks

TL;DR: This paper presents an effective key management scheme that takes advantage of the powerful high-end sensors in heterogeneous sensor networks and provides better security with low complexity and significant reduction on storage requirement, compared with existing key management schemes.
Journal ArticleDOI

Minimum-energy multicast in mobile ad hoc networks using network coding

TL;DR: This paper shows that under a simplified layered model of wireless networks, the minimum-energy multicast problem in mobile ad hoc networks is solvable as a linear program, assuming network coding.
Journal ArticleDOI

Transactions papers a routing-driven Elliptic Curve Cryptography based key management scheme for Heterogeneous Sensor Networks

TL;DR: A novel routing-driven key management scheme, which only establishes shared keys for neighbor sensors that communicate with each other, which can provide better security with significant reductions on communication overhead, storage space and energy consumption than other key management schemes.
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)