Sorry, you need to enable JavaScript to visit this website.

Communications and Networking

A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION


We consider the problem of secrecy rate maximization in a multi-input multi-output multi-eavesdropper (MIMOME) wiretap channel and present an exact solution. A general system model with a multi-antenna eavesdropper and a multi-antenna full-duplex receiver is considered. In particular, we perform joint beamforming and artificial noise optimization in an effort to maximize the achievable secrecy rate. The optimization is performed in the presence of artificial noise generated by both transmitter and legitimate receiver. The resulting optimization problem is non-convex and difficult to solve.

Paper Details

Authors:
Mudassir Masood, Ali Ghrayeb, Prabhu Babu, Issa Khalil, Mazen Hasna
Submitted On:
7 December 2016 - 2:36am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

A Minorization-Maximization (MM) Algorithm for artificial-noise (AN)-based MIMOME secrecy rate maximization

(408)

Subscribe

[1] Mudassir Masood, Ali Ghrayeb, Prabhu Babu, Issa Khalil, Mazen Hasna, "A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1398. Accessed: Feb. 26, 2020.
@article{1398-16,
url = {http://sigport.org/1398},
author = {Mudassir Masood; Ali Ghrayeb; Prabhu Babu; Issa Khalil; Mazen Hasna },
publisher = {IEEE SigPort},
title = {A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION},
year = {2016} }
TY - EJOUR
T1 - A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION
AU - Mudassir Masood; Ali Ghrayeb; Prabhu Babu; Issa Khalil; Mazen Hasna
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1398
ER -
Mudassir Masood, Ali Ghrayeb, Prabhu Babu, Issa Khalil, Mazen Hasna. (2016). A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION. IEEE SigPort. http://sigport.org/1398
Mudassir Masood, Ali Ghrayeb, Prabhu Babu, Issa Khalil, Mazen Hasna, 2016. A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION. Available at: http://sigport.org/1398.
Mudassir Masood, Ali Ghrayeb, Prabhu Babu, Issa Khalil, Mazen Hasna. (2016). "A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION." Web.
1. Mudassir Masood, Ali Ghrayeb, Prabhu Babu, Issa Khalil, Mazen Hasna. A MINORIZATION-MAXIMIZATION (MM) ALGORITHM FOR ARTIFICIAL NOISE (AN)-BASED MIMOME SECRECY RATE MAXIMIZATION [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1398

Blind channel gain cartography


Channel gain cartography relies on sensor measurements to construct maps providing the attenuation between arbitrary transmitter-receiver locations. A number of applications involving interference control, such as wireless network planning or cognitive radio, can benet from channel gain maps. Existing approaches capitalize on tomographic models, where shadowing is the weighted integral of a spatial loss eld (SLF) that depends on the propagation environment.

Paper Details

Authors:
Daniel Romero, Donghoon Lee, Georgios B. Giannakis
Submitted On:
7 December 2016 - 10:44am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Globalsip16_Blind CG cartography_final.pdf

(95)

Subscribe

[1] Daniel Romero, Donghoon Lee, Georgios B. Giannakis, "Blind channel gain cartography", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1395. Accessed: Feb. 26, 2020.
@article{1395-16,
url = {http://sigport.org/1395},
author = {Daniel Romero; Donghoon Lee; Georgios B. Giannakis },
publisher = {IEEE SigPort},
title = {Blind channel gain cartography},
year = {2016} }
TY - EJOUR
T1 - Blind channel gain cartography
AU - Daniel Romero; Donghoon Lee; Georgios B. Giannakis
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1395
ER -
Daniel Romero, Donghoon Lee, Georgios B. Giannakis. (2016). Blind channel gain cartography. IEEE SigPort. http://sigport.org/1395
Daniel Romero, Donghoon Lee, Georgios B. Giannakis, 2016. Blind channel gain cartography. Available at: http://sigport.org/1395.
Daniel Romero, Donghoon Lee, Georgios B. Giannakis. (2016). "Blind channel gain cartography." Web.
1. Daniel Romero, Donghoon Lee, Georgios B. Giannakis. Blind channel gain cartography [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1395

CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING

Paper Details

Authors:
Huiting Su, Shengqian Han, Chenyang Yang
Submitted On:
6 December 2016 - 9:01pm
Short Link:
Type:
Event:

Document Files

FD_Poster.pdf

(379)

Subscribe

[1] Huiting Su, Shengqian Han, Chenyang Yang, "CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1384. Accessed: Feb. 26, 2020.
@article{1384-16,
url = {http://sigport.org/1384},
author = {Huiting Su; Shengqian Han; Chenyang Yang },
publisher = {IEEE SigPort},
title = {CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING},
year = {2016} }
TY - EJOUR
T1 - CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING
AU - Huiting Su; Shengqian Han; Chenyang Yang
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1384
ER -
Huiting Su, Shengqian Han, Chenyang Yang. (2016). CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING. IEEE SigPort. http://sigport.org/1384
Huiting Su, Shengqian Han, Chenyang Yang, 2016. CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING. Available at: http://sigport.org/1384.
Huiting Su, Shengqian Han, Chenyang Yang. (2016). "CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING." Web.
1. Huiting Su, Shengqian Han, Chenyang Yang. CACHING POLICY OPTIMIZATION FOR RATE ADAPTIVE VIDEO STREAMING [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1384

Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks

Paper Details

Authors:
Yuan Liang, Tianlong Song, Tongtong Li
Submitted On:
6 December 2016 - 12:47pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

slides.pdf

(1187)

Subscribe

[1] Yuan Liang, Tianlong Song, Tongtong Li, "Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1370. Accessed: Feb. 26, 2020.
@article{1370-16,
url = {http://sigport.org/1370},
author = {Yuan Liang; Tianlong Song; Tongtong Li },
publisher = {IEEE SigPort},
title = {Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks},
year = {2016} }
TY - EJOUR
T1 - Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks
AU - Yuan Liang; Tianlong Song; Tongtong Li
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1370
ER -
Yuan Liang, Tianlong Song, Tongtong Li. (2016). Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks. IEEE SigPort. http://sigport.org/1370
Yuan Liang, Tianlong Song, Tongtong Li, 2016. Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks. Available at: http://sigport.org/1370.
Yuan Liang, Tianlong Song, Tongtong Li. (2016). "Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks." Web.
1. Yuan Liang, Tianlong Song, Tongtong Li. Energy Efficient Multi-Hop Wireless Backhaul in Heterogeneous Cellular Networks [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1370

Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples

Paper Details

Authors:
Silvija Kokalj-Filipovic, Crystal Acosta, Michael Pepe
Submitted On:
6 December 2016 - 12:30pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

GlobalSIPNS3HSMMtalk.pdf

(365)

Subscribe

[1] Silvija Kokalj-Filipovic, Crystal Acosta, Michael Pepe, "Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1369. Accessed: Feb. 26, 2020.
@article{1369-16,
url = {http://sigport.org/1369},
author = {Silvija Kokalj-Filipovic; Crystal Acosta; Michael Pepe },
publisher = {IEEE SigPort},
title = {Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples},
year = {2016} }
TY - EJOUR
T1 - Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples
AU - Silvija Kokalj-Filipovic; Crystal Acosta; Michael Pepe
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1369
ER -
Silvija Kokalj-Filipovic, Crystal Acosta, Michael Pepe. (2016). Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples. IEEE SigPort. http://sigport.org/1369
Silvija Kokalj-Filipovic, Crystal Acosta, Michael Pepe, 2016. Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples. Available at: http://sigport.org/1369.
Silvija Kokalj-Filipovic, Crystal Acosta, Michael Pepe. (2016). "Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples." Web.
1. Silvija Kokalj-Filipovic, Crystal Acosta, Michael Pepe. Learning Structural Properties of Wireless Ad-Hoc Networks Non-Parametrically from Spectral Activity Samples [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1369

A New Perspective on Randomized Gossip Algorithms


In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how the Randomized Block Kaczmarz (RBK) method—a method for solving linear systems—works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case.

Paper Details

Authors:
Nicolas Loizou, Peter Richtarik
Submitted On:
5 December 2016 - 8:10am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

PosterGlobalSip.pdf

(734)

Subscribe

[1] Nicolas Loizou, Peter Richtarik , "A New Perspective on Randomized Gossip Algorithms", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1345. Accessed: Feb. 26, 2020.
@article{1345-16,
url = {http://sigport.org/1345},
author = {Nicolas Loizou; Peter Richtarik },
publisher = {IEEE SigPort},
title = {A New Perspective on Randomized Gossip Algorithms},
year = {2016} }
TY - EJOUR
T1 - A New Perspective on Randomized Gossip Algorithms
AU - Nicolas Loizou; Peter Richtarik
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1345
ER -
Nicolas Loizou, Peter Richtarik . (2016). A New Perspective on Randomized Gossip Algorithms. IEEE SigPort. http://sigport.org/1345
Nicolas Loizou, Peter Richtarik , 2016. A New Perspective on Randomized Gossip Algorithms. Available at: http://sigport.org/1345.
Nicolas Loizou, Peter Richtarik . (2016). "A New Perspective on Randomized Gossip Algorithms." Web.
1. Nicolas Loizou, Peter Richtarik . A New Perspective on Randomized Gossip Algorithms [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1345

A New Perspective on Randomized Gossip Algorithms


In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how the Randomized Block Kaczmarz (RBK) method—a method for solving linear systems—works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case.

Paper Details

Authors:
Nicolas Loizou, Peter Richtarik
Submitted On:
5 December 2016 - 8:10am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

PosterGlobalSip.pdf

(734)

Subscribe

[1] Nicolas Loizou, Peter Richtarik , "A New Perspective on Randomized Gossip Algorithms", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1344. Accessed: Feb. 26, 2020.
@article{1344-16,
url = {http://sigport.org/1344},
author = {Nicolas Loizou; Peter Richtarik },
publisher = {IEEE SigPort},
title = {A New Perspective on Randomized Gossip Algorithms},
year = {2016} }
TY - EJOUR
T1 - A New Perspective on Randomized Gossip Algorithms
AU - Nicolas Loizou; Peter Richtarik
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1344
ER -
Nicolas Loizou, Peter Richtarik . (2016). A New Perspective on Randomized Gossip Algorithms. IEEE SigPort. http://sigport.org/1344
Nicolas Loizou, Peter Richtarik , 2016. A New Perspective on Randomized Gossip Algorithms. Available at: http://sigport.org/1344.
Nicolas Loizou, Peter Richtarik . (2016). "A New Perspective on Randomized Gossip Algorithms." Web.
1. Nicolas Loizou, Peter Richtarik . A New Perspective on Randomized Gossip Algorithms [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1344

A New Perspective on Randomized Gossip Algorithms


In this short note we propose a new approach for the design and analysis of randomized gossip algorithms which can be used to solve the average consensus problem. We show how the Randomized Block Kaczmarz (RBK) method—a method for solving linear systems—works as gossip algorithm when applied to a special system encoding the underlying network. The famous pairwise gossip algorithm arises as a special case.

Paper Details

Authors:
Nicolas Loizou, Peter Richtarik
Submitted On:
5 December 2016 - 8:10am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

PosterGlobalSip.pdf

(734)

Subscribe

[1] Nicolas Loizou, Peter Richtarik , "A New Perspective on Randomized Gossip Algorithms", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1343. Accessed: Feb. 26, 2020.
@article{1343-16,
url = {http://sigport.org/1343},
author = {Nicolas Loizou; Peter Richtarik },
publisher = {IEEE SigPort},
title = {A New Perspective on Randomized Gossip Algorithms},
year = {2016} }
TY - EJOUR
T1 - A New Perspective on Randomized Gossip Algorithms
AU - Nicolas Loizou; Peter Richtarik
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1343
ER -
Nicolas Loizou, Peter Richtarik . (2016). A New Perspective on Randomized Gossip Algorithms. IEEE SigPort. http://sigport.org/1343
Nicolas Loizou, Peter Richtarik , 2016. A New Perspective on Randomized Gossip Algorithms. Available at: http://sigport.org/1343.
Nicolas Loizou, Peter Richtarik . (2016). "A New Perspective on Randomized Gossip Algorithms." Web.
1. Nicolas Loizou, Peter Richtarik . A New Perspective on Randomized Gossip Algorithms [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1343

Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks


We address the inter-cell interference coordination for the indoor multi-color visible light communication (VLC) network under lighting constraints. In the multi-color VLC system, soft frequency reuse-based interference coordination is adopted, which adjusts the AC powers of the cell-edge components and the cell-center components. To further improve the system throughput in the environment of dense LED deployment, we propose the dynamic scheduler for the inter-cell interference coordination.

Paper Details

Authors:
Chen Gong, Qian Gao, Zhengyuan Xu
Submitted On:
4 December 2016 - 11:27am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

KaixiongZhou_GlobalSIP2016_report.pdf

(330)

Subscribe

[1] Chen Gong, Qian Gao, Zhengyuan Xu, "Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1338. Accessed: Feb. 26, 2020.
@article{1338-16,
url = {http://sigport.org/1338},
author = {Chen Gong; Qian Gao; Zhengyuan Xu },
publisher = {IEEE SigPort},
title = {Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks},
year = {2016} }
TY - EJOUR
T1 - Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks
AU - Chen Gong; Qian Gao; Zhengyuan Xu
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1338
ER -
Chen Gong, Qian Gao, Zhengyuan Xu. (2016). Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks. IEEE SigPort. http://sigport.org/1338
Chen Gong, Qian Gao, Zhengyuan Xu, 2016. Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks. Available at: http://sigport.org/1338.
Chen Gong, Qian Gao, Zhengyuan Xu. (2016). "Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks." Web.
1. Chen Gong, Qian Gao, Zhengyuan Xu. Inter-cell Interference Coordination for Multi-color Visible Light Communication Networks [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1338

Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel


This paper studies the achievable rate of a relay- assisted optical wireless communication channel, and presents a novel discrete signaling method by our proposed symbol-number filling algorithm. Unlike the radio frequency counterpart, the signaling is designed subject to nonnegative, peak and average power constraints, taking the input-dependent Gaussian shot noise into account. Decode and forward (DF) protocol is adopted by the relay, and is shown to outperform the direct transmission (DT) protocol.

Paper Details

Authors:
Guangtao Zheng, Qian Gao, Chen Gong and Zhengyuan Xu
Submitted On:
6 December 2016 - 10:23pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

GuangtaoZheng_GlobalSIP2016_slides.pdf

(247)

Subscribe

[1] Guangtao Zheng, Qian Gao, Chen Gong and Zhengyuan Xu, "Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1337. Accessed: Feb. 26, 2020.
@article{1337-16,
url = {http://sigport.org/1337},
author = {Guangtao Zheng; Qian Gao; Chen Gong and Zhengyuan Xu },
publisher = {IEEE SigPort},
title = {Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel},
year = {2016} }
TY - EJOUR
T1 - Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel
AU - Guangtao Zheng; Qian Gao; Chen Gong and Zhengyuan Xu
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1337
ER -
Guangtao Zheng, Qian Gao, Chen Gong and Zhengyuan Xu. (2016). Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel. IEEE SigPort. http://sigport.org/1337
Guangtao Zheng, Qian Gao, Chen Gong and Zhengyuan Xu, 2016. Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel. Available at: http://sigport.org/1337.
Guangtao Zheng, Qian Gao, Chen Gong and Zhengyuan Xu. (2016). "Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel." Web.
1. Guangtao Zheng, Qian Gao, Chen Gong and Zhengyuan Xu. Achievable Rate and Optimal Signaling for an Optical Wireless Decode-and-Forward Relaying Channel [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1337

Pages