Anna University, Chennai

EC9023 MOBILE ADHOC NETWORKS

UNIT I INTRODUCTION
Introduction to Ad Hoc networks definition, characteristics features, applications.Characteristics of
Wireless channel, Adhoc Mobility Models: - Indoor and outdoor models.
UNIT II MEDIUM ACCESS PROTOCOLS
MAC Protocols: design issues, goals and classification. Contention based protocols with reservation,
scheduling algorithms, protocols using directional antennas. IEEE standards: 802.11a, 802.11b,
802.11g, 802.15. HIPERLAN.
UNIT III NETWORK PROTOCOLS
Routing Protocols: Design issues, goals and classification. Proactive Vs reactive routing, Unicast
routing algorithms, Multicast routing algorithms, hybrid routing algorithm, Energy aware routing
algorithm, Hierarchical Routing, QoS aware routing.
UNIT IV END-END DELIVERY AND SECURITY
Transport layer: Issues in designing- Transport layer classification, adhoc transport protocols.
Security issues in adhoc networks: issues and challenges, network security attacks, secure routing
protocols.
UNIT V CROSS LAYER DESIGN AND INTERGRATION OF ADHOC FOR 4G
Cross layer Design: Need for cross layer design, cross layer optimization, parameter optimization
techniques, Cross layer cautionary perspective, Sensor Network Architecture, Data Dissemination,
Data Gathering, Location Discovery, Quality of a Sensor Network Integration of adhoc with Mobile IP
networks.
TEXT BOOKS
1. C.Siva Ram Murthy and B.S.Manoj, Ad hoc Wireless Networks Architectures and protocols, 2 nd
edition, Pearson Education. 2007
2. Charles E. Perkins, Ad hoc Networking, Addison Wesley, 2000
REFERENCES
1. Stefano Basagni, Marco Conti, Silvia Giordano and Ivan stojmenovic, Mobile adhoc networking,
Wiley-IEEE press, 2004.
2. Mohammad Ilyas, The handbook of adhoc wireless networks, CRC press, 2002.
3. T. Camp, J. Boleng, and V. Davies A Survey of Mobility Models for Ad Hoc Network Research,
Wireless Communication and Mobile Comp., Special Issue on Mobile

I.I.T., Delhi
CSL851: Algorithmic Graph Theory
UNIT I Graphs Definition - Paths and Chains - Loops, Circuits and Cycles Degrees of a Vertex - Partial Graphs and Subgraphs - Types of Graphs - Strong
Graphs and the Components of a Graph - Matrix Representations - Reachability and
Connectivity - Reachability and Reaching Matrices - Calculation of Strong
Components - Bases - Problems Associated with Limiting the Reachability
UNIT II Independent and Dominating SetsThe Set Covering Problem Independent Sets Dominating Sets - The Set Covering Problem - Applications of the
Covering Problem - Graph Colouring- Theorems and Bounds for the Chromatic
Number - Exact Colouring Algorithms - Approximate Colouring Algorithms Generalizations and Applications
UNIT III The Location of Centres - Separations - Centre and Radius - The
Absolute Centre - Algorithms for the Absolute Centre - Multiple Centres (p-Centres) Absolute p-Centres - An Algorithm for Finding Absolute p-Centres - The Location of
Medians - Multiple Medians (p-Medians) - The Generalized p-Median -Methods for
the p-Median Problem
UNIT IV Trees - The Generation of all Spanning Trees of a Graph - The Shortest
Spanning Tree (SST) of a Graph - The Steiner Problem - Shortest Paths - The Shortest
Path Between Two Specified Vertices s and t - The Shortest Paths Between all Pairs
of Vertices - The Detection of Negative Cost Circuits - The K Shortest Paths Between
Two Specified Vertices - The Shortest Path Between Two Specified Vertices in the
Special Case of a Directed Acyclic Graph - Problems Related to the Shortest Path Circuits, Cut-sets and Eider's Problem - The Cyclomatic Number and Fundamental
Circuits - Cut-sets - Circuit and Cut-set Matrices - Eulerian Circuits and the Chinese
Postman's Problem
UNIT V Hamiltonian Circuits in a Graph - Comparison of Methods for Finding
Hamiltonian Circuits - A Simple Scheduling Problem -The Travelling Salesman
Problem - The Travelling Salesman and Shortest Spanning Tree Problems - The
Travelling Salesman and Assignment Problems - Network Flows - The Basic (s to t)
Maximum Flow Problem - Simple Variations of the (s to t) Maximum Flow Problem Maximum Flow Between Every Pair of Vertices - Minimum Cost Flow from s to tFlows in Graphs with Gains
TEXT BOOKS
1. Nicos Christofides, GRAPH THEORY - An Algorithmic Approach , Academic
Press, New York.
REFERENCES

1. Narsingh Deo, Graph Theory: With Application to Engineering and Computer Science,
Prentice Hall of India, 2003.
2. R.J. Wilson, Introduction to Graph Theory, Fourth Edition, Pearson Education, 2003.