It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

On the capacity of a cellular CDMA system

Power Aware Routing in Mobile Ad Hoc Networks

The growing commercial interest in indoor location-based services (ILBS) has spurred recent development of many indoor positioning techniques. Due to the absence of global positioning system (GPS) signal, many other signals have been proposed for indoor usage. Among them, Wi-Fi (802.11) emerges as a promising one due to the pervasive deployment of wireless LANs (WLANs). In particular, Wi-Fi fingerprinting has been attracting much attention recently because it does not require line-of-sight measurement of access points (APs) and achieves high applicability in complex indoor environment. This survey overviews recent advances on two major areas of Wi-Fi fingerprint localization: advanced localization techniques and efficient system deployment. Regarding advanced techniques to localize users, we present how to make use of temporal or spatial signal patterns, user collaboration, and motion sensors. Regarding efficient system deployment, we discuss recent advances on reducing offline labor-intensive survey, adapting to fingerprint changes, calibrating heterogeneous devices for signal collection, and achieving energy efficiency for smartphones. We study and compare the approaches through our deployment experiences, and discuss some future directions.

/pdf/wi-fi-fingerprint-based-indoor-positioning-recent-advances-1sxd8ckwi0.pdf

Wi-Fi Fingerprint-Based Indoor Positioning: Recent Advances and Comparisons

Recognizing the mannerism ways to get this books computer organization and design the hardware software interface 4th fourth edition by patterson hennessy is additionally useful. You have remained in right site to begin getting this info. acquire the computer organization and design the hardware software interface 4th fourth edition by patterson hennessy join that we manage to pay for here and check out the link.

[서평]「Computer Organization and Design, The Hardware/Software Interface」

WiFi localization, the task of determining the physical location of a mobile device from wireless signal strengths, has been shown to be an accurate method of indoor and outdoor localization and a powerful building block for location-aware applications. However, most localization techniques require a training set of signal strength readings labeled against a ground truth location map, which is prohibitive to collect and maintain as maps grow large. In this paper we propose a novel technique for solving the WiFi SLAM problem using the Gaussian Process Latent Variable Model (GPLVM) to determine the latent-space locations of unlabeled signal strength data. We show how GPLVM, in combination with an appropriate motion dynamics model, can be used to reconstruct a topological connectivity graph from a signal strength sequence which, in combination with the learned Gaussian Process signal strength model, can be used to perform efficient localization.

WiFi-SLAM Using G aussian Process Latent Variable Models

The received signal strength (RSS)-based approach to wireless localization offers the advantage of low cost and easy implementability. To circumvent the nonconvexity of the conventional maximum likelihood (ML) estimator, in this paper, we propose convex estimators specifically for the RSS-based localization problems. Both noncooperative and cooperative schemes are considered. We start with the noncooperative RSS-based localization problem and derive a nonconvex estimator that approximates the ML estimator but has no logarithm in the residual. Next, we apply the semidefinite relaxation technique to the derived nonconvex estimator and develop a convex estimator. To further improve the estimation performance, we append the ML estimator to the convex estimator with the result by the convex estimator as the initial point. We then extend these techniques to the cooperative localization problem. The corresponding Cramer-Rao lower bounds (CRLB) are derived as performance benchmarks. Our proposed convex estimators comply well with the RSS measurement model, and simulation results clearly demonstrate their superior performance for RSS-based wireless localization.

/pdf/received-signal-strength-based-wireless-localization-via-4udqgt6mws.pdf

Received Signal Strength-Based Wireless Localization via Semidefinite Programming: Noncooperative and Cooperative Schemes

A class of switching networks is proposed to remove the time and space bottlenecks of conventional RAM-controlled switching architectures. The advantages of these networks, such as tolerance of faults O(log/sub 2/N) stages between each inlet-outlet pair, self-routing capability, easy path hunt, and easy fault diagnosis, and their implementation are discussed. Graph theory is used to construct strictly nonblocking or rearrangeable nonblocking networks that are based on the new architecture. >

Multi-log/sub 2/N networks and their applications in high-speed electronic and photonic switching systems

Multi-Log2N networks and their applications in high-speed electronic and photonic switching systems

Directional-coupler (DC)-based switching systems can switch signals at the rate of several terabits per second. Such switches can also transmit signals with multiple wavelengths simultaneously. Despite these advantages, DCs suffer from an intrinsic crosstalk problem that must be overcome in building a robust switching system. In this paper, the principles of constructing strictly nonblocking DC-based photonic switching systems under various crosstalk constraints are explored. We demonstrate how crosstalk adds a new dimension to the theory of switching systems. We find the sufficient nonblocking condition for photonic networks under crosstalk constraints and demonstrate that some well-known nonblocking networks can tolerate a stricter crosstalk constraint while retaining their hardware complexity. The theory developed in the paper can guide us in making the design tradeoff between the level of crosstalk and the amount of hardware.

Strictly nonblocking directional-coupler-based switching networks under crosstalk constraint

A class of rearrangeable nonblocking networks is presented. The proposed networks are fault-tolerant, self-routing, and intended for a very-high-speed environment. Self-routing networks have one major problem when applied to switching: they are blocking networks. To solve this problem, two methods have been used to create self-routing rearrangeable nonblocking networks: horizontal cascading (HC) and vertical stacking (VS). The authors unify the two approaches and propose a novel class of switching networks. The proposed design principle allows the best tradeoffs among design parameters such as fault tolerance, hardware cost, and the frequency of rearrangement activities. A study of the frequency of rearrangement activities is also presented. >

Chin-Tau Lea

Papers

Received Signal Strength-Based Wireless Localization via Semidefinite Programming: Noncooperative and Cooperative Schemes

Multi-log/sub 2/N networks and their applications in high-speed electronic and photonic switching systems

Multi-Log2N networks and their applications in high-speed electronic and photonic switching systems

Strictly nonblocking directional-coupler-based switching networks under crosstalk constraint

Tradeoff of horizontal decomposition versus vertical stacking in rearrangeable nonblocking networks