Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission

Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes to create a virtual multiple-input/multiple-output (MIMO) system. Extending the lifetime of networks composed of battery-operated nodes is a key issue in the design and operation of wireless sensor networks. This paper considers the effects on network lifetime of allowing closely located nodes to use CB/CT to reduce the load or even to avoid packet-forwarding requests to nodes that have critical battery life. First, the effectiveness of CB/CT in improving the signal strength at a faraway destination using energy in nearby nodes is studied. Then, the performance improvement obtained by this technique is analyzed for a special 2D disk case. Further, for general networks in which information-generation rates are fixed, a new routing problem is formulated as a linear programming problem, while for other general networks, the cost for routing is dynamically adjusted according to the amount of energy remaining and the effectiveness of CB/CT. From the analysis and the simulation results, it is seen that the proposed method can reduce the payloads of energy-depleting nodes by about 90% in the special case network considered and improve the lifetimes of general networks by about 10%, compared with existing techniques.Comment: Invited paper to appear in the IEE Proceedings: Microwaves, Antennas and Propagation, Special Issue on Antenna Systems and Propagation for Future Wireless Communication

Full-duplex MAC Protocol Design and Analysis

The idea of in-band full-duplex (FD) communications revives in recent years owing to the significant progress in the self-interference cancellation and hardware design techniques, offering the potential to double spectral efficiency. The adaptations in upper layers are highly demanded in the design of FD communication systems. In this letter, we propose a novel medium access control (MAC) using FD techniques that allows transmitters to monitor the channel usage while transmitting, and backoff as soon as collision happens. Analytical saturation throughput of the FD-MAC protocol is derived with the consideration of imperfect sensing brought by residual self- interference (RSI) in the PHY layer. Both analytical and simulation results indicate that the normalized saturation throughput of the proposed FD-MAC can significantly outperforms conventional CSMA/CA under various network conditions

Matching Theory for Future Wireless Networks: Fundamentals and Applications

The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce spectral resources has become a prevalent theme in many emerging wireless systems. In this paper, the first comprehensive tutorial on the use of matching theory, a Nobelprize winning framework, for resource management in wireless networks is developed. To cater for the unique features of emerging wireless networks, a novel, wireless-oriented classification of matching theory is proposed. Then, the key solution concepts and algorithmic implementations of this framework are exposed. Then, the developed concepts are applied in three important wireless networking areas in order to demonstrate the usefulness of this analytical tool. Results show how matching theory can effectively improve the performance of resource allocation in all three applications discussed

Nucleation threshold and deactivation mechanisms of nanoscopic cavitation nuclei

The acoustic nucleation threshold for bubbles trapped in cavities has theoretically been predicted within the crevice theory by Atchley and Prosperetti [“The crevice model of bubble nucleation,” J. Acoust. Soc. Am. 86, 1065 (1989)]. Here, we determine this threshold experimentally, by applying\ud a single pressure pulse to bubbles trapped in cylindrical nanoscopic pits (“artificial crevices”) with radii down to 50 nm. By decreasing the minimum pressure stepwise, we observe the threshold for which the bubbles start to nucleate. The experimental results are quantitatively in good agreement with the theoretical predictions of Atchley and Prosperetti. In addition, we provide the mechanism which explains the deactivation of cavitation nuclei: gas diffusion together with an aspherical bubble collapse. Finally, we present superhydrophobic nuclei which cannot be deactivated, unless with a high-speed liquid jet directed into the pit

Optimal Taylor-Couette flow: Radius ratio dependence

Taylor-Couette flow with independently rotating inner (i) and outer (o) cylinders is explored numerically and experimentally to determine the effects of the radius ratio {\eta} on the system response. Numerical simulations reach Reynolds numbers of up to Re_i=9.5 x 10^3 and Re_o=5x10^3, corresponding to Taylor numbers of up to Ta=10^8 for four different radius ratios {\eta}=r_i/r_o between 0.5 and 0.909. The experiments, performed in the Twente Turbulent Taylor-Couette (T^3C) setup, reach Reynolds numbers of up to Re_i=2x10^6$ and Re_o=1.5x10^6, corresponding to Ta=5x10^{12} for {\eta}=0.714-0.909. Effective scaling laws for the torque J^{\omega}(Ta) are found, which for sufficiently large driving Ta are independent of the radius ratio {\eta}. As previously reported for {\eta}=0.714, optimum transport at a non-zero Rossby number Ro=r_i|{\omega}_i-{\omega}_o|/[2(r_o-r_i){\omega}_o] is found in both experiments and numerics. Ro_opt is found to depend on the radius ratio and the driving of the system. At a driving in the range between {Ta\sim3\cdot10^8} and {Ta\sim10^{10}}, Ro_opt saturates to an asymptotic {\eta}-dependent value. Theoretical predictions for the asymptotic value of Ro_{opt} are compared to the experimental results, and found to differ notably. Furthermore, the local angular velocity profiles from experiments and numerics are compared, and a link between a flat bulk profile and optimum transport for all radius ratios is reported.Comment: Submitted to JFM, 28 pages, 17 figure

Direct numerical simulation of Taylor-Couette flow with grooved walls: torque scaling and flow structure

We present direct numerical simulations of Taylor-Couette flow with grooved walls at a fixed radius ratio $\eta=r_i/r_o=0.714$ with inner cylinder Reynolds number up to $Re_i=3.76\times10^4$, corresponding to Taylor number up to $Ta=2.15\times10^9$. The grooves are axisymmetric V-shaped obstacles attached to the wall with a tip angle of $90^\circ$. Results are compared to the smooth wall case in order to investigate the effects of grooves on Taylor-Couette flow. We focus on the effective scaling laws for the torque, flow structures, and boundary layers. It is found that, when the groove height is smaller than the boundary layer thickness, the torque is the same as that of the smooth wall cases. With increasing $Ta$, the boundary layer thickness becomes smaller than the groove height. Plumes are ejected from the tips of the grooves and secondary circulations between the latter are formed. This is associated to a sharp increase of the torque and thus the effective scaling law for the torque vs. $Ta$ becomes much steeper. Further increasing $Ta$ does not result in an additional slope increase. Instead, the effective scaling law saturates to the "ultimate" regime effective exponents seen for smooth walls. It is found that even though after saturation the slope is the same as for the smooth wall case, the absolute value of torque is increased, and the more the larger size of the grooves.Comment: Accepted by JFM, 27 pages, 23 figure

Coalition Formation Games for Collaborative Spectrum Sensing

Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the detection of the primary user (PU) and maintaining a reasonable false alarm probability (e.g., for maintaining a good spectrum utilization). In this paper, we study the impact of this tradeoff on the network structure and the cooperative incentives of the SUs that seek to cooperate for improving their detection performance. We model the CSS problem as a non-transferable coalitional game, and we propose distributed algorithms for coalition formation. First, we construct a distributed coalition formation (CF) algorithm that allows the SUs to self-organize into disjoint coalitions while accounting for the CSS tradeoff. Then, the CF algorithm is complemented with a coalitional voting game for enabling distributed coalition formation with detection probability guarantees (CF-PD) when required by the PU. The CF-PD algorithm allows the SUs to form minimal winning coalitions (MWCs), i.e., coalitions that achieve the target detection probability with minimal costs. For both algorithms, we study and prove various properties pertaining to network structure, adaptation to mobility and stability. Simulation results show that CF reduces the average probability of miss per SU up to 88.45% relative to the non-cooperative case, while maintaining a desired false alarm. For CF-PD, the results show that up to 87.25% of the SUs achieve the required detection probability through MWCComment: IEEE Transactions on Vehicular Technology, to appea

Network Formation Games Among Relay Stations in Next Generation Wireless Networks

The introduction of relay station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's long term evolution advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the RSs and their serving base station in the \emph{uplink} of the next generation wireless multi-hop systems. Unlike existing literature which mainly focused on performance analysis, we propose a distributed algorithm for studying the \emph{structure} and \emph{dynamics} of the network. We formulate a network formation game among the RSs whereby each RS aims to maximize a cross-layer utility function that takes into account the benefit from cooperative transmission, in terms of reduced bit error rate, and the costs in terms of the delay due to multi-hop transmission. For forming the tree structure, a distributed myopic algorithm is devised. Using the proposed algorithm, each RS can individually select the path that connects it to the BS through other RSs while optimizing its utility. We show the convergence of the algorithm into a Nash tree network, and we study how the RSs can adapt the network's topology to environmental changes such as mobility or the deployment of new mobile stations. Simulation results show that the proposed algorithm presents significant gains in terms of average utility per mobile station which is at least 17.1% better relatively to the case with no RSs and reaches up to 40.3% improvement compared to a nearest neighbor algorithm (for a network with 10 RSs). The results also show that the average number of hops does not exceed 3 even for a network with up to 25 RSs.Comment: IEEE Transactions on Communications, vol. 59, no. 9, pp. 2528-2542, September 201

Coalitional Games with Overlapping Coalitions for Interference Management in Small Cell Networks

In this paper, we study the problem of cooperative interference management in an OFDMA two-tier small cell network. In particular, we propose a novel approach for allowing the small cells to cooperate, so as to optimize their sum-rate, while cooperatively satisfying their maximum transmit power constraints. Unlike existing work which assumes that only disjoint groups of cooperative small cells can emerge, we formulate the small cells' cooperation problem as a coalition formation game with overlapping coalitions. In this game, each small cell base station can choose to participate in one or more cooperative groups (or coalitions) simultaneously, so as to optimize the tradeoff between the benefits and costs associated with cooperation. We study the properties of the proposed overlapping coalition formation game and we show that it exhibits negative externalities due to interference. Then, we propose a novel decentralized algorithm that allows the small cell base stations to interact and self-organize into a stable overlapping coalitional structure. Simulation results show that the proposed algorithm results in a notable performance advantage in terms of the total system sum-rate, relative to the noncooperative case and the classical algorithms for coalitional games with non-overlapping coalitions

Coalition Formation Games for Distributed Cooperation Among Roadside Units in Vehicular Networks

Vehicle-to-roadside (V2R) communications enable vehicular networks to support a wide range of applications for enhancing the efficiency of road transportation. While existing work focused on non-cooperative techniques for V2R communications between vehicles and roadside units (RSUs), this paper investigates novel cooperative strategies among the RSUs in a vehicular network. We propose a scheme whereby, through cooperation, the RSUs in a vehicular network can coordinate the classes of data being transmitted through V2R communications links to the vehicles. This scheme improves the diversity of the information circulating in the network while exploiting the underlying content-sharing vehicle-to-vehicle communication network. We model the problem as a coalition formation game with transferable utility and we propose an algorithm for forming coalitions among the RSUs. For coalition formation, each RSU can take an individual decision to join or leave a coalition, depending on its utility which accounts for the generated revenues and the costs for coalition coordination. We show that the RSUs can self-organize into a Nash-stable partition and adapt this partition to environmental changes. Simulation results show that, depending on different scenarios, coalition formation presents a performance improvement, in terms of the average payoff per RSU, ranging between 20.5% and 33.2%, relative to the non-cooperative case.Comment: accepted and to appear in IEEE Journal on Selected Areas in Communications (JSAC), Special issue on Vehicular Communications and Network