"Table of Contents," in 

IEEE Transactions on Wireless Communications, vol. 15, no. 5,

pp. C1-3102, May 2016.
doi: 10.1109/TWC.2016.2545318
Abstract: Presents the table of contents for this issue of the publication.
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7466436&isnumber=7466418

"IEEE Transactions on Wireless Communications," in IEEE Transactions on Wireless

Communications, vol. 15, no. 5, pp. C2-C2, May 2016.
doi: 10.1109/TWC.2016.2545319
Abstract: Provides a listing of the editors, board members, and current staff for this
issue of the publication.
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7466437&isnumber=7466418

S. Cui, H. Yousefi'zadeh and X. Gu, "An optimal power control algorithm for STDMA
MAC protocols in multihop wireless networks," in IEEE Transactions on Wireless
Communications, vol. 15, no. 5, pp. 3131-3142, May 2016.
doi: 10.1109/TWC.2016.2517162
Abstract: Multihop spatial time division multiple access (STDMA) medium access
control (MAC) protocols constitute an important building block of wireless networks.
There are not many practical power control algorithms that can optimally tradeoff
power consumption against transmission rates with a reasonable computational
complexity. In this paper, we introduce an energy-efficient distributed power control
algorithm for STDMA MAC protocols. The motivation for this study is two fold,
namely, maximizing the spatial reuse of the system resources and maximizing power
efficiency. We develop a mathematical formulation for maximizing spatial reuse and
power efficiency under discrete SINR and rate constrains. After proving that power is
a convex function of data rates in our problem, we demonstrate that our problem in
simultaneous transmission environments can be reduced to a linear programming
(LP) problem. Then, we solve this LP problem using dynamic programming (DP).
Finally, based on our proposed solution, we propose a low complexity optimal power
control (OPC) algorithm which can be generically embedded within any existing
STDMA MAC protocol. Through analytical and experimental studies, we show that
our power control algorithm cannot only significantly improve the throughput,
power consumption, and delay performance of STDMA MAC protocols compared to
their baseline alternatives, but also outperform existing STDMA algorithms.
keywords: {computational complexity;convex programming;distributed
control;dynamic programming;energy conservation;linear programming;optimal
control;power consumption;power control;radio networks;telecommunication
power management;time division multiple access;DP;LP problem;OPC
algorithm;STDMA MAC protocol;computational complexity;convex function;discrete
SINR;dynamic programming;energy-efficient distributed optimal power control
algorithm;linear programming problem;mathematical formulation;multihop spatial
time division multiple access medium access control protocol;multihop wireless
network;power consumption;power efficiency maximization;rate constrain;system
resource spatial reuse maximization;Complexity theory;Heuristic
algorithms;Interference;Media Access Protocol;Power control;Signal to noise
ratio;Wireless networks;Dynamic Programming;Linear
Programming;STDMA;dynamic programming;linear programming;optimal power
control;rate adaptive},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7379004&isnumber=7466418

B. Wang, J. Zhu, L. T. Yang and Y. Mo, "Sensor Density for Confident Information
Coverage in Randomly Deployed Sensor Networks," in IEEE Transactions on Wireless
Communications, vol. 15, no. 5, pp. 3238-3250, May 2016.
doi: 10.1109/TWC.2016.2518689
Abstract: Coverage is one of the fundamental issues in wireless sensor networks, yet
most of the current studies on coverage are based on the simplest disk coverage
model. Based on the theory of field reconstruction, we proposed a novel coverage
model called confident information coverage in our previous study. In this paper,
based on the confident information coverage model, we study the critical sensor
density to achieve complete coverage in randomly deployed sensor networks. We
first use the average vacancy to measure the degree of coverage, and compute the
average vacancy through the computation of the probability that an arbitrary point is
not covered by randomly deployed sensors within its correlation range. We then
propose a numerical computation method called discrete approximation algorithm
to compute this probability, and prove that this probability is actually the limit of the
output of the proposed algorithm. Furthermore, we derive the upper and lower
bound for the average vacancy as a function of sensor density, which provides a
useful insight for the critical sensor density to achieve complete coverage. The
simulation results validate our theoretical analysis.
keywords: {approximation theory;wireless sensor networks;confident information
coverage;critical sensor density;discrete approximation algorithm;numerical
computation method;randomly deployed sensor networks;sensor density;simplest
disk coverage model;wireless sensor networks;Approximation
algorithms;Computational modeling;Correlation;Monitoring;Temperature
sensors;Wireless sensor networks;Sensor density;confident information
coverage;random network deployment;wireless sensor networks},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7384534&isnumber=7466418

M. Nikolov and Z. J. Haas, "Relay Placement in Wireless Networks: Minimizing

Communication Cost," in IEEE Transactions on Wireless Communications, vol. 15, no.
5, pp. 3587-3602, May 2016.
doi: 10.1109/TWC.2016.2523984
Abstract: Given n source nodes and k relay nodes, we model the optimal relay
topology problem allowing for simultaneous optimization of the relay node locations
and traffic through the network, so that the overall number of packet
retransmissions is minimized. We argue that state-of-the-art models and algorithms
for relay placement in wireless networks do not reflect salient characteristics of the
optimal relays topology and lead to suboptimal solutions. We do not constrain the
position of relays to a finite set of discrete points, as the latter may not be feasible in
practical networks. In this case, we show that just listing a set of feasible sites for the
relays is already at least APX-hard. Exploiting convexity in a special case of the
network communication cost function, we give an optimal algorithm for the relay
placement problem. However, the algorithm is exponential on the number of nodes
in the network. We suggest a practical heuristic algorithm for relay placement:
RePlace. We compare RePlace numerically to the optimal algorithm and show that
RePlace achieves the optimal or almost optimal solutions. We implement RePlace in
the full network stack simulator JiST/SWANS. The relay topologies generated by
RePlace eliminate overhead communication cost almost entirely.
keywords: {radio networks;relay networks (telecommunication);telecommunication
network topology;APX-hard;RePlace;heuristic algorithm;k relay nodes;optimal relay
topology problem;relay placement;source nodes;wireless networks;Network
topology;Relays;Routing;Sensors;Steiner trees;Topology;Wireless
communication;Relays;combinatorial optimization;communication
cost;relays;reliability;throughput maximization;wireless networks},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7398148&isnumber=7466418

R. K. Mungara, X. Zhang, A. Lozano and R. W. Heath, "Analytical Characterization of

ITLinQ: Channel Allocation for Device-to-Device Communication Networks," in IEEE
Transactions on Wireless Communications, vol. 15, no. 5, pp. 3603-3615, May 2016.
doi: 10.1109/TWC.2016.2523987
Abstract: Device-to-device (D2D) communication allows serving local wireless traffic
bypassing the system's infrastructure. One way to control the interference in D2D
networks is to carefully channelize transmissions. This paper presents an analytical
characterization of ITLinQ, one of the principal D2D channelization schemes
proposed to date. Recognizing that it captures well the spatial characteristics of D2D
networks, a stochastic geometry setting is utilized for this analysis. The derived
expressions enable gleaning insights on how ITLinQ avoids situations of excessive
interference, and they facilitate optimizing the controllable parameters of ITLinQ so
as to maximize the system spectral efficiency (bits/s/Hz per unit area). With the
parameters thus optimized, the ultimate performance of ITLinQ can be evaluated
with respect to other D2D channel allocation schemes. In particular, performance
evaluation comparisons with the FlashLinQ scheme are provided, and the gains with
respect to an unchannelized network are quantified.
keywords: {channel allocation;radio networks;D2D communication;FlashLinQ
scheme;ITLinQ;channel allocation scheme;device-to-device communication
networks;local wireless traffic;principal D2D channelization schemes;stochastic
geometry;Channel allocation;Geometry;Interference;Receivers;Signal to noise
ratio;Transmitters;Wireless communication;FlashLinQ;ITLinQ;Poisson point
process;channel allocation;channelization;spectral efficiency;stochastic geometry},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7399766&isnumber=7466418

P. Zhou and T. Jiang, "Toward Optimal Adaptive Wireless Communications in

Unknown Environments," in IEEE Transactions on Wireless Communications, vol. 15,
no. 5, pp. 3655-3667, May 2016.
doi: 10.1109/TWC.2016.2524638
Abstract: Designing efficient channel access schemes for wireless communications
without any prior knowledge about the nature of environments has been a very
challenging issue, in which the channel state distribution of all spectrum resources
could be entirely or partially stochastic or adversarial at different times and
locations. In this paper, we propose an online learning algorithm for adaptive
channel access of wireless communications in unknown environments based on the
theory of multiarmed bandits (MAB) problems. By automatically tuning two control
parameters, i.e., learning rate and exploration probability, our algorithms could find
the optimal channel access strategies and achieve the almost optimal learning
performance over time in different scenarios. The quantitative performance studies
indicate the superior throughput gain when compared with previous solutions and
the flexibility of our algorithm in practice, which is resilient to both oblivious and
adaptive jamming attacks with different intelligence and attacking strength that
ranges from no-attack to the full-attack of all spectrum resources. We conduct
extensive simulations to validate our theoretical analysis.
keywords: {jamming;learning (artificial intelligence);multi-access systems;multiuser
channels;probability;radiocommunication;telecommunication security;MAB
problem;adaptive channel access scheme;adaptive jamming attack;channel state
distribution;exploration probability;multiarmed bandit;online learning
algorithm;optimal adaptive wireless communication;optimal channel access
strategy;optimal learning performance;spectrum resource;throughput gain;unknown
environment;Algorithm design and analysis;Communication system
security;Jamming;Receivers;Stochastic processes;Wireless networks;Online
learning;jamming attack;security;stochastic and adversarial bandits;wireless
communications},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7398139&isnumber=7466418

J. Ren, Y. Zhang, K. Zhang and X. Shen, "Adaptive and Channel-Aware Detection of

Selective Forwarding Attacks in Wireless Sensor Networks," in IEEE Transactions on
Wireless Communications, vol. 15, no. 5, pp. 3718-3731, May 2016.
doi: 10.1109/TWC.2016.2526601
Abstract: Wireless sensor networks (WSNs) are vulnerable to selective forwarding
attacks that can maliciously drop a subset of forwarding packets to degrade network
performance and jeopardize the information integrity. Meanwhile, due to the
unstable wireless channel in WSNs, the packet loss rate during the communication of
sensor nodes may be high and vary from time to time. It poses a great challenge to
distinguish the malicious drop and normal packet loss. In this paper, we propose a
channel-aware reputation system with adaptive detection threshold (CRS-A) to
detect selective forwarding attacks in WSNs. The CRS-A evaluates the data
forwarding behaviors of sensor nodes, according to the deviation of the monitored
packet loss and the estimated normal loss. To optimize the detection accuracy of
CRS-A, we theoretically derive the optimal threshold for forwarding evaluation,
which is adaptive to the time-varied channel condition and the estimated attack
probabilities of compromised nodes. Furthermore, an attack-tolerant data
forwarding scheme is developed to collaborate with CRS-A for stimulating the
forwarding cooperation of compromised nodes and improving the data delivery ratio
of the network. Extensive simulation results demonstrate that CRS-A can accurately
detect selective forwarding attacks and identify the compromised sensor nodes,
while the attack-tolerant data forwarding scheme can significantly improve the data
delivery ratio of the network.
keywords: {telecommunication security;wireless channels;wireless sensor
networks;CRS-A;WSN;adaptive aware detection;adaptive detection threshold;attack-
tolerant data forwarding scheme;channel aware detection;forwarding
packets;information integrity;monitored packet loss;selective forwarding
attacks;sensor nodes;time-varied channel condition;wireless channel;wireless sensor
networks;Adaptive systems;Monitoring;Packet loss;Routing;Wireless
communication;Wireless sensor networks;Wireless sensor network;channel-
aware;packet dropping;reputation system;routing;selective forwarding
attack;wireless sensor network},
URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?
tp=&arnumber=7401098&isnumber=7466418