In this paper, we study the feasibility of a batteryless wireless sensor supplied with energy by using microwave power transmission (MPT). If we perform co-channel operation of MPT and wireless local area networks (WLANs) for the sake of spectral efficiency, a time division method for MPT and WLAN communications is required to avoid serious interference from MPT to WLAN data transmissions. In addition, to reduce the power consumption of a sensor, the use of power-save operation of the sensor is desirable. We proposed a scheduling scheme that allocates time for MPT and WLAN communications. Specifically, in the proposed scheduling system, an energy source transmits microwave power to a sensor station except when the sensor station transmits data frames or receives beacon frames. In addition, in the proposed scheduling system, we force the remaining energy of the sensor station to converge to a maximum value by adjusting the time interval of data transmission from the sensor station such that the power consumption of the sensor station is reduced. On the basis of the proposition, we implemented a scheduling system and then confirmed that it performed successfully in the conducted experiments. Finally, we discussed the feasibility of the proposed scheduling scheme by evaluating the coverage and then showed that the scheduling scheme can be applied to closed space or room.

The problem of coexistence between IEEE 802.11g based wireless LANs (WLANs) and IEEE 802.15.4 based wireless personal area networks (WPANs) in the 2.4GHz band is an important issue for the operation of a home energy management system (HEMS) for smart grids. This paper proposes a coexistence scheme that is called a Hybrid station aided coexistence (HYSAC) scheme to solve this problem. This scheme employs a hybrid-station (H-STA) that possesses two types of network device functions. The scheme improves the data transmission quality of the WPAN devices which transmit energy management information such as power consumption. The proposed HYSAC scheme employs WLAN control frames, which are used to assign WPAN system traffic resources. Moreover, we propose a coexistence method to achieve excellent WLAN throughput where multiple WPANs coexist with a WLAN. We theoretically derive the performance of the proposed scheme by considering the QoS support in WLAN and show that the results of the simulation and theoretical analysis are in good agreement. The numerical results show that the HYSAC scheme decreases the beacon loss rate of WPAN to less than 1% when the WLAN system consists of 10 STAs under saturated traffic conditions. Furthermore, the WLAN throughput of the proposed synchronization method is shown to be 30.6% higher than that of the HYSAC scheme without synchronization when the WLAN that consists of 10 STAs coexists with four WPANs.

Distributed channel selection schemes are proposed in this paper to mitigate the flow-in-the-middle (FIM) starvation in dense wireless local area networks (WLANs). The FIM starvation occurs when the middle transmitter is within the carrier sense range of two exterior transmitters, while the two exterior transmitters are not within the carrier sense range of each other. Since an exterior transmitter sends a frame regardless of the other, the middle transmitter has a high probability of detecting the channel being occupied. Under heavy traffic conditions, the middle transmitter suffers from extremely low transmission opportunities, i.e., throughput starvation. The basic idea of the proposed schemes is to let each access point (AP) select the channel which has less three-node-chain topologies within its two-hop neighborhood. The proposed schemes are formulated in strategic form games. Payoff functions are designed so that they are proved to be potential games. Therefore, the convergence is guaranteed when the proposed schemes are conducted in a distributed manner by using unilateral improvement dynamics. Moreover, we conduct evaluations through graph-based simulations and the ns-3 simulator. Simulations confirm that the FIM starvation has been mitigated since the number of three-node-chain topologies has been significantly reduced. The 5th percentile throughput has been improved.

Technological developments in wireless communication have led to an increasing demand for radio frequencies. This has necessitated the practice of spectrum sharing to ensure optimal usage of the limited frequencies, provided this does not cause interference. This paper presents a framework for managing an unexpected situation in which a primary user experiences harmful interference with regard to database-driven secondary use of spectrum allocated to the primary user towards 5G mobile networks, where the primary user is assumed to be a radar system. In our proposed framework, the primary user informs a database that they are experiencing harmful interference. Receiving the information, the database updates a primary exclusive region in which secondary users are unable to operate in the licensed spectrum. Subsequent to the update, this primary exclusive region depends on the knowledge about the secondary users when the primary user experiences harmful interference, knowledge of which is stored in the database. We assume a circular primary exclusive region centered at a primary receiver and derive an optimal radius of the primary exclusive region by applying stochastic geometry. Then, for each type of knowledge stored in the database for the secondary user, we evaluate the optimal radius for a target probability that the primary user experiences harmful interference. The results show that the more detailed the knowledge of the secondary user's density and transmission power stored in the database, the smaller the radius that has to be determined for the primary exclusive region after the update and the more efficient the spatial reuse of the licensed spectrum that can be achieved.

This paper proposes a rate adaptation scheme (RAS) for a wireless local area network (WLAN) station powered with microwave power transmission (MPT). A WLAN station attempting to transmit data frames when exposed to microwave radiation for MPT, experiences a reduction in the physical (PHY) layer data rate because frames are lost even when the carrier sense mechanism is used. The key idea of the proposed scheme is to utilize the output of the rectenna used for receiving microwave power. Using rectenna output, a WLAN station based on the proposed scheme assesses whether the station is exposed to microwave radiation for MPT. Then, using historical data corresponding to the assessment result, the station selects an appropriate PHY data rate. The historical data are obtained from previous transmission results, e.g., historical data pertaining to the data frame loss ratio. The proposed scheme was implemented and verified through an experiment. Experimental results showed that the proposed scheme prevents the reduction in the PHY data rate, which is caused by the use of historical data stored in a single memory. Thus, the proposed scheme leads to an improvement in the WLAN throughput.

To substantially alleviate the human blockage problem in mmWave communications, this paper proposes a proactive handover system based on human blockage prediction using RGB and depth (RGB-D) cameras. The proposed scheme uses RGB-D camera images to estimate the mobility of pedestrians and to predict when blockage will occur. On the basis of this information, the proposed system transfers a mobile station (STA) communicating with one wireless BS (base station) to another BS before human blockage occurs and thus avoids blockage-induced throughput degradation. This paper presents performance modeling of both proactive handover scheme and reactive handover scheme which is based on the received power level. A numerical evaluation reveals conditions under which the proactive handover scheme achieves higher spectral efficiency compared to reactive scheme. In addition, using IEEE 802.11ad-based wireless local area network (WLAN) devices, a testbed for implementing the proposed system is built. The innovative experimental results demonstrate that the proactive handover system can considerably reduce the duration of human blockage-induced degradation of throughput performance relative to the reactive scheme.

Conventional mechanisms proposed for enhancing quality of service (QoS) in 802.11 networks suffer from a lack of backward compatibility and fairness with and to legacy devices. In this paper, we present a cooperative mechanism, called TXOP (transmission opportunity) Exchange, that provides a legacy-neutral solution in which only stations (STAs) participating in TXOP Exchange cooperatively use their available bandwidth to satisfy their required throughputs, while other legacy devices continue to get the same throughput performance as before. Specifically, we discuss the implementation of TXOP Exchange in legacy 802.11 networks. We show that this mechanism can be realized with minor modifications to the RTS (request-to-send) frames of only the STAs participating in TXOP Exchange and without any replacement of legacy access points or STAs. We show an example of a proportional fair algorithm for fair and efficient MAC cooperation using a Nash bargaining solution (NBS). A simulation study using a realistic simulator verifies that the TXOP Exchange mechanism ensures legacy neutrality and fair and efficient cooperation even when a large number of legacy STAs coexist.

A joint deployment of base stations (BSs) and RGB-depth (RGB-D) cameras for camera-assisted millimeter-wave (mmWave) access networks is discussed in this paper. For the deployment of a wide variety of devices in heterogeneous networks, it is crucial to consider the synergistic effects among the different types of nodes. A synergy between mmWave networks and cameras reduces the power consumption of mmWave BSs through sleep control. A purpose of this work is to optimize the number of nodes of each type, to maximize the average achievable rate within the constraint of a predefined total power budget. A stochastic deployment problem is formulated as a submodular optimization problem, by assuming that the deployment of BSs and cameras forms two independent Poisson point processes. An approximate algorithm is presented to solve the deployment problem, and it is proved that a (1-e-1)/2-approximate solution can be obtained for submodular optimization, using a modified greedy algorithm. The numerical results reveal the deployment conditions under which the average achievable rate of the camera-assisted mmWave system is higher than that of a conventional system that does not employ RGB-D cameras.

The IEEE 802.11 wireless LAN (WLAN) is based on carrier sense multiple access with collision avoidance (CSMA/CA) protocol. CSMA/CA uses a backoff mechanism to avoid collisions among stations (STAs). One disadvantage of backoff mechanisms is that STAs must wait for some period of time before transmission, which degrades spectral efficiency. Moreover, a backoff algorithm cannot completely avoid collisions. We have proposed a novel medium access control (MAC) scheme called the visual recognition-based medium access control (VRMAC) scheme, which uses an LED-camera communication technique. STAs send media-access request messages by blinking their LEDs in VRMAC scheme. An access point (AP) receives the messages via its camera, and then allocates transmission opportunities to the STAs by transmitting control frames. Since the transmission rate of the LED-camera communication is lower than WLAN transmission, the delay of access requesting causes and it could decrease the system throughput of the VRMAC system based WLAN. We reveal the effect of the delay for TCP flows and propose enhanced access procedures to eliminate the effect of the delay. Our simulation results demonstrate that VRMAC scheme increases the system throughput in UDP and TCP traffic. Moreover, the scenario-based evaluations reveal that VRMAC scheme also decreases the session delay which is a metric of quality of experience (QoE) for TCP applications.

In densely deployed wireless local area network (WLAN) environments, the arbitrary deployment of WLAN access points (APs) can cause serious cell overlaps among APs. In such situations, the ability to realize adaptable coverage using transmission power control (TPC) is effective for improving the area spectral efficiency. Meanwhile, it should be guaranteed that no coverage holes occur and that connectivity between APs and wireless stations (STAs) is maintained. In this paper, the self-organization of coverage domains of APs using TPC is proposed. The proposed technique reduces the incidence of coverage overlaps without generating area coverage holes. To detect coverage holes, STAs and/or APs are used as sensors that inform each AP of whether or not the points at which they exist are covered by the APs. However, there is a problem with this approach in that when the density of STAs is not sufficiently large, the occurrence of area coverage holes is inevitable because the points at which the sensors do not exist are not guaranteed to be covered by APs. This paper overcomes the problem by focusing APs that belong to network's outer boundary (boundary APs) and prohibiting the APs from operating at low transmission power levels, the idea being that the coverage domains of such APs always include the region covered by only those APs. The boundary APs are determined by performing Delaunay triangulation of the set of points at which all APs exist. Simulation results confirm the effectiveness of the proposed TPC scheme in terms of its ability to reduce the total overlap area while avoiding the occurrence of area coverage holes.

In this study, a contextual multi-armed bandit (CMAB)-based decentralized channel exploration framework disentangling a channel utility function (i.e., reward) with respect to contending neighboring access points (APs) is proposed. The proposed framework enables APs to evaluate observed rewards compositionally for contending APs, allowing both robustness against reward fluctuation due to neighboring APs' varying channels and assessment of even unexplored channels. To realize this framework, we propose contention-driven feature extraction (CDFE), which extracts the adjacency relation among APs under contention and forms the basis for expressing reward functions in disentangled form, that is, a linear combination of parameters associated with neighboring APs under contention). This allows the CMAB to be leveraged with a joint linear upper confidence bound (JLinUCB) exploration and to delve into the effectiveness of the proposed framework. Moreover, we address the problem of non-convergence — the channel exploration cycle — by proposing a penalized JLinUCB (P-JLinUCB) based on the key idea of introducing a discount parameter to the reward for exploiting a different channel before and after the learning round. Numerical evaluations confirm that the proposed method allows APs to assess the channel quality robustly against reward fluctuations by CDFE and achieves better convergence properties by P-JLinUCB.

Sharing perceptual data (e.g., camera and LiDAR data) with other vehicles enhances the traffic safety of autonomous vehicles because it helps vehicles locate other vehicles and pedestrians in their blind spots. Such safety applications require high throughput and short delay, which cannot be achieved by conventional microwave vehicular communication systems. Therefore, millimeter-wave (mmWave) communications are considered to be a key technology for sharing perceptual data because of their wide bandwidth. One of the challenges of data sharing in mmWave communications is broadcasting because narrow-beam directional antennas are used to obtain high gain. Because many vehicles should share their perceptual data to others within a short time frame in order to enlarge the areas that can be perceived based on shared perceptual data, an efficient scheduling for concurrent transmission that improves spatial reuse is required for perceptual data sharing. This paper proposes a data sharing algorithm that employs a graph-based concurrent transmission scheduling. The proposed algorithm realizes concurrent transmission to improve spatial reuse by designing a rule that is utilized to determine if the two pairs of transmitters and receivers interfere with each other by considering the radio propagation characteristics of narrow-beam antennas. A prioritization method that considers the geographical information in perceptual data is also designed to enlarge perceivable areas in situations where data sharing time is limited and not all data can be shared. Simulation results demonstrate that the proposed algorithm doubles the area of the cooperatively perceivable region compared with a conventional algorithm that does not consider mmWave communications because the proposed algorithm achieves high-throughput transmission by improving spatial reuse. The prioritization also enlarges the perceivable region by a maximum of 20%.

In content services where people purchase and download large-volume contents, minimizing network traffic is crucial for the service provider and the network operator since they want to lower the cost charged for bandwidth and the cost for network infrastructure, respectively. Traffic localization is an effective way of reducing network traffic. Network traffic is localized when a client can obtain the requested content files from other a near-by altruistic client instead of the source servers. The concept of the peer-assisted content distribution network (CDN) can reduce the overall traffic with this mechanism and enable service providers to minimize traffic without deploying or borrowing distributed storage. To localize traffic effectively, content files that are likely to be requested by many clients should be cached locally. This paper presents a novel traffic engineering scheme for peer-assisted CDN models. Its key idea is to control the behavior of clients by using content-oriented incentive mechanism. This approach enables us to optimize traffic flows by letting altruistic clients download content files that are most likely contributed to localizing traffic among clients. In order to let altruistic clients request the desired files, we combine content files while keeping the price equal to the one for a single content. This paper presents a solution for optimizing the selection of content files to be combined so that cross traffic in a network is minimized. We also give a model for analyzing the upper-bound performance and the numerical results.

Long-distance wireless local area networks (WLANs) are the key enablers of wide-area and low-cost access networks in rural areas. In a WLAN, the long propagation delay between an access point (AP) and stations (STAs) significantly degrades the throughput and creates a throughput imbalance because the delay causes unexpected frame collisions. This paper summarizes the problems caused in the medium access control (MAC) mechanism of the WLAN by a long propagation delay. We propose a MAC protocol for solving the delay-induced throughput degradation and the throughput imbalance between the uplink and the downlink in WLANs to address these problems. In the protocol, the AP extends NAV duration of CTS frame to protect an ACK frame and transmits its data frame to avoid delay induced frame collisions by piggybacking on the ACK frame transmission. We also provide a throughput model for the proposed protocol based on the Bianchi model. A numerical analysis using the proposed throughput model and simulation evaluation demonstrate that the proposed protocol increases the system throughput by 150% compared with that obtained using the conventional method, and the uplink throughput can be increased to the same level as the downlink throughput.

Broadcast services for wireless local area networks (WLANs) are being standardized in the IEEE 802.11 task group bc. Envisaging the upcoming coexistence of broadcast access points (APs) with densely-deployed legacy APs, this paper addresses a learning-based spatial reuse with only partial receiver-awareness. This partial awareness means that the broadcast APs can leverage few acknowledgment frames (ACKs) from recipient stations (STAs). This is in view of the specific concerns of broadcast communications. In broadcast communications for a very large number of STAs, ACK implosions occur unless some STAs are stopped from responding with ACKs. Given this, the main contribution of this paper is to demonstrate the feasibility to improve the robustness of learning-based spatial reuse to hidden interferers only with the partial receiver-awareness while discarding any re-training of broadcast APs. The core idea is to leverage robust adversarial reinforcement learning (RARL), where before a hidden interferer is installed, a broadcast AP learns a rate adaptation policy in a competition with a proxy interferer that provides jamming signals intelligently. Therein, the recipient STAs experience interference and the partial STAs provide a feedback overestimating the effect of interference, allowing the broadcast AP to select a data rate to avoid frame losses in a broad range of recipient STAs. Simulations demonstrate the suppression of the throughput degradation under a sudden installation of a hidden interferer, indicating the feasibility of acquiring robustness to the hidden interferer.

Decentralized channel assignment schemes are proposed to obtain low system-wide spatial overlap regions in wireless local area networks (WLANs). The important point of channel assignment in WLANs is selecting channels with fewer contending stations rather than mitigating interference power due to its medium access control mechanism. This paper designs two potential game-based channel selection schemes, basically each access point (AP) selects a channel with smaller spatial overlaps with other APs. Owing to the property of potential games, each decentralized channel assignment is guaranteed to converge to a Nash equilibrium. In order that each AP selects a channel with smaller overlaps, two metrics are proposed: general overlap-based scheme yields the largest overlap reduction if a sufficient number of stations (STAs) to detect overlaps are available; whereas decomposed overlap-based scheme need not require such STAs, while the performance would be degraded due to the shadowing effect. In addition, the system-wide overlap area is analytically shown to be upper bounded by the negative potential functions, which derives the condition that local overlap reduction by each AP leads to system-wide overlap reduction. The simulation results confirm that the proposed schemes perform better reductions in the system-wide overlap area compared to the conventional interference power-based scheme under the spatially correlated shadowing effect. The experimental results demonstrate that the channel assignment dynamics converge to stable equilibria even in a real environment, particularly when uncontrollable APs exist.

Differential games are considered an extension of optimal control problems, which are used to formulate centralized control problems in smart grids. Optimal control theory is used to study systems consisting of one agent with one objective, whereas differential games are used to formulate systems consisting of multiple agents with multiple objectives. Therefore, a differential-game-theoretic approach is appropriate for formulating decentralized demand-side energy management systems where there are multiple decision-making entities interacting with each other. Moreover, in many smart grid applications, we need to obtain information for control via communication systems. To formulate the influence of communication availability, differential game theory is also promising because the availability of communication is considered as part of an information structure (i.e., feedback or open-loop) in differential games. The feedback information structure is adopted when information for control can be obtained, whereas the open-loop information structure is applied when the information cannot be obtained because of communication failure. This paper proposes a comprehensive framework for evaluating the performance of demand-side actors in a demand-side management system using each control scheme according to both communication availability and sampling frequency. Numerical analysis shows that the proposed comprehensive framework allows for an analysis of trade-off for decentralized and centralized control schemes.

Stochastic geometry analysis of wireless backhaul networks with beamforming in roadside environments is provided. In particular, a new model to analyze antenna gains, interference, and coverage in roadside environments of wireless networks with Poisson point process deployment of BSs is proposed. The received interference from the BSs with wired backhaul (referred to as anchored BS or A-BS) and the coverage probability of a typical BS are analyzed under different approximations of the location of the serving A-BS and combined antenna gains. Considering the beamforming, the coverage probability based on the aggregate interference consisting of the direct interference from the A-BSs and reflected interference from the BSs with wireless backhaul is also derived.

In this paper, a stochasic geometry analysis of the inversely proportional setting (IPS) of carrier sense threshold (CST) and transmission power for densely deployed wireless local area networks (WLANs) is presented. In densely deployed WLANs, CST adjustment is a crucial technology to enhance spatial reuse, but it can starve surrounding transmitters due to an asymmetric carrier sensing relationship. In order for the carrier sensing relationship to be symmetric, the IPS of the CST and transmission power is a promising approach, i.e., each transmitter jointly adjusts its CST and transmission power in order for their product to be equal to those of others. This setting is used for spatial reuse in IEEE 802.11ax. By assuming that the set of potential transmitters follows a Poisson point process, the impact of the IPS on throughput is formulated based on stochastic geometry in two scenarios: an adjustment at a single transmitter and an identical adjustment at all transmitters. The asymptotic expression of the throughput in dense WLANs is derived and an explicit solution of the optimal CST is achieved as a function of the number of neighboring potential transmitters and signal-to-interference power ratio using approximations. This solution was confirmed through numerical results, where the explicit solution achieved throughput penalties of less than 8% relative to the numerically evaluated optimal solution.

We discuss the division of radio resources in the time and frequency domains for wireless local area network (WLAN) devices powered with microwave energy. In general, there are two ways to avoid microwave power transmission (MPT) from influencing data communications: adjacent channel operation of continuous MPT and WLAN data transmission and co-channel operation of intermittent MPT and WLAN data transmission. Experimental results reveal that, even when we implement these methods, several problems arise because WLAN devices have been developed without supposing the existence of MPT. One problem clarified in our experiment is that adjacent channel operation at 2.4GHz does not necessarily perform well owing to the interference from MPT. This interference occurs regardless of the frequency separation at 2.4GHz. The other problem is that intermittent MPT could result in throughput degradation owing to the data rate control algorithm and the association scheme of the WLAN. In addition, the experimental results imply that a microwave energy source and a WLAN device should share information on the timings of intermittent MPT and data transmission to avoid buffer overflow.