Optical and Wireless Hybrid Access Networks: Design and Optimization

Ming Xia; Yasunori Owada; Masugi Inoue; Hiroaki Harai

doi:10.1364/JOCN.4.000749

Journal of Optical Communications and Networking
Vol. 4,
Issue 10,
pp. 749-759
(2012)
•https://doi.org/10.1364/JOCN.4.000749

Optical and Wireless Hybrid Access Networks: Design and Optimization

Ming Xia, Yasunori Owada, Masugi Inoue, and Hiroaki Harai

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Ming Xia, Yasunori Owada, Masugi Inoue, and Hiroaki Harai, "Optical and Wireless Hybrid Access Networks: Design and Optimization," J. Opt. Commun. Netw. 4, 749-759 (2012)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Related Topics
Table of Contents Category
- Research Papers
Optics & Photonics Topics
?

The topics in this list come from the Optics and Photonics Topics applied to this article.

About this Article
History
- Original Manuscript: March 6, 2012
- Revised Manuscript: August 2, 2012
- Manuscript Accepted: August 2, 2012
- Published: September 17, 2012

Abstract

The performance of optical/wireless hybrid networks is largely limited by the wireless part. To reduce the wireless transmission, we configure virtual channels in the optical infrastructure as “shortcuts” between selected gateways. Adding virtual channels changes the network topology and affects the optimality of gateway deployment. Meanwhile, the gateway locations dictate the traffic distribution that affects the selection of gateways for virtual-channel placement. We propose to jointly optimize the gateways and virtual channels, and formulate the optimization as a mixed integer programming problem. In addition, we design an efficient heuristic algorithm based on k-means clustering to iteratively optimize these two aspects. Our schemes are evaluated using various network settings (network size, number of gateways, etc.). In particular, a random topology with Ethernet traffic is studied for delay and throughput. Numerical results show that our design and optimization effectively reduce the wireless transmission, which leads to better scalability, smaller traffic delay, and larger throughput.

Full Article | PDF Article

More Like This

CaDAR: An Efficient Routing Algorithm for a Wireless–Optical Broadband Access Network (WOBAN)

Abu (Sayeem) Reaz, Vishwanath Ramamurthi, Suman Sarkar, Dipak Ghosal, Sudhir Dixit, and Biswanath Mukherjee
J. Opt. Commun. Netw. 1(5) 392-403 (2009)

Design of QoS-Aware Energy-Efficient Fiber–Wireless Access Networks

G. Schütz and N. Correia
J. Opt. Commun. Netw. 4(8) 586-594 (2012)

Design of a Survivable Hybrid Wireless-Optical Broadband-Access Network

Taiming Feng and Lu Ruan
J. Opt. Commun. Netw. 3(5) 458-464 (2011)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (10)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (2)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (24)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Category	Research work	Targeted network	Objective	Contributions (in brief)
Gateway (or similar concepts as ONU/IBO) deployment	Li et al. [6]	Wireless mesh network	Maximize network throughput	Infinite possibilities for k gateways.
				Throughput formulation by linear programming.
				Three heuristic algorithms are proposed.
	Sarkar et al. [7]	Wireless and optical hybrid network	Minimize average Euclidian ONU–router distance	Real-field survey for ONU deployment.
				Joint optimization for wireless and optical parts.
				Heuristic algorithms are proposed.
	Liu et al. [8]	Hybrid EPON/WiMAX networks	Minimize number of integrated BSs/ONUs	Minimum results among known works.
				QoS metrics optimized: delay, load balancing.
				Heuristic algorithms are proposed.
	Zheng et al. [9]	Fiber–wireless network	Maximize network throughput	A heuristic algorithm (Tabu search) is proposed.
	Zheng et al. [9]	Fiber–wireless network	Maximize network throughput	Peer-to-peer communication is considered.
Virtual-channel (or similar concepts as wire/hotline/shortcut) placement	Chitradurga et al. [14]	Wireless sensor networks	Minimize path length	Analytical model for path length using shortcuts.
	Chitradurga et al. [14]	Wireless sensor networks	Minimize path length	Optimal wire length is obtained to minimize path length.
	Sharma et al. [15]	Wireless sensor networks	Minimize average hop count of the network	Heuristic algorithms are proposed.
				Cases for static and mobile sinks are studied.
				Energy consumption is considered.
	Tufail et al. [16]	Wireless sensor networks	Minimize average hop count of the network	A reliability model is built.
	Tufail et al. [16]	Wireless sensor networks	Minimize average hop count of the network	Heuristic algorithms are proposed.
Gateway deployment and virtual-channel placement	Our work	PON + WMN hybrid networks	Minimize average transmission cost (hop count ∗ traffic volume)	Configure PON to set up shortcuts for WMN in a hybrid network.
				MIP (linearized) for the joint optimization problem.
				Heuristic algorithms for joint optimization.

Index of scenario		# of MAPs	# of GAPs	# of virtual channels
I	A	$5^{2}$	5	0
	B	$5^{2}$	5	3
	C	$5^{2}$	5	10
II	A	$1 0^{2}$	10	0
	B	$1 0^{2}$	10	6
	C	$1 0^{2}$	10	45
III	A	$1 5^{2}$	15	0
	B	$1 5^{2}$	15	9
	C	$1 5^{2}$	15	105
IV	A	$2 0^{2}$	20	0
	B	$2 0^{2}$	20	12
	C	$2 0^{2}$	20	190

Category	Research work	Targeted network	Objective	Contributions (in brief)
Gateway (or similar concepts as ONU/IBO) deployment	Li et al. [6]	Wireless mesh network	Maximize network throughput	Infinite possibilities for k gateways.
				Throughput formulation by linear programming.
				Three heuristic algorithms are proposed.
	Sarkar et al. [7]	Wireless and optical hybrid network	Minimize average Euclidian ONU–router distance	Real-field survey for ONU deployment.
				Joint optimization for wireless and optical parts.
				Heuristic algorithms are proposed.
	Liu et al. [8]	Hybrid EPON/WiMAX networks	Minimize number of integrated BSs/ONUs	Minimum results among known works.
				QoS metrics optimized: delay, load balancing.
				Heuristic algorithms are proposed.
	Zheng et al. [9]	Fiber–wireless network	Maximize network throughput	A heuristic algorithm (Tabu search) is proposed.
	Zheng et al. [9]	Fiber–wireless network	Maximize network throughput	Peer-to-peer communication is considered.
Virtual-channel (or similar concepts as wire/hotline/shortcut) placement	Chitradurga et al. [14]	Wireless sensor networks	Minimize path length	Analytical model for path length using shortcuts.
	Chitradurga et al. [14]	Wireless sensor networks	Minimize path length	Optimal wire length is obtained to minimize path length.
	Sharma et al. [15]	Wireless sensor networks	Minimize average hop count of the network	Heuristic algorithms are proposed.
				Cases for static and mobile sinks are studied.
				Energy consumption is considered.
	Tufail et al. [16]	Wireless sensor networks	Minimize average hop count of the network	A reliability model is built.
	Tufail et al. [16]	Wireless sensor networks	Minimize average hop count of the network	Heuristic algorithms are proposed.
Gateway deployment and virtual-channel placement	Our work	PON + WMN hybrid networks	Minimize average transmission cost (hop count ∗ traffic volume)	Configure PON to set up shortcuts for WMN in a hybrid network.
				MIP (linearized) for the joint optimization problem.
				Heuristic algorithms for joint optimization.

Index of scenario		# of MAPs	# of GAPs	# of virtual channels
I	A	$5^{2}$	5	0
	B	$5^{2}$	5	3
	C	$5^{2}$	5	10
II	A	$1 0^{2}$	10	0
	B	$1 0^{2}$	10	6
	C	$1 0^{2}$	10	45
III	A	$1 5^{2}$	15	0
	B	$1 5^{2}$	15	9
	C	$1 5^{2}$	15	105
IV	A	$2 0^{2}$	20	0
	B	$2 0^{2}$	20	12
	C	$2 0^{2}$	20	190

Abstract

Cited By

Figures (10)

Tables (2)

Equations (24)

Journal of Optical Communications and Networking