Intelligent reflecting surface (IRS) is an effective technology to improve the energy and spectral efficiency of wireless powered communication network (WPCN). Under user cooperation, we propose an IRS-assisted WPCN system where the wireless devices (WDs) collect wireless energy in the downlink (DL) and then share data. The adjacent single-antenna WDs cooperate to form a virtual antenna array so that their information can be simultaneously transmitted to the multi-antenna common hybrid access point (HAP) through the uplink (UL) using multiple-input multiple-output (MIMO) technology. By jointly optimizing the passive beamforming at the IRS, the active beamforming in the DL and the UL, the energy consumed by data sharing, and the time allocation of each phase, we formulate an UL throughput maximization problem. However, this optimization problem is non-convex since the optimization variables are highly coupled. In this study, we apply the alternating optimization (AO) technology to decouple the optimization variables and propose an efficient algorithm to avoid the difficulty of directly solving the problem. Numerical results indicate that the joint optimization method significantly improves the UL throughput performance in multi-user WPCN compared with various baseline methods.

Power line communication (PLC) networks play an important role in home networks and in next generation hybrid networks, which provide higher data rates (Gbps) and easier connectivity. The standard medium access control (MAC) protocol of PLC networks, IEEE 1901, uses a special carrier sense multiple access with collision avoidance (CSMA/CA) mechanism, in which the deferral counter technology is introduced to avoid unnecessary collisions. Although PLC networks have achieved great commercial success, MAC layer analysis for IEEE 1901 PLC networks received limited attention. Until now, a few studies used renewal theory and strong law of large number (SLLN) to analyze the MAC performance of IEEE 1901 protocol. These studies focus on saturated conditions and neglect the impacts of buffer size and traffic rate. Additionally, they are valid only for homogeneous traffic. Motivated by these limitations, we develop a unified and scalable analytical model for IEEE 1901 protocol in unsaturated conditions, which comprehensively considers the impacts of traffic rate, buffer size, and traffic types (homogeneous or heterogeneous traffic). In the modeling process, a multi-layer discrete Markov chain model is constructed to depict the basic working principle of IEEE 1901 protocol. The queueing process of the station buffer is captured by using Queueing theory. Furthermore, we present a detailed analysis for IEEE 1901 protocol under heterogeneous traffic conditions. Finally, we conduct extensive simulations to verify the analytical model and evaluate the MAC performance of IEEE 1901 protocol in PLC networks.

This letter studies secure communication in a wireless powered communication network with a full-duplex destination node, who applies either power splitting (PS) or time switching (TS) to coordinate energy harvesting and information decoding of received signals and transmits jamming signals to the eavesdropper using the harvested energy. The secrecy rate is maximized by optimizing PS or TS ratio and power allocation. We propose iterative algorithms with power allocation optimized by the successive convex approximation method. Simulation results demonstrate that the proposed algorithms are superior to other benchmark algorithms.

Wireless powered communication networks (WPCNs) utilize the wireless energy transfer (WET) technique to facilitate the wireless information transmission (WIT) of nodes. We propose a two-step iterative algorithm to maximize the sum throughput of the users in a MIMO WPCN with discrete signal inputs. Firstly, the optimal solution of a convex power allocation problem can be found given a fixed time allocation; Secondly, a semi closed form solution for the optimal time allocation is obtained when fixing the power allocation matrix. By optimizing the power allocation and time allocation alternately, the two-step algorithm converges to a local optimal point. Simulation results show that the proposed algorithm outperforms the conventional schemes, which consider only Gaussian inputs.

We propose a new call admission control (CAC) scheme for voice calls in cellular mobile communication networks. It is assumed that the rejection of a hand-off call is less desirable than that of a new call, for a hand-off call loss would cause a severe mental pain to a user. We consider the pains of rejecting new and hand-off calls as different costs. The key idea of our CAC is to restrict the admission of new calls in order to minimize the total expected costs per unit time over the long term. An optimal policy is derived from a semi-Markov decision process in which the intervals between successive decision epochs are exponentially distributed. Based on this optimal policy, we calculate the steady state probability for the number of established voice connections in a cell. We then evaluate the probability of blocking new calls and the probability of forced termination of hand-off calls. In the numerical experiments, it is found that the forced termination probability of hand-off calls is reduced significantly by our CAC scheme at the slight expense of the blocking probability of new calls and the channel utilization. Comparison with the static guard channel scheme is made.

This paper discusses self-similarity in cell dwell time of a mobile terminal, the discovery of which was described in our previous paper, and its effects on teletraffic of mobile communication networks. We have evaluated various teletraffic statistics, such as cell dwell time and channel occupancy time, of a mobile terminal based on measurements of motion for various types of vehicles. Those results show that cell dwell time follows a long-tailed log-normal distribution rather than the exponential distribution that has been used for modeling. Here, we first elaborate on self-similarity in cell dwell time of various vehicles. We then evaluate self-similarity in channel occupancy time. For future mobile multimedia communication systems employing a micro-cell configuration, it is anticipated that data communication will be the main form of communication and that call holding time will be long. For such cases, we have shown that channel occupancy time will be greatly affected by the cell dwell time of the mobile terminal, and that self-similarity, a characteristic that is not seen in conventional systems, will consequently appear. We have also found that hand-off frequently fails as self-similarity in cell dwell time of a mobile terminal becomes stronger.

In evaluating the teletraffic of mobile communication networks, it is important to model the motion of terminals. In the previous migration model, mobility characteristics of terminals, such as cell dwell time, have been expressed by a single probability distribution. In this paper, we discuss the modeling of the cell dwell time of terminals in each cell. Using measured data we show that cell dwell time differs from cell to cell and follows log-normal distributions rather than conventional exponential distributions.

Teletraffic characteristics of a mobile packet communication network, which supports mobile Internet, were quantitatively evaluated by using a terminal migration model in which the cell dwell time possesses self-similarity. I used a migration model in which the migration speed of the terminal is determined by the density of the dwell terminals in a cell (determined from measured vehicular mobility characteristics). The transmission rates per terminal in a cell were estimated as teletraffic on the mobile packet communication networks using this migration model. I found that when there is self-similarity in the terminal cell dwell time, communicating terminals may be concentrated in the cell and restricted for an indefinite period of time to using only a narrow bandwidth.

We describe a control scheme for wireless-link layers and the TCP/IP layers in which wireless link states, such as signal strength and transmission rate, are transparent to the upper network layers and govern the behavior of the upper layers. Monitoring and notifying functions for wireless link states are incorporated into mobile hosts, and prefetching functions for the mobility agent lists are added to the present MobileIP functionalities of the network layers. In addition, we give the mobile hosts functions for controlling the TCP advertised windows in the transport layers and give the base-stations buffering functions to deal with the variable signal strength of the wireless links. A simulation (using ns-2) of this control scheme shows that mobile agent can be switched at the network layers soon after base-station hand-over and that errors in packet routing, packet loss and communication throughput reduction can be avoided. Moreover, communications can be interrupted without having to shrink the size of the congestion windows of the TCP senders, which improves overall throughput.

In this paper, we study the link capacity assignment problem in packet-switched networks (CA problem) focusing on the case where link cost function is a piecewise linear concave function. This type of cost function arises in many communication network design problems such as those arising from developments in communication transmission technologies. It is already known that the method of link set assignment is applicable for solving the CA problem with piecewise linear convex cost function. That is, each link in the network is assigned to one of a group of specific sets, and checked for link set contradiction. By extending the method of link set assignment to the case of piecewise linear concave cost function, an important characteristic of the optimal solution of the CA problem is derived. Based on this characteristic, the non-differentiable link cost function can be treated as a differentiable function, and a heuristic algorithm derived from the Lagrange multiplier method is then proposed. Although it is difficult to determine the global optimum of the CA problem due to its non-convexity, it is shown by numerical results that the solution obtained from the proposed algorithm is very close to the global optimum. Moreover, the computation time is linearly dependent on the number of links in the problem. These performances show that the proposed algorithm is very efficient in solving the CA problem, even in the case of large-scale networks.

To design and develop user-oriented, flexible and distributed applications which can deal with various users' requirements, new technologies to manage, control and utilize the services of communication networks have to be provided. In this paper, the current challenges faced by large-scale distributed applications are discussed and a framework for the next generation network operation and management is presented on the basis of agent-based computing technologies. Examples of flexible distributed applications are presented to clarify the role of application-centric flexible network operation and management.

A Time-Division Multiplexed (TDM) Hierarchical Switching System (HSS), proposed by Eng and Acampora [5], provides any size of bandwidth for a number of subscribers by allocating proper number of time-slots in a frame. In this paper, we present a binary time-slot assignment (TSA) algorithm by which a proper size of time-slots in the frame are allocated to each subscriber so as to meet its bandwidth requests. The time complexity of the proposed algorithm is O(NLlog2 L) in which N is the number of input/output links of the central switch and L is the number of time-slots allotted to each link in the frame. As the authors know, the most efficient algorithm proposed in the literature has time complexity of O(min(L, M2)min(N, M)M2), in which M is the number of subscribers that is larger than N in TDM/HSS system. To give a clear idea of relative efficiency between two algorithms, let us give a typical situation of M = L = O(N2). In this configuration our algorithm makes a significant improvement in time complexity by the order of O(M2/log2M).

Significant traffic variations occur in telecommunication networks. This paper focuses on hour-to-hour traffic variations during 24 hours and investigates the possibility of using idle periods effectively by introducing non-realtime service at a discount rate. In order to provide non-realtime service, memory is placed at each telecom center. When immediate service is not available, messages of non-realtime calls are stored in the memory and served later when network resources are available. Realtime calls are served with preference. A basic model and a method of dimensioning the memory capacity are presented. The basic model is extended to the network model, and methods of designing a minimum cost network and pricing and profit issues are presented. The results for a basic model are verified by traffic simulation. Numerical examples are given to show the effectiveness of non-realtime service.

The Guaranteed Bandwidth Protocol (GBW) is an access scheme being proposed for implementation of connection oriented services in DQDB networks. Connection oriented services are expected to handle both constant bit rate (CBR) and variable bit rate (VBR) traffic that have delay and jitter constraints. It has been reported that the GBW protocol can provide guaranteed bandwidth and lower delays compared to the ordinary DQDB protocol. However, the intensity of the jitter introduced by this scheme has not been made clear. This paper compares the jitter results for the GBW scheme to those obtained by a new access method called Modified Guaranteed Bandwidth (MOD_GBW) protocol, which is proposed here. It is shown through simulation that MOD_GBW also provides guaranteed bandwidth and that its delay and jitter characteristics are significantly better than those of the GBW protocol. In the simulation model, the DQDB stations are divided into two groups: 1)Real-Time (RT) stations that generate either CBR or VBR real-time traffic; and 2)Data stations that generate memoryless type of traffic. Data stations operate according to the ordinary DQDB protocol only. The main performance measure adopted here for the real-time traffic is the interdeparture time distribution of consecutive segments from an RT-station. We define the variance of this distribution as jitter. This paper also shows the impact of GBW/MOD_GBW on the performance of the data stations by evaluating their throughput and average bus access delay. Finally, we show that the network performance is weakly related to the number of RT-stations under MOD_GBW, but it depends strongly on the overall loading.

The evolution of access networks towards Fiber-To-The-Home (FTTH) receives much attention throughout the world because FTTH has a big potential for providing future attractive services. To provide such services in terms of transmission rate, the cable network transition scenario from conventional copper cable network to optical fiber cable one in access field should be clarified. Since network transition scenario deeply depends on the service evolution scenarios (what type of service would appear at a certain time and how many customers move to the other services, for example), this paper firstly categorizes telecommunication services into four kinds of services, i.e. Basic Service (e.g. POTS), Narrowband Symmetrical Service (e.g. NISDN), Broadband Asymmetrical Services (e.g. Video-On-Demand) and Broadband Symmetrical Services (e.g. BISDN) in terms of up-and down-stream transmission rates. Based on this service categorization, it is proposed to formalize service evolution scenarios by a transition pattern of the initial demands and the penetration rates of these services. Then, the evaluation method of network transition scenarios is also proposed in terms of NPV by the service evolution scenarios. It is conclude that the network transition scenarios are deeply related to the amount and behavior of the demands moving to the other services as follows.-The scenario where the new system configuration partly replaces the old one whenever the demands appear for providing higher transmission rate services is applicable, when the demands move little or constantly move to the higher transmission rate services,-The scenario where the new system configuration totally replaces the old one at the early stage for providing all services is applicable, when the demands drastically move to the higher transmission rate services during short period.

In this paper, a feasible optical code-division multiple-access (CDMA) technique is proposed for high-speed computer networks using prime codes and optical signal processing to guarantee real-time data communications. All-optical architectures for fastly tunable CDMA encoders and decoders are presented, which can be feasibly implemented in the optical domain by using electrooptic switches and optical delay lines. This can support an ultrahigh throughput and a very fast reconfiguration time. Furthermore, we present a self-synchronized sample technique to ensure the correct phase synchronization between optical clock stream and asynchronous electronic data at each electrooptic modulator of an optical CDMA transmitter.

We study the capacity assignment and routing procedure for a simultaneous multipoint-to-point communication network called convergence cast communication (con-cast). In capacity assignment, we analyse the network in two different application model, single destination and variable destination concast group. In each model, we determine the optimal capacity and network configuration. In routing procedure, since the problem is computationally intractable[1], [2], we present a heuristic algorithm that, under condition of the capacity constraint, selects a set of connections for n-1 separated points to one point. This is accomplished by considering a hierarchical structure and a flow decomposition technique in the network. The algorithm finds a solution for connection assignment in convergence-type communications. Theoretical analysis and computer simulation of the proposed method are given.

In this paper, we formulate and solve a discrete-time queueing problem that has two potential applications: ATM multiplexers and DQDB networks. We first consider the modeling of an ATM multiplexer. The object of the analysis is a periodic traffic stream (CBR traffic), which is one of the inputs to the multiplexer. As in previous works of the subject, we consider a memoryless background traffic input. Here, in addition to this background traffic, we take into account the influence of a high-priority traffic, which is time-correlated and requires expedited service. We analyze the influence of these two types of traffic on the statistics of the interdeparture time (jitter process) and the delay of the periodic traffic stream. We obtain their distributions in a form of z-transforms, and from these we derive closed form expressions for the average delay and the variance of the interdeparture time. Our results show that the delay and jitter are very sensitive to the burstiness of the high priority traffic arrival process. We next apply our analytical modeling to a DQDB network when some of its stations are driven by CBR sources. We can obtain interesting results concerning the influence of the physical location of a DQDB station on the jitter.

This paper proposes a protocol verification tool where protocols are described in an extended Petri net and Horn clauses. The extended net model contributes to reduce state space in verification with hierarchical description. The model also includes timed and colored net. Horn clause enables protocol designers to grasp a protocol by the declarative semantics. They can describe non critical but mandatory portion of a protocol like error processing or abortion with Horn clauses. Protocols are verified through simulation. Protocol verification includes two methods, all-in-one and hierarchical methods. By the all-in-one method all description is translated into Prolong clause and simulated exhaustively, whereas by the hierarchical verification, simulation begins with the lowest layer and deduces sufficient conditions that give liveness and safeness of the net model. Then the layer is replaced by a simpler net model that is incorporated into the higher layer. The scheme is applied to an illustrative example of the Alternating Bit protocol to discuss its effectiveness.

A method is proposed for locating large gas leaks in subscriber cable networks composed of different type cables and/or branch cables that uses pressures periodically measured at several points. Theoretical pressure curves corresponding to these measured pressure curves are calculated using a model representing the actual cable network. These curves are called the calculated pressure curves. The position of the leak is varied in the calculation model and where the measured and calculated pressure curves coincide the most, the leak position in the calculation model indicates the estimated leak position. The calculated pressure curves are based on the Laplace transform and an analogy between the pneumatic characteristics in cable networks and the electrical characteristics in electrical transmission networks. An experiment using a cable network about 910m long resulted in a location error of less than 30m.