Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
ISIT 2003, Yokohama, Japan, June 29 July 4, 2003 Information-Theoretic Lower Bounds on the
 

Summary: ISIT 2003, Yokohama, Japan, June 29 July 4, 2003
Information-Theoretic Lower Bounds on the
Routing Overhead in Mobile Ad-hoc Networks
Nianjun Zhou
Dept. of Electrical, Computer and
Systems Engineering
110 Eighth Street
Rensselaer Polytechnic Institute
Troy, New York 12180, USA
e-mail: zhoun@rpi.edu
Alhussein A. Abouzeid
Dept. of Electrical, Computer and
Systems Engineering
110 Eighth Street
Rensselaer Polytechnic Institute
Troy, New York 12180, USA
e-mail: abouzeid@ecse.rpi.edu
I. Extended Abstract
In coding theory, a channel coding algorithm is good if it
achieves the Shannon capacity [1]. Similarly, we seek to derive

  

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

 

Collections: Engineering; Computer Technologies and Information Sciences