Zhou Yangfan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (leaves 102-112). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.v / Chapter 1 --- Introduction and Background Study --- p.1 / Chapter 1.1 --- Wireless Sensor Networks --- p.1 / Chapter 1.1.1 --- Wireless Integrated Network Sensors --- p.1 / Chapter 1.1.2 --- Main Challenge of In-situ Sensing with Sensor Nodes: Limited Energy Resource --- p.3 / Chapter 1.1.3 --- Networking the Sensor Nodes --- p.4 / Chapter 1.2 --- Applications of Wireless Sensor Networks --- p.4 / Chapter 1.3 --- Characteristics of Wireless Sensor Networks: A Summary --- p.6 / Chapter 1.4 --- Energy-Efficient and Reliable Wireless Sensor Networks --- p.9 / Chapter 2 --- PORT: A Price-Oriented Reliable Transport Protocol --- p.12 / Chapter 2.1 --- Reliable Sensor-to-Sink Data Communications in Wireless Sensor Networks --- p.14 / Chapter 2.2 --- Related Work --- p.17 / Chapter 2.3 --- Protocol Requirements --- p.20 / Chapter 2.4 --- Design Considerations --- p.25 / Chapter 2.4.1 --- The concept of node price --- p.25 / Chapter 2.4.2 --- Link-loss rate estimation --- p.28 / Chapter 2.4.3 --- Routing scheme --- p.29 / Chapter 2.5 --- Protocol Description --- p.31 / Chapter 2.5.1 --- Task initialization --- p.31 / Chapter 2.5.2 --- Feedback of newly desired source reporting rates --- p.32 / Chapter 2.5.3 --- Feedback of wireless communication condition --- p.32 / Chapter 2.5.4 --- Fault tolerance and scalability considerations --- p.33 / Chapter 2.6 --- Protocol Evaluation: A Case Study --- p.34 / Chapter 2.6.1 --- Simulation model --- p.34 / Chapter 2.6.2 --- Energy consumption comparison --- p.36 / Chapter 2.6.3 --- The impact of reporting sensors' uncertainty distribution --- p.39 / Chapter 2.7 --- Conclusion --- p.40 / Chapter 3 --- Setting Up Energy-Efficient Paths --- p.41 / Chapter 3.1 --- Transmitter Power Setting for Energy-Efficient Sensor-to-Sink Data Communications --- p.46 / Chapter 3.1.1 --- "Network, communication, and energy consumption models" --- p.46 / Chapter 3.1.2 --- Transmitter power setting problem for energy-efficient sensor-to-sink data communications --- p.49 / Chapter 3.2 --- Setting Up the Transmitter Power Levels for Sensor-to-Sink Traffic --- p.51 / Chapter 3.2.1 --- BOU: the basic algorithm --- p.52 / Chapter 3.2.2 --- Packet implosion of BOU: the challenge --- p.53 / Chapter 3.2.3 --- Determining the waiting time before broadcasting --- p.56 / Chapter 3.2.4 --- BOU-WA: an approximation approach --- p.60 / Chapter 3.3 --- Simulation Results --- p.62 / Chapter 3.3.1 --- The comparisons of BOU and BOU-WA --- p.63 / Chapter 3.3.2 --- The approximation of BOU-WA --- p.65 / Chapter 3.4 --- Related Work --- p.67 / Chapter 3.5 --- Conclusion Remarks and Future Work --- p.69 / Chapter 4 --- Solving the Sensor-Grouping Problem --- p.71 / Chapter 4.1 --- Introduction --- p.73 / Chapter 4.2 --- The Normalized Minimum Distance i:A Point-Distribution Index --- p.74 / Chapter 4.3 --- The Sensor-Grouping Problem --- p.77 / Chapter 4.3.1 --- Problem Formulation --- p.80 / Chapter 4.3.2 --- A General Sensing Model --- p.81 / Chapter 4.4 --- Maximizing-i Node-Deduction Algorithm for Sensor-Grouping Problem --- p.84 / Chapter 4.4.1 --- Maximizing-i Node-Deduction Algorithm --- p.84 / Chapter 4.4.2 --- Incremental Coverage Quality Algorithm: A Benchmark for MIND --- p.86 / Chapter 4.5 --- Simulation Results --- p.87 / Chapter 4.5.1 --- Number of Groups Formed by MIND and ICQA --- p.88 / Chapter 4.5.2 --- The Performance of the Resulting Groups --- p.89 / Chapter 4.6 --- Conclusion --- p.90 / Chapter 5 --- Conclusion --- p.92 / Chapter A --- List of Research Conducted --- p.96 / Chapter B --- Algorithms in Chapter 3 and Chapter 4 --- p.98 / Bibliography --- p.102

"Opportunistic routing (OR) takes advantages of the spatial diversity and broadcast nature of wireless networks to combat the time-varying links by involving multiple neighboring nodes (forwarding candidates) for each packet relay. This dissertation studies the properties, energy efficiency, capacity, throughput, protocol design and security issues about OR in multihop wireless networks. Firstly, we study geographic opportunistic routing (GOR), a variant of OR which makes use of nodes' location information. We identify and prove three important properties of GOR. The first one is on prioritizing the forwarding candidates according to their geographic advancements to the destination. The second one is on choosing the forwarding candidates based on their advancements and link qualities in order to maximize the expected packet advancement (EPA) with different number of forwarding candidates. The third one is on the concavity of the maximum EPA in respect to the number of forwarding candidates. We further propose a local metric, EPA per unit energy consumption, to tradeoff the routing performance and energy efficiency for GOR. Leveraging the proved properties of GOR, we propose two efficient algorithms to select and prioritize forwarding candidates to maximize the local metric. Secondly, capacity is a fundamental issue in multihop wireless networks. We propose a framework to compute the end-to-end throughput bound or capacity of OR in single/multirate systems given OR strategies (candidate selection and prioritization). Taking into account wireless interference and unique properties of OR, we propose a new method of constructing transmission conflict graphs, and we introduce the concept of concurrent transmission sets to allow the proper formulation of the maximum end-to-end throughput problem as a maximum-flow linear programming problem subject to the transmission conflict constraints. We also propose two OR metrics: expected medium time (EMT) and expected advancement rate (EAR), and the corresponding distributed and local rate and candidate set selection schemes, the Least Medium Time OR (LMTOR) and the Multirate Geographic OR (MGOR). We further extend our framework to compute the capacity of OR in multi-radio multi-channel systems with dynamic OR strategies. We study the necessary and sufficient conditions for the schedulability of a traffic demand vector associated with a transmitter to its forwarding candidates in a concurrent transmission set. We further propose an LP approach and a heuristic algorithm to obtain an opportunistic forwarding strategy scheduling that satisfies a traffic demand vector. Our methodology can be used to calculate the end-to-end throughput bound of OR in multi-radio/channel/rate multihop wireless networks, as well as to study the OR behaviors (such as candidate selection and prioritization) under different network configurations. Thirdly, protocol design of OR in a contention-based medium access environment is an important and challenging issue. In order to avoid duplication, we should ensure only the "best" receiver of each packet to forward it in an efficient way. We investigate the existing candidate coordination schemes and propose a "fast slotted acknowledgment" (FSA) to further improve the performance of OR by using a single ACK to coordinate the forwarding candidates with the help of the channel sensing technique. Furthermore, we study the throughput of GOR in multi-rate and single-rate systems. We introduce a framework to analyze the one-hop throughput of GOR, and provide a deeper insight on the trade-off between the benefit (packet advancement, bandwidth, and transmission reliability) and cost (medium time delay) associated with the node collaboration. We propose a local metric named expected one-hop throughput (EOT) to balance the benefit and cost. Finally, packet reception ratio (PRR) has been widely used as an indicator of the link quality in multihop wireless networks. Many routing protocols including OR in wireless networks depend on the PRR information to make routing decision. Providing accurate link quality measurement (LQM) is essential to ensure the right operation of these routing protocols. However, the existing LQM mechanisms are subject to malicious attacks, thus can not guarantee to provide correct link quality information. We analyze the security vulnerabilities in the existing link quality measurement (LQM) mechanisms and propose an efficient broadcast-based secure LQM (SLQM) mechanism, which prevents the malicious attackers from reporting a higher PRR than the actual one. We analyze the security strength and the cost of the proposed mechanism. "

A realistic comparative performance evaluation of indoor Geolocation systems is a complex and challenging problem facing the research community. This is due to the fact that performance of these systems depends on the statistical variations of the fading multipath characteristics of the wireless channel, the density and distribution of the access points in the area, and the number of the training points used by the positioning algorithm. This problem, in particular, becomes more challenging when we address RFID devices, because the RFID tags and the positioning algorithm are implemented in two separate devices. In this thesis, we have designed and implemented a testbed for comparative performance evaluation of RFID localization systems in a controlled and repeatable laboratory environment. The testbed consists of a real-time RF channel simulator, several WiFi 802.11 access points, commercial RFID tags, and a laptop loaded with the positioning algorithm and its associated user interface. In the real-time channel simulator the fading multipath characteristics of the wireless channel between the access points and the RFID tags is modeled by a modified site-specific IEEE 802.11 channel model which combines this model with the correlation model of shadow fading existing in the literature. The testbed is first used to compare the performance of the modified IEEE 802.11 channel model and the Ray Tracing channel model previously reported in the literature. Then, the testbed with the new channel model is used for comparative performance evaluation of two different WiFi RFID devices.

In last few years there has been significant growth in the area of wireless communication. Quality of Service (QoS) has become an important consideration for supporting variety of applications that utilize the network resources. These applications include voice over IP, multimedia services, like, video streaming, video conferencing etc. IEEE 802.16/WiMAX is a new network which is designed with quality of service in mind. This thesis focuses on analysis of quality of service as implemented by the WiMAX networks. First, it presents the details of the quality of service architecture in WiMAX network. In the analysis, a WiMAX module developed based on popular network simulator ns-2, is used. Various real life scenarios like voice call, video streaming are setup in the simulation environment. Parameters that indicate quality of service, such as, throughput, packet loss, average jitter and average delay, are analyzed for different types of service flows as defined in WiMAX. Results indicate that better quality of service is achieved by using service flows designed for specific applications. / by Rohit Talwalkar. / Thesis (M.S.)--Florida Atlantic University, 2008. / Includes bibliography. / Electronic reproduction. Boca Raton, FL : 2008 Mode of access: World Wide Web.

This thesis presents the design of a 2.4 GHz sub-integer-N PLL for IEEE 802.llb/g WLAN applications. The proposed PLL not only acquires the advantages of the integer-N PLL, such as simple structure and good spurious performance, but also offers some benefits (for example, faster settling time and better phase noise performance) as in the fractional-N PLL design. In this design, a novel quadrature-input programmable fractional frequency divider provides fractional division ratio in steps of 0.5 by the phase-switching technique. Its key building block is a dual divide-by-4 injection-locked frequency divider (ILFD), which is realized by coupling two conventional divide-by-4 ILFDs. Two different coupling schemes are introduced, namely the cross-coupling type and coherent-coupling type. In both schemes, symmetric configuration is maintained and hence does not degrade the PLL output phase quadrature accuracy. Furthermore, the generated phase pattern for phase switching is uniquely defined, which simplifies the phase-switching circuitry and suppresses the possibility of incorrect frequency division due to glitches. / To demonstrate the feasibility of the two proposed coupling methodologies, two subinteger-N PLLs with different fractional frequency dividers have been fabricated in a 0.35 11m standard CMOS process. In design 1, the dual divide-by-4 ILFD in the fractional frequency divider is implemented with the cross-coupling scheme while the coherent-coupling scheme is used in design 2. The measured spurious tones of both designs are under -64 dBc and their measured phase noise at 1 MHz frequency offset is less than -115 dBc/Hz. The two proposed frequency synthesizers settle at approximately 32 us and their phase mismatches of the quadrature outputs are better than 38 dB (characterized by image rejection ratio). Moreover, both designs individually occupy a chip area as small as 0.70 mm2. At a supply of 1.5 V, the total power consumption for each design is below 24.1 mW. / Wireless local area networks (WLANs) are being extensively deployed since their introduction in the late 1990s. Low cost, high performance frequency synthesizers are indispensable in WLAN telecommunication systems. Meanwhile, integer-N phase-locked loop (PLL) architecture is commonly chosen due to its low circuit complexity and clean output spectrum with few spurs. However, designers have to face the tradeoffs between frequency resolution, phase noise performance and switching time. To solve the above dilemma, fractional-N PLL architecture is proposed, but fractional spurs emerge in the output spectrum, degrading the spectrum purity. Sub-integer-N PLL is thus a compromise between the integer-N and fractional-N PLL. Its structure is same as that of the integer-N while fractional division is achieved by a fractional frequency divider that is not relied on time-varying modulus control as in the fractional-N PLL. / Chang, Ka Fai. / Adviser: Kwok-Keung Cheng. / Source: Dissertation Abstracts International, Volume: 73-04, Section: B, page: . / Thesis (Ph.D.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 176-188). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [201-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Wireless communication technologies are no longer limited for voice band applications, but have entered the era for multimedia data link. The IEEE802.11 family, which occupies a bandwidth in the multi-mega hertz region with the highest data rate of 54 Mbps, now has become the most widely deployed wireless LAN standards. The rapid adoption of IEEE802.11 for computer wireless networks and their growing popularity in mobile applications highlight the need for a low cost, low power consumption, and monolithic solution. To meet this challenge, traditional RF techniques, which revolved around the superheterodyne architecture can no longer be used. On the contrary, new receiver frontend architectures need to be developed to satisfy the demand of system level integration. Direct downconversion receivers directly translate the RF spectrum to the baseband by setting the LO frequency equal to the RF. Due to the single frequency translation, expensive and bulky off-chip filters and 50 ohm I/O matching networks at IF are no longer required. Also, the single-stage quadrature mixers further simplify the receiver design and reduce the power dissipation. Subsequent baseband components and ADCs are also possible to be integrated with the RF frontend to achieve a monolithic receiver chip. Despite the previously mentioned advantages, the implementation of a direct downconversion receiver has its own set of performance challenges. In particular, the performance is plagued by DC offset, flicker noise, linearity and mismatches etc. The main objective of this project is to investigate the feasibility of using direct downconversion architecture for the IEEE802.11a standard, and implement the design in a 0.18 µm CMOS technology. By approaching the design issue at a theoretic point of view, extensive modeling and simulations based on a SIMULINK IEEE802.11a physical layer theme have been carried out to evaluate the receiver performance. SER results of the receiver demonstrate that the impairments associated with zero IF can be minimised to an acceptable level. Under the guidance of the system level analysis, the circuit level design of a monolithic direct downconversion receiver has been implemented in a 0.18 µm RF CMOS process, including the building blocks of an LNA, mixer, baseband amplifier and a channel-selection filter. Particularly, a novel LNA design methodology with an improved noise figure and less power consumption has been developed. The mixer conversion gain and phase noise have been analysed by a novel approach. The combination topology of the highpass DC offset removal filter and the baseband amplifier provids the best linearity with a negligible noise figure degradation. Circuit simulations are performed using the foundry provided RF design kit with enhanced noise models to capture the extra noise of passive and deep submicron devices. Circuit level simulations show a qualified receiver frontend for the IEEE802.11a standard. As data converters are important building blocks in wireless receivers, research on high performance Sigma-Delta modulators is also included. MATLAB based programs have been developed for both the discrete and continuous time transfer function synthesis. A BPSDM chip with variable centre frequencies has been developed to verify the SDM transfer function algorithm and the design methodology. The design of an ultra fast continuous time SDM is particularly focused on for a broadband data conversion. To alleviate the challenge of the comparator speed limit, a novel noise transfer function with a unit clock delay has been synthesised. With such a delayed transfer function, a three-stage comparator can be acheieved that solves the comparator gain and speed tradeoff. The full chip simulation shows an acceptable performance for the IEEE802.11a standard. / Thesis (Ph.D.) -- University of Adelaide, School of Electrical and Electronic Engineering, 2008

Thesis (M.S.) -- Mississippi State University. Department of Electrical and Computer Engineering. / Title from title screen. Includes bibliographical references.

<p>The networking field has become a core component for any company. All of the</p><p>businesses rely on the networking industry, due its vastness and significance. Every day</p><p>companies are planning and thinking to develop better strategies that can offer efficient</p><p>and reliable communication solutions between their employees and customers for</p><p>maximum revenue. The planning of a company’s network requires a lot of resources and</p><p>aspects to study, and to evaluate them carefully to build a comprehensive secure and</p><p>reliable platform. It is the job of a network administrator to take care of the company’s</p><p>network infrastructure and upgrade or update the required components and applications</p><p>from time-to-time that can follow new standards.</p><p>This thesis is a practical work aimed to evaluate a company network infrastructure in its</p><p>real environment. The purpose of this thesis is to evaluate different aspects of the</p><p>network infrastructure used such as VPN, WLAN, firewall and physical security and give</p><p>recommendations to make their performance better and to offer more advanced strategies.</p><p>This study will also provide an inclusive observation of the company’s needs and their</p><p>network infrastructure, and will provide a concept how to evaluate and fix small mistakes,</p><p>the kind of problems that can occur in an evolving company network. Lastly, this research</p><p>will make recommendations and suggest a possible implementation on the studied</p><p>network infrastructure.</p>

No description available.

Thesis (Ph. D.)--Ohio State University, 2006. / Title from first page of PDF file. Includes bibliographical references (p. 180-187).