M.Tech NETWORK ENGINEERING TRIMESTER I

mustardpruneΔίκτυα και Επικοινωνίες

23 Οκτ 2013 (πριν από 4 χρόνια και 18 μέρες)

207 εμφανίσεις



1


M.Tech NETWORK ENGINEERING


TRIMESTER

I


S.No

Subject
Code

Subject

L

T

P

C

Theory

1

PTS1MAB0
8

Mathematical Foundations for Communication
Systems

3

1

0

4

2

PTS1NEB01

Data Communication and Networks

3

0

0

3

3

PTS1NEB02

Communication systems

3

0

0

3

Prac
tical

4

PTS1NEB03

Digital Communication Lab

0

0

3

2

Total Credits

12


TRIMESTER

II


S.No

Subject
Code

Subject

L

T

P

C

Theory

1

PTS2NEB04

Advanced Digital Signal Processing

3

0

0

3

2

PTS2NEB05

Cryptography And Network Security

3

0

0

3

3

PTS2
NEB06

Internet Programming

3

0

0

3

Practical

4

PTS2NEB07

Internet Programming lab

0

0

3

2

Total Credits

11


TRIMESTER

III


S.No

Subject
Code

Subject

L

T

P

C

Theory

1

PTS3NEB08

Network Programming

3

0

0

3

2

PTS3NEB09

Mobile and Personal Communicat
ion

3

0

0

3

3

*****

Elective

f

P

M

M

P

Practical

4

PTS3NEB10

Networking Lab

0

0

3

2

Total Credits

11


L


Lecture; T


Tutorial; P


Practical; C


Credit




2


TRIMESTER

IV





TRIMESTER

V



TRIMESTER

VI




SL

No

Subject


Code

Subject

L

T

P

C

1

PTS6NEB15

Project Phase II

0

0

24

12

Total Credits

12


L


Lecture; T


Tutorial; P


Practical; C


Cre
dit







Over all Total Credits = 72







SL

No

Subject


Code

Subject

L

T

P

C

Theory

1

PTS4NEB11

High Speed Networks

3

0

0

3

2

PTS
4NEB12

TCP/IP Technology

3

0

0

3

3

*****

Elective II

3

0

0

3

4

*****

Elective IV

3

0

0

3

Tot al Credit s

11

S.No

Subject
Code

Subject

L

T

P

C

Theory

1

PTS5NEB13

Cloud computing

3

0

0

3

2

*****

Elective

III

3

0

0

3

3

*
****

Elective

IV

3

0

0

3

Practical

4

PTS5NEB14

Project Phase I

0

0

12

6

Total Credits

15



3


ELECTIVES

S.No

Subject Code

Subject

L

T

P


C


1.


PTSENEB16

Artificial Intelligence

3

0

0

3


2.


PTSENEB17

Bio
-
Informatics

3

0

0

3


3.


PTSENEB18

Pattern Recognition

3

0

0

3


4.


PTSENEB19

Data Mining and Data Warehousi
ng

3

0

0

3


5.


PTSENEB20

Ad Hoc And Sensor Networks

3

0

0

3


6.


PTSENEB21

Digital Image Processing

3

0

0

3


7.


PTSENEB22

Mobile Ad
-
Hoc Networks

3

0

0

3


8.


PTSENEB23

Neural Networks

3

0

0

3


9.


PTSENEB24

Real Time Systems

3

0

0

3


10.


PTSENEB25

Wireless Adhoc Net
works

3

0

0

3


11.


PTSENEB26

Cellular Network


3

0

0

3


12.


PTSENEB27

Virtualization Techniques

3

0

0

3


13.


PTSENEB28

Compiler Optimization


3

0

0

3

14.


PTSENEB29

Satellite Communication

3

0

0

3


15.


PTSENEB30

Network Routing Algorithms


3

0

0

3


16.


PTSENEB31

Distri
buted Computing

3

0

0

3


17.


PTSENEB32

Wireless Communication Networks

3

0

0

3


18.


PTSENEB33

Advanced database Systems

3

0

0

3

19.


PTSENEB34

Pervasive Computing

3

0

0

3



4


TRIMESTER

I


PTS1MAB08

MATHEMATICAL FOUNDATIONS OF COMMUNICATION SYSTEMS


L T P C















3 1 0 4

AIM


The
aim

of
this paper is to present
mathematical

models for computers and computation.


OBJECTIVES



To have Fundamental concepts and tools in discreet mathematics with emphasis on their
applications to computer science.



T
o formulate logic expressions for a variety of applications.



To evaluate Trees and graphs and to formulate computational problems.


UNIT I

LINEAR ALGEBRAIC EQUATION AND EIGEN VALUE PROBLEMS


9


System of equations


solution by Gauss elimination, Gauss
-
J
ordan and LU decomposition method


Jacobi, Gauss
-
Seidel iteration methods


finding eigen values of a matrix by Jacobi and power methods


UNIT II

GRAPHS









9


Simple graphs and multigraphs


directed multigraphs


graph models


handshaking theorem


some
simple special graphs


representing graphs and graph isomorphism


adjacency and incidence matrices


connectivity paths


connectedness in undirected and directed graphs


Euler and Hamilton paths


shortest
-
path problems


UNIT III

RANDOM PROCESS
ES







9


Definition and description


random processes


stationary random processes


autocorrelation and
cross
-
correlation functions and their properties


ergodic processes


UNIT IV

SPECIAL RANDOM PROCESSES






9


Sine wave process


binomial, Pois
son and normal processes


Markov process


Markov chains


transition probability matrix


steady
-
state distribution


classification of states of Markov chains


birth
and death process


UNIT V

QUEUEING THEORY








9


Basics of queueing models


(M
-
M
-
1):(


/FIFO) model
-

(M
-
M
-
s):(


/FIFO) model
-
(M
-
M
-
1):(k/FIFO)
model
-

(M
-
M
-
s):(k/FIFO) model


(M
-
G
-
1) queueing model


Pollaczek
-
Khinchine formula


TOTAL : 45+15(Tutorial) = 60 periods

REFERENCES

1.

V. Sundarapandian, “Numerical Linear Algebra”, PHI Learni
ng, New Delhi, 2008.

2.

V. Sundarapandian, “Probability, Statistics and Queuing Theory”, PHI Learning, New Delhi, 2009.

3.

S. Lipschutz and M.L. Lipson, “Discrete Mathematics”, third edition, Tata McGraw
-
Hill, New Delhi,
2006

4.

S.M. Ross, “Introduction to Probabil
ity Models”, eighth edition, Academic Press, San Diego, 2004.



5


PTS1NEB01


DATA COMMUNICATION AND NETWORKS




L T P C













3 0 0 3

AIM


The aim of this course is to explore communication methodologies in an effective way.



OBJECTIVES




To

understand, develop, specify, assemble, commission, assess and manage data and
telecommunication systems,



To appreciate and apply hardware and software system design principles and diagnostic
methodologies



To appreciate the role of national and internat
ional regulatory bodies, and the commercial
opportunities created by liberalisation and privatisation of telecommunication networks


UNIT I



DATA COMMUNICATION FUNDAMENTALS & OSI REFERENCE MODEL

9


Overview of Data Communication and Networking


Analog
/ Digital signals and transmission, Simplex /
Half and Full duplex and Synchronous / Asynchronous communication


Multiplexing


Transmission
Media


Circuit switching and Telephone network


DSL, ADSL and Cable Modem


Network
Configuration, Concepts of l
ayering , ISO's OSI reference model


Physical Layer Standards


RS 232C,
RS 449, RS 422A / 423A, X.21 and V.24


UNIT II

DATA LINK LAYER








9


Error detection and correction


Data link control and protocols


Flow and Error control


Sliding window
protocol


ARQ schemes


HDLC protocol


Point to Point Protocol


Multiple Access Techniques


Random Access, Controlled Access


Logical Link Control (LLC) and Medium Access Sub
-
layer functions


LAN standards


IEEE 802.3(CSMA/CD)


Fast Ethernet


Giga

Bit Ethernet, IEEE 802.4 (Token Bus),
IEEE 802.5 (Token Ring), IEEE 802.11 (Wireless LAN)


UNIT III

NETWORK LAYER








9


Network layer
-

Services
-

Virtual circuits and Data
-
grams


Inter
-
networking


Addressing


Routing


Link state and Distance Vec
tor Routing
-

Congestion control algorithms
-

Network Layer Protocols


ARP,
RARP, IPv4, ICMP, IPv6 and ICMPv6

Uni
-
cast Routing
-

RIP, OSPF, BGP and Multicast Routing


IGMP,
DVMRP, MOSPF, CBT, PIM.


UNIT IV

TRANSPORT LAYER








9


Transport layer
-

S
ervices


Processes to Processes Delivery


Transmission Control Protocol (TCP)
-

User
Datagram Protocol


Data Traffic


Congestion Control and Quality of Service


Techniques to improve
QOS


Integrated Services


Differentiated Services.


UNIT V

SESSIO
N, PRESENTATION AND APPLICATION LAYERS




9


Session layer Design Issues, services
-

Presentation layer Design Issues


Network security


Cryptography, Message Security, Digital Signature, User Authentication, Key Management, Security
Protocols in Int
ernet


Application layer Design Issues


DNS, E
-
mail (SMTP), FTP, HTTP, WWW, Virtual
Terminal Protocol.



6



TOTAL : 45

periods


REFERENCES


1

Forouzan : Data Communications and Networking, TMH, 3rd Edition, 2004.

2 William Stallings,Data and Computer Commu
nications,Eighth Edition,Printice Hall of India Private
Limited,2007

3

Brijendra Singh: Data Communication and Computer Networks, PHI, 2004.

4 Michael A.Gallo, William A. Hancock : Computer Communication and Networking Technologies,
Thomson Asia, 2003




7


PTS1NEB02


COMMUNICATION SYSTEMS






L T P C













3 0 0 3

AIM



To know the C
ommunications of digital messages to devices external to the message source.
"External" devices
.
.


OBJECTIVES




To understand the meaning of communication



To study the i
mportance of communication



To study the features of communication



To understand the scope of communication



To study the various techniques of communication



To discuss the factors affecting process of communication


UNIT I

INTRODUCTION









9

Functional

architecture coded and encoded digital communication system architecture,Types of network
and services, Performance criterion and link budgets


UNIT II

DIGITAL MODULATIONS







9


PSD ,Data pulse stream, M
-
ary Markov source,convolutionally coded modula
tion, continuous phase
modulation(CPM),Scalar and vector communications over memory less channel, scalar reciever, BER
Performance, detection criterion


UNIT III

COHERENT AND NON
-
COHERENT COMMUNICATION WITH WAVEFORMS

9


Optical reciever in WGN,MF reciever
, Matrix generation,colored GN, Whitening approach, Inphase and
Quadrature phase modem, Non
-
coherent recievers, Random phase channel, Optimum and suboptimum
MFSK, Performance of Non
-
coherent Recievers in Random phase channel,optimum recievers in Rayleigh
and Rician channels,M
-
ary symbol error probability


UNIT IV

BAND LIMITED CHANNELS







9


Optimum pulse shape design, optimum demodulations of digital signals in the presence of ISI and AWGN,
equalization techniques, diminishing and detectionI
-
Q modulati
on,QAM,QPSK,QBM,CPM,FSK,MSK


UNIT V

CODED DIGITAL COMMUNICATION






9


Architecture, interfacing, detailing, Synchronization ,block coded digital communication system,
performance, types of binary block codes, Shannon channel coding theorem, linear bloc
k codes,
convolutional coded digital communication system, representation of convolution codes,
decoding,problems of decreasing errors , sequencing and threshold decoding












TOTAL : 45

periods



REFERENCES:



1. M.K.Simon,S.M.Hinedi and W.C.Lindsey
, Digital communication techniques: signalling and

detection,Prentice Hall India,New Delhi. 1995

2. Simon Haykin,Digital communications,John Wiley and sons,1998

3. Wayne Tomasi,Advanced Electronic communication systems,4th Edition,Pearson Education Asia,1
998

4. B.P.Lathi,Modern Digital and analog communication systems,3rd Edition,Oxford University Press,1998



8


PTS1NEB03


DIGITAL COMMUNICATION LAB





L T P C














0 0 3 2

AIM

To familiarize students with the techniques and instrumentation emp
loyed for measuring

the performance and properties of digital communication systems


OBJECTIVES




To test the digital communication systems using simulation software.



To assist the students in obtaining a better understanding of the operation of digital mod
ulation.



LIST OF EXPERIMENTS


1 Simulation of Modulation and Coding in a AWGN Communication Channel using Simulation Packages.

2 Implementation of Adaptive Filters, periodogram and multistage multirate system in DSP Processor

3 Simulation of QMF using

Simulation Packages.

4 Implementation of Linear and Cyclic Codes.

5 Implementation and study of Stop and Wait, Goback
-
N and Selective Repeat ARQ protocols

6 Implementation of Distance Vector and Link State routing Algorithms.

7 Ethernet LAN protocol
-

To create scenario and study the performance ofCSMA/CD protocol ethrol
simulation

8 Simulation of AdHoc Network using GLOMOSIM

9 Simulation and implementation of congestion control algorithm in ATM

Network. (using free ATM network simulator software)

10 S
imulation of ATM Switches.

11 Implementation of DS
-
SS technique using Spread Spectrum trainer kits.

12 Implementation of FH
-
SS technique using Spread Spectrum trainer kits.

13 Simulation of audio compression algorithm

14 Implementation of Analog Interface
System for speech signal ( active LPF + ADC + Loop back DAC +
Reconstruction)

15 Performance evaluation of CDMA Systems

16 Simulation of IEEE 802.11 MAC protocol







9


TRIMESTER

II

PTS2NEB04



ADVANCED DIGITAL SIGNAL PROCESSING




L T P C














3 0 0 3

AIM


To introduce the student to advanced digital signal processing techniques.


OBJECTIVES




To study the parametric methods for power spectrum estimation.



To study adaptive filtering techniques using LMS algorithm and to

study the applications of
adaptive filtering



To study multirate signal processing fundamentals.



To study the analysis of speech signals.



To introduce the student to wavelet transforms.


UNIT I

DISCRETE RANDOM SIGNAL PROCESSING





9


Discrete Random Pro
cesses
-

Ensemble averages, stationary processes, Autocorrelation and Auto
covariance matrices. Parseval's Theorem, Wiener
-

Khintchine Relation
-

Power Spectral Density
-
Periodogram, Spectral Factorization, Filtering random processes. Low Pass Filtering of Wh
ite Noise.
Parameter estimation: Bias and consistency.


UNIT II

SPECTRUM ESTIMATION







9


Estimation of spectra from finite duration signals, Non
-
Parametric Methods
-

Correlation Method ,
Periodogram Estimator, Performance Analysis of Estimators
-

Unb
iased, Consistent Estimators
-

Modified
periodogram, Bartlett and Welch methods, Blackman

Tukey method. Parametric Methods
-

AR, MA,
ARMA model based spectral estimation. Parameter Estimation
-
Yule
-
Walker equations, solutions

using Durbin’s algorithm


UNIT

III

LINEAR ESTIMATION AND PREDICTION





9


Linear prediction
-

Forward and backward predictions, Solutions of the Normal equations
-

Levinson
-
Durbin
algorithms. Least mean squared error criterion

Wiener filter for filtering and prediction , FIR Wiener f
ilter
and Wiener IIR filters ,Discrete Kalman filter


UNIT IV

ADAPTIVE FILTERS








9


FIR adaptive filters
-
adaptive filter based on steepest descent method
-
Widrow
-
Hoff LMS adaptive
algorithm, Normalized LMS. Adaptive channel equalization
-
Adaptive ech
o cancellation
-
Adaptive noise
cancellation
-

Adaptive recursive filters (IIR). RLS adaptive filters
-
Exponentially weighted RLS
-
sliding
window RLS.


UNIT V

MULTIRATE DIGITAL SIGNAL PROCESSING




9


Mathematical description of change of sampling rate
-

Inte
rpolation and Decimation , Decimation by an
integer factor
-

Interpolation by an integer factor, Sampling rate conversion by a rational factor, Filter
implementation for sampling rate conversion
-

Direct form FIR structures, Polyphase filter structures,
tim
e
-
variant structures. Multistage implementation of multirate system. Application to sub band coding
-

Wavelet transform and filter bank implementation of wavelet expansion of signals.



10



TOTAL : 45 periods

REFERENCES


1 Monson H.Hayes, Statistical Digital S
ignal Processing and

Modeling, John Wiley and Sons,
Inc.,Singapore, 2002.

2 John G.Proakis, Dimitris G.Manolakis, Digital Signal Processing Pearson Edn., 2002.

3 John G.Proakis et.al.,’Algorithms for Statistical Signal Processing’, Pearson Edn., 2002

4 Dim
itris G.Manolakis et.al.,’Statistical and adaptive signal Processing’, McGraw Hill, Newyork,2000.



11


PTS2NEB05


CRYPTOGRAPHY AND NETWORK SECURITY


L T P C

3 0 0 3

AIM


To understand the principles of encryption algorithms; conventional and public

key cryptography. To
have a detailed knowledge about authentication, hash functions and application level security
mechanisms.


OBJECTIVES



To know the methods of conventional encryption.



To understand the concepts of public key encryption and number theor
y



To understand authentication and Hash functions.



To know the network security tools and applications.



To understand the system level security used.


UNIT I

INTRODUCTION AND NUMBER THEORY






9

Classic Cipher Techniques


Substitution Ciphers, Mono
-
alp
habetic Substitution and Poly
-
alphabetic
Substitution


Transposition Ciphers. Number Theory and Finite Arithmetic, Counting in Modulus


Arithmetic, Congruence Arithmetic, Fermat’s Theorem and Euler’s Theorem
-

Exponentiation.


UNIT II

SINGLE AND PUBLIC K
EY CIPHERS






9

DES
-

3DES


AES


RSA Algorithm, ElGamal Algorithm


Key Management using Exponential Ciphers
-

Diffie
-
Hellman.



UNIT III

MESSAGE AUTHENTICATION, DIGITAL SIGNATURES AND
CERTIFICATES









9

Security Servic
es and Mechanisms


Message Authentication (Integrity)


MAC


Hash Functions


Digital
Signature: Digital Signature Standards (FIPS 186
-
2), DSA (ANSI X9.30), RSA (ANSI X9.31)


RSA
Certification

PKI Certificates.


UNIT IV

TRUSTED IDENTITY AND WIRELESS S
ECURITY





9

Security Concerns


Password System: Fixed and One time Passwords (S/Key) RFC 2289


Callback
Systems, Challenge and Response Systems


RADIUS


Kerberos v4 & v5


Needham Schroeder Protocol


ITU
-
T X.509


Authentication: Framework, Simple,

Protected, Strong


PKI Life Cycle Management
-

Current Wireless Technology
-

Wireless Security WEP Issues.


UNIT V

PROTOCOLS AND FIREWALLS







9

SSL/TLS
-

SSH
-

IPSec


Firewall Concepts, Architecture, Packet Filtering, Proxy Services and Bastion
Hos
ts


Electronic Mail Security


PGP, S/MIME.

TOTAL
= 45

Periods

REFERENCES:

1.

William Stallings “Cryptography and Network Security: Principles and Practice”, 3rd Edition,
Pearson Education, 2002.

2.

William Stallings “Network Security Essentials: Applications an
d Standards”, 2
nd

Edition, Pearson
Education, 2000.

3.

Behrouz A.Forouzan, “Cryptography and Network Security”, special edition, Tata McGraw Hill,
2007.

4.

Bruce Scheneier, “Applied Cryptography”, John Wiley & Sons, 1994.

5.

Douglas R.Stinson, “Cryptography: Theor
y and Practice”, CRC Press Series on Discrete
Mathematics and its Applications, 1995.



12


PTS2NEB06



INTERNET PROGRAMMING






L T P C













3 0 0 3

AIM


The aim of this course is to equip you with the necessary techniques you will need

within Web
Appl
ications.


OBJECTIVES




Giving the students the insights of the Internet programming and how to design and implement
complete applications over the web.



To encapsulate virtually any type of data.



It covers the notions of Web servers and Web Application Ser
vers
.



It give the information usage of recent platforms used in developing web


UNIT I

INTRODUCTION







9



Introduction to the Internet and World Wide Web
-

World Wide Web Consortium (W3C)
-

History of the
Internet History of the W
orld Wide Web
-

History of SGML

XML
Introduction to HyperText Markup
Language
-

Editing HTML
-

Common Elements


Headers
-

Linking
-

Images
-

Unordered Lists
-

Nested
and Ordered Lists


HTML Tables
-
Basic HTML Forms





UNIT II

DYNAMIC HTML






9


Dynamic HTML Object Model and Collections, Event Model, Filters and Transitions, Data Binding with
Tabular Data Control, Dynamic HTML
-
Structured Graphics ActiveX Controls, Dynamic HTML
-
Path,
Sequencer and Spr
ite ActiveX Controls.




UNIT III

JAVASCRIPT







9



JavaScript, Introduction to Scripting, Control Statements, Functions, Arrays, Objects.


UNIT IV

XML



9



Creating Markup with XML
-
Parsers and Well
-
formed XML Documents
-
Parsing an XML Document with
msxml
-

Document Type Definition (DTD)
-

Document Type Declaration
-

Element Type Declarations
-

Attribute De
clarations
-

Document Object Model


DOM Implementations
-



DOM Components
-

path
-

XSL: Extensible Stylesheet Language


Transformations (XSLT)




UNIT V

PERL, CGI AND PHP





9



Perl
-

String Processing and Regu
lar Expressions
-

Form Processing and Business Logic
-

Server
-
Side
Includes
-

Verifying a Username and Password
-

Using DBI to Connect to a Database
-
PHP
-

Form
Processing and Business Logic
--
Connecting to a Database
-

Dynamic Content in PHP














TOTAL : 45

periods


REFERNCES:





1.

Deitel & Deitel Internet & World Wide Web How to Program, Pearson Education India
-
Third Edition
-
2004

2. Deitel & Deitel XML How to Program, Pearson Education,2001

3. Robert W.Sebesta , “ Programming withWorld Wide We
b”,Pearson Education, 2009

4. Negrino and Smith Javascript for the World Wide Web, 5th Edition, Peachpit Press 2003.

5. Deitel & Deitel Perl How to Program, Pearson Education, 2001

6.
Benoit Marchal, XML by Example, 2nd Edition, Que/Sams 2002.



13


PTS2NEB07



INTERNET PROGRAMMING LAB





L T P C













0 0 3 2

AIM


To provide basics of programming language processors and to serve as a foundation for more
advancedstudies of high performance parallel compilers and advanced compiler design implementation


O
BJECTIVES




To be able to discuss implementation issues of complier for a sample language.



To be able to design computational model for finite automata.



To be able to analyze the optimization techniques of complier


1.Write programs in Java to demonstrate
the use of following components Text fields, buttons, Scrollbar,
Choice, List and Check box.

2. Write Java programs to demonstrate the use of various Layouts like Flow Layout, Border Layout, Grid
layout, Grid bag layout and card layout

3.Write programs in
Java to create applets incorporating the following features:

CreateÂ


color palette with matrix of buttons

Set background and foreground of the control text area by selecting a color from color palette.

In order to select Foreground or background use check

box control as radio buttons

To set background images

4.Write programs in Java to do the following.

Set the URL of another server.

Download the homepage of the server.

Display the contents of home page with date, content type, and Expiration date.

Last mo
dified and length of the home page.

5. Write programs in Java using sockets to implement the following:

HTTP request

FTP

SMTP

POP3

6. Write a program in Java for creating simple chat application with datagram sockets and datagram
packets.

7. Write program
s in Java using Servlets:

To invoke servlets from HTML forms

To invoke servlets from Applets

8. Write programs in Java to create three
-
tier applications using servlets for conducting on
-
line
examination for displaying student mark list. Assume that student

information is available in a database
which has been stored in a database server.


9. Create a web page with the following using HTML

To embed a map in a web page

To fix the hot spots in that map

Show all the related information when the hot spots are cl
icked.

10. Create a web page with the following.

i) Cascading style sheets.

ii) Embedded style sheets.

iii) Inline style sheets.

iv) Use your college information for the web pages.



14


TRIMESTER

III


PTS3NEB08




NETWORK PROGRAMMING





L T P C












3 0 0 3

AIM



To highlight the features of different concepts involved in network methodologies.


OBJECTIVES






To learn indepth on TCP Sockets



To have an analysis of the major sockets and their corresponding functionalities.



To know about the clie
nt server design alternatives in much detailed manner.


UNIT I

ELEMENTARY TCP SOCKETS








9


Introduction to Socket Programming


Overview of TCP/IP Protocols

Introduction to Sockets


Socket
address Structures


Byte ordering functions


address con
version functions


Elementary TCP Sockets


socket, connect, bind, listen, accept, read, write, close functions


Iterative Server


Concurrent Server.


UNIT II

APPLICATION DEVELOPMENT







9


TCP Echo Server


TCP Echo Client


Posix Signal handling


Server with multiple Clients


boundary
conditions: Server process Crashes, Server host Crashes, Server Crashes and reboots, Server Shutdown


I/O multiplexing


I/O Models


select function


shutdown function


TCP echo Server (with
multiplexing)


poll
function


TCP echo Client (with Multiplexing).


UNIT III

SOCKET OPTIONS, ELEMENTARY UDP SOCKETS




9


Socket options


getsocket and setsocket functions


generic socket options


IP socket options


ICMP
socket options


TCP socket options


Elementary

UDP sockets


UDP echo Server


UDP echo Client


Multiplexing TCP and UDP sockets


Domain name system


gethostbyname function


Ipv6 support in
DNS


gethostbyadr function


getservbyname and getservbyport functions.


UNIT IV

ADVANCED SOCKETS









9


Ipv4 and Ipv6 interoperability


threaded servers


thread creation and termination


TCP echo server
using threads


Mutexes


condition variables


raw sockets


raw socket creation


raw socket output


raw socket input


ping program


trace route p
rogram.


UNIT V

CLIENT/SERVER DESIGN ALTERNATIVES





9


Introduction
-

TCP Client Alternatives
-

TCP Test Client
-
TCP Iterative Server
-

TCP Concurrent Server, One
Child per Client
-

TCP Preforked Server, No Locking Around accept
-
TCP Preforked Server, File L
ocking
Around accept
-

TCP Preforked Server, Thread Locking Around accept
-
TCP Preforked Server, Descriptor
Passing
-

TCP Concurrent Server, One Thread per Client
-
TCP Prethreaded Server, per
-
Thread accept
-

TCP
Prethreaded Server, Main Thread accept













TOTAL : 45 periods


REFERENCES:


1. W. Richard Stevens, “Unix Network Programming Vol
-
I”, Second Edition, Pearson Education, 1998.

2. D.E. Comer, “Internetworking with TCP/IP Vol
-

III”, (BSD Sockets Version), Second Edition, Pearson
Education, 2003.



15


PTS
3NEB09



MOBILE AND PERSONAL COMMUNICATIONS



L T P C














3 0 0 3

AIM


To know much about the current generation and next generation communication services..


OBJECTIVES



To have more advanced learning in terms of personal communication system.



To learn more on personal communication system.



To analyse much with PCS and Cellular systems.


UNIT I











9

INTRODUCTION TO MOBILE AND PERSONAL COMMUNICATION



History of wireless communications, Mobile and Personal communications: Cell phone gener
ations,
cellular networks, The mobile radio environment, Cellular concept and frequency reuse, Multiple access
technologies for cellular systems, Channel assignment and hand off, Mobile radio interference.


UNIT II











9

PROPAGATION ISSUES


Predicti
on of propagation loss
-
Prediction over flat terrain, Point
-
point prediction,Calculation of fading and
methods of reducing fading
-

Amplitude fading, Selective fading, Diversity schemes, combining
techniques.


UNIT III











9

ANTENNA SYSTEMS


Design p
arameters at the Base station
-

Antenna locations, spacing, heights, configurations, Design
parameters at the Mobile unit
-

Directional antennas and diversity schemes, Antenna connections and
locations.


UNIT IV











9

PERSONAL COMMUNICATION SYSTEMS


The concept of PCS/PCN, Function , Evolution of personal Communications, Requirements of PCS,PCS
environment, Differences between PCS and Cellular systems, IS
-
136(TDMA)PCS, IS
-
95 CDMA PCS, Data
Communication with PCS, PCS standards, PCS economics


UNIT V











9

UNIVERSAL PERSONAL TELECOMMUNICATION


UPT: Concept and service aspects, Functional Architecture, Numbering, Routing and Billing aspects,
Access security requirements for UPT Digital Cellular Mobile Systems
-

GSM, IS
-
136, PDC, IS
-
95, IMT
-
2000: T
hird generation Mobile Communication Systems, W
-
CDMA, CDMA
-
2000, EDGE


TOTAL : 45

periods




16


REFERENCES


1.

William C.Y.Lee, “Mobile Communications Design Fundamentals”, second edition, John Wiley &
sons, 1993.

2.

RajPandya, “Mobile and Personal Communication syst
ems and services”, PHI, New Delhi, 2003.

3.

Blake, “Wireless Communication Technology”, Thomson Asia Pte, Ltd, Singapore, 2001.

4.

Bud Bates, “Wireless networked telecommunications
-

Concepts, Technology and Implementation”
, McGraw
-
Hill International Editions, 1
995.

5.

Jack.M.Holtzman, David J. Goodman ( Er.s), “ Wireless and Mobile Communications”, Allied
Publishers Limited, 1996.



17


PTS3NEB10


NETWORKING LABORATORY

(Experiments using NS2/matlab/Qualnet/Routers/Switches, etc.,)



L T P C

0 0 3 2

AIM

To
teach the principles of good programming practice and to give a practical training in writing
efficient programs in
NS2/matlab/Qualnet/Routers/Switches.


OBJECTIVES



Study the effect of different Routing protocols (RIP and OSPF) on network’s performance
thr
ough simulation.



Implementation of network security By using Different set of algorithms.


LIST OF Experiments


1.


Wireless Access Point


configuring and enabling security

2.


W
i
-
Fi based Data Acquisition

3.


Routing protocols for IP network using routers

4.


Config
uration of VLAN using switches

5.


PDA mobility analysis using layer 3 switches

6.


Hidden and exposed terminal problem

7.


Signaling in wireless networks (RTS, CTS, DATA and ACK)

8.


AODV/DSR

9.


RTP protocol of VoIP

10.


Implementation of network security algorithms

11.


Net
work performance analysis using packet sniffer

12.


Mini project






18


TRIMESTER

IV

PTS4NEB11


HIGH SPEED NETWORKS







L T P C












3 0 0 3

AIM



To highlight the features of different technologies involved in High Speed Networking and their
per
formance.


OBJECTIVES




Students will get an introduction about ATM and Frame relay.



Students will be provided with an up
-
to
-
date survey of developments in High Speed Networks.



Enable the students to know techniques involved to support real
-
time traffic and

congestion
control.



Students will be provided with different levels of quality of service (Q.S) to different applications


UNIT I












9



Circuit Switched Networks: Performance of circuit switched networks


SONET


Densen Wave Division
Multiplexin
g (DWDM)


Fiber


Digital Subscriber Line (DSL)


Intelligent Networks


CATV



UNIT II











9



ATM: Main features of ATM


Addressing Signaling & Routing


ATM Header Structure


ATM Adaptation
layer


Management and control


BISDN Internetworking

with ATM: Multiprotocol Encapsulation over
AAL5


LAN Emulation over ATM


IP over ATM


Multiprotocol over ATM


Frame Relay over ATM



UNIT III











9



Wireless Networks: Introduction


The wireless channel


Link level design


Channel access


Ne
twork
design


Standards


Future System and Standards


UNIT IV











9



Control of Networks: Objectives and methods of control


Circuit


Switched Networks


Datagram
networks


ATM Networks



UNIT V











9



Optical Networks: Optical Links


W
DM System


Optical Cross connects


Optical LANs


Optical Paths
and Networks


Switching











TOTAL : 45 periods



REFERENCE:






1. Jean Walrand and Pravin Varaiya, High Performance Communication Networks, Second
Edition, Morgan Kaufmann, 2000. (
Chapters 5
-
8, 11, 12)





19


PTS4NEB12



TCP/IP TECHNOLOGY






L T P C













3 0 0 3


AIM


This
computer networking technology support TCP/IP as the "language" computers use to find
and connect with each other.

.

OBJECTIVES





Ability to bind to many t
ypes of physical media, from wire to wirelessor LAN to WAN, and on the
other end.



To encapsulate virtually any type of data.


UNIT I

INTRODUCTION








9


Protocols and standards
-

OSI model
-

TCP/ IP protocol suite
-

addressing
-

versions
-

underlying
technologies


UNIT II

IP ADDRESSES, ROUTING, ARP AND RARP





9


Classful addressing
-

other issues
-

subnetting
-

supernetting
-

classless addressing
-

routing methods
-

delivery
-

table and modules
-

CIDR
-

ARP package
-

RARP.


UNIT III

IP, ICMP, TGMP

AND UDP







9


Datagram
-

fragmentation
-

options
-

checksum
-

IP package
-

ICMP
-

messages, formats
-

error
reporting
-

query
-

checksum
-

ICMP package
-

IGMP
-

messages, operation
-

encapsulation
-

IGMP
package
-

UDP
-

datagram
-

checksum
-

operation
-

uses
-

UDP package.


UNIT IV

TCP UNICAST AND MULTICASTING PROTOCOLS




9


Services
-

flow, congestion and error control
-

TCP package and operation
-

state transition diagram
-

unicast routing protocols
-

RIP
-

OSPF
-

BGP
-

multicast routing
-

trees
-

protocols
-

MOSPF
-

CBT
-

PIM.


UNIT V

APPLICATION LAYERS, SOCKETS






9


Client server model
-

concurrency
-

processes
-

sockets
-

byte ordering
-

socket system calls
-

TCP and
UDP client
-
server programs
-

BOOTP
-
DHCP
-

DNS
-

name space, resolution
-

t
ypes of records
-

concept
-

mode of operation
-

Rlogin.


TOTAL : 45 periods

REFERENCES


1. Behrouz Forouzan, "TCP/IP protocol suite ", 2nd edition, Tata McGrawhill


2. Douglas Comer, "Internetworking with TCP/ IP", Vol
-

1, PHI, 2000




20


TRIMESTER

IV

PTS5NEB
13


CLOUD COMPUTING L T P C





3 0 0 3

AIM


The main pu
rpose of
CLOUD COMPUTING

is to present a basic framework for estimating value and
determine benefits from Cloud Computing
.


OBJECTIVE



To provide logical segregation of CSP customers’ data



To enable customer classification of sensitive data



To enable protec
tion of data commensurate with risk and defined information classifications



UNIT

I












9


Cloud and Services:

Introduction


Evolution of cloud computing


Hardware evolution


Internet
software evolution


Server virtualization


W
eb services overview
-

IaaS
-

PaaS


SaaS
-
XaaS


UNIT III







9


Access to Cloud:

Ha
rdware and infrastructure


C汩ents


pe捵r楴y


ketwork


perv楣is
J

A捣css楮g the
捬潵d


m污tforms


teb app汩捡t楯is


teb Amfs
J

teb browsers

C汯ld storage overv楥w


C汯ld serv楣i prov楤ers


ptandards
J

app汩捡t楯i


C汩ent


fnfrastru捴ure


pervi



poftware as a serv楣i overv楥w

ar楶楮g for捥s


poftware and serv楣i s


aeve汯l楮g
app汩捡t楯isK


UNIT IV





9


Security and Standards
:

Secuity


Cha汬enges


paap se捵r楴y


Common standards


lpen 捬潵d
捯nsort極m


ptandards for app汩捡t楯i deve汯lersI 䵥ssag楮g and se捵r楴y


UNIT V











9


Mobile Platform:

End user access


䵯b楬e fnternet dev楣is


pmartphone


䵯b楬e operat楮g systems


䵯b楬e p污tform v楲tua汩zat楯i


Co汬aborat楯i app汩捡t楯is



TOTAL : 45 periods

TEXT BOOKS

1.

Rittinghouse
John
, and Ransome
James
, “Cloud Computing: Implemen
tat楯iI 䵡nagementI and
Security”, CRC Press, 2010.



Toby Velte, Anthony Velte and Robert Elsenpeter, “Cloud Computing
J

A Practical Approach”, Tata
䵣jraw e楬氬 OMNMK



REFERENCES

1.

Michael Miller
, “
C汯ld Comput楮gW teb
J
Based Appl
楣it楯is qhat Change the tay vou tork and
Co汬aborate ln汩ne
”, QUE publishing, 2009.



Jeorge Reese, “Cloud Application Architectures: Building Applications and Infrastructure in the
cloud”, O Rilly Publications, 2009.

PK

䵩汬er cKmKI sandome AKc and
Mc Brewster John., “Cloud Computing”, Alphascript Publishing, 2009.



21


ELECTIVES


PTSENEB16


ARTIFICIAL INTELLIGENCE






L T P C












3 0 0 3

AIM



Th
is course will strive to emphasize important unifying themes that occur throughout many areas
of AI

research.


OBJECTIVES






Many methods can be viewed as context
-
based searching through a space of learned experience.



Search should be made more active through brain's representation of learned knowledge.



The viewpoint of an intelligent agent" as an acti
ve one for describing and understanding AI


UNIT I

INTRODUCTION








9


Intelligent Agents


Design of Rational Agents
-

Agents and environments
-

Good behavior


The nature
of environments


structure of agents
-

Problem Solving
-

problem solving agen
ts


example problems


searching for solutions


uniformed search strategies
-

avoiding repeated states


searching with partial
information.


UNIT II

SEARCHING TECHNIQUES








9


Informed search and exploration


Informed search strategies


heuristic

function


local search
algorithms and optimistic problems


local search in continuous spaces


online search agents and
unknown environments
-

Constraint satisfaction problems (CSP)


Backtracking search and Local search
for CSP


Structure of problems
-

Adversarial Search


Games


Optimal decisions in games


Alpha


Beta Pruning


imperfect real
-
time decision


games that include an element of chance.


UNIT III

KNOWLEDGE REPRESENTATION







9


First order logic


representation revisited


Syntax an
d semantics for first order logic


Using first order
logic


Knowledge engineering in first order logic
-

Inference in First order logic


prepositional versus
first order logic


unification and lifting


forward chaining


backward chaining
-

Resolution

-

Knowledge
representation
-

Ontological Engineering
-

Categories and objects


Actions
-

Simulation and events
-

Mental events and mental objects


UNIT IV

LEARNING










9


Learning from observations
-

forms of learning
-

Inductive learning
-

Learnin
g decision trees
-

Ensemble
learning
-

Knowledge in learning


Logical formulation of learning


Explanation based learning


Learning using relevant information


Inductive logic programming
-

Statistical learning methods
-

Learning with complete data
-

L
earning with hidden variable
-

EM algorithm
-

Instance based learning
-

Neural networks
-

Reinforcement learning


Passive reinforcement learning
-

Active reinforcement
learning
-

Generalization in reinforcement learning.







22


UNIT V

APPLICATIONS









9


Communication


Communication as action


Formal grammar for a fragment of English


Syntactic
analysis


Augmented grammars


Semantic interpretation


Ambiguity and disambiguation


Discourse
understanding


Grammar induction
-

Probabilistic language p
rocessing
-

Probabilistic language models


Information retrieval


Information Extraction


Machine translation.











TOTAL : 45
Periods

REFERENCES:


1. Stuart Russell, Peter Norvig, “Artificial Intelligence


A Modern Approach”, 2nd Edition, Pearson

Education / Prentice Hall of India, 2004.

2. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd., 2000.

3. Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata McGraw
-
Hill, 2003.

4. George F. Luger, “
Artificial Intelligence
-
Structures And Strategies For Complex Problem Solving”,
Pearson Education / PHI, 2002.



23


PTSENEB17


BIO INFORMATICS






L T P C













3 0 0 3

AIM


To study of plant and microbial genomes, with special reference to applicatio
ns for agriculture,
environment and industry.


OBJECTIVES



To know the new and emerging technologies including genome analysis and bioinformatics



Improvements in conventional breeding procedures by using marker assisted selection.



To produce the transgen
ic plants conferring resistance to fungal pathogens.


UNIT I

INTRODUCTION









9







The Central Dogma


Killer Application


Parallel Universes


Watson’s Definition


Top Down Vs Bottom
Up Approach


Information Flow


Conversance


Commun
ications.


UNIT II

DATABASE AND NETWORKS








9


Definition


Data Management


Data Life Cycle


Database Technology


Interfaces


Implementation


Networks: Communication Models


Transmission Technology


Protocols


Bandwidth


Topology


Contents


Security


Ownership


Implementation.


UNIT III

SEARCH ENGINES AND DATA VISUALIZATION





9




Search Process


Technologies


Searching And Information Theory


Computational Methods


Knowledge Management


Sequence Visualizations


St
ructure Visualizations


User Interfaces


Animation Vs Simulation


UNIT IV

STATISTICS, DATA MINING AND PATTERN MATCHING



9



Statistical Concepts


Micro Arrays


Imperfect Data


Basics


Quantifying


Randomness


Data
Analysis


Tools Selection


Ali
gnment


Clustering


Classification


Data Mining Methods


Technology


Infrastructure Pattern Recognition


Discovery


Machine Learning


Text Mining


Pattern Matching
Fundamentals


Dot Matrix Analysis


Substitution Matrix


Dynamic Programming


Wo
rd Method


Bayesian Method


Multiple Sequence Alignment Tools.


UNIT V

MODELING SIMULATION AND COLLABORATION





9


Drug Discovery Fundamentals


Protein Structure


System Biology Tools


Collaboration And
Communication


Standards


Issues


Case Study.


TOTAL : 45 periods

REFERENCES:


1.

Bryan Bergeron, “Bio Informatics Computing”, Prentice Hall, 2003.

2.

T.K. Affward, D.J. Parry Smith, “Introduction to Bio Informatics”, Pearson Education, 2001.

3.

Pierre Baldi, Soren Brunak, “Bio Informatics


The Ma
chine Learning Approach”, 2
nd

Edition, First
East West Press, 2003.




24


PTSENEB18


PATTERN RECOGNITION





L T P C












3 0 0 3

AIM


pattern recognition the aim is to learn a computer (by examples) to recognize patterns in data
sets.


OBJECTIVES





To learn the basics of Pattern Classifier



To learn Feature extraction, Classification and Recognition techniques



To learn recent advances in pattern recognition


UNIT I

INTRODUCTION








9


Pattern and feature
-
Training and learning in Pattern recogni
tion approaches
-
Statistical pattern
recognition
-

Syntactic pattern recognition
-
Neural pattern recognition
-
Reasoning driven pattern
recognition
-
Discriminant functions
-
Linear and Fisher's discriminant functions



UNIT II

STATISTICAL PATTERN RECOGNITION





9


Gaussian model
-
Supervised learning
-
Prametric estimation
-
Maximum likelihood estimation
-

Bayesian
Decision Theory
-

Bayesian parameters estimation
-
Perception algorithm
-
LMSE algorithm
-
Problems with
Bayes approach
-
Pattern classification by distance function
s
-
Maximum distance pattern classifier


UNIT III

CLUSTER ANALYSIS








9


Unsupervised learning
-
Clustering for Unsupervised learning and classification
-
C
-
means algorithm
-

Hierarchical procedures
-
Graph theoretic approach to pattern clustering
-
Validity of
clustering solutions


UNIT IV

SYNTACTICS PATTERN RECOGNITION





9


Elements of formal grammer
-
String generation as pattern description
-
Recognition of syntactic
description
-

Parsing
-
Stochastic grammer and appllications
-
Graph based structural representatio
n


UNIT V

FEATURE EXTENSION AND RECENT ADVANCES




9


Entropy minimisation
-
Karhunen
-
Loeve transformation
-
Neural Network structures for pattern recognition
-

Unsupervised learning
-
self organising networks
-
Fuzzy pattern classifiers
-
Genetic algorithms
-
Applic
ation
to pattern recognition

TOTAL : 45 periods


REFERENCES:


1. Richard,E.G.,Johnsonbaugh and Jost .S., :Pattern Recognition and Image Analysis",Prentice Hall of
India Priovate Ltd., NewDelhi
-
110001,1999

2. Duda R.O. and Hart P.E. "Pattern classification
and Scene analysis:",Wiley,NewYork,1973

3. Morton Nadler and Eric Smith p.,"Pattern Recognition Engineering",John Wiley and Sons,New
York,1993

4. Tou and Gonzaler R., "Pattern Recognition Principles" Addison Wesley,1974



25


PTSENEB19



DATA MINING AND DATA WAR
EHOUSING



L T P C














3 0 0 3

AIM


The aim of this course is to explore reporting functionality in financial information systems.



OBJECTIVES






The Information Integration from multiple systems
-

Single point source for information



To have High Response Time
-

Production Databases are tuned to expected transaction load



To provide an adaptive and flexible source of information.


UNIT I

FUNDAMENTALS








9


Relation to Statistics


Databases


Data Mining Functionalities


Steps in
Data Mining Process


Architecture of Typical Data Mining Systems


Classification of Data Mining Systems


Overview of Data
Mining Techniques.


UNIT II

DATA PREPROCESSING AND ASSOCIATION RULES



9


Data Preprocessing


Data Cleaning


Integration


Tran
sformation


Reduction


Discretization Concept
Hierarchies


Concept Description Data Generalization and Summarization Based Characterization


Mining Association Rules in Large Databases.


UNIT III

PREDICTIVE MODELING







9


Classification and Predic
tion Issues Regarding Classification and Prediction


Classification by Decision
Tree Induction


Bayesian Classification


Other Classification Methods


Prediction


Clusters Analysis


Types of Data in Cluster Analysis


Categorization of Major Clusteri
ng Methods


Partitioning Methods


Hierarchical Methods.



UNIT IV

DATA WAREHOUSING







9


Data Warehousing Components


Multi Dimensional Data Model


Data Warehouse Architecture


Data
Warehouse Implementation


Mapping the Data Warehouse to Multipr
ocessor Architecture


OLAP


Need


Categorization of OLAP Tools.


UNIT V

APPLICATIONS








9


Applications of Data Mining


Social Impacts of Data Mining


Tools


An Introduction to DB Miner


Case
studies


Mining WWW


Mining Text Databases


Mini
ng Spatial Databases.

TOTAL : 45 periods

REFERENCES:

1. Jiawei Han, Micheline Kamber, "Data Mining Concepts and Techniques", Morgan

Kaufmann Publishers, 2002.

2. Alex Berson, Stephen J Smith, “Data Warehousing, Data Mining & OLAP”, Tata Mcgraw Hill, 2004.

3. Usama M. Fayyad, Gregory Piatetsky , Shapiro, Padhrai Smyth and Ramasamy Uthurusamy, "Advances
In Knowledge Discovery And Data Mining", The M.I.T Press, 1996.

4. Ralph Kimball, "The Data Warehouse Life Cycle Toolkit", John Wiley & Sons Inc., 1998.

5. Se
an Kelly, "Data Warehousing In Action", John Wiley & Sons Inc., 1997



26


PTSENEB20


AD HOC AND SENSOR NETWORKS




L T P C

3 0 0 3

AIM





To present the wireless communication,adhoc wireless network,Routing Protocol,multicast
routing in adhoc network,Sensor

Network.


OBJECTIVES




This syllabus will help students to identify the major issues associated with ad
-
hoc/sensor
networks.



Students will explore current ad
-
hoc/sensor technologies by researching key areas such as
algorithms, protocols, hardware, and app
lications.



Students will learn how to program and communicate with embedded operating system such as
TinyOS, a prominent application development environment for sensor systems using Motes


UNIT I

FUNDAMENTALS







(9)


Introduction


Fundamentals of Wire
less Communication Technology


The Electromagnetic Spectrum


Radio Propagation Mechanisms


Characteristics of the Wireless Channel


IEEE 802.11a

b Standard


Origin of Ad hoc Packet Radio Networks


Technical Challenges


Architecture of PRNETs


Compo
nents
of Packet Radios


Ad hoc Wireless Networks


What is an Ad Hoc Network? Heterogeneity in Mobile
Devices


Wireless Sensor Networks


Traffic Profiles


Types of Ad hoc Mobile Communications


Types
of Mobile Host Movements


Challenges Facing Ad hoc

Mobile Networks


Ad hoc wireless Internet.


UNIT II

AD HOC ROUTING PROTOCOLS






(9)


Introduction


Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks


Classifications of
Routing Protocols


Table

Driven Routing Protocols


Destinati
on Sequenced Distance Vector (DSDV)


Wireless Routing Protocol (WRP)


Cluster Switch Gateway Routing (CSGR)


Source

Initiated On

Demand Approaches


Ad hoc On

Demand Distance Vector Routing (AODV)


Dynamic Source Routing
(DSR)

Temporally Ordered Routi
ng Algorithm (TORA)


Signal Stability Routing (SSR)

Location

Aided
Routing (LAR)


Power

Aware Routing (PAR)


Zone Routing Protocol (ZRP).


UNIT III

MULTICASTROUTING IN ADHOC NETWORKS



(9)


Introduction


Issues in Designing a Multicast Routing Proto
col


Operation of Multicast Routing Protocols


An Architecture Reference Model for Multicast Routing Protocols

Classifications of Multicast Routing
Protocols


Tree

Based Multicast Routing Protocols


Mesh

Based Multicast Routing Protocols


Summary
of T
ree and Mesh based Protocols


Energy

Efficient Multicasting


Multicasting with Quality of Service
Guarantees


Application


Dependent Multicast Routing


Comparisons of Multicast Routing Protocols.


UNIT IV

SENSOR NETWORK







(9)


Introduction of sen
sor networks , Wireless Communications/Radio Characteristics , Broadcast and
dissemination , Data aggregation , Storage , Tracking , Dealing with sensor data , Programming models ,
Energy management ,Ad
-
Hoc wireless networks, Media Access Control (MAC) Pro
tocols , Networking
Sensors , Sensor Network Platforms and Tools , Applications of Ad
-
Hoc/Sensor Network and Future
Directions.



27



UNIT V

APPLICATION




(9)


Sensor network application classes,

System Evaluation Metrics,Individual node evaluation metric,
Software Architecture for Wireless Sensors,Tiny Microthreading Operating System,TinyOS Execution
ModelTinyOS Component Model, Communication Paradigm, Generalized Wireless Sensor Node
Architectur
e, Generalized architecture for a wireless sensor node, Generalized Wireless Sensor Node
Architecture, Approximation of General Architecture:Camera
-
based sensor networks, Underwater sensor
networks

TOTAL= 45 PERIODS


REFERENCES


1. C. Siva Ram Murthy and
B. S. Manoj, “Ad Hoc Wireless Networks Architectures and Protocols”, Prentice
Hall, PTR, 2004.

2. C. K. Toh, “Ad Hoc Mobile Wireless Networks Protocols and Systems”, Prentice Hall,

PTR, 2001.2. Charles E. Perkins, “Ad Hoc Networking”, Addison Wesley, 20003

3..Madden, S., et al., TAG: A Tiny AGgregation Service for Ad
-
Hoc Sensor Networks. 2002: OSDI.

4. Intanagonwiwat, C., R. Govindan, and D. Estrin, Directed Diffusion: A Scalable and Robust
Communication Paradigm for Sensor Networks. 2000: Mobile Computing
and Networking.




28


PTSENEB21


DIGITAL IMAGE PROCESSING




L T P C












3 0 0 3

AIM


The primary objective of the course is to provide students with the skills and knowledge to apply remote
sensing to their own research problems.


OBJECTIVE




To emphas
izes the application of processing and analysis of digital satellite images.



To provide students with the skills and knowledge.



To apply remote sensing to their own research problems.




UNIT I

DIGITAL IMAGE FUNDAMENTALS







9


Image form
ation, Image transforms


Fourier transforms, Walsh, Hadamard, Discrete cosine, Hotelling
transforms.


UNIT II

IMAGE ENHANCEMENT & RESTORATION






9


Histogram modification techniques
-

Image smoothening
-

Image Sharpening
-

Image Restoration
-

De
gradation Model


Noise models
-

Spatial filtering


Frequency domain filtering.


UNIT III


IMAGE COMPRESSION & SEGMENTATION






9


Compression Models
-

Elements of information theory
-

Error free Compression
-
Image segmentation

Detection of disc
ontinuities
-

Edge linking and boundary detection
-

Thresholding


Region based
segmentation
-

Morphology.


UNIT IV

REPRESENTATION AND DESCRIPTION






9


Representation schemes
-

Boundary descriptors
-

Regional descriptors
-

Relational Descriptors



UNIT V

OBJECT RECOGNITION AND INTERPRETATION





9


Patterns and pattern classes
-

Decision
-
Theoretic methods
-

Structural methods.


TOTAL : 45 periods


REFERENCES:


1.

Gonzalez.R.C & Woods. R.E., Digital Image Processing, 2
nd

Edition
, Pearson Ed
ucation, 2002.

2.

Anil Jain.K, Fundamentals of Digital image Processing, Prentice Hall of India, 1989.

3. Sid Ahmed, Image Processing, McGraw Hill, New York, 1995






29


PTSENEB22


MOBILE AD
-
HOC NETWORKS




L T P C



3 0 0 3

AIM

To learn the Protoco
ls, IEEE Standards,Cross layer design and integration of adhoc for 4G.


OBJECTIVES




Introduction to the most recent advanced Mobile Ad hoc Networks (MANETs) routing
protocols.



The syllabus will cover all the issues that are related to design protocols suc
h as scheduling,
capacity, medium access, QoS, topology control, and mobility tracking.



In addition, modeling techniques as well as delay models will be covered using Linear
Programming.


UNIT I

INTRODUCTION








(9)


Introduction to adhoc networks


d
efinition, characteristics features, applications.Charectristics of
Wireless channel, Adhoc Mobility Models:
-

Indoor and out door models.


UNIT II

MEDIUM ACCESS PROTOCOLS






(9)


MAC Protocols: design issues, goals and classification. Contention based p
rotocols
-

with reservation,
scheduling algorithms, protocols using directional antennas. IEEE standards: 802.11a, 802.11b, 802.11g,
802.15. HIPERLAN.


UNIT III

NETWORK PROTOCOLS







(9)


Routing Protocols: Design issues, goals and classification. Proact
ive 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




(9)


Transport layer : Issues
in desiging
-

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 INTEGRATION OF ADHOC FOR 4G

(9)


Cross l
ayer Design: Need for cross layer design, cross layer optimization, parameter optimization
techniques, Cross layer cautionary prespective. Intergration of adhoc with Mobile IP networks.


TOTAL= 45
periods


REFERENCES:

1.

C.Siva Ram Murthy and B.S.Manoj, Ad ho
c Wireless Networks Architectures and protocols, 2nd
edition, Pearson Education. 2007

2.

Charles E. Perkins, Ad hoc Networking, Addison


Wesley, 2000




30


PTSENEB23



NEURAL NETWORKS






L T P C













3 0 0 3

AIM

In order to develop an artificial neural n
etwork method for machine setup problems


OBJECTIVE




Neural Networks are typically trained with respect to Euclidean distance minimisation / likelihood
maximisation.



To learn the machine setup concepts and methods, along with feedforward



To self organize t
he map and adaptive reasoning theory


UNIT I

ARTIFICIAL NEURAL NETWORKS








9


Neuro
-
physiology
-

General Processing Element
-

Perceptrons
-

-

ADALINE
-

LMS learning rule
-

MADALINE
-

MR2 training algorithm.


UNIT II BACK PROPAGATION NETWORK AND
BI
-
DIRECTIONAL ASSOCIATION MEMORY 9



Back Propagation Network
-

updating of output and hidden layer weights


Derivation of BPN learning
rule


Application of BPN
-

Associative memory
-

Bi
-
directional Associative Memory
-

Hopfield memory
-

traveling sales

man problem.


UNIT III

SIMULATED ANNEALING AND COUNTER PROPAGATION NETWORK


9



Annealing
-

Boltzmann machine learning
-

Application
-

Counter Propagation network
-

architecture
-

Training
-

Applications.


UNIT IV

SELF ORGANIZING MAP AND ADAPTIVE RE
ASONING THEORY



9


Self
-
organizing map
-

Learning algorithm
-

Feature map classifier
-

Applications
-
Architecture of Adaptive
Resonance Theory
-

Pattern matching in ART network.


UNIT V

NEOCOGNITRON









9


Architecture of Neocognitron
-

Data proce
ssing and performance of architecture of spacio
-

temporal
networks for speech recognition.


TOTAL : 45 periods

TEXT BOOK


1.M. Ananda Rao, J. Srinivas, Neural networks : algorithms and applications, Alpha Science
International,2003.


REFERENCES:

1.

1.
Laurene Fausett, Fundamentals of Neural Networks: Architecture, Algorithms and Applications,
2nd Edition, Prentice Hall, 1994.

2.

2.Freeman J.A. and Skapura B.M., Neural Networks, Algorithms Applications and Programming
Techniques, Addison
-
Wesely, 1990.




31


PTS
ENEB24


REAL TIME SYSTEMS







L T P C













3 0 0 3

AIM


This paper describes to learn, real
-
manipulation technology.


OBJECTIVE




To explain the timing requirements of real
-
time systems



To d
istinguish between hard and soft real
-
time systems



To discuss the defining characteristics of real
-
time systems



To describe scheduling algorithms for hard real
-
time systems


UNIT I

TYPES & ISSUES








9


Real time Definitions
-

Types
-

Examples
-

Struc
ture of an RTS
-

Task classes Real
-

time system issues
-

Architecture issues
-

OS issues
-

other issues
-

Performance measure for real
-

time systems.


UNIT II

REAL TIME LANGUAGES







9


Programming languages and tools
-

Language features
-

survey of c
ommonly used programming
languages


programming environments
-

run
-

time support Real


Time Systems life cycle
-

Real
-

time
Specification and Design Techniques Natural languages
-

mathematical specification
-

Flow charts
-

structure charts
-

Pseudo cod
e and PDL


FSA
-

DFD
-

Petri Nets
-

Warnier
-

Orr notation
-

state charts.


UNIT III

SCHEDULING ALGORITHMS







9


Real
-

Time OS Task
-

control block model
-

Task states


Task management
-

POSIX. Task assignment
and scheduling classical uniprocessor
scheduling Algorithms


Task assignment
-

Fault Tolerance
scheduling.


UNIT IV

FAULT TOLERANT SYSTEMS







9


Real
-
time communication Network Topologies
-

Protocols
-

Reliability
-

Testing and Fault Tolerance
-

Faults
-

Failures


Bugs and effects
-

reli
ability
-

Testing


Fault Tolerance.


UNIT V


FUTURE APPLICATIONS







9


Real
-

Time Applications
-

The first real
-

time application
-

Real
-

time database
-

real
-

time image
processing
-

real
-
time UNIX.

TOTAL : 45 periods


REFERENCES:


1. Phillip A.
Laplante., Real Time Systems Hand book, Prentice Hall of India Pvt. Ltd., 3rd Edition,2004.

2. C.M. Krishna. Kang G. Shin ,Real Time Systems, 2nd Edition Tata McGraw Hill International, 2001.




32


PTSENEB25


WIRELESS ADHOC NETWORKS




L T P C






3
0 0 3

AIM

It covered

Wireless Ad Hoc Networks
, which include Mobile Ad Hoc Networks (MANETs), Wireless
Sensor Networks (WSNs) and Wireless Mesh Networks (WMNs).


OBJECTIVES



Introduction to Wireless Networks WANs and LANs



Mobility in the Internet (MobileIP
)



MAC Layer Design for Mobile Adhoc Networks



Routing Layer Design for Mobile Adhoc Networks



Case Studies


UNIT I


INTRODUCTION









(9)


Introduction to wireless ad hoc networks, including Mobile ad hoc networks (MANETs), Wireless sensor
networks (WSNs)

and Wireless mesh networks (WMNs),Adhoc Mobility Models:
-

Indoor and outdoor
models.


UNIT II

MEDIUM ACCESS PROTOCOLS AND MANET




(9)


MAC Protocols: design issues, goals and classification. Contention based protocols
-

with reservation,
scheduling algo
rithms, protocols using directional antennas. IEEE standards: 802.11a, 802.11b, 802.11g,
802.15. HIPERLAN. Medium access control (MAC) protocols for MANETs, Routing protocols for MANETs,

MAC Layer Design for Mobile Adhoc Networks,

Transport protocols and c
ongestion control for MANETs,
Security issue in MANETs.


UNIT III

NETWORK PROTOCOLS AND WSN






(9)


Routing Protocols: Design issues, goals and classification. Proactive Vs reactive routing,Unicast routing
algorithms, Multicast routing algorithms, hybri
d routing algorithm,
Routing Layer Design for Mobile Adhoc
Networks
Energy aware routing algorithm, Hierarchical Routing, QoS aware routing. Power
-
efficient MAC
protocols for WSNs, Routing and data dissemination in WSNs,Flow and Congestion control in WSNs,

Topology control in WSNs, Node deployment and localization in WSNs, Security issues in WSNs


UNIT IV

WMS AND END
-
END DELIVERY AND SECURITY




(9)


Architecture and design issues of WMNs, Medium access control and scheduling for WMNs, Routing and
securit
y for WMNs,Issues in designing a transport layer protocol for Ad hoc wireless Networks, Design
goals of a transport layer protocol for Ad hoc wireless Networks, Classification of transport layer
solutions, TCP over Ad hoc wireless Networks, Other transport

layer protocols for Ad hoc wireless
Networks.


UNIT V

SECURITY AND INTEGRATION OF ADHOC FOR 4G




(9)


Security in wireless Ad hoc wireless Networks, Network security requirements, Issues & challenges in
security provisioning, Network security attacks,
Key management, Secure routing in Ad hoc wireless.
Cross layer Design: Need for cross layer design, cross layer optimization, parameter optimization


33


techniques, Cross layer cautionary prespective. Intergration of adhoc with Mobile IP networks.

Case
Studies


TOTAL= 45 PERIODS

REFERENCES:


1. C.Siva Ram Murthy and B.S.Manoj, Ad hoc Wireless Networks Architectures and protocols, 2nd edition,
Pearson Education. 2007

2. Charles E. Perkins, Ad hoc Networking, Addison


Wesley, 2000

3. Stefano Basagni, Marco Cont
i, Silvia Giordano and Ivan stojmenovic, Mobilead hoc networking, Wiley
-
IEEE press, 2004.

4. Mohammad Ilyas, The handbook of adhoc wireless networks, CRC press, 2002.



34


PTSENEB26



CELLULAR NETWORK






L T P C

3 0 0 3

AIM


It present the introduction of
cellular network, GSM, Multiple Access,Location management,

Cooperative Cellular Wireless Network,OFDM,MIMO.


OBJECTIVES



To learn the introduction of cellular network.



we have to study the
elements of cellular radio system design



to learn the cell coverage

for signal and traffic



to learn frequency management and channel assignment


UNIT I

INTRODUCTION









(
9
)

Cellular Concepts and Basics
-

Evolution of Cellular Networks
-

GSM Network Architecture
-

Cell system
for frequency re
-
use
-

Multiple Access Sc
hemes for Cellular Systems
-

TDD FDD Duplex Schemes
-

Cell
phone electronics basics
-

Cellular network basics
-

Mobile phone network registration
-

Cellular Handover
and handoff


Power Control
-

Cellular Telecommunications and Cell Phone Technology


UNIT
II

LOCATION MANAGEMENT IN CELLULAR NETWORKS



(9)

Numbering and grouping, setup access and paging channels channel assignments to cell sites and mobile
units,channel sharing and borrowing, sectorization, overlaid cells, non fixed channel assignment.
WLL,Pa
ging,Satelite systems,Standards,Future trends in personal wireless systems

,
Radio wave
propagation issues in personal wireless systems,Propagation models,Multipath fading and Base
bandimpulse respond models,parameters of mobile multipath channels,Antenna s
ystems in mobile radio.


UNIT III

NETWORK PLANNING







(9)



Network Design Process
-

Detailed Network Planning
-

Network Evolution
-

3GPP Release 4 Circuit
Core Network
-

CS Core Detailed Network Planning
-

User Plane Detailed Planning
-

CS Core Network
Op
timisation
-

Packet Switched Core Network Planning and Optimisation
-

Fourth Generation Mobile
Networks
-

4G Network Architecture
-

Planning Overview for 4G Networks


UNIT IV

COOPERATIVE CELLULAR WIRELESS NETWORK




(11)

Network architecture and Research

issue, Cooperative communications in OFDM and MIMO , Coperative
base station techniques ,Antenna architecture for network MIMO , Distributed Space time block codes ,
Collaborative relaying in downlink cellular network ,radio Resource Optimization,Adaptiv
e Resource
allocation , Cross layer scheduling design , Green Communication ,Cooridinated multipoint transmission
in LTE.


UNIT V


APPLICATION









(9)

Applications of CDMA to cellular communication systems. Second and third generation CDMA
systems/ s
tandards. Multicarrier CDMA. Synchronization and demodulation,Diversity techniques and rake
receiver.














TOTAL = 45

REFERENCES:

1. K.Feher,Wireless digital communications,PHI,New Delhi,1995

2. T.S.Rappaport,Wireless digital commun
ications;Principles and practice,Prentice Hall,NJ,1996.

3. W.C.Y.Lee,Mobile communications Engineering:Theory And Applications,Second Edition,

McGraw
Hill,New York.19908.

4. Schiller,Mobile Communications;Pearson Education Asia Ltd.,2000



35


PTSENEB27


VIRTUAL
IZATION TECHNIQUES





L T P C





3 0 0 3

AIM

To develop a focused technology view targeted at Virtualization with a focus on Computing an
d
Networking virtualization
.


OBJECTIVE



Computing Virtualization tools, applications and techniques



Network Virtualization



Virtualization and Cloud Computing


UNIT I

OVERVIEW OF VIRTUALIZATION






10

Basics of Vi
rtualization
-

Virtualization Types


Desktop Virtualization


Network Virtualization


Server
and Machine Virtualization


Storage Virtualization


System
-
level or Operating Virtualization


Application
Virtualization
-
Virtualization Advantages


Virtual M
achine Basics


Taxonomy of Virtual machines
-

Process Virtual Machines


System Virtual Machines


Hypervisor
-

Key Concepts


UNIT II

SERVER CONSOLIDATION







8

Hardware Virtualization


Virtual Hardware Overview
-

Sever Virtualization


Phy
sical and Logical
Partitioning
-

Types of Server Virtualization


Business cases for Sever Virtualization


Uses of Virtual
server Consolidation


Planning for Development


Selecting server Virtualization Platform


UNIT III

NETWORK VIRTUALIZATION








10

Design of Scalable Enterprise Networks
-

Virtualizing the Campus WAN Design


WAN Architecture
-

WAN
Virtualization
-

Virtual Enterprise Transport Virtualization

VLANs and Scalability
-

Theory Network Device
V
irtualization Layer 2
-

VLANs Layer 3 VRF Instances Layer 2
-

VFIs Virtual Firewall Contexts Network
Device Virtualization
-

Data
-

Path Virtualization Layer 2: 802.1q
-

Trunking Generic Routing Encapsulation


Ipsec L2TPv3 Label Switched Paths
-

Control
-
Pl
ane Virtualization

Routing Protocols
-

VRF
-

Aware
Routing Multi
-
Topology Routing.


UNIT IV

VIRTUALIZING STORAGE





8

SCSI
-

Speaking SCSI
-

Using SCSI buses


Fiber Channel


Fiber Channel Cables


Fiber Cha
nnel
Hardware Devices


iSCSI Architecture


Securing iSCSI


SAN backup and recovery techniques


RAID


SNIA Shared Storage Model


Classical Storage Model


SNIA Shared Storage Model


Host based
Architecture


Storage based architecture


Network based

Architecture


Fault tolerance to SAN


Performing Backups


Virtual tape libraries.


UNIT V

VIRTUAL MACHINES PRODUCTS





9

Xen Virtual machine monitors
-

Xen API


VMware


VMware products


Vmware Features


Microsof
t
Virtual Server


Features of Microsoft Virtual Server

TOTAL : 45 periods

REFERENCES:

1. William von Hagen, Professional Xen Virtualization, Wrox Publications,January, 2008.

2. Chris Wolf , Erick M. Halter, Virtualization: From the Desktop to the Enterpri
se, APress 2005.

3. Kumar Reddy, Victor Moreno, Network virtualization, Cisco Press, July, 2006.

4. James E. Smith, Ravi Nair, Virtual Machines: Versatile Platforms for Systems and Processes,
Elsevier/Morgan Kaufmann, 2005.

5. David Marshall, Wade A. Reyno
lds, Advanced Server Virtualization:VMware and Microsoft Platform in
the Virtual Data Center, Auerbach Publications, 2006.



36


PTSENEB28


COMPILER OPTIMIZATION




L T P C





3 0 0 3

AIM


To learn the compiler design concepts such as language recognition, symbol table management,
semantic analysis and code generation
.


OBJECTIVE



To introduce the major concept areas
of language translation and compiler design.



To develop an awareness of the function and complexity of modern compilers.



To provide practical, hands
-
on experience in compiler design, writing and modification.


UNIT I






9

Principles Of Compiler


Compiler Structure


Properties of a Compiler


Optimization

Importance of
Code optimization


Structure of Optimizing compilers


placement of optimizations in optimizing
c
ompilers


ICAN


Introduction and Overview


Symbol table structure


Local and Global Symbol table
management


UNIT II






9

Intermediate representation


Issu
es


High level, medium level, low level intermediate languages


MIR,
HIR, LIR


ICAN for Intermediate code


Optimization


Early optimization


Constant folding


scalar
replacement of aggregates


Simplification


value numbering


constant propagation



redundancy
elimination


loop optimization


UNIT III





9

Procedure optimization


in
-
line expansion


leaf routine optimization and shrink wrapping


register
allo
cation and assignment


graph coloring


code scheduling

control flow and low level optimizations


inter
-
procedural analysis and optimization

call graph


data flow analysis


constant propagation


alias
analysis


register allocation


global referenc
es


Optimization for memory hierarchy


UNIT IV




9

Code Scheduling


Instruction scheduling


Speculative scheduling


Software pipelining


trace
sche
duling


percolation scheduling


Run
-
time support


Register usage


local stack frame


run
-
time
stack


Code sharing


position

independent code


Symbolic and polymorphic language support


UNIT V







9

Case Studies


Sun Compilers for SPARC


IBM XL Compilers


Alpha compilers


PA

RISC assembly
language


COOL


( Classroom Object oriented language)


Compiler testing tools


SPIM


TOTAL : 45

periods

TEXT BOOKS:

1. S
teven S. Muchnick, “Advanced Compiler Design Implementation”, Morgan Koffman


Elsevier Science,
India, Indian Reprint 2003

2. Keith D Cooper and Linda Torczon, “ Engineering a Compiler, Elsevier Science,India,


REFERENCES
:

1. Allen Holub “Compiler Design
in C”, Prentice Hall of India, 1990.

2. Alfred Aho, V. Ravi Sethi, D. Jeffery Ullman, “Compilers Principles, Techniques and Tools”, Addison
Wesley, 1988.

3. Charles N. Fischer, Richard J. Leblanc, “Crafting a compiler with C”, Benjamin Cummings, 1991.



37


PTSE
NEB29


SATELLITE COMMUNICATION




3 0 0 3


AIM

To enable the student to become familiar with satellites and satellite services.


OBJECTIVES

• Overview of satellite systems in relation to other terrestrial systems.

• Study of satellite orbits and launching
.

• Study of earth segment and space segment components

• Study of satellite access by various users.

• Study of DTH and compression standards


UNIT I

ORBITAL MECHANICS






9

Kepler's laws of motion, Orbits, Orbit Equations, Orbit Description, Locating t
he Satellite in the Orbit and
with Respect to Earth, Orbital Elements
-
Look Angle Determination and Visibility
-

Orbital Perturbations,
Orbit Determination, Launch Vehicles, Orbital Effects in Communication System
-

Performance Attitude
control; Satellite l
aunch vehicles. Spectrum allocations for satellite systems.


UNIT II

SPACECRAFT SUB SYSTEMS AND EARTH STATION



9

Spacecraft Subsystems, Altitude and Orbit Control, Telemetry and Tracking, Power
Systems,Communication Subsystems, Transponders, Antennas, E
quipment Reliability, Earth Stations,
Example of payloads of operating and planned systems.


UNIT III

SPACE LINKS








9

The Space Link, Satellite Link Design
-

Satellite uplink
-
down link power Budget, Basic Transmission
Theory, System Noise Temp, G/T
Ratio, Noise Figure, Downlink Design, Design of Satellite Links for
Specified C/N
-

Microwave Propagation on Satellite
-
Earth Paths. Interference between satellite circuits,
Energy Dispersal, propagation characteristics of fixed and mobile satellite links.


UNIT IV

MULTIPLE ACCESS TECHNIQUES AND NETWORK ASPECTS

9

Single access vs. multiple access (MA). Classical MA techniques: FDMA, TDMA. Single channel per carrier
(SCPC) access
-

Code division multiple access (CDMA). Demand assignment techniques. Exam
ples of MA
techniques for existing and planned systems (e.g. the satellite component of UMTS).Mobile satellite
network design, ATM via satellite. TCP/IP via satellite
-

Call control, handover and call set up procedures.
Hybrid satellite
-
terrestrial network
s


UNIT V

SERVICES AND APPLICATIONS



9

Fixed and mobile services
-

Multimedia satellite services
-

Advanced applications based on satellite
platforms
-

INTELSAT series
-

INSAT, VSAT, Remote Sensing
-

Mobile satellite service:

GSM. GPS,
INMARSAT, Navigation System, Direct to Home service (DTH), Special services, E
-
mail, Video
conferencing and Internet connectivity

TOTAL : 45
periods

REFERENCES

1.

Dennis Roddy, “Satellite Communications”, 3rd Edition, Mc Graw Hill International Edi
tions, 2001.

2.

Bruce R.Elbert, “Introduction to Satellite Communication” , Artech House Inc.,1999.

3.

Timothy Pratt, Charles W. Bostian, Jeremy Allnutt, “Satellite Communications”, 2nd Edition,
Wiley,

John & Sons, 2002.

4.

Wilbur L.Pritchard, Hendri G.Suyderhood,
Robert A.Nelson, “Satellite Communication Systems

Engineering”, 2nd Edition, Prentice Hall, New Jersey, 1993.

5.

Tri T.Ha, "Digital satellite communication", 2nd Edition, McGraw Hill, New york,1990



38


PTSENEB30



NETWORK ROUTING ALGORITHMS





L T P C













3 0 0 3

AIM



To study fundamental concepts in circuit switching and packet switching networks.



OBJECTIVES




To expose the students to the concepts of circuit and packet switching networks.



To provide adequate knowledge about High spe
ed and Mobile Ad Hoc Networks.




To provide adequate knowledge about Network Routing algorithms.


UNIT I












9



CIRCUIT SWITCHING NETWORKS


AT & T’s Dynamic Routing Network, Routing in Telephone Network
-
Dynamic Non Hierarchical Routing
-
Trunk Status

Map Routing
-
Real Time Network Routing, Dynamic Alternative Routing
-
Distributed Adaptive
Dynamic Routing
-
Optimized Dynamic Routing


UNIT II











9


PACKET SWITCHING NETWORKS


Distance vector Routing, Link State Routing, Inter domain Routing
-
Classles
s Interdomain routing (CIDR),
Interior Gateway routing protocols (IGRP)
-

Routing Information Protocol (RIP), Open Shortest Path First
(OSPF), Exterior Gateway Routing Protocol (EGRP)
-

Border Gateway Protocol (BGP), Apple Talk Routing
and SNA Routing


UNI
T III











9


HIGH SPEED NETWORKS


Routing in optical networks
-
The optical layer, Node Designs, Network design and operation, Optical layer
cost tradeoffs, Routing and wavelength assignment, Architectural variations, Routing in ATM networks
-
ATM addre
ss structure, ATM Routing, PNNI protocol, PNNI signaling protocol, Routing in the PLANET
network and Deflection Routing.



UNIT


IV











9


MOBILE NETWORKS


Routing in Cellular Mobile Radio Communication networks
-
Mobile Network Architecture, Mobilit
y
management in cellular systems, Connectionless Data service for cellular systems, Mobility and Routing in
Cellular Digital Packet Data (CDPD) network, Packet Radio Routing
-

DARPA packet radio network, Routing
algorithms for small, medium and large sized
packet radio networks.



UNIT
-

V











9


MOBILE AD
-
HOC NETWORKS




Internet based mobile ad
-
hoc networking, communication strategies, routing algorithms


Table
-
driven
routing
-

Destination Sequenced Distance Vector (DSDV), Source initiated ondeman
d routing
-

Dynamic
Source Routing (DSR), Ad
-
hoc On
-

demand Distance Vector (AODV), Hierarchical based routing
-

Cluster
head Gateway Switch Routing (CGSR) and Temporally
-
Ordered Routing Algorithm (TORA), Quality of
Service.










TOTAL : 45 periods





39


PT
SENEB31


DISTRIBUTED COMPUTING






L T P C












3 0 0 3

AIM

To study
different how parts of a program run simultaneously on two or more computers
.


OBJECTIVES



To understand the concept of Distributed Computing,



To organization of Distributed Comp
uting,



To know advantages and limitations of Distributed Computing



UNIT I

FUNDAMENTALS








9

Characterization of Distributed Systems


Examples


Resource Sharing and the Web


Challenges


System Models


Architectural and Fundamental Models


Netw
orking and Internetworking


Types of
Networks


Network Principles


Internet Protocols


Case Studies.


UNIT II

PROCESSES AND DISTRIBUTED OBJECTS





9

Interprocess Communication


The API for the Internet Protocols


External Data Representation and
Ma
rshalling


Client

Server Communication


Group Communication


Case Study


Distributed Objects
and Remote Invocation


Communication between Distributed Objects


Remote Procedure Call


Events
and Notifications


Java RMI


Case Study.


UNIT III

OPERAT
ING SYSTEM ISSUES






9

The OS Layer


Protection


Processes and Threads


Communication and Invocation


OS Architecture


Security


Overview


Cryptographic Algorithms


Digital Signatures


Cryptography Pragmatics


Case
Studies


Distributed File S
ystems


File Service Architecture


Sun Network File System


The Andrew
File System.


UNIT IV

OPERATING SYSTEM ISSUES






9

Name Services


Domain Name System


Directory and Discovery Services


Global Name Service


X.500 Directory Service


Clocks


Events and Process States


Synchronizing Physical Clocks


Logical
Time and Logical Clocks


Global States


Distributed Debugging


Distributed Mutual Exclusion


Elections


Multicast Communication Related Problems.


UNIT V

DISTRIBUTED TRANSACTION PR
OCESSING




9

Transactions


Nested Transactions


Locks


Optimistic Concurrency Control


Timestamp Ordering


Comparison


Flat and Nested Distributed Transactions


Atomic Commit Protocols


Concurrency Control
in Distributed Transactions


Distribute
d Deadlocks


Transaction Recovery


Overview of Replication and
Distributed Multimedia Systems.

TOTAL : 45 periods

REFERENCES:

1. George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems Concepts and Design”, Pearson
Education, 3rd Edition,

2002.

2. Sape Mullender, “Distributed Systems”, Addison Wesley, 2nd Edition, 1993.

3. Albert Fleishman, “Distributed Systems Software Design and Implementation”, Springer Verlag, 1994.

4. Andrew S Tanenbaum, Maartenvan Steen, “Distributed Systems, Princip
les and Pardigms”, Pearson
Education, 2002.





40


PTSENEB32


WIRELESS COMMUNICATION NETWORK




L T P C














3 0 0 3

AIM


To have knowledge about Wireless medium, Wireless medium Access.



OBJECTIVES




To study various wireless LAN and WAN concepts.




To learn planning and operation of wireless networks.



To understand WPAN and geo
-
location system


UNIT I











9


WIRELESS MEDIUM


Air Interface Design


Radio propagation mechanism


Pathloss modeling and Signal Coverage


Effect of
Multipath and Do
ppler


Channel Measurement and Modelling


Simulation of Radio Channel.



UNIT II











9


WIRELESS MEDIUM ACCESS


Fixed Assignment Access for Voice Networks


Random Access for Data Networks
-

Integration of Voice
and Data Traffic.



UNIT III











9



WIRELESS NETWORK OPERATION


Wireless Network Topologies


Cellular Topology


Cell fundamentals


Signal to Interference Ratio


Capacity Expansion


Mobility Management

Resources and Power Management


Security in Wireless
Networks


UNIT IV











9


WIRELESS WAN



GSM and TDMA Technology


Mobile Environment


Communication in the Infrastructure


CDMA
Technology


IS95


IMT2000


Mobile Data Networks


CDPD Networks


GPRS


Mobile Application
Protocol.



UNIT


V











9



WIRELESS L
ANS AND HIPERLANS


Introduction to wireless LANs


IEEE 802.11


WPAN IEEE 802.15

Mobile AdHoc Networks(MANET)
-

Principle and operation
-

Wireless Home Networking


Concepts of Bluetooth Technology


Wireless
Geolocation.











TOTAL : 45 periods


RE
FERENCES



1. Kaveth Pahlavan, K.Prasanth Krishnamurthy, “Principles of Wireless Networks”, Pearson Education
2.Asia, 2002 2. Leon Garcia, Widjaja, “Communication Networks”, Tata McGraw Hill, New Delhi, 2000.

3. William Stallings, “Wireless Communications
and Networks”, Second Edition Prentice Hall, India 2007

4. Jon W Mark , Weihua Zhuang, ”Wireless communication and Networking”, Prentice Hall India 2003



41


PTSENEB33


ADVANCED DATABASE SYSTEMS





L T P C














3 0 0 3

AIM


To provide a str
ong foundation in database technology and an introduction to the current trends in this
field


OBJECTIVES




To learn the fundamentals of data models and to conceptualize and depict a database system
using ER diagram.



To make a study of SQL and relational da
tabase design.



To understand the internal storage structures using different file and indexing techniques which
will help in physical DB design


UNIT I

DATABASES









9



Conventional Databases, Distributed Databases and Relational Databases


Archite
cture


Fragmentation


Query Processing


Transaction Processing


Concurrency Control


Recovery



UNIT II

OBJECT ORIENTED DATABASES






9


Introduction to Object Oriented Data Bases
-

Approaches
-

Modeling and Design
-

Persistence


Query
Languages
-

Transaction
-

Concurrency


Multi Version Locks
-

Recovery.



UNIT III

EMERGING SYSTEMS







9


Enhanced Data Models
-

Client/Server Model
-

Data Warehousing and Data Mining
-

Web Databases


Mobile Databases.



UNIT IV

DATABASE DESIGN ISSUES







9


ER Model
-

Normalization
-

Security
-

Integrity
-

Consistency
-

Database Tuning
-

Optimization and
Research Issues


Design of Temporal Databases


Spatial Databases.



UNIT V


CURRENT ISSUES








9


Rules
-

Knowledge Bases
-

Active and Deductive Data
bases
-

Parallel databases


Multimedia Databases


Image Databases


Text Database











TOTAL : 45 periods


REFERENCES



1.


Elisa Bertino, Barbara Catania, Gian Piero Zarri, “Intelligent Database Systems”, Addison
-
Wesley,
2001.

2.

Carlo Zaniolo, St
efano Ceri, Christos Faloustsos, R.T.Snodgrass, V.S.Subrahmanian, “Advanced
Database Systems”, Morgan Kaufman, 1997.

3

Gary W.Hason, James V.Hanson, "Database Management and Design", Prentice Hall of India Private
Ltd, 1999.

4

N.Tamer Ozsu, Patrick Valdu
riez, “Principles of Distributed Database Systems”, Prentice Hal
International Inc., 1999.

5

C.S.R Prabhu, “Object
-
Oriented Database Systems”, Prentice Hall of India, 1998.

6

Abdullah Uz Tansel et al, “Temporal Databases: Theory, Design and principles”, B
enjamin Cummings
Publishers, 1993.



42




PTSENEB34



PERVASIVE COMPUTING






L T P C






3 0 0 3

AIM

Pervasive computin
g aims to make our lives simpler through the use of tools that allow us to manage
information easily


OBJECTIVE



To know the
Computing and Networks theme is the successful collaboration of those within the
Intelligence, Agents



To learn about the smart card
application and authentication.



To understand the concepts of computing and web based application.


UNIT I






9


Pervasive Computing Application
-

Pervasive Computing devices
and Interfaces
-
Device technology
trends, Connecting issues and protocols


UNIT II






9


Pervasive Computing and web based Applications
-

XML and its role in Pervasive Computi
ng
-

Wireless
Application Protocol (WAP) Architecture and Security


Wireless Mark
-
Up language (WML)


Introduction


UNIT III






9


Voice Enabling Pervasive Computing
-

Voice Stand
ards
-

Speech Applications in Pervasive Computing and
security


UNIT IV






9


PDA in Pervasive Computing


Introduction
-

PDA software Components, Standards, emerging trends
-

PD
A Device characteristics
-

PDA Based Access Architecture


UNIT V





9

User Interface Issues in Pervasive Computing, Architecture
-

Smart Card
-

based Authentication
Mechan
isms
-

Wearable computing Architecture



TOTAL : 45 PERIODS

TEXT BOOKS

1. Jochen Burkhardt, Horst Henn, Stefan Hepper, Thomas Schaec & Klau
s Rindtorff.Pervasive Computing
Technology and Architecture of Mobile Internet Applications,Addision Wesley, Reading, 2002.

2. Uwe Ha nsman, Lothat Merk, Martin S Nicklous & Thomas Stober: Principles of Mobile Computing,
Second Edition, Springer
-

Verlag, N
ew Delhi, 2003.


REFERENCES


1. Rahul Banerjee: Internetworking Technologies: An Engineering Perspective,Prentice

Hall of India,
New Delhi, 2003. (ISBN 81
-
203
-
2185
-
5)

2
.
Rahul Banerjee: Lecture Notes in Pervasive Computing, Outline Notes,BITS
-
Pilani, 2003.