Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Information-Theoretic Bounds for Mobile Ad-hoc Networks Routing Protocols
 

Summary: Information-Theoretic Bounds for Mobile Ad-hoc
Networks Routing Protocols
Nianjun Zhou and Alhussein A. Abouzeid
Dept of Electrical, Computer and Systems Engineering
Rensselaer Polytechnic Institute
Troy, New York 12180, USA
email:zhoun@rpi.edu, abouza@rpi.edu
Abstract. In this paper, we define the routing overhead as the amount of infor-
mation needed to describe the changes in a network topology. We derive a uni-
versal lower bound on the routing overhead in a mobile ad-hoc network. We also
consider a prediction-based routing protocol that attempts to minimize the rout-
ing overhead by predicting the changes in the network topology from the previous
mobility pattern of the nodes. We apply our approach to a mobile ad-hoc network
that employs a dynamic clustering algorithm, and derive the optimal cluster size
that minimizes the routing overhead, with and without mobility prediction. We
believe that this work is a fundamental and essential step towards the rigorous
modeling, design and performance comparisons of protocols for ad-hoc wireless
networks by providing a universal reference performance curve against which the
overhead of different routing protocols can be compared.
1 Introduction

  

Source: Abouzeid, Alhussein A. - Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute

 

Collections: Engineering; Computer Technologies and Information Sciences