In a wireless network, mobile nodes (MNs) repeatedly perform tasks such as layer 2 (L2) handoff, layer 3 (L3) handoff and authentication. These tasks are critical, particularly for real-time applications such as VoIP. We propose a novel approach, namely Cooperative Roaming (CR), in which MNs can collaborate with each other and share useful information about the network in which they move. We show how we can achieve seamless L2 and L3 handoffs regardless of the authentication mechanism used and without any changes to either the infrastructure or the protocol. In particular, we provide a working implementation of CR and show how, with CR, MNs can achieve a total L2+L3 handoff time of less than 16 ms in an open network and of about 21 ms in an IEEE 802.11i network. We consider behaviors typical of IEEE 802.11 networks, although many of the concepts and problems addressed here apply to any kind of mobile network.
, @cite_6 introduce a location sensing mechanism based on cooperative behavior among stations. Stations share location information about other stations and about landmarks so to improve position prediction and reduce training.
@cite_6
2158442058
We introduce a framework to study slotted Aloha with cooperative base stations. Assuming a geographic-proximity communication model, we propose several decoding algorithms with different degrees of base stations' cooperation (non-cooperative, spatial, temporal, and spatio-temporal). With spatial cooperation, neighboring base stations inform each other whenever they collect a user within their coverage overlap; temporal cooperation corresponds to (temporal) successive interference cancellation done locally at each station. We analyze the four decoding algorithms and establish several fundamental results. With all algorithms, the peak throughput (average number of decoded users per slot, across all base stations) increases linearly with the number of base stations. Further, temporal and spatio-temporal cooperations exhibit a threshold behavior with respect to the normalized load (number of users per station, per slot). There exists a positive load @math , such that, below @math , the decoding probability is asymptotically maximal possible, equal the probability that a user is heard by at least one base station; with non-cooperative decoding and spatial cooperation, we show that @math is zero. Finally, with spatio-temporal cooperation, we optimize the degree distribution according to which users transmit their packet replicas; the optimum is in general very different from the corresponding optimal distribution of the single-base station system. We present the cooperative location-sensing system (CLS), an adaptive location-sensing system that enables devices to estimate their position in a self-organizing manner without the need for an extensive infrastructure or training. Hosts cooperate and share positioning information. CLS uses a grid representation that allows an easy incorporation of external information to improve the accuracy of the position estimation. We evaluated the performance of CLS via simulation and investigated the impact of the density of landmarks, degree of connectivity, range error, and grid resolution on the accuracy. We found that the average error is less than 2 of the transmission range, when used in a terrain with 20 of the hosts to be landmarks, average network connectivity above 7, and distance estimation error equal to 5 of the transmission range. Motivated by the ongoing discussion on coordinated multipoint in wireless cellular standard bodies, this paper considers the problem of base station cooperation in the downlink of heterogeneous cellular networks. The focus of this paper is the joint transmission scenario, where an ideal backhaul network allows a set of randomly located base stations, possibly belonging to different network tiers, to jointly transmit data, to mitigate intercell interference and hence improve coverage and spectral efficiency. Using tools from stochastic geometry, an integral expression for the network coverage probability is derived in the scenario where the typical user located at an arbitrary location, i.e., the general user, receives data from a pool of base stations that are selected based on their average received power levels. An expression for the coverage probability is also derived for the typical user located at the point equidistant from three base stations, which we refer to as the worst case user. In the special case where cooperation is limited to two base stations, numerical evaluations illustrate absolute gains in coverage probability of up to 17 for the general user and 24 for the worst case user compared with the noncooperative case. It is also shown that no diversity gain is achieved using noncoherent joint transmission, whereas full diversity gain can be achieved at the receiver if the transmitting base stations have channel state information. In this paper, we develop an energy-efficient base station deployment framework for heterogeneous networks. Micro base station deployment increases the total capacity of the network. However, increasing the number of micro base stations excessively may reduce the energy efficiency of the network. Therefore, in this paper, we examine the energy efficiency aspect of the micro base station deployment problem. This problem can be divided into two subproblems: choosing feasible candidate micro base station locations and selecting the optimum set of micro base stations among the candidate locations. The proposed algorithm first chooses the subset of the feasible locations as candidate locations, and then selects the micro base stations which maximize the energy efficiency of the network iteratively. It is shown that the proposed algorithm is a constant-factor approximation of the optimal solution. Our simulations demonstrate that proposed algorithm improves the energy efficiency of the network up to 12 for low-loaded scenarios and 98 for the high-loaded scenarios. Stochastic models of base station infrastructure deployment by multiple mobile operators can be an invaluable tool for deriving fundamental results about wireless network sharing. In this paper, we study stochastic geometry models for a shared cellular network consisting of base stations deployed by multiple mobile operators, based on real cellular network data coming from three European countries. Relying on a statistical approach as well as the evaluation of wireless network performance metrics, we show that the log-Gaussian Cox process provides the most compelling fitness results with real multi-operator base station deployment patterns and a model that offers some degree of analytical tractability. The model captures the fact that, in urban areas, there is strong correlation between the locations where the base stations of different operators are deployed. In contrast to that, in rural areas we observe some repulsion between antenna locations of different operators. Moreover, we observe that the behavior which can be modelled with the help of these processes occurs over and over again for similar areas in different countries, which suggests universality of the proposed models. It is common practice to model the base station (BS) locations in a cellular system by a grid, such as a hexagonal or square lattice. This model is usually analytically intractable as well as quite idealized. Therefore, system designers resort to complex simulations to evaluate network performance. In this paper, we introduce a new model for the base station locations based on a homogeneous Poisson point process (PPP), whereby the mobiles communicate with their nearest base stations. We obtain the distribution of the signal-to-interference-noise ratio (SINR), compute the average ergodic rate, and analytically verify the trade-off between coverage and rate with frequency reuse. We compare our results with actual BS locations as well as the grid model. In addition to being tractable, we also observe that the performance predicted by the PPP model lower bounds the actual performance, and is about as predictive as the grid model which provides upper bounds. We study the question of determining locations of base stations (BSs) that may belong to the same or to competing service providers. We take into account the impact of these decisions on the behavior of intelligent mobile terminals that can connect to the base station that offers the best utility. The signal-to-interference-plus-noise ratio (SINR) is used as the quantity that determines the association. We first study the SINR association-game: We determine the cells corresponding to each base stations, i.e., the locations at which mobile terminals prefer to connect to a given base station than to others. We make some surprising observations: 1) displacing a base station a little in one direction may result in a displacement of the boundary of the corresponding cell to the opposite direction; 2) a cell corresponding to a BS may be the union of disconnected subcells. We then study the hierarchical equilibrium in the combined BS location and mobile association problem: We determine where to locate the BSs so as to maximize the revenues obtained at the induced SINR mobile association game. We consider the cases of single frequency band and two frequency bands of operation. Finally, we also consider hierarchical equilibria in two frequency systems with successive interference cancellation. In this paper we study optimal beamforming policy to minimize the Cramer Rao Lower Bound (CRLB) of joint angle of arrival (AoA) and time delay estimation for a multicarrier millimeter wave (mmWave) system. Considering one single base station (BS) with rough a priori knowledge of channel coefficients and location information of the mobile station (MS), we show that it is possible to improve the accuracy of AoA and time delay estimation, and hence of mobile station (MS) positioning, by means of optimized beamforming. Mathematical formulation of the CRLB is first introduced and the related optimization problem is solved for a each single subcarrier independently. Then we propose a solution optimizing the beamformer jointly for the multicarrier system. A few examples are provided to illustrate the benefits from bound-based beamforming optimization. As cellular networks are turning into a platform for ubiquitous data access, cellular operators are facing a severe data capacity crisis due to the exponential growth of traffic generated by mobile users. In this work, we investigate the benefits of sharing infrastructure and spectrum among two cellular operators. Specifically, we provide a multi-cell analytical model using stochastic geometry to identify the performance gain under different sharing strategies, which gives tractable and accurate results. To validate the performance using a realistic setting, we conduct extensive simulations for a multi-cell OFDMA system using real base station locations. Both analytical and simulation results show that even a simple cooperation strategy between two similar operators, where they share spectrum and base stations, roughly quadruples capacity as compared to the capacity of a single operator. This is equivalent to doubling the capacity per customer, providing a strong incentive for operators to cooperate, if not actually merge. We study in this paper the question of determining locations of base stations (BSs) that may belong to the same or to competing service providers, taking into account the impact of these decisions on the behavior of intelligent mobile terminals who can connect to the base station that offers the best utility. We first study the SINR association-game: we determine the cells corresponding to each base stations, i.e. the locations at which mobile terminals prefer to connect to a given base station than to other. The Signal to Interference and Noise Ratio (SINR) is used as the quantity that determines the association. We make some surprising observations: (i) displacing a base station a little in one direction may result in a displacement of the boundary of the corresponding cell to the opposite direction; (ii) A cell corresponding to a BS may be the union of disconnected sub-cells. We then study the Stackelberg equilibrium in the combined BS location and mobile association problem: we determine where to locate the BSs so as to maximize the revenues obtained at the induced SINR mobile association game. We consider the cases of single frequency band and two frequency bands of operation. Finally, we also consider Stackelberg equilibria in two frequency systems with successive interference cancellation. Having the channel state information of the channels over which the signals propagate from the transmitter to the receiver available at both sides of the transmission link is beneficial in many wireless applications. However, in frequency division duplex systems, a base station can only estimate the channel transfer function of the uplink channel based on the transmission of a-priori known training signals from the mobile station. A mobile station can only estimate the channel transfer function of the downlink channel based on the transmission of a-priori known training signals from the base station. Due to the frequency selective behavior of the mobile radio channel, the channel transfer functions of the uplink channel are different from the channel transfer functions of the downlink channel. In order to obtain the channel state information of the downlink channel in the base station or the channel state information of the uplink channel in the mobile station it is possible to feed back this information from the mobile station to the base station or from the base station to the mobile station. However, this feedback of the channel state information decreases the spectral efficiency. This paper introduces novel techniques to obtain the channel state information of the downlink channel in the base station based on the channel state information of the uplink channel in multiple antenna systems. Measurement results show the good performance of the investigated techniques. Thus, the signalling overhead can be reduced. We consider synchronization techniques required to enhance the cellular network capacity using base station cooperation. In the physical layer, local oscillators are disciplined by the global positioning system (GPS) and over the backbone network for outdoor and indoor base stations, respectively. In the medium access control (MAC) layer, the data flow can be synchronized by two approaches. The first approach uses so-called time stamps. The data flow through the user plane and through copies of it in each cooperative base station is synchronized using a timing protocol on the interconnects between the base stations. The second approach adds mapping information to the data after the user plane processing is almost finalized. Each forward-error encoded transport block, its modulation and coding scheme and the resources where it will be transmitted are multicast over the interconnect network. Interconnect latency is reduced below 1 ms to enable coherent interference reduction for mobile radio channels. Given a set S of radio stations located on a line and an integer h (1 ≤ h ≤ |S| - 1), the Min Assignment problem is to find a range assignment of minimum power consumption provided that any pair of stations can communicate in at most h hops. Previous positive results for this problem were known only when h = |S| - 1 (i.e. the unbounded case) or when the stations are equally spaced (i.e. the uniform chain). In particular, Kirousis, Kranakis, Krizanc and Pelc (1997) provided an efficient exact solution for the unbounded case and efficient approximated solutions for the uniform chain, respectively. This paper presents the first polynomial time, approximation algorithm for the Min Assignment problem. The algorithm guarantees an approximation ratio of 2 and runs in time O(hn3). We also prove that, for constant h and for "well spread" instances (a broad generalization of the uniform chain case), we can find a solution in time O(hn3) whose cost is at most an (1 + Ɛ(n)) factor from the optimum, where Ɛ(n) = o(1) and n is the number of stations. This result significantly improves the approximability result by on uniform chains. Both of our approximation results are obtained by new algorithms that exactly solves two natural variants of the Min Assignment problem that might have independent interest: the All-To-One problem (in which every station must reach a fixed one in at most h hops) and the Base Location problem (in which the goal is to select a set of Basis among the stations and all the other stations must reach one of them in at most h -1 hops). Finally, we show that for h = 2 the Min Assignment problem can be solved in O(n3)-time. Access to electric vehicle (EV) charging stations will affect EV adoption rates, use decisions, electrified mile shares, petroleum demand, and power consumption across times of day. Parking information from more than 30,000 records of personal trips in the Puget Sound, Washington, Regional Council's 2006 Household Activity Survey is used to determine public (nonresidential) parking locations and durations. Regression equations predict parking demand variables (i.e., total vehicle hours per zone or neighborhood and parked time per vehicle trip) as a function of site accessibility, local job and population density, trip attributes, and other variables available in most regions and travel surveys. Several of these variables are key inputs to a mixed-integer programming problem developed to determine optimal location assignments for EV charging stations. The algorithm minimizes EV users' costs for station access while penalizing unmet demand. This useful specification is used to determine the top locations fo... This paper deals with the distribution of cumulated instantaneous interference power in a Rayleigh fading channel for an infinite number of interfering stations, where each station transmits with a certain probability, independently of all others. If all distances are known, a necessary and sufficient condition is given for the corresponding distribution to be nondefective. Explicit formulae of density and distribution functions are obtained in the interesting special case that interfering stations are located on a linear grid. Moreover, the Laplace transform of cumulated power is investigated when the positions of stations follow a one- or two-dimensional Poisson process. It turns out that the corresponding distribution is defective for the two-dimensional models. One of the most critical barriers to widespread adoption of electric cars is the lack of charging station infrastructure. Although it is expected that a sufficient number of charging stations will be constructed eventually, due to various practical reasons they may have to be introduced gradually over time. In this paper, we formulate a multi-period optimization model based on a flow-refueling location model for strategic charging station location planning. We also propose two myopic methods and develop a case study based on the real traffic flow data of the Korean Expressway network in 2011. We discuss the performance of the three proposed methods. Emergency medical service provides a variety of services for those in need of emergency care. One of the major challenges encountered by emergency service providers is selecting the appropriate locations for ambulance stations. Prior works measure spatial proximity under Euclidean space or static road network. In this paper, we focus on locating the ambulance stations by using the real traffic information so as to minimize the average travel-time to reach the emergency requests. To this end, we estimate the travel-time of road segments using real GPS trajectories and propose an efficient PAM-based refinement for the location problem. We conduct extensive experimental evaluations using real emergency requests collected from Tianjin, and the result shows that the proposed solution can reduce the travel-time to reach the emergency requests by 29.9 when compared to the original locations of ambulance stations. Cooperation in cellular networks is a promising scheme to improve system performance, especially for cell-edge users. In this work, stochastic geometry is used to analyze cooperation models where the positions of base stations follow a Poisson point process distribution and where Voronoi cells define the planar areas associated with them. For the service of each user, either one or two base stations are involved. If two, these cooperate by exchange of user data and channel related information with conferencing over some backhaul link. Our framework generally allows for variable levels of channel information at the transmitters. This paper is focused on a case of limited information based on Willems' encoding. The total per-user transmission power is split between the two transmitters and a common message is encoded. The decision for a user to choose service with or without cooperation is directed by a family of geometric policies, depending on its relative position to its two closest base stations. An exact expression of the network coverage probability is derived. Numerical evaluation shows average coverage benefits of up to 17 compared to the non-cooperative case. Various other network problems of cellular cooperation, like the fully adaptive case, can be analyzed within our framework. This paper presents a spatial and temporal model of electric vehicle charging demand for a rapid charging station located near a highway exit. Most previous studies have assumed a fixed charging location and fixed charging time during the off-peak hours for anticipating electric vehicle charging demand. Some other studies have based on limited charging scenarios at typical locations instead of a mathematical model. Therefore, from a distribution system perspective, electric vehicle charging demand is still unidentified quantity which may vary by space and time. In this context, this study proposes a mathematical model of electric vehicle charging demand for a rapid charging station. The mathematical model is based on the fluid dynamic traffic model and the M M s queueing theory. Firstly, the arrival rate of discharged vehicles at a charging station is predicted by the fluid dynamic model. Then, charging demand is forecasted by the M M s queueing theory with the arrival rate of discharged vehicles. This mathematical model of charging demand may allow grid's distribution planners to anticipate a charging demand profile at a charging station. A numerical example shows that the proposed model is able to capture the spatial and temporal dynamics of charging demand in a highway charging station. This paper introduces a novel intention-aware routing system (IARS) for electric vehicles. This system enables vehicles to compute a routing policy that minimizes their expected journey time while considering the policies, or intentions , of other vehicles. Considering such intentions is critical for electric vehicles, which may need to recharge en route and face potentially significant queueing times if other vehicles choose the same charging stations. To address this, the computed routing policy takes into consideration predicted queueing times at the stations, which are derived from the current intentions of other electric vehicles. The efficacy of IARS is demonstrated through simulations using realistic settings based on real data from The Netherlands, including charging station locations, road networks, historical travel times, and journey origin–destination pairs. In these settings, IARS is compared with a number of state-of-the-art benchmark routing algorithms and achieves significantly lower average journey times. In some cases, IARS leads to an over 80 improvement in waiting times at charging stations and a more than 50 reduction in overall journey times.