Distributed limited feedback beamforming based on game theory in multiple-input multiple-output ad hoc networks

2011 ◽  
Vol 5 (7) ◽  
pp. 975-981 ◽  
Author(s):  
J.-H. Lee
2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Dimitrios Kosmanos ◽  
Nikolas Prodromou ◽  
Antonios Argyriou ◽  
Leandros A. Maglaras ◽  
Helge Janicke

Vehicular ad hoc networks have emerged as a promising field of research and development, since they will be able to accommodate a variety of applications, ranging from infotainment to traffic management and road safety. A specific security-related concern that vehicular ad hoc networks face is how to keep communication alive in the presence of radio frequency jamming, especially during emergency situations. Multiple Input Multiple Output techniques are proven to be able to improve some crucial parameters of vehicular communications such as communication range and throughput. In this article, we investigate how Multiple Input Multiple Output techniques can be used in vehicular ad hoc networks as active defense mechanisms in order to avoid jamming threats. For this reason, a variation of spatial multiplexing is proposed, namely, vSP4, which achieves not only high throughput but also a stable diversity gain upon the interference of a malicious jammer.


Author(s):  
Yiftach Richter ◽  
Itsik Bergel

AbstractIn this paper we consider opportunistic routing in multiple-input–multiple-output (MIMO) random wireless ad-hoc networks (WANETs). Our analysis uses a proper model of the physical layer together with an abstraction of the higher communication layers. We assume that the nodes are distributed according to a Poisson point process and consider a routing scheme that opportunistically selects the next relay and the number of spatially multiplexed data streams. The routing decisions are based on geographic locations, the channel gains of the neighbor nodes, and the statistical characterization of all other nodes. Unlike the single antenna case, the optimal routing scheme cannot be explicitly expressed. Hence, we propose a smart-routing scheme for MIMO that adapts the number of data streams per user to the channel conditions. The numerical results demonstrate that this scheme outperforms all previously published schemes for this scenario. The findings highlight the importance of channel state information for efficient routing, and the need for an adaptive selection of the number of data streams at each transmitter.


2011 ◽  
Vol 3 (1) ◽  
pp. 14-36 ◽  
Author(s):  
Antonis Michalas ◽  
Nikos Komninos ◽  
Neeli R. Prasad

This paper proposes a technique to defeat Denial of Service (DoS) and Distributed Denial of Service (DDoS) attacks in Ad Hoc Networks. The technique is divided into two main parts and with game theory and cryptographic puzzles. Introduced first is a new client puzzle to prevent DoS attacks in such networks. The second part presents a multiplayer game that takes place between the nodes of an ad hoc network and based on fundamental principles of game theory. By combining computational problems with puzzles, improvement occurs in the efficiency and latency of the communicating nodes and resistance in DoS and DDoS attacks. Experimental results show the effectiveness of the approach for devices with limited resources and for environments like ad hoc networks where nodes must exchange information quickly.


Sign in / Sign up

Export Citation Format

Share Document