1 Page

Slide_15

Course: MATH 1104, Spring 2008
School: National University of...
Rating:
 
 
 
 
 

Word Count: 2998

Document Preview

Multivariable MA1104 Calculus Lecture 15 Dr KU Cheng Yeaw Monday March 16, 2009 Recap Last Lecture ... we finished our study on multiple integrations! Overview In this lecture, we begin a study on vector calculus. We first introduce vector fields. Unlike (scalar) functions of several variables, a vector field assigns a vector to a point in plane/space. we introduce line integrals over a curve in plane/space...

Register Now

Unformatted Document Excerpt

Coursehero >> Other International >> National University of Singapore >> MATH 1104

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Multivariable MA1104 Calculus Lecture 15 Dr KU Cheng Yeaw Monday March 16, 2009 Recap Last Lecture ... we finished our study on multiple integrations! Overview In this lecture, we begin a study on vector calculus. We first introduce vector fields. Unlike (scalar) functions of several variables, a vector field assigns a vector to a point in plane/space. we introduce line integrals over a curve in plane/space as a generalization of single integral over an interval. Vector Field So far, we have developed the calculus of (scalar) functions of several variables. On many instances, we borrow intuition from Single Variable Calculus. We have also seen the role and usefulness of vector functions r(t) in the study of scalar functions. In this last chapter of MA1104, we shall study the calculus of vector fields. These are functions that assign vectors to points in plane or space. We shall define Line integrals - integrals which can be used to find the work done by a force field in moving an object along a curve. Surface integrals - integrals which can be used to find the rate of fluid flow across a surface The connections between these new types of integrals and the single, double, and triple integrals we have already met are given by the higher-dimensional versions of the Fundamental Theorem of Calculus: Greens Theorem Stokes Theorem Divergence Theorem Recall that we have learned about the following different type of functions function (scalar) f (t) (vector) r(t) (scalar) f (x, y) (scalar) f (x, y, z) Today, we will introduce function (vector field) F(x, y) (vector field) F(x, y, z) Domain D D R2 D R3 Range R R V2 R V3 Domain D DR DR D R2 D R3 Range R RR R V2 or V3 RR RR Vector field on R2 Let D R2 . A vector field of on R2 is a function F that assigns to each point (x, y) D a 2-D vector F(x, y). Vector field on R3 Let D R3 . A vector field of on R3 is a function F that assigns to each point (x, y, z) D a 3-D vector F(x, y, z). Suppose F is a vector function on R2 . Since F(x, y) is a 2-D vector, we can write F(x, y) in its component functions P and Q as follows: F(x, y) = P (x, y)i + Q(x, y)j = P (x, y), Q(x, y) or for short F = P i + Qj. Similarly, for a vector field F on R3 , we can express F as F(x, y, z) = P (x, y, z)i + Q(x, y, z)j + R(x, y, z)k = or for short F = P i + Qj + Rk. P (x, y, z), Q(x, y, z), R(x, y, z) Notice that P and Q are scalar functions of two variables. They are sometimes called scalar fields to distinguish them from vector fields. How can we visualize a vector field? The best way to picture a vector field F(x, y) is to draw the arrow representing the vector F(x, y) starting at the point (x, y). Of course, its impossible to do this for all points (x, y). Still, we can gain a reasonable impression of F by doing it for a few representative points in D, as shown. For F(x, y.z), we visualize it by drawing arrows starting from (x, y, z): We can define continuity of vector fields. We can show that F is continuous if and only if its component functions P , Q, and R are continuous. We sometimes identify a point (x, y, z) with its position vector x = x, y, z and write F(x) instead of F(x, y, z). Then, F becomes a function that assigns a vector F(x) to a vector x. Here are some examples of computer plots of vector fields: F(x, y) = -yi + xj F(x, y) = yi + sin xj F(x, y) = ln(1 + y2)i + ln(1 + x2 )j Example 1. Match the vector fields F(x, y) = y 2 , x-1 , G(x, y) = y+1, ex/6 , H(x, y) = y 3 , x2 -1 to the graphs shown: Graph A Graph B Graph C Solution. Notice the vectors F(x, y) = y 2 , x - 1 will never point to the left because y 2 0. So F is matched to Graph B. Similarly, the second component of G(x, y) = y + 1, ex/6 is ex/6 > 0, so the vectors G(x, y) will always point upwards. Graph A is the only such graph. We are left with Graph C for H(x, y) = y 3 , x2 - 1 . Lets check: for y > 0, the vectors H(x, y) point to the right; for y < 0, the vectors H(x, y) points to the left. So Graph C is reasonable. Most 3-D vector fields, however, are virtually impossible to sketch by hand. The gravitational field is pictured here. Gradient Fields If f is a scalar function of two variables, recall that its gradient is defined by: f (x, y) = fx (x, y)i + fy (x, y)j. f Therefore, f is really a vector field on R2 and is called a gradient vector field. Likewise, if f is a scalar function of three variables, its gradient is a vector field on R3 given by: f (x, y, z) = fx (x, y, z)i + fy (x, y, z)j + fz (x, y, z)k. Conservative Vector Field We shall discover later that many calculations involving vector fields simplify dramatically if the vector field F is a gradient field of some scalar function, that is, if there exists a function f such that F = f. In this situation, F is called a conservative vector field and f is called a potential function for F. Not all vector fields are conservative. But such fields do arise frequently in physics. For example, the gravitational field is conservative. However, we will not go into the details here. Example 2. Determine whether F(x, y) = 2xy - 3, x2 + cos y is conservative. Solution. The idea is to try to construct a potential function f such that f = F. Suppose such f exists. Then f = 2xy - 3, x f = x2 + cos y. y Integrating the first of these equations with respect to x (treating y as a constant), we get f (x, y) = (2xy - 3)dx = x2 y - 3x + g(y). Here, we have added an arbitrary function of y alone, g(y), rather than a constant of integration, because any function of y is treated as a constant when integrating with respect to x. Differentiating the expression for f (x, y) with respect to y gives f = x2 + g (y) = x2 + cos y. y Thus yields g (y) = cos y, so that g(y) = cos y dy = sin y + c. Therefore, f (x, y) = x2 y - 3x + sin y + c where c is an arbitrary constant. Since we have been able to construct a potential function, the vector field F(x, y) is conservative. Line Integrals We shall define an integral that is similar to a single integral except that, instead of integrating over an interval [a, b], we integrate over a curve C. Such integrals are called line integrals. They were invented in the early 19th century to solve problems involving: Fluid flow Forces Electricity Magnetism Line integrals generalizes the idea of integrating a single-variable real function over an interval [a, b] in two ways: as the integral of a function of two or three variables over a curve in two- or three-dimensional space. as the integral of a vector field over a curve. Line Integrals in Plane We start with a plane curve C given by the parametric equations: x = x(t), y = y(t), a t b. Equivalently, C can be given by the vector equation r(t) = x(t)i + y(t)j. We assume that r(t) is smooth, that is r (t) is continuous and r (t) = 0 for all a t b. Lets divide the parameter interval [a, b] into n subintervals [ti-1 , ti ] of equal width. We let xi = x(ti ) and yi = y(ti ). Then, the corresponding points Pi (xi , yi ) divide C into n subarcs with lengths s1 , . . ., sn . We choose any point Pi (x , yi ) in the i-th subarc. This i in [t corresponds to a point ti i-1 , ti ]. Now, if f is any function of two variables whose domain includes the curve C, we: 1. Evaluate f at the point (x , yi ). i 2. Multiply by the length 3. Form the sum n si of the subarc. f (x , yi ) si i i which is similar to a Riemann sum. Then, we take the limit of these sums and make the following definition by analogy with a single integral. Line Integrals If f is defined on a smooth curve C given by a smooth parametrization r(t) = x(t)i + y(t)j, t a b. Then the line integral of f along C is n f (x, y) ds = lim C n f (x , yi ) si , i i=1 provided this limit exists and is the same for every choice of (x , yi ). i It can be shown that, if f is a continuous function, then the limit in the above definition always exists. Notice si (xi - xi-1 )2 + (yi - yi-1 )2 . Since x(t) and y(t) have continuous first derivatives, by the Mean Value Theorem (as in the derivation of the arc length formula), we have si for some t (ti-1 , ti ). i x (t )2 + y (t )2 ti i i Therefore, we have n f (x, y) ds = C n lim f (x , yi ) si i i=1 n f (x , yi ) i i=1 = n b lim x (t )2 + y (t )2 ti i i dx dt 2 = a f (x(t), y(t)) + dy dt 2 dt. This formula can be used to evaluate the line integral: Formula for Line Integrals b f (x, y) ds = C a f (x(t), y(t)) dx dt 2 + dy dt 2 dt. The value of the line integral does not depend on the parametrization of the curve, provided that the curve is traversed exactly once as t increases from a to b. The preceding formula says essentially that the arc length element ds can be replaced by ds = dx dt 2 + dy dt 2 dt. In the special case where C is the line segment that joins (a, 0) to (b, 0), using x as the parameter, we can write the parametric equations of C as: x = x, y = 0, a x b. Then, our formula reduces to b f (x, y) ds = C a f (x, 0) ( dx 2 ) + 0 dx = dx b f (x, 0) dx a which is an ordinary single integral. Just as for an ordinary single integral, we can interpret the line integral of a positive function as an area. In fact, if f (x, y) 0, then C f (x, y) ds represents the area of one side of the `fence' or `curtain' shown below, whose: Base is C. Height above the point (x, y) is f (x, y). Example 3. Evaluate C (2 + x2 y) ds where C is the upper half of the unit circle x2 + y 2 = 1. Solution. The upper half of the unit circle has the following smooth parametrization x = cos t, y = sin t, 0 t . Therefore 2 2 (2 + x2 y) ds = C 0 (2 + cos2 t sin t) (2 + cos2 t sin t) 0 dx dt + dy dt dt = = 0 sin2 t + cos2 t dt (2 + cos2 t sin t) dt 0 = cos3 t 3 2 = 2 + . 3 2t - So far, we have defined line integral only for smooth curves. In fact, we can consider any piecewise smooth curve C. That is, C is a union of a finite number of smooth curves C1 , C2 , . . ., Cn , where the initial point of Ci+1 is the terminal point of Ci . Then, we define the line integral f along C as the sum of the integrals of f along each of the smooth pieces: f (x, y) ds = C C1 f (x, y) ds + + Cn f (x, y) ds. Very often, we need to parametrize a line segment, so it is useful to remember that a vector representation of the line segment that starts from r0 and ends at r1 is given by r(t) = (1 - t)r0 + tr1 , 0 t 1. Example 4. Give a parametrization of the line segment from (-5, -3) to (0, 2). Solution. Take r0 = -5, -3 and r1 = 0, 2 . Then, a vector equation of the line is r(t) = (1 - t) -5, -3 + t 0, 2 = = So, a parametrization is x = 5t - 5, y = 5t - 3, 0 t 1. (1 - t)(-5), (1 - t)(-3) + 2t 5t - 5, 5t - 3 , 0 t 1. Example 5. Evaluate C 2x ds where C consists of the arc C1 of the parabola y = x2 from (0, 0) to (1, 1) followed by the vertical line segment C2 from (1, 1) to (1, 2). Solution. We can parametrize C1 as x = x, Therefore, 2 2 y = x2 , 0 x 1. 1 2x ds = C1 0 1 dx dx 2x + dy dx = 0 1 + 4x2 dx = 5 5-1 . 6 On the other hand, on C2 , we choose y as the parameter: x = 1, So 2 2 y = y, 1 y 2. 2 2x ds = C2 1 2 2(1) 2 dy 1 dx dy + dy dy = = 2. Combining the results, 2x ds = C C1 2x ds + 5 5-1 + 2. 6 C2 2x ds = Two other line integrals are obtained by replacing definition, by either: xi = xi - xi-1 . yi = yi - yi-1 . si the Then, they are called the line integral of f along C with respect to x and y respectively: n f (x, y) dx = lim C n f (x , yi ) xi i i n f (x, y) dy = lim C n f (x , yi ) yi . i i Formula for line integral with respect to x b f (x, y) dx = C a f (x(t), y(t))x (t) dt. Formula for line integral with respect to y b f (x, y) dy = C a f (x(t), y(t))y (t) dt. It frequently happens that line integrals with respect to x and y occur together. When this happens, its customary to abbreviate by writing P (x, y) dx + C C Q(x, y) dy = C P (x, y) dx + Q(x, y) dy. Example 6. Evaluate from (5, 3) to (0, 2). C y 2 dx + x dy where C is the line segment Solution. A parametrization of C was given in Example 4: x = 5t - 5, So, x (t) = 5, y (t) = 5. y = 5t - 3, 0 t 1. y 2 dx + x dy = C y 2 x (t) dt + intC xy (t) dt C 1 1 = 0 (5t - 3)3 5 dt + 0 1 (5t - 5)5 dt = 5 0 (25t2 - 25t + 4) dt 1 0 25t3 25t2 - + 4t 3 2 5 = - . 6 = 5 Curve Orientation In general, a given parametrization x = x(t), y = y(t), a t b determines an orientation of a curve C, with the positive direction corresponding to increasing values of the parameter t. For instance, here, the initial point A corresponds to t = a; the terminal point B corresponds to t = b. Let -C denotes the curve consisting of the same points as C but with the opposite orientation (from initial point B to terminal point A): Then we have f (x, y) dx = - -C C f (x, y) dx, -C f (x, y) dy = - C f (x, y) dy This is because orientation. xi and yi changes sign when we reverse the However, if we integrate with respect to the arc length, the value of the line integral does NOT change when we reverse the orientation of the curve: f (x, y) ds = -C C f (x, y) ds This is because si is always positive in both orientations. Line Integrals in Space We now consider line integrals in space. Suppose that C is a smooth space curve given by the parametric equations x = x(t), or by a vector equation r(t) = x(t)i + y(t)j + z(t)k. y = y(t), atb Suppose f is a function of three variables that is continuous on some region containing C. Then, we define the line integral of f along C (with respect to arc length) in a manner similar to that for plane curves: n f (x, y, z) ds = lim C n f (x , yi , zi ) si i i=1 provided this limit exists and does not depend on the choice of the sample points (x , yi , zi ). i We evaluate line integrals in space using a formula similar to that for line integrals in plane: Formula for line integrals in space b f (x, y, z) ds = C a f (x(t), y(t), z(t)) dx dt 2 + dy dt 2 + dz dt 2 dt Similarly, we have the following formula for line integrals with respect to x, y and z respectively: Formula for line integrals in space b f (x, y, z) dx = C a b f (x(t), y(t), z(t))x (t) dt f (x(t), y(t), z(t))y (t) dt a b f (x, y, z) dy = C f (x, y, z) dz = C a f (x(t), y(t), z(t))z (t) dt Therefore, as with line integrals in plane, we evaluate integrals of the form P (x, y, z) dx + Q(x, y, z) dy + R(x, y, z) dz C by expressing x, y, z, dx, dy, dz in terms of the parameter t. Example 7. Evaluate y dx + z dy + x dz C where C consists of the line segment C1 from (2, 0, 0) to (3, 4, 5), followed by the vertical line segment C2 from (3, 4, 5) to (3, 4, 0). Solution. We can write C1 as r(t) = (1 - t) 2, 0, 0 + t 3, 4, 5 = 2 + t, 4t, 5t . So, a parametrization of C1 is x = 2 + t, y = 4t, z = 5t, 0 t 1. Since x (t) = 1, y (t) = 4, z (t) = 5, we have 1 y dx + z dy + x dz = C1 0 1 (4t + (5t)4 + (2 + t)5) dt (10 + 29t) dt 0 = = 24.5 Similarly, we can write C2 as w(t) = (1 - t) 3, 4, 5 + t 3, 4, 0 = 3, 4, 5 - 5t . So a parametrization of C2 is x = 3, y = 4, z = 5 - 5t, 0 t 1. such that x (t) = 0, y (t) = 0, z (t) - 5. So 1 y dx + z dy + x dz = C2 0 3(-5) dt = -15. Adding the values of these integrals, we obtain y dx + z dy + x dz = 24.5 - 15 = 9.5 C
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

National University of Singapore - MATH - 1104
MA1104 Multivariable Calculus Lecture 16Dr KU Cheng Yeaw Thursday March 19, 2009RecapLast Lecture . We introduced vector fields. An important examples is gradient vector field. We say that F is a conservative vector field if F is the gradient vector fi
National University of Singapore - MATH - 1104
MA1104 Multivariable Calculus Lecture 17Dr KU Cheng Yeaw Monday March 23, 2009RecapLast Lecture . we considered integral of a vector field. This type of line integrals appear frequently in physics. It turns out that the computation of this line integra
National University of Singapore - MATH - 1104
MA1104 Multivariable Calculus Lecture 18Dr KU Cheng Yeaw Thursday March 26, 2009RecapLast Lecture . we study Green's Theorem and see how to apply it to compute line integrals. Green's Theorem can be regarded as the counterpart of the Fundamental Theore
National University of Singapore - MATH - 1104
MA1104 Multivariable Calculus Lecture 19Dr KU Cheng Yeaw Monday March 30, 2009RecapLast lecture . we defined two operations (curl and divergence) that can be performed on vector fields. They have physical significance. We appreciate this physical inter
National University of Singapore - MATH - 1104
MA1104 Multivariable Calculus Lecture 20Dr KU Cheng Yeaw Thursday April 2, 2009RecapLast lecture . we defined the surface area of a general parametric surface we introduced surface integral of scalar field over a smooth curve. The main idea is to use p
National University of Singapore - MATH - 1104
MA1104 Multivariable Calculus Lecture 21Dr KU Cheng Yeaw Monday April 6, 2009RecapLast lecture . we defined surface integrals (flux) of vector fields F dS =S SF n dS. We can evaluate these integrals usingparametrization r(u, v) of the surface S we s
National University of Singapore - MATH - 1104
MA1104 Multivariable Calculus Lecture 22Dr KU Cheng Yeaw Thursday April 9, 2009RecapLast lecture . we proved the Divergence Theorem. we proved Stoke's TheoremOverviewIn this lecture . we shall see some examples using Stoke's Theorem.Stoke's Theorem
Punjab Engineering College - COMPUTER S - 2143
Ad Hoc Networks Model Analysis and Security IssuesGaurav BansalEmail: gauravb21@yahoo.comABSTRACT Wireless data networks present a more constraint communication environment compared to the wired networks. Because of fundamental limitations of power and
Punjab Engineering College - COMPUTER S - 2143
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 4, NO. 1, JUNE 200739A Probabilistic Approach for Managing Mobile Ad-Hoc NetworksRemi Badonnel, Radu State, Olivier FestorAbstract- A pure management approach where all the nodes are managed at
Punjab Engineering College - COMPUTER S - 2143
An Intrusion Detection Tool for AODV-based Ad hoc Wireless NetworksGiovanni Vigna Sumit Gwalani Kavitha Srinivasan Elizabeth M. Belding-Royer Richard A. Kemmerer Department of Computer Science University of California, Santa Barbara vigna,sumitg,kavitha,
Punjab Engineering College - COMPUTER S - 2143
International Journal of Security and Its Applications Vol. 2, No.3, July, 2008AN INTRUSION DETECTION SYSTEM IN MOBILE ADHOC NETWORKSS.Madhavi, Research Scholar, Dept of Computer, Science &amp; Engineering, Acharya Nagarjuna University, India. Dr. Tai Hoon
Punjab Engineering College - COMPUTER S - 2143
A Bayesian Game Approach for Intrusion Detection in Wireless Ad Hoc NetworksYu LiuDepartment of Electrical and Computer Engineering Stevens Institute of Technology Hoboken, NJ 07030, USACristina ComaniciuDepartment of Electrical and Computer Engineeri
Punjab Engineering College - COMPUTER S - 2143
Secure communication in cellular and ad hoc environmentsBharat Bhargava bb@cs.purdue.edu Department of Computer Sciences, Purdue University This is supported by Motorola Communication Research Lab &amp; National Science FoundationTeam at Motorola: Jeff Bont
Punjab Engineering College - COMPUTER S - 2143
International Journal of Network Security &amp; Its Applications (IJNSA), Vol 1, No 1, April 2009A NEW CLUSTER-BASED WORMHOLE INTRUSION DETECTION ALGORITHM FOR MOBILE AD-HOC NETWORKS11Debdutta Barman Roy, 2Rituparna Chaki, 3Nabendu Chakibarmanroy.debdutt
Punjab Engineering College - COMPUTER S - 2143
A Cooperative Intrusion Detection System for Ad Hoc NetworksYi-an HuangCollege of Computing Georgia Institute of TechnologyWenke LeeCollege of Computing Georgia Institute of Technologyyian@cc.gatech.edu ABSTRACTMobile ad hoc networking (MANET) has b
Punjab Engineering College - COMPUTER S - 2143
Detecting Critical Nodes for MANET Intrusion Detection SystemsA. Karygiannis, E. Antonakakis, and A. Apostolopoulos National Institute of Standards and Technology cfw_karygiannis, manos, aimilios@nist.gov AbstractAd hoc routing protocols have been desig
Punjab Engineering College - COMPUTER S - 2143
Feature Selection in Intrusion Detection System over Mobile Ad-hoc NetworkXia Wang, Tu-liang Lin, Johnny WongComputer Science Department Iowa State University Ames, Iowa 50010 cfw_jxiawang, tlin, wong@cs.iastate.eduAbstract As Mobile ad-hoc network (MA
Punjab Engineering College - COMPUTER S - 2143
A Ferry-based Intrusion Detection Scheme for Sparsely Connected Ad Hoc NetworksM. Chuah, P.Yang, J. Han cfw_chuah, pey204, jih206@cse.lehigh.edu Department of Computer Science &amp; Engineering Lehigh University Bethlehem, PA 18015 Abstract- Several intrusio
Punjab Engineering College - COMPUTER S - 2143
A Game Theoretic Formulation for Intrusion Detection in Mobile Ad Hoc NetworksAnimesh Patcha and Jung-Min ParkBradley Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg, VA 24061Abstract Nod
Punjab Engineering College - COMPUTER S - 2143
Enhanced Intrusion Detection Systems in Ad Hoc Networks using a Grid Based Agnostic MiddlewarePasquale DonadioAlcatel Lucent Italia VIA BOSCO PRIMO 84091 BATTIPAGLIA - ITALY +39 0828 398 694Antonio CimminoAlcatel Lucent Italia VIA BOSCO PRIMO 84091 BA
Punjab Engineering College - COMPUTER S - 2143
Mobile Networks and Applications ? (2003) 1161Intrusion Detection Techniques for Mobile Wireless NetworksYongguang ZhangHRL Laboratories LLC, Malibu, California E-mail: ygz@hrl.comWenke LeeCollege of Computing, Georgia Institute of Technology E-mail
Punjab Engineering College - COMPUTER S - 2143
Applying Intrusion Detection Systems to Wireless Sensor NetworksRodrigo Roman E.T.S. Ing. Informatica University of Malaga 29071, Malaga, Spain roman@lcc.uma.es Jianying Zhou Institute for Infocomm Research 21 Heng Mui Keng Terrace Singapore 119613 jyzho
Punjab Engineering College - COMPUTER S - 2143
TCS 2010Partial list of Accepted Research Papers Note:- Minimum one author must register for the conference along with DD. SL.No Paper ID Paper Title Authors Mathematics A New Approach to Solve The Tic-Tac-Toe 1.008 Game Radha Krishna Jana Manami Saha Pr
Punjab Engineering College - COMPUTER S - 2143
International J. of Engg. Research &amp; Indu. Appls. (IJERIA). ISSN 0974-1518, Vol.1, No. VII (2008), pp 129-140PACKET LOSS RECOVERY IN MOBILE AD-HOC NETWORK BY STREAM CONTROL CONGESTION ALGORITHMK. THIRUNADANA SIKAMANI, V. RAJAMANI AND R. MADHUSUDHANANAb
Punjab Engineering College - COMPUTER S - 2143
PERFORMANCE EVALUATION OF SCTP IN MOBILE AD HOC NETWORKS Ilknur AydinRenwei GePreethi NatarajanChien-Chung ShenDepartment of Computer and Information Sciences Department of Electrical and Computer Engineering University of Delaware cfw_aydin,ge,natara
Punjab Engineering College - COMPUTER S - 2143
To appear in the Proceedings of the 3rd International Conference on Pervasive Computing and Communications(PerCom 2005), Kauai Island, Hawaii.Secure Routing and Intrusion Detection in Ad Hoc NetworksAnand Patwardhan Jim Parker and Anupam JoshiUMBC, Bal
Punjab Engineering College - COMPUTER S - 2143
Security within Ad hoc NetworksPosition Paper, PAMPAS Workshop, Sept. 16/17 2002, London Author: Preetida Vinayakray-Jani preetida.vinayakray-jani@nokia.com Nokia Research Center, Helsinki, Finland 1. WHAT IS AD HOC NETWORK? With the advancement in radio
Punjab Engineering College - COMPUTER S - 2143
A security architecture for Mobile Ad Hoc NetworksShuyao Yu Youkun Zhang Chuck Song Kai ChenInstitute of Computing Technology, School of Software, Computer Network Information Bell Labs Computer Network Information Tsinghua University Center of Chinese
Punjab Engineering College - COMPUTER S - 2143
Intrusion Detection for Mobile Ad Hoc NetworksTom Chen SMU, Dept of Electrical Engineering tchen@engr.smu.edu http:/www.engr.smu.edu/~tchenTC/Rockwell/5-20-04 SMU Engineering p. 1Outline Security problems in MANETs Role of intrusion detection systems
Punjab Engineering College - COMPUTER S - 2143
TCP PERFORMANCE ANALYSIS FOR MOBILE AD HOC NETWORK USING ONDEMAND ROUTING PROTOCOLSK.Kathiravan B S Abdur Rehman Crescent Engineering College Vandalur, Chennai 48 Dr. S. Thamarai Selvi Professor MIT Chromepet Campus Anna University, Chennai 14 A.Selvam B
Punjab Engineering College - COMPUTER S - 2143
W IRELESS /M OBILE N ETWORK S ECURITY Y. Xiao, X. Shen, and D.-Z. Du (Eds.) pp. - c 2006 SpringerChapter 12 A Survey on Attacks and Countermeasures in Mobile Ad Hoc NetworksBing Wu, Jianmin Chen, Jie Wu, Mihaela CardeiDepartment of Computer Science and
Punjab Engineering College - COMPUTER S - 2143
Vulnerabilities of Intrusion Detection Systems in Mobile Ad-hoc Networks - The routing problemErnesto Jimnez Caballero Helsinki University of Technology erjica@gmail.comAbstractintrusion detection systems is one of the most active fields of research in
Punjab Engineering College - COMPUTER S - 2143
Wireless Attacks and DefenseBy: Dan SchadeApril 9, 2006Schade - 2As more and more home and business users adapt wireless technologies because of their ease of use and affordability, these devices are coming under attack by the malicious who are after
Punjab Engineering College - COMPUTER S - 2143
Zone-Based Intrusion Detection for Mobile Ad Hoc Networks*Bo Sun Dept. of Computer Science Texas A&amp;M University College Station TX 77843-3112 b0s6067@cs.tamu.edu Kui Wu Dept. of Computer Science University of Victoria BC, Canada V8W 3P6 wkui@cs.uvic.ca U
Punjab Engineering College - CS - 1313
COOPERATIVE CACHE MANAGEMENT IN MOBILE AD HOC NETWORKSNarottam Chand, R. C. Joshi and Manoj Misra Indian Institute of Technology Roorkee, India Email: cfw_narotdec, joshifcc, manojfec@iitr.ernet.inABSTRACT Caching of frequently accessed data in ad hoc n
Punjab Engineering College - CS - 1313
Cache Management of Dynamic Source Routing for Fault Tolerance in Mobile Ad Hoc NetworksChing-Hua Chuan and Sy-Yen Kuo Department of Electrical Engineering National Taiwan University Taipei, Taiwan Email: sykuo@cc.ee.ntu.edu.twAbstractMobile ad hoc net
Punjab Engineering College - CS - 1313
1694IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING,VOL. 19, NO. 12,DECEMBER 2007Semantic-Aware and QoS-Aware Image Caching in Ad Hoc NetworksBo Yang, Member, IEEE, and Ali R. Hurson, Senior Member, IEEEAbstract-Semantic caching was originally u
Punjab Engineering College - CS - 1313
IEEE TRANSACTIONS ON MOBILE COMPUTING,VOL. 7,NO. 3,MARCH 2008289Benefit-Based Data Caching in Ad Hoc NetworksBin Tang, Member, IEEE, Himanshu Gupta, Member, IEEE, and Samir R. Das, Member, IEEEAbstract-Data caching can significantly improve the eff
Punjab Engineering College - CS - 1313
2009 29th IEEE International Conference on Distributed Computing Systems WorkshopsOverhearing-aided Data Caching in Wireless Ad Hoc NetworksWeigang WuDepartment of Computer Science Sun Yat-sen University Guangzhou 510275, China wuweig@mail.sysu.edu.cn
Punjab Engineering College - CS - 1313
Contention-Aware Data Caching in Wireless Multihop Ad Hoc NetworksXiaopeng Fan, Jiannong CaoDepartment of Computing Hong Kong Polytechnic University Kowloon, Hong Kong cfw_csxpfan, csjcao@comp.polyu.edu.hkWeigangWuDepartment of Computer Science Sun Va
Punjab Engineering College - CS - 1313
Cooperative Data Caching with Prefetching in Mobile Ad-Hoc NetworksNaveen Chauhan*, L.K. Awasthi and Narottam Chand Department of Computer Sc. &amp; Engineering National Institute of Technology, Hamirpur -177005 *Email: naveen@nitham.ac.inAbstract- This pap
Punjab Engineering College - CS - 1313
Node Caching Enhancement of Reactive Ad Hoc Routing ProtocolsSunsook Jung, Nisar Hundewale, Alex ZelikovskyAbstract- Enhancing route request broadcasting protocols constitutes a substantial part of recent research in mobile adhoc network (MANET) routing
Punjab Engineering College - CS - 1313
On optimal cooperative route caching in large, memory-limited wireless ad hoc networksTheodoros Salonidis and Leandros Tassiulas, Department of Electrical and Computer Engineering University of Maryland, College Park, MD, USA Department of Computer and C
Punjab Engineering College - CS - 1313
Cache Based Energy Efficient Strategies in Mobile Ad Hoc NetworksKMwrugan' S Balaji* P Siasanka? and S.Sbanmugavel' . . 'Rummujm ComputirPg Centre, Anna Univm'Q, C h m d - 600 025, LNDIA EMail: mnrug@nnnuniv.erh, Telephone: 91.- 44 - 22203133ABSTRACTAn
Punjab Engineering College - CS - 1313
(IJCSIS) International Journal of Computer Science and Information Security, Vol. 1, No. 1, May 2009A Full Image of the Wormhole Attacks Towards Introducing Complex Wormhole Attacks in wireless Ad Hoc NetworksMarianne Azer Computer Dept. National Teleco
Punjab Engineering College - CS - 1313
Defending against Wormhole Attacks in Mobile Ad Hoc NetworksWeichao Wang Bharat Bhargava Yi Lu Xiaoxin Wu wangwc, bb, yilu, wu @cs.purdue.edu Department of Computer Sciences, Purdue University, W. Lafayette, Indiana In ad hoc networks, malicious nodes
Punjab Engineering College - CS - 1313
International Journal of Network Security &amp; Its Applications (IJNSA), Vol 1, No 1, April 2009A NEW CLUSTER-BASED WORMHOLE INTRUSION DETECTION ALGORITHM FOR MOBILE AD-HOC NETWORKS11Debdutta Barman Roy, 2Rituparna Chaki, 3Nabendu Chakibarmanroy.debdutt
Punjab Engineering College - CS - 1313
The Third International Conference on Availability, Reliability and SecurityIntrusion Detection for Wormhole Attacks in Ad hoc Networks a Survey and a Proposed Decentralized SchemeMarianne A. Azer Sherif M. El-Kassas Abdel Wahab F. Hassan Professor, Fac
Punjab Engineering College - CS - 1313
2009 Third International Conference on Network and System SecurityDeWorm: A Simple Protocol to Detect Wormhole Attacks in Wireless Ad hoc NetworksThaier HayajnehUniversity of Pittsburgh Pittsburgh, PA, USA Email: hayajneh@sis.pitt.eduPrashant Krishnam
Punjab Engineering College - CS - 1313
Using Directional Antennas to Prevent Wormhole AttacksLingxuan Hu David Evans Department of Computer Science University of Virginia Charlottesville, VA [lingxuan, evans]@cs.virginia.edu AbstractWormhole attacks enable an attacker with limited resources
Punjab Engineering College - CS - 1313
An End-to-end Detection of Wormhole Attack in Wireless Ad-hoc NetworksXia Wang, Johnny Wong Department of Computer Science Iowa State University Ames, Iowa 5001 1 cfw_jxiawang, wong @cs.iastate.eduAbstractWormhole attack is a severe attack in wireless
Punjab Engineering College - CS - 1313
The Second International Conference on Emerging Security Information, Systems and TechnologiesFEEPVR: First End-to-End protocol to Secure Ad hoc Networks with variable ranges against Wormhole AttacksSandhya Khurana Department of Computer Science, Univer
Punjab Engineering College - CS - 1313
Preventing Wormhole Attacks on Wireless Ad Hoc Networks: A Graph Theoretic ApproachL. Lazos1 , R. Poovendran1 , C. Meadows2 , P. Syverson2 , L. W. Chang2 1 University of Washington, Seattle, Washington, 2 Naval Research Laboratory, Washington, DC Email:
Punjab Engineering College - CS - 1313
Comparison between DSR and AODV DSR Overview AODV Overview Similarity Difference ConsequenceDSR Overview Source routing: routes are stored in a route cache, data packets carry the source route in the packet header Route discoveryt tCondition: a node
Punjab Engineering College - CS - 1313
2008 International Conference on Information Security and AssuranceAn Approach to Mitigate Wormhole Attack in Wireless Ad Hoc NetworksGunhee Lee, Dong-kyoo Kim Ajou University San 5, Wonchon, Suwon 443-749, Korea cfw_icezzoco, dkkim@ajou.ac.kr Abstract
Punjab Engineering College - CS - 1313
International Conference on Computational Sciences and Its Applications ICCSA 2008Minimizing the Intrusion Detection Modules in Wireless Sensor NetworksTran Hoang Hai, Eui-Nam Huh Internet Computing and Security Laboratory, Department of Computer Engine
Punjab Engineering College - CS - 1313
2009 29th IEEE International Conference on Distributed Computing Systems WorkshopsOverhearing-aided Data Caching in Wireless Ad Hoc NetworksWeigang WuDepartment of Computer Science Sun Yat-sen University Guangzhou 510275, China wuweig@mail.sysu.edu.cn
Punjab Engineering College - CS - 1313
Ad Hoc Networking with AODVCharles E. Perkins Nokia Research Center Mountain View, CA USA http:/people.nokia.net/charliep charliep@iprg.nokia.com1 NOKIAFILENAMs.PPT/ DATE / NNOutline of Presentation Ad Hoc Networks in general AODV in particular Rece
Punjab Engineering College - CS - 1313
The Fourth International Conference on Wireless and Mobile CommunicationsSEEEP: Simple and Efficient End-to-End protocol to Secure Ad hoc Networks against Wormhole AttacksNeelima Gupta Department of Computer Science, University of Delhi ngupta@cs.du.ac.
Punjab Engineering College - CS - 1313
Wormhole Attacks Detection in Wireless Ad Hoc Networks: A Statistical Analysis ApproachNing Song and Lijun QianDepartment of Electrical Engineering Prairie View A&amp;M University Prairie View, Texas 77446 Email: NSong, Lijun Qian@pvamu.eduAbstract- Variou
Punjab Engineering College - CS - 1313
2009 Fourth International Conference on Systems and Networks CommunicationsImmuning Routing Protocols from the Wormhole Attackin Wireless Ad Hoc NetworksMarianne A. AzerComputer Dept. National Telecommunication Institute Cairo, Egypt mazer@nti.sci.eg