scispace - formally typeset
Search or ask a question
Topic

Base station

About: Base station is a research topic. Over the lifetime, 85883 publications have been published within this topic receiving 1019303 citations. The topic is also known as: Mobile phone base stations & BS.


Papers
More filters
Proceedings ArticleDOI
31 Oct 2003
TL;DR: A probabilistic model and two protocols to establish a secure pair-wise communication channel between any pair of sensors in the WSN, by assigning a small set of random keys to each sensor, are described.
Abstract: A distributed Wireless Sensor Network (WSN) is a collection of n sensors with limited hardware resources. Sensors can exchange messages via Radio Frequency (RF), whose range usually covers only a limited number of other sensors. An interesting problem is how to implement secure pair-wise communications among any pair of sensors in a WSN. A WSN requires completely distributed solutions which are particularly challenging due to the limited resources and the size of the network. Moreover, WSNs can be subject to several security threats, including the physical compromising of a sensor. Hence, any solution for secure pairwise communications should tolerate the collusion of a set of corrupted sensors. This paper describes a probabilistic model and two protocols to establish a secure pair-wise communication channel between any pair of sensors in the WSN, by assigning a small set of random keys to each sensor. We build, based on the first Direct Protocol, a second Co-operative Protocol. The Co-operative Protocol is adaptive: its security properties can be dynamically changed during the life-time of the WSN. Both protocols also guarantee implicit and probabilistic mutual authentication without any additional overhead and without the presence of a base station. The performance of the Direct Protocol is analytically characterized while, for the Co-operative Protocol, we provide both analytical evaluations and extensive simulations. For example, the results show that, assuming each sensor stores 120 keys, in a WSN composed of 1024 sensors with 32 corrupted sensors the probability of a channel corruption is negligible in the case of the Co-operative Protocol.

292 citations

Journal ArticleDOI
Yang Xiao1
TL;DR: Energy consumption for the IEEE 802.16e broadband wireless access (BWA) network is studied and the sleep-mode scheme is analytically model and validated with simulations.
Abstract: In this paper, we study energy consumption for the IEEE 802.16e broadband wireless access (BWA) network, A mobile subscriber station goes to sleep-mode after negations with the base station and temporarily wake-up periodically for a short interval to check whether there is downlink traffic to it to decide whether it goes to wake-mode or continues to be in the sleep-mode. The sleep interval is increased exponentially upon no arrival traffic. We analytically model the sleep-mode scheme and validate the model with simulations.

292 citations

Journal ArticleDOI
TL;DR: This work formulates the problem of scheduling the mobile element in the network so that there is no data loss due to buffer overflow and the problem is shown to be NP-complete and an integer-linear-programming formulation is given.
Abstract: Wireless networks have historically considered support for mobile elements's an extra overhead. However, recent research has provided the means by which a network can take advantage of mobile elements. Particularly in the case of wireless sensor networks, mobile elements can be deliberately built into the system to improve the lifetime of the network and act as mechanical carriers of data. The mobile element, whose mobility is controlled, visits the nodes to collect their data before their buffers are full. In general, the spatio-temporal dynamics of the sensed phenomenon may require sensor nodes to collect samples at different rates, in which case, some nodes need to be visited more frequently than others. This work formulates the problem of scheduling the mobile element in the network so that there is no data loss due to buffer overflow. The problem is shown to be NP-complete and an integer-linear-programming formulation is given. Finally, some computationally practical algorithms for a single mobile and for the case of multiple mobiles are presented and their performances compared

290 citations

Patent
27 Mar 2001
TL;DR: In this article, a network navigation center outputs guide access information GAI to a personal computer of an ad sponsor over the Internet and receives registration of advertisement information ADI for the designated location(s) from the personal computer according to the GAI.
Abstract: In the present invention, advertisements are transmitted electronically at designated locations, as a substitute for stationary billboards. A network navigation center outputs guide access information GAI to a personal computer of an ad sponsor over the Internet and receives registration of advertisement information ADI for the designated location(s) from the personal computer of the ad sponsor according to the guide access information GAI. In addition, the network navigation center receives current position information API from mobile communication device(s) carried by automobile, via a mobile telephone base station and a public telephone network. Likewise, the network navigation center transmits the advertisement information ADI, based on current position information API, to the mobile communication instrument via the public telephone network and mobile telephone base station.

290 citations

Journal ArticleDOI
TL;DR: A survey of cellular network sharing is presented, which is a key building block for virtualizing future mobile carrier networks in order to address the explosive capacity demand of mobile traffic, and reduce the CAPEX and OPEX burden faced by operators to handle this demand.
Abstract: This article presents a survey of cellular network sharing, which is a key building block for virtualizing future mobile carrier networks in order to address the explosive capacity demand of mobile traffic, and reduce the CAPEX and OPEX burden faced by operators to handle this demand. We start by reviewing the 3GPP network sharing standardized functionality followed by a discussion on emerging business models calling for additional features. Then an overview of the RAN sharing enhancements currently being considered by the 3GPP RSE Study Item is presented. Based on the developing network sharing needs, a summary of the state of the art of mobile carrier network virtualization is provided, encompassing RAN sharing as well as a higher level of base station programmability and customization for the sharing entities. As an example of RAN virtualization techniques feasibility, a solution based on spectrum sharing is presented: the network virtualization substrate (NVS), which can be natively implemented in base stations. NVS performance is evaluated in an LTE network by means of simulation, showing that it can meet the needs of future virtualized mobile carrier networks in terms of isolation, utilization, and customization.

289 citations


Network Information
Related Topics (5)
Wireless
133.4K papers, 1.9M citations
96% related
Wireless network
122.5K papers, 2.1M citations
96% related
Wireless ad hoc network
49K papers, 1.1M citations
94% related
Network packet
159.7K papers, 2.2M citations
94% related
Wireless sensor network
142K papers, 2.4M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20231,277
20222,829
20211,823
20203,484
20194,001
20184,426