Wireless communications and networking

Wireless communications and networking Wireless communications and networking Wireless communications and networking Wireless communications and networking Wireless communications and networking Wireless communications and networking Wireless communications and networking Wireless communications and networking Wireless communications and networking

WIRELESS COMMUNICATIONS AND NETWORKING The Morgan Kaufmann Series in Networking Series Editor, David Clark, M.I.T Wireless Communications and Networking Vijay K Garg Ethernet Networking for the Small Office and Professional Home Office Jan L Harrington Network Analysis, Architecture, and Design, 3e James D McCabe IPv6 Advanced Protocols Implementation Qing Li, Tatuya Jinmei, and Keiichi Shima Computer Networks: A Systems Approach, 4e Larry L Peterson and Bruce S Davie Network Routing: Algorithms, Protocols, and Architectures Deepankar Medhi and Karthikeyan Ramaswami Deploying IP and MPLS QoS for Multiservice Networks: Theory and Practice John Evans and Clarence Filsfils Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks Gerald R Ash IPv6 Core Protocols Implementation Qing Li, Tatuya Jinmei, and Keiichi Shima Smart Phone and Next-Generation Mobile Computing Pei Zheng and Lionel Ni GMPLS: Architecture and Applications Adrian Farrel and Igor Bryskin Network Security: A Practical Approach Jan L Harrington Content Networking: Architecture, Protocols, and Practice Markus Hofmann and Leland R Beaumont Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices George Varghese Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS Jean Philippe Vasseur, Mario Pickavet, and Piet Demeester Routing, Flow, and Capacity Design in Communication and Computer Networks Michał Pióro and Deepankar Medhi Wireless Sensor Networks: An Information Processing Approach Feng Zhao and Leonidas Guibas Communication Networking: An Analytical Approach Anurag Kumar, D Manjunath, and Joy Kuri The Internet and Its Protocols: A Comparative Approach Adrian Farrel Modern Cable Television Technology: Video, Voice, and Data Communications, 2e Walter Ciciora, James Farmer, David Large, and Michael Adams Bluetooth Application Programming with the Java APIs C Bala Kumar, Paul J Kline, and Timothy J Thompson Policy-Based Network Management: Solutions for the Next Generation John Strassner MPLS Network Management: MIBs, Tools, and Techniques Thomas D Nadeau Developing IP-Based Services: Solutions for Service Providers and Vendors Monique Morrow and Kateel Vijayananda Telecommunications Law in the Internet Age Sharon K Black Optical Networks: A Practical Perspective, 2e Rajiv Ramaswami and Kumar N Sivarajan Internet QoS: Architectures and Mechanisms Zheng Wang TCP/IP Sockets in Java: Practical Guide for Programmers Michael J Donahoo and Kenneth L Calvert TCP/IP Sockets in C: Practical Guide for Programmers Kenneth L Calvert and Michael J Donahoo Multicast Communication: Protocols, Programming, and Applications Ralph Wittmann and Martina Zitterbart MPLS: Technology and Applications Bruce Davie and Yakov Rekhter High-Performance Communication Networks, 2e Jean Walrand and Pravin Varaiya Internetworking Multimedia Jon Crowcroft, Mark Handley, and Ian Wakeman Understanding Networked Applications: A First Course David G Messerschmitt Integrated Management of Networked Systems: Concepts, Architectures, and their Operational Application Heinz-Gerd Hegering, Sebastian Abeck, and Bernhard Neumair Virtual Private Networks: Making the Right Connection Dennis Fowler Networked Applications: A Guide to the New Computing Infrastructure David G Messerschmitt Wide Area Network Design: Concepts and Tools for Optimization Robert S Cahn For further information on these books and for a list of forthcoming titles, please visit our Web site at http://www.mkp.com WIRELESS COMMUNICATIONS AND NETWORKING Vijay K Garg Amsterdam • Boston • Heidelberg London • New York Oxford Paris • San Diego • San Francisco Singapore • Sydney • Tokyo Morgan Kaufmann is an imprint of Elsevier Senior Acquisitions Editor Publishing Services Manager Senior Project Manager Associate Editor Editorial Assistant Cover Design Composition Illustration Copyeditor Proofreader Indexer Interior printer Cover printer Rick Adams George Morrison Brandy Lilly Rachel Roumeliotis Brian Randall Alisa Andreola diacriTech diacriTech Janet Cocker Janet Cocker Distributech Scientific Indexing Sheridan Books Phoenix Color Morgan Kaufmann Publishers is an imprint of Elsevier 500 Sansome Street, Suite 400, San Francisco, CA 94111 This book is printed on acid-free paper © 2007 by Elsevier Inc All rights reserved Designations used by companies to distinguish their products are often claimed as trademarks or registered trademarks In all instances in which Morgan Kaufmann Publishers is aware of a claim, the product names appear in initial capital or all capital letters Readers, however, should contact the appropriate companies for more complete information regarding trademarks and registration No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means—electronic, mechanical, photocopying, scanning, or otherwise—without prior written permission of the publisher Permissions may be sought directly from Elsevier’s Science & Technology Rights Department in Oxford, UK: phone: (ϩ44) 1865 843830, fax: (ϩ44) 1865 853333, E-mail: permissions@elsevier.com You may also complete your request on-line via the Elsevier homepage (http://elsevier.com), by selecting “Support & Contact” then “Copyright and Permission” and then “Obtaining Permissions.” Library of Congress Cataloging-in-Publication Data Garg, Vijay Kumar, 1938Wireless communications and networking / Vijay K Garg.–1st ed p cm Includes bibliographical references and index ISBN-13: 978-0-12-373580-5 (casebound : alk paper) ISBN-10: 0-12-373580-7 (casebound : alk paper) Wireless communication systems Wireless LANs I Title TK5103.2.G374 2007 621.382’1–dc22 2006100601 ISBN: 978-0-12-373580-5 For information on all Morgan Kaufmann publications, visit our Web site at www.mkp.com or www.books.elsevier.com Printed in the United States of America 07 08 09 10 11 Working together to grow libraries in developing countries www.elsevier.com | www.bookaid.org | www.sabre.org The book is dedicated to my grandchildren — Adam, Devin, Dilan, Nevin, Monica, Renu, and Mollie This page intentionally left blank Contents About the Author Preface An Overview of Wireless Systems xxiii xxv 1.1 Introduction 1.2 First- and Second-Generation Cellular Systems 1.3 Cellular Communications from 1G to 3G 1.4 Road Map for Higher Data Rate Capability in 3G 1.5 Wireless 4G Systems 14 1.6 Future Wireless Networks 15 1.7 Standardization Activities for Cellular Systems 17 1.8 Summary 19 Problems 20 References 20 Teletraffic Engineering 23 2.1 Introduction 23 2.2 Service Level 23 2.3 Traffic Usage 24 2.4 Traffic Measurement Units 25 2.5 Call Capacity 30 2.6 Definitions of Terms 32 2.7 Data Collection 36 2.8 Office Engineering Considerations 36 2.9 Traffic Types 38 2.10 Blocking Formulas 39 2.10.1 Erlang B Formula 40 2.10.2 Poisson’s Formula 41 2.10.3 Erlang C Formula 41 2.10.4 Comparison of Erlang B and Poisson’s Formulas 42 2.10.5 Binomial Formula 42 vii viii Contents 2.11 Summary 43 Problems 44 References 45 Radio Propagation and Propagation Path-Loss Models 47 3.1 Introduction 3.2 Free-Space Attenuation 48 3.3 Attenuation over Reflecting Surface 50 3.4 Effect of Earth’s Curvature 53 3.5 Radio Wave Propagation 54 Characteristics of Wireless Channel 58 3.6 3.6.1 3.7 Multipath Delay Spread, Coherence Bandwidth, and Coherence Time 47 60 Signal Fading Statistics 62 3.7.1 Rician Distribution 63 3.7.2 Rayleigh Distribution 64 3.7.3 Lognormal Distribution 64 3.8 Level Crossing Rate and Average Fade Duration 65 3.9 Propagation Path-Loss Models 66 3.9.1 Okumura/Hata Model 67 3.9.2 Cost 231 Model 68 3.9.3 IMT-2000 Models 72 3.10 Indoor Path-Loss Models 75 3.11 Fade Margin 76 3.12 Link Margin 79 3.13 Summary 81 Problems 82 References 83 An Overview of Digital Communication and Transmission 85 4.1 Introduction 85 4.2 Baseband Systems 87 4.3 Messages, Characters, and Symbols 87 4.4 Sampling Process 88 4.4.1 Aliasing 91 4.4.2 Quantization 93 Contents ix 4.4.3 Sources of Error 94 4.4.4 Uniform Quantization 95 4.5 Voice Communication 97 4.6 Pulse Amplitude Modulation (PAM) 4.7 Pulse Code Modulation 100 4.8 Shannon Limit 102 4.9 Modulation 103 98 4.10 Performance Parameters of Coding and Modulation Scheme 105 4.11 Power Limited and Bandwidth-Limited Channel 108 4.12 Nyquist Bandwidth 109 4.13 OSI Model 112 4.13.1 OSI Upper Layers 112 4.14 Data Communication Services 113 4.15 Multiplexing 115 4.16 Transmission Media 116 4.17 Transmission Impairments 118 4.17.1 Attenuation Distortion 118 4.17.2 Phase Distortion 118 4.17.3 Level 118 4.17.4 Noise and SNR 119 4.18 Summary 120 Problems 121 References 121 Fundamentals of Cellular Communications 123 5.1 Introduction 123 5.2 Cellular Systems 123 5.3 Hexagonal Cell Geometry 125 5.4 Cochannel Interference Ratio 131 5.5 Cellular System Design in Worst-Case Scenario with an Omnidirectional Antenna 134 5.6 Cochannel Interference Reduction 136 5.7 Directional Antennas in Seven-Cell Reuse Pattern 137 5.7.1 Three-Sector Case 137 5.7.2 Six-Sector Case 138 5.8 Cell Splitting 141 D-2 Appendix D Spreading Codes Used in CDMA Equation D.2 implies that for all time offsets other than zero, each spreading code is orthogonal to itself The orthogonality conditions in Equations D.1 and D.2 mean that different user signals can be separated at the receiver, even though they use the same frequency channel and the same period Walsh codes are generated using the Hadamard matrix with H1 ϭ [0], where H1 is a ϫ matrix and is an order The Hadamard matrix is built by H2n ϭ ΄H ᎏ H ΅ Hn Hn n (D.3) n For example, the Hadamard matrix of order and will be: H2 ϭ ΄ 0 ΅ and 01 ΄ ΅ 0000 H4 ϭ 1 0011 0110 From the corresponding Hadamard matrix, the Walsh codes are given by the rows We usually map the binary data to polar form so we can use real number arithmetic when computing correlations So 0s are mapped to 1s and 1s are mapped to Ϫ1s This means the kth row of the H(n) Hadamard matrix is (see below for examples): H(0) ϭ W(0, 0) ϭ H(2) ϭ ΄ 1 Ϫ1 ΅ W(0, 2) ϭ 1, W(1, 2) ϭ 1, Ϫ1 ΄ 1 1 H4 ϭ Ϫ1 Ϫ1 1 Ϫ1 Ϫ1 Ϫ1 Ϫ1 ΅ W(0, 4) ϭ 1, 1, 1, W(1, 4) ϭ 1, Ϫ1, 1, Ϫ1 W(2, 4) ϭ 1, 1, Ϫ1, Ϫ1 W(3, 4) ϭ 1, Ϫ1, Ϫ1, Appendix D Spreading Codes Used in CDMA D-3 W(0, 8) W(0, 4) W(0, 2) W(1, 4) W(0, 0) W(2, 4) W(1, 2) W(3, 4) Figure D.1 OVSF tree The basic set of Walsh codes is the set of four patterns –– 0000, 0101, 0011, 0110 When the Walsh codes modulate the transmitter, bi-phase shift keying is used Thus, represents 0° phase shift and represents 180° phase shift The 64 orthogonal Walsh codes provide the basis for the CDMA modulation used in IS-95 Walsh codes form the basis for variable spreading codes with different spreading factors This property becomes useful when we want signals with different spreading factors to share the same frequency channel (such as in 3G systems) The codes that possess this property are called orthogonal variable spreading factors (OVSF) To construct such codes, it is better to use a different approach than matrix manipulation Using a tree structure allows better visualization of the relation between different code lengths and the orthogonality between them (see Figure D.1) For example, let’s examine the codeword denoted W(1, 2) and the codeword denoted W(2, 4) to see if they are orthogonal Since they are of different lengths, we repeat W(1, 2) to match the length of W(2, 4) Hence, we get the following two code words in polar form: W(1, 2) → ΄ Ϫ1 W(2, 4) → ΄ 1 Ϫ1 ΅ Ϫ1 Ϫ1 ΅ Computing the orthogonality, we get (1 ϫ 1) ϩ (Ϫ1 ϫ 1) ϩ (1 ϫ Ϫ1) ϩ (Ϫ1 ϫ Ϫ1) ϭ Ϫ Ϫ ϩ ϭ Hence, W(1, 2) and W(2, 4) are orthogonal The autocorrelation function of Walsh codes does not have good characteristics It can have more than one peak, and therefore it is not possible for a receiver to detect the beginning of the code word without an external synchronization scheme The cross-correlation can also be non-zero for a number of time shifts and unsynchronized users can interfere with each other This is why Walsh codes can only be used in D-4 Appendix D Spreading Codes Used in CDMA synchronous CDMA systems Walsh codes not have the best spreading behavior They not spread data as well as pseudo-noise (PN) sequences because their power spectral density is concentrated in small numbers of discrete frequencies D.2 PN Sequences As mentioned in Section D.1, the Walsh codes provide good orthogonality properties when they are aligned in time Their orthogonality may suffer when they are not aligned in time Ideally, we would like to have sequences that are orthogonal for all time shifts However, in practice the sequences that are approximately orthogonal are achievable One class of sequences that satisfies this condition is the class of PN sequences Various pseudorandom codes are generated using linear feedback shift register (LFSR) The generator polynomial governs all the characteristics of the generator The feedback generator uses only the output bit to add several stages of shift register This is desirable for high speed hardware implementation as well as software implementation Shift-register sequences having the maximum possible period for an n-shift register are called maximal length sequences or m-sequences A primitive generator polynomial always yields an m-sequence The maximum period of an n-stage shift register is T ϭ 2n Ϫ The m-sequences have three important properties (balance property, run-length property, and shiftand-add property), which are formulated as follows: T ku ϭ T iuT ju, where u is an m-sequence By combining two shifts of this sequence (relative shift i and j) we obtain the same m-sequence, yet with another relative shift The periodic autocorrelation function Ra(k) is two-valued and is given by: Ra(k) ϭ where: I ϭ an integer T ϭ period of m-sequence ΆϪ 1 T ᎏ k ϭ IT k IT The cross-correlation of m-sequences is not as well behaved as autocorrelation An m-sequence generating system with four shift registers is shown in Figure D.2 This can be expressed using the recursive relation: ϩ X1 Figure D.2 X2 X3 4-Stage shift register for generating m-sequences X4 Appendix D Spreading Codes Used in CDMA D-5 X1(i ϩ 1) ϭ X3(i) ϩ X4(i) (D.4) where i ϭ 0, 1, 2, … Because m-sequences are periodic and shift registers cycle through every binary value (with the exception of a zero vector), registers can be initialized to any state, with the exception of the zero vector m-sequences are inexpensive to implement in hardware or software, and relatively low-order feedback shift registers can generate long sequences A sequence generated using 20 shift registers is 220 Ϫ samples long The number of m-sequences that can be generated by an n linear shift-register generator is given as: k P Ϫ1 Pi i Ϫ1͟ Np(n) ϭ ᎏ ᎏ n n iϭ1 (D.5) where: Np(n) ϭ number of PN sequences n ϭ number of shift registers in a generator Pi ϭ prime decomposition of 2n Ϫ In Table D.1, feedback connections (even numbers) are given for m-sequences generated with a linear shift register generator (without image set) For every set [n, k, …, p] feedback taps listed in Table D.1, there exists an image set (reverse set) of feedback taps [n, n Ϫ k, …, n Ϫ p] that generates an identical sequence reversed in time Table D.1 Feedback connections for m-sequences n T ϭ 2n Ϫ [2, 1] [3, 1] 15 [4, 1] 31 [5, 3]; [5, 4, 3, 2]; [5, 4, 2, 1] 6 63 [6, 1]; [6, 5, 2, 1]; [6, 5, 3, 2] 127 [7, 6, 4, 2]; [7, 6, 3, 1]; [7, 6, 5, 2]; [7, 6, 5, 4, 2, 1]; [7, 5, 4, 3, 2, 1] 18 255 [8, 4, 3, 2]; [8, 6, 5, 3]; [8, 6, 5, 2]; [8, 5, 3, 1]; [8, 6, 5, 1]; [8, 7, 6, 1]; [8, 7, 6, 5, 2, 1]; [8, 6, 4, 3, 2, 1] 16 Feedback taps for m-sequences No of msequences D-6 Appendix D Spreading Codes Used in CDMA Example D.1 Using the shift register shown in Figure D.3, generate an m-sequence (Table D.2) and demonstrate its properties Sketch the autocorrelation function The generated m-sequence has been plotted in Figure D.4 ϩ X1 Figure D.3 X2 X3 3-stage shift register for generating first m-sequence Table D.2 First m -sequence using 3-stage shift register X1 X2 X3 Output Initial Stage 0 1 Shift 1 0 Shift 0 Shift 1 Shift 1 0 Shift 1 1 Shift 1 Shift 0 1 TC Time Ϫ1 T Figure D.4 T 7-chip first m-sequence T Appendix D Spreading Codes Used in CDMA D-7 The properties of m-sequence in Figure D.4 are: • • • • Number of Ϫ1s ϭ 4; number of 1s ϭ Run length ϭ Run length ϭ Run length ϭ Example D.2 Since two m-sequences can be generated by the 3-stage shift register (see Table D.3), what is the location of the modulo-2 adder for the second m-sequence? Generate the second m-sequence Solution The location of modulo-2 adder for the second m-sequence is shown in Figure D.5 Properties of m-sequence in Figure D.6 are: • Number of Ϫ1s ϭ 4; number of 1s ϭ • Run length ϭ • Run length ϭ • Run length ϭ The autocorrelation for this m-sequence will be as shown in Figure D.7 Table D.3 Second m-sequence using 3-stage shift register X1 X2 X3 Output Initial State 0 1 Shift 1 0 Shift 1 0 Shift 1 1 Shift 1 Shift 1 Shift 0 Shift 0 1 ϩ X1 Figure D.5 X2 X3 3-stage shift register for generating second m-sequence D-8 Appendix D Spreading Codes Used in CDMA Time Ϫ1 T Figure D.6 T T 7-chip second m-sequence ϩ1 Ϫ1/7 Figure D.7 Autocorrelation for m-sequence m-sequence (t = 0) ϩ Gold sequence (k) m-sequence (t = kT ) Figure D.8 D.3 Generation of Gold sequence Gold Codes The family of PN sequences, called Gold sequences, are particularly popular for nonorthogonal CDMA systems Gold sequences have only three cross-correlation peaks, which tends to get less important as the length of the code increases Gold codes are constructed from a modulo-2 addition of two maximum length sequences The code sequences are added chip by chip by synchronous clocking Because the m-sequences are of the same length, the two code generators maintain the same phase relationship, and the codes generated (see Figure D.8) are of the same length as the two base codes, which are added together, but nonmaximal Appendix D Spreading Codes Used in CDMA D-9 Table D.4 Preferred m-sequences normalized cross-correlations n Period (T) Normalized 3-value cross-correlations Odd 2n Ϫ Ϫ1/T, Ϫ[2(nϩ1)/2 ϩ 1]/T, [2(nϩ1)/2 Ϫ 1]/T Even 2n Ϫ1 Ϫ1/T, Ϫ[2(nϩ2)/2 ϩ 1]/T, [2(nϩ2)/2 Ϫ 1]/T (so the autocorrelation function will be worse than that of m-sequences) Every change in phase position between two generated m-sequences causes a new sequence to be generated In addition to their advantage in generating large numbers of codes, the Gold codes may be selected so that over a set of codes available from a given generator the autocorrelation and cross-correlation between the codes is uniform and bounded When specially selected m-sequences, called preferred m-sequences, are used, the generated Gold codes have a three-valued cross-correlation Preferred m-sequences are pairs of m-sequences with specific three-valued cross-correlation (see Table D.4) Preferred pairs for shift-register with a length equal to I, where I is an integer, not exist Gold codes will permit multiple access on the channel With two m-sequences alone, we can generate 2n ϩ Gold codes (a combination with 2n Ϫ different shift positions and sequences) The use of Gold codes permits the transmission to be asynchronous The receiver can synchronize using the autocorrelation property of the Gold code The following are the properties of Gold codes: • Period T equal to m-sequence • Three-valued cross-correlation function with values are {Ϫ1, t(n), Ϫt(n) Ϫ 2}, where: ΄2 (nϩ1)/2 t(n) ϭ 2(nϩ2)/2 ϩ ϩ1 for odd n for even n References Dinan, E., and Jabbari, B Spreading codes for direct sequence CDMA and wideband CDMA cellular networks IEEE Communications Magazine, October 1996, pp 124–136 Dixon, R C Spread Spectrum Systems with Commercial Applications John Wiley & Sons, Inc., 1994 Gold, R Optimal binary sequences for spread spectrum multiplexing IEEE Transactions on Information Theory, October 1967, pp 619–621 Holmes, J K Coherent Spread Spectrum Systems John Wiley & Sons, 1982 Proakis, J G Communication Systems Engineering Prentice-Hall, 1994 D-10 Appendix D Spreading Codes Used in CDMA Simon, M K Spread Spectrum Communications Handbook McGraw-Hill Inc., 1994 Sklar, B Digital Communications Prentice-Hall, 1988 Tachikawa, S.-T Recent spreading codes for spread spectrum communication systems Electronic and Communications in Japan, Part I, vol 75, no 6, 1992, pp 41–49 Viterbi, A CDMA Principles of Spread Spectrum Communication Reading, MA: AddisonWesley, 1995 APPENDIX E Power Units E.1 Power Units In this appendix we explain the difference between dBm and dB Power (P) in milliwatts (mW) can be expressed as: P(mW) 1mW P(mW) ϭ ᎏ (E.1) The power (P) in terms of dBm will be: P(dBm) ϭ 10log[P(mW)] Ϫ 10log(1mW) ϭ 10log[P(mW)] (E.2) In other words, the power in dBm is an absolute measure of the power in mW For example, 100 mW of power is 20 dBm, W of power is dBW or 30 dBm, and 1␮W is Ϫ30 dBm The unit dB is the ratio of two powers in identical units For example, if the average signal power (P) is 10,000 mW and average noise power (N) is 100 mW, then we can express signal-to-noise ratio (SNR) as: Signal power (mW) Noise power (mw) SNR ϭ ᎏᎏ (E.3) SNR(dB) ϭ 10log[P(mW)] Ϫ 10log[N(mW)] ϭ 40 Ϫ 20 ϭ 20 (E.4) or Thus, the SNR in dB provides information on how strong or how weak the signal is relative to the noise In the example, the signal power is 100 times stronger than noise power, since dB expresses the ratio and therefore is not a measure of the absolute power Because of this reason, we can write: Transmit Power(dBm) ϭ Received power (dBm) ϩ Path loss (dBm) (E.5) E-1 This page intentionally left blank Index ARQ, see Automatic repeat request Authentication, thirdgeneration wireless widearea network/wireless local area network interworking, 22-20–22-22 Automatic repeat request, 23-14 Basic service set, definition, 22-9 Bell Labs Layered Space Time architecture, 23-16 implementation, 23-17–23-18 model, 23-15, 23-17 receiver, 23-15 transmitter, 23-15 BER, see Bit-error-rate Bit-error-rate, 23-14 BLAST, see Bell Labs Layered Space Time Cognitive ratio, 23-20–23-21 CR, see Cognitive ratio Emulator approach, thirdgeneration wireless wide-area network/wireless local area network interworking, 22-4–22-5 Fourth generation systems applications, 23-7 Bell Labs Layered Space Time, 23-15–23-18 challenges and solutions, 23-6 cognitive ratio, 23-20–23-21 features, 23-3, 23-5 multicarrier modulation, 23-7, 23-9–23-10 objectives, 23-2–23-4 overview, 23-1–23-2 smart antenna techniques, 23-10–23-15 software-defined ratio, 23-18–23-20 third generation system comparison, 23-3 Gateway approach, thirdgeneration wireless wide-area network/wireless local area network interworking, 22-3 General packet radio service, wireless local area network coupling general packet radio service interworking function/ receiver address identity discovery, 22-15 loose coupling authentication, 22-20–22-22 interfaces, 22-17–22-19 session mobility, 22-26 3GPP-based charging, 22-23–22-26 user data routing and access to services, 22-23 overview, 22-8–22-9 tight coupling overview, 22-9–22-12 protocol stack, 22-12–22-13 WLAN adaptation function, 22-13–22-15 General packet radio service interworking function, discovery with receiver address identity discovery, 22-15 HLR, see Home location register Home location register, general packet radio service-wireless local area network coupling, 22-20–22-21 IEEE, see Institute of Electrical and Electronic Engineers Institute of Electrical and Electronic Engineers, local multipoint distribution service IEEE 802-16 standards, 22-28–22-29 LMDS, see Local multipoint distribution service Local multipoint distribution service applications, 22-28 IEEE 802-16 standards, 22-28–22-29 multichannel multipoint distribution system comparison, 22-31 overview, 22-26–22-27 MCM, see Multicarrier modulation MIMO, see Multiple-input multiple-output MISO, see Multiple-input singleoutput MMDS, see Multichannel multipoint distribution system GIF, see General packet radio service interworking function Mobile Internet protocol, third-generation wireless wide-area network/wireless local area network interworking, 22-3 GPRS, see General packet radio service Multicarrier modulation, 23-7, 23-9–23-10 I-1 Index Multichannel multipoint distribution system architecture, 22-29–22-30 local multipoint distribution service comparison, 22-31 Multiple-input multiple-output orthogonal frequency division multiplexing combination, 23-14 overview, 23-10–23-14 Multiple-input single-output, 23-13 OFDM, see Orthogonal frequency division multiplexing Orthogonal frequency division multiplexing multicarrier modulation, 23-9–23-10 multiple-input multiple-output combination, 23-14 RAI, see Receiver address identity Receiver address identity, general packet radio service interworking function/receiver address identity discovery in general packet radio service/wireless local area network coupling, 22-15 SDR, see Software-defined ratio Signal-to-noise ratio multicarrier modulation, 23-9 smart antenna techniques, 23-13 SIMO, see Single-input multipleoutput Single-input multiple-output, 23-13 Single-input single-output, 23-11 SISO, see Single-input singleoutput I-2 SNR, see Signal-to-noise ratio Software-defined ratio, 23-18–23-20 Transmission control protocol, fourth generation systems, 23-14 TCP, see Transmission control protocol Third generation system fourth generation system comparison, 23-3 wireless local area network interworking emulator approach, 22-4–22-5 gateway approach, 22-3 general packet radio service coupling overview, 22-8–22-9 general packet radio service interworking function/ receiver address identity discovery, 22-15 local multipoint distribution service, 22-26–22-29 loose coupling authentication, 22-20– 22-22 interfaces, 22-17–22-19 session mobility, 22-26 3GPP-based charging, 2223–22-26 user data routing and access to services, 22-23 mobile Internet protocol approach, 22-3 multichannel multipoint distribution system, 22-29–22-31 objectives, 22-2 overview, 22-1–22-2 requirements, 22-2 session mobility, 22-7–22-8 tight coupling overview, 22-9–22-12 protocol stack, 22-12– 22-13 WLAN adaptation function, 22-13–22-15 Wireless local area network architecture, 22-5, 22-7 range, 22-1 third-generation wireless wide-area network interworking emulator approach, 22-4– 22-5 gateway approach, 22-3 general packet radio service coupling overview, 228–22-9 general packet radio service interworking function/ receiver address identity discovery, 22-15 local multipoint distribution service, 22-26–22-29 loose coupling authentication, 22-20– 22-22 interfaces, 22-17–22-19 session mobility, 22-26 3GPP-based charging, 22-23–22-26 user data routing and access to services, 22-23 mobile Internet protocol approach, 22-3 multichannel multipoint distribution system, 2229–22-31 objectives, 22-2 overview, 22-1–22-2 requirements, 22-2 session mobility, 22-7–22-8 tight coupling overview, 22-9–22-12 protocol stack, 22-12– 22-13 WLAN adaptation function, 22-13–22-15 I-3 Index Wireless wide-area network fourth generation systems, see Fourth generation systems wireless local area network interworking emulator approach, 22-4– 22-5 gateway approach, 22-3 general packet radio service coupling overview, 228–22-9 general packet radio service interworking function/ receiver address identity discovery, 22-15 local multipoint distribution service, 22-26–22-29 loose coupling authentication, 22-20– 22-22 interfaces, 22-17–22-19 session mobility, 22-26 3GPP-based charging, 2223–22-26 user data routing and access to services, 22-23 mobile Internet protocol approach, 22-3 multichannel multipoint distribution system, 22-29–22-31 objectives, 22-2 overview, 22-1–22-2 requirements, 22-2 session mobility, 22-7– 22-8 tight coupling overview, 22-9–22-12 protocol stack, 22-12– 22-13 WLAN adaptation function, 22–13-22-15 WLAN, see Wireless local area network WWAN, see Wireless wide-area network This page intentionally left blank .. .WIRELESS COMMUNICATIONS AND NETWORKING The Morgan Kaufmann Series in Networking Series Editor, David Clark, M.I.T Wireless Communications and Networking Vijay K Garg Ethernet Networking. .. networking and mobile communications under a single cover In the last two decades, many books have been written on the subject of wireless communications and networking However, mobile data networking. .. networking and mobile communications were not fully addressed This book is written to provide essentials of wireless communications and wireless networking including WPAN, WLAN, WMAN, and WWAN