Deflection-based transmission protocol for LAN operation in a PON system

In this paper, we propose and evaluate a new deflection transmission scheme for communication between local customers in a passive optical network (PON). In particular, we provide an analytical model to approximate the average packet delay of the proposed scheme in a local area network (LAN) operating within the PON (referred to as LAN-PON system). The accuracy of our model is validated by simulation. Furthermore, our simulation results show that a LAN-PON with a deflection scheme can achieve > 80% bandwidth gain using < 125 μs switching time compared to that of the traditional PON system for the cases studied.

Novel Section‐Based Joint Network Coding and Scheduling Scheme in WMNs: JNCS

Guaranteeing quality of service over a multihop wireless network is difficult because end‐to‐end (ETE) delay is accumulated at each hop in a multihop flow. Recently, research has been conducted on network coding (NC) schemes as an alternative mechanism to significantly increase the utilization of valuable resources in multihop wireless networks. This paper proposes a new section‐based joint NC and scheduling scheme that can reduce ETE delay and enhance resource efficiency in a multihop wireless network. Next, this paper derives the average ETE delay of the proposed scheme and simulates a TDMA network where the proposed scheme is deployed. Finally, this paper compares the performance of the proposed scheme with that of the conventional sequential scheduling scheme. From the performance analysis and simulation results, the proposed scheme gives more delay‐ and energy‐efficient slot assignments even if the NC operation is applied, resulting in a use of fewer network resources and a reduction in ETE delay.     

Bidirectional Hybrid DWDM‐PON for HDTV/Gigabit Ethernet/CATV Applications

A new scheme for bi‐directional HDTV/Gigabit Ethernet/CATV transmission over a hybrid dense‐wavelength‐division‐multiplexing passive optical network (DWDM‐PON) is proposed and demonstrated. It is based on injection‐locked vertical‐cavity surface‐emitting lasers and distributed‐feedback laser diodes as transmitters. Services with 129 HDTV channels, a 1.25 Gbps Gigabit Ethernet connection, and 77 CATV channels are successfully demonstrated over 40 km single‐mode fiber links. Good performance of bit error rate, carrier‐to‐noise ratio, composite second order, and composite triple beat is achieved in our proposed bidirectional DWDM‐PON.     

Low‐Cost,Low‐Power,High‐Capacity 3R OEO‐Type Reach Extender for a Long‐Reach TDMA‐PON

This paper proposes a low‐cost, low‐power, and high‐capacity optical‐electrical‐optical‐type reach extender that can provide 3R frame regeneration and remote management to increase the reach and split ratio with no change to a legacy time division multiple access passive optical network. To provide remote management, the extender gathers information regarding optical transceivers and link status per port and then transmits to a service provider using a simple network management protocol agent. The extender can also apply to an Ethernet passive optical network (E‐PON) or a gigabit‐capable PON (G‐PON) by remote control. In a G‐PON, in particular, it can provide burst mode signal retiming and burst‐to‐continuous mode conversion at the upstream path through a G‐PON transmission convergence frame adaptor. Our proposed reach extender is based on the quad‐port architecture for cost‐effective design and can accommodate both the physical reach of 60 km and the 512 split ratios in a G‐PON and the physical reach of 80 km and the 256 split ratios in an E‐PON.     

OFDM‐Based STBC with Low End‐to‐End Delay for Full‐Duplex Asynchronous Cooperative Systems

We propose a new space‐time block coding (STBC) for asynchronous cooperative systems in full‐duplex mode. The orthogonal frequency division multiplexing (OFDM) transmission technique is used to combat the timing errors from the relay nodes. At the relay nodes, only one OFDM time slot is required to delay for a pair‐wise symbol swap operation. The decoding complexity is lower for this new STBC than for the traditional quasi‐orthogonal STBC. Simulation results show that the proposed scheme achieves excellent performances.     

End‐to‐end delay and packet drop rate performance for a wireless sensor network with a cluster‐tree topology

In this paper, we study the delay performance in a wireless sensor network (WSN) with a cluster‐tree topology. The end‐to‐end delay in such a network can be strongly dependent on the relative location between the sensors and the sink and the resource allocations of the cluster heads (CHs). For real‐time traffic, packets transmitted with excessive delay are dropped. Given the timeline allocations of each CH for local and inter‐cluster traffic transmissions, an analytical model is developed to find the distribution of the end‐to‐end transmission delay for packets originated from different clusters. Based on this result, the packet drop rate is derived. A heuristic scheme is then proposed to jointly find the timeline allocations of all the CHs in a WSN in order to achieve the minimum and balanced packet drop rate for traffic originated from different levels of the cluster tree. Simulation results are shown to verify the analysis and to demonstrate the effectiveness of the proposed CH timeline allocation scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

Coalitional game‐based behavior analysis for spectrum access in cognitive radios

The core of cognitive radio paradigm is to introduce cognitive devices able to opportunistically access the licensed radio bands. The coexistence of licensed and unlicensed users prescribes an effective spectrum hole‐detection and a non‐interfering sharing of those frequencies. Collaborative resource allocation and spectrum information exchange are required but often costly in terms of energy and delay. In this paper, each secondary user (SU) can achieve spectrum sensing and data transmission through a coalitional game‐based mechanism. SUs are called upon to report their sensing results to the elected coalition head, which properly decides on the channel state and the transmitter in each time slot according to a proposed algorithm. The goal of this paper is to provide a more holistic view on the spectrum and enhance the cognitive system performance through SUs behavior analysis. We formulate the problem as a coalitional game in partition form with non‐transferable utility, and we investigate on the impact of both coalition formation and the combining reports costs. We discuss the Nash Equilibrium solution for our coalitional game and propose a distributed strategic learning algorithm to illustrate a concrete case of coalition formation and the SUs competitive and cooperative behaviors inter‐coalitions and intra‐coalitions. We show through simulations that cognitive network performances, the energy consumption and transmission delay, improve evidently with the proposed scheme. Copyright © 2016 John Wiley & Sons, Ltd.     

Performance analysis of prioritized parallel transmission MAC protocol in all‐IP wireless WAN

Prioritized parallel transmission MAC (PPTM) protocol is proposed for all‐IP wireless wide area network (WAN). In this paper, we analyse its performance and compare it with modified channel load sensing protocol (MCLSP). We model PPTM as a non‐preemptive priority queueing system and obtain a close form of transmission time delay for each priority class, throughput of the scheme, and number of packets in the queue in the Poisson arrival case. We find that PPTM achieves less transmission time delay than MCLSP does for high priority data. Hence, the overall performance of the system using PPTM is significantly improved. We verify the conclusions with simulation via a simplified all‐IP wireless WAN. Copyright © 2006 John Wiley & Sons, Ltd.     

Genetic algorithm‐based content distribution strategy for F‐RAN architectures

Fog radio access network (F‐RAN) architectures provide markedly improved performance compared to conventional approaches. In this paper, an efficient genetic algorithm‐based content distribution scheme is proposed that improves the throughput and reduces the transmission delay of a F‐RAN. First, an F‐RAN system model is presented that includes a certain number of randomly distributed fog access points (F‐APs) that cache popular content from cloud and other sources. Second, the problem of efficient content distribution in F‐RANs is described. Third, the details of the proposed optimal genetic algorithm‐based content distribution scheme are presented. Finally, simulation results are presented that show the performance of the proposed algorithm rapidly approaches the optimal throughput. When compared with the performance of existing random and exhaustive algorithms, that of the proposed method is demonstrably superior.     

Power control and channel allocation for real‐time applications in cellular networks

The next‐generation packet‐based wireless cellular network will provide real‐time services for delay‐sensitive applications. To make the next‐generation cellular network successful, it is critical that the network utilizes the resource efficiently while satisfying quality of service (QoS) requirements of real‐time users. In this paper, we consider the problem of power control and dynamic channel allocation for the downlink of a multi‐channel, multi‐user wireless cellular network. We assume that the transmitter (the base‐station) has the perfect knowledge of the channel gain. At each transmission slot, a scheduler allots the transmission power and channel access for all the users based on the instantaneous channel gains and QoS requirements of users. We propose three schemes for power control and dynamic channel allocation, which utilize multi‐user diversity and frequency diversity. Our results show that compared to the benchmark scheme, which does not utilize multi‐user diversity and power control, our proposed schemes substantially reduce the resource usage while explicitly guaranteeing the users' QoS requirements. Copyright © 2007 John Wiley & Sons, Ltd.     

Cluster‐based coordination scheme for cooperative cognitive radio networks

In this paper, a cluster‐based two‐phase coordination scheme for cooperative cognitive radio networks is proposed considering both spectrum efficiency and network fairness. Specifically, candidate secondary users (SUs) are first selected by a partner selection algorithm to enter the two‐phase cooperation with primary users (PUs). In phase I, the selected SUs cooperate with PUs to acquire a fraction of time slot as a reward. In phase II, all SUs including the unselected ones share the available spectrum resources in local clusters; each of which is managed by a cluster head who participated in the cooperation in phase I. To improve the total network utility of both PUs and SUs, the maximum weighted bipartite matching is adopted in partner selection. To further improve the network performance and communication reliability, network coding is exploited during the spectrum sharing within the cluster. Simulation results demonstrate that, with the proposed cluster‐based coordination scheme, not only the PUs' transmission performance is improved, but also SUs achieve spectrum access opportunities. Copyright © 2015 John Wiley & Sons, Ltd.     

Supporting multimedia streaming and best‐effort data transmission over IEEE 802.11e EDCA

As demand for broadband multimedia wireless services increases, improving quality of service (QoS) of the widely deployed IEEE 802.11 wireless LAN (WLAN) has become crucial. To support the QoS required by a wide range of applications, the IEEE 802.11 working group has defined a new standard: IEEE 802.11e. In this paper, we propose a measurement‐based dynamic media time allocation (MBDMTA) scheme combined with a concatenating window scheme to support real‐time variable bit rate (rt‐VBR) video and best‐effort (BE) data transmission using IEEE 802.11e enhanced distributed channel access (EDCA). To provide the QoS guarantee for rt‐VBR video, the proposed MBDMTA scheme dynamically assigns channel time to the rt‐VBR video based on the estimate of the required network resources. On the other hand, the concatenating window scheme controls the contention window (CW) ranges of different priority flows such that real‐time services always have higher channel access probability, thus achieving the capability of preemptive priorities. In addition, the concatenating window scheme preserves fairness among flows of the same class and attains high channel utilization under different network conditions. Simulation results demonstrate that the throughput and delay performance improve significantly for the transmission of rt‐VBR video and BE traffic as compared to those for the 802.11e EDCA specification. It is also revealed that combining the two proposed schemes provides seamless integration and reliable transmission of digital video and data service within the 802.11e EDCA framework. Copyright © 2007 John Wiley & Sons, Ltd.     

Network coding‐based channel quality indicator reporting for two‐way multi‐relay networks

This paper considers channel quality indicator (CQI) reporting for data exchange in a two‐way multi‐relay network. We first propose an efficient CQI reporting scheme based on network coding, where two terminals are allowed to simultaneously estimate the CQI of the distant terminal‐relay link without suffering from additional overhead. In addition, the transmission time for CQI feedback at the relays is reduced by half while the increase in complexity and the loss of performance are negligible. This results in a system throughput improvement of 16.7% with our proposed CQI reporting. Upper and lower bounds of the mean square error (MSE) of the estimated CQI are derived to study performance behaviour of our proposed scheme. It is found that the MSE of the estimated CQI increases proportionally with the square of the cardinality of CQI level sets although an increased number of CQI levels would eventually lead to a higher data rate transmission. On the basis of the derived bounds, a low‐complexity relay selection (RS) scheme is then proposed. Simulation results show that, in comparison with optimal methods, our suboptimal bound‐based RS scheme achieves satisfactory performance while reducing the complexity at least three times in case of large number of relays. Copyright © 2012 John Wiley & Sons, Ltd.     

An end‐to‐end channel allocation scheme for a wireless mesh network

Co‐channel interference seriously influences the throughput of a wireless mesh network. This study proposes an end‐to‐end channel allocation scheme (EECAS) that extends the radio‐frequency‐slot method to minimize co‐channel interference. The EECAS first separates the transmission and reception of packets into two channels. This scheme can then classify the state of each radio‐frequency‐slot as transmitting, receiving, interfered, free, or parity. A node that initiates a communication session with a quality of service requirement can propagate a channel allocation request along the communication path to the destination. By checking the channel state, the EECAS can determine feasible radio‐frequency‐slot allocations for the end‐to‐end path. The simulation results in this study demonstrate that the proposed approach performs well in intra‐mesh and inter‐mesh communications, and it outperforms previous channel allocation schemes in end‐to‐end throughput. Copyright © 2013 John Wiley & Sons, Ltd.     

Performance modeling and optimization of multiple‐objective cross‐layer design in multi‐flow ad‐hoc networks

In ad‐hoc wireless networks, to achieve good performance, multiple parameters need to be optimized jointly. However, existing literature lacks a design framework that investigates the synchronic impact of several parameters on overall system performance. Among several design parameters, energy conservation, end‐to‐end delay minimization, and improved throughput are considered most important for efficient operation of these networks. In this paper, we propose a novel scheme for multiple‐objective cross‐layer optimization capable of optimizing all these performance objectives simultaneously for reliable, energy‐efficient, and timely transmission of continuous media information across the network. The three global criteria considered for optimization are incorporated in a single programming problem via linear scalarization. Besides, we employ standard convex optimization method and Lagrangian technique to solve the proposed problem to seek optimality. Extensive simulation results are generated accounting for several topologies with multiple concurrent flows in the network. These results are used to validate the analytical results and demonstrate the efficiency of the proposed optimization model. Efficiency of the model is verified by finding the set of Pareto‐optimal solutions plotted in three‐dimensional objective space. These solution points constituting the Pareto front are used as the best possible balance points among maximum throughput, maximum residual energy, and least network delay. Finally, to emphasize the effectiveness and supremacy of our proposed multiple‐objective cross‐layer design scheme, we compare it with the conventional multiple‐objective genetic algorithm. Simulation results demonstrate that our method provides significant performance gain over the genetic algorithm approach in terms of the above specified three objectives.     

Adaptive BU association and resource allocation in integrated PON‐WiMAX networks

This paper addresses the issues of Base station—User Association and Resources Allocation (BUA‐RA) in OFDM‐TDMA based broadband wireless access (BWA) networks under passive optical networks (PON)‐WiMAX integration. With the powerful coordination capability at the optical line terminal (OLT), a key technology of inter‐cell cooperative transmission (CT) is incorporated in the integrated network architecture, which is called cooperative PON‐WiMAX network (CPWN). To achieve an efficient integration and inter‐cell cooperative transmission in the CPWNs, the BUA‐RA scheme is critical to the Quality of Service (QoS) provisioning for each user. In order to minimize the network resource usage, we provide three new BUA‐RA schemes which first time employ the cooperative transmission in a multi‐cell BWA network. The three schemes are designed for three kinds of subscribers with different moving types, and can be adaptively applied based on the network load. Simulations are conducted to verify the proposed BUA‐RA schemes by comparing with those without cooperative transmission technology. Our results demonstrate the efficiency of our proposed schemes, which are based on mathematical formulations and linearization. Copyright © 2010 John Wiley & Sons, Ltd.     

Transmission scheduling in a multi‐channel wireless network with bidirectional relaying links

Using network coding in a wireless network can potentially improve the network throughput. On the other hand, it increases the complexity of resource allocations as the quality of one transmission is affected by the link conditions of the transmitter to multiple receivers. In this work, we study time slot scheduling and channel allocations jointly for a network with bidirectional relaying links, where the two end nodes of each link can exchange data through a relay node. Two scenarios are considered when the relay node forwards packets to the end nodes. In the first scenario, the relay node always forwards network‐coded packets to both end nodes simultaneously; in the second scenario, the relay node opportunistically uses network coding for two‐way relaying and traditional one‐way relaying. For each scenario, an optimization problem is first formulated for maximizing the total network throughput. The optimum scheduling is not causal because it requires future information of channel conditions. We then propose heuristic scheduling schemes. The slot‐based scheduling maximizes the total transmission rate of all the nodes at each time slot, and the node‐based scheduling schedules transmissions based on achievable transmission rates of individual nodes at different channels. The node‐based one has lower complexity than the slot‐based one. Our results indicate that although the node‐based scheduling achieves slightly lower throughput than the slot‐based one, both the proposed scheduling schemes are very effective in the sense that the difference between their throughput and the optimum scheduling is relatively small in different network settings. Copyright © 2015 John Wiley & Sons, Ltd.     

Low‐jitter slot assignment algorithm for deadline‐aware packet transmission in wireless video surveillance sensor networks

This work presents a distributed time‐slot assignment algorithm which adopts TDMA as Medium Access Control, specially suited to support applications with strict delay, jitter, and throughput requirements characterized by convergecast traffic pattern in sensor networks. (e.g. wireless video surveillance sensor networks). The proposed algorithm has three characteristics: (1) every node is guaranteed a path to the base station for its data delivery. In the path, sufficient resource is reserved and weighted fairness can be achieved. (2) It uses cascading time‐slot assignment and jitter minimization algorithm in each node to minimize jitter and end‐to‐end delay. (3) Nodes are only active during their scheduled slots and sleep otherwise. This offers energy saving by reducing idle listening and avoiding overhearing. The performance of the proposed algorithm is evaluated over simulations and analyzed theoretically in comparison with existing slot assignment algorithm. The results show that our algorithm provides lower end‐to‐end delay, jitter, and higher throughput. Copyright © 2010 John Wiley & Sons, Ltd.     

Dynamic bandwidth allocation and buffer dimensioning under equal segment scheme to support video‐on‐demand services

This paper focuses on the optimization of network bandwidth allocation and buffer dimensioning to transport pre‐stored MPEG video data from source to playback destination across ATM networks. This is one of the most important issues in the support of video‐on‐demand (VoD) service. This paper provides a novel scheme in the dynamic allocation of bandwidth to segments of video using ABR mode. The dynamic bandwidth allocation is based on a new concept, called playback tunnel which is obtained from the traffic characteristics of the pre‐stored MPEG video trace to determine the optimum of transmission bandwidth as well as the buffer capacity to ensure that the playback buffer neither underflows nor overflows. The proposed scheme is tested with real‐life MPEG video traces. The obtained results have shown its significant performance improvement in terms of the capacity of playback buffer, the start‐up playback delay, the size of video segment and the network multiplexing gain. Copyright © 2001 John Wiley & Sons, Ltd.     

Hierarchical queue‐length‐aware power control for real‐time applications over wireless networks

We consider the problem of optimal power control for quality‐of‐service‐assured wireless communication. The quality of service (QoS) measures of our consideration are a triplet of data rate, delay, and delay bound violation probability (DBVP). Our target is to develop power control laws that can provide delay guarantees for real‐time applications over wireless networks. The power control laws that aim at optimizing certain physical‐layer performance measures, usually adapt the transmission power based on the channel gain; we call these “channel‐gain‐based” (CGB) power control (PC). In this paper, we show that CGB‐PC laws achieve poor link‐layer delay performance. To improve the performance, we propose a novel scheme called hierarchical queue‐length‐aware (HQLA) power control. The key idea is to combine the best features of the two PC laws, i.e., a given CGB‐PC law and the clear‐queue (CQ) PC law; here, the CQ‐PC is defined as a PC law that uses a transmission power just enough to empty the queue at the link layer. We analyze our proposed HQLA‐PC scheme by the matrix‐geometric method. The analysis agrees well with the simulation results. More importantly, our results show that the proposed HQLA power control scheme is superior to the corresponding CGB‐PC in both average power consumption and effective capacity. Copyright © 2010 John Wiley & Sons, Ltd.