The Experts below are selected from a list of 379857 Experts worldwide ranked by ideXlab platform
Yuanyuan Yang - One of the best experts on this subject based on the ideXlab platform.
-
Network Cost minimization for mobile data gathering in wireless sensor Networks
IEEE Transactions on Communications, 2015Co-Authors: Miao Zhao, Dawei Gong, Yuanyuan YangAbstract:Recent studies have shown that significant benefit can be achieved in wireless sensor Networks (WSNs) by employing mobile collectors for data gathering via short-range communications. A typical scenario for such a scheme is that a mobile collector roams over the sensing field and pauses at some anchor points on its moving tour such that it can traverse the transmission range of all the sensors in the field and directly collect data from each sensor. In this paper, we study the performance optimization of such mobile data gathering by formulating it into a Cost minimization problem constrained by channel capacity, required minimum data uploads from each sensor and bound of total sojourn time at all anchor points. In order to provide an efficient and distributed algorithm, we decompose this global optimization problem into two subproblems that can be solved by each sensor and the mobile collector, respectively. We show that such decomposition can be characterized as a pricing mechanism, in which each sensor independently adjusts its payment for the data uploading opportunity based on the shadow prices of different anchor points. Correspondingly, we give an efficient algorithm to jointly solve the two subproblems. Our theoretical analysis demonstrates that the proposed algorithm can achieve the optimal data control for each sensor and the optimal sojourn time allocation for the mobile collector, which minimizes the overall Network Cost. Finally, extensive simulation results further validate that our algorithm achieves lower Cost than the compared data gathering strategy.
-
nonblocking wdm switching Networks with full and limited wavelength conversion
IEEE Transactions on Communications, 2002Co-Authors: Yuanyuan YangAbstract:In previous years, with the rapid exhaustion of the capacity in wide area Networks led by Internet and multimedia applications, demand for high bandwidth has been growing at a very fast pace. Wavelength-division multiplexing (WDM) is a promising technique for utilizing the huge available bandwidth in optical fibers. We consider efficient designs of nonblocking WDM permutation switching Networks. Such designs require nontrivial extensions from the existing designs of electronic switching Networks. We first propose several permutation models in WDM switching Networks ranging from no wavelength conversion, to limited wavelength conversion, to full wavelength conversion, and analyze the Network performance in terms of the permutation capacity and Network Cost, such as the number of optical cross-connect elements and the number of wavelength converters required for each model. We then give two methods for constructing nonblocking multistage WDM switching Networks to reduce the Network Cost.
-
nonblocking wdm switching Networks with full and limited wavelength conversion
International Conference on Computer Communications and Networks, 2001Co-Authors: Yuanyuan YangAbstract:In recent years, with the rapid exhaustion of the capacity in wide area Networks (WAN) led by Internet and multimedia applications, demand for high bandwidth has been growing at a very fast pace. Wavelength division multiplexing (WDM) is a promising technique to utilize the huge available bandwidth in optical fibers. We consider efficient designs of nonblocking WDM permutation switching Networks. Such designs require nontrivial extensions from the existing designs of electronic switching Networks. We first propose several permutation models in WDM switching Networks ranging from no wavelength conversion, limited wavelength conversion, to full wavelength conversion, and analyze the Network performance in terms of the permutation capacity and Network Cost such as the number of optical crossconnect elements and the number of wavelength converters required for each model. We then give two methods for constructing nonblocking multistage WDM switching Networks to reduce the Network Cost.
-
on blocking probability of multicast Networks
IEEE Transactions on Communications, 1998Co-Authors: Yuanyuan Yang, J WangAbstract:Multicast is a vital operation in both broad-band integrated services digital Networks (BISDN) and scalable parallel computers. We look into the issue of supporting multicast in the widely used three-stage Clos Network or /spl upsi/(m, n, r) Network. Previous work has shown that a nonblocking /spl upsi/(m, n, r) multicast Network requires a much higher Network Cost than a /spl upsi/(m, n, r) permutation Network. However, little has been known on the blocking behavior of the /spl upsi/(m, n, r) multicast Network with only a comparable Network Cost to a permutation Network. We first develop an analytical model for the blocking probability of the /spl upsi/(m, n, r) multicast Network and then study the blocking behavior of the Network under various routing control strategies through simulations. Our analytical and simulation results show that a /spl upsi/(m, n, r) Network with a small number of middle switches m, such as m=n+c or dn, where c and d are small constants, is almost nonblocking for multicast connections, although theoretically it requires m/spl ges//spl Theta/(n(log r/log log r)) to achieve nonblocking for multicast connections. We also demonstrate that routing control strategies are effective for reducing the blocking probability of the multicast Network. The best routing control strategy can provide a factor of two to three performance improvement over random routing. The results indicate that a /spl upsi/(m, n, r) Network with a comparable Cost to a permutation Network can provide Cost-effective support for multicast communication.
Ken-ichi Sato - One of the best experts on this subject based on the ideXlab platform.
-
large capacity optical Networks applying multi stage hetero granular optical path routing
Optical Switching and Networking, 2014Co-Authors: Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a novel scalable large-scale OXC architecture with a two-stage hetero-granular optical path switching mechanism based on a combination of different granular optical selective switches and an appropriate Network design algorithm that can make the best use of the proposed OXC architecture for building Cost-effective large capacity optical Networks. Simulation results verify that our proposed solution can offer a significant overall Network Cost reduction. The Cost efficiency of Networks based on the architecture is also investigated in relation to switching component Cost and different Network parameters.
-
Impact of electrical grooming and regeneration of wavelength paths in creating hierarchical optical path Networks
Optics express, 2011Co-Authors: Hiroshi Hasegawa, Ken-ichi SatoAbstract:We assess the impact of utilizing electrical cross-connects for the intermediate grooming and 3R regeneration of wavelength paths in a hybrid hierarchical optical path Network. Simulation results prove that they offer a significant Cost reduction. We also investigate the dependencies of Network Cost on Network parameters including optically-transparent reach, electrical switch port Cost, and waveband capacity. It is demonstrated that it is critical to choose the waveband capacity properly in order to minimize total Network Cost.
-
hierarchical optical path Network design algorithm considering waveband add drop ratio constraint
IEEE\ OSA Journal of Optical Communications and Networking, 2010Co-Authors: Hiroshi Hasegawa, Ken-ichi SatoAbstract:A new hierarchical optical path Network design algorithm that incorporates restrictions on waveband add/drop ratios at nodes is proposed. We evaluate its effectiveness by conducting extensive numerical experiments. The effects of the Network parameters, which include Network size, link distance, and Network topology, on total Network Cost are elucidated. The results show that the proposed algorithm, which considers restrictions on the waveband add/drop ratio, yields almost the same Cost as an algorithm that does not consider the add/drop ratio when the ratio is not so stringent, say, greater than 0.3. It is also demonstrated that choosing the waveband capacity properly is critical in minimizing total Network Cost.
-
an efficient hierarchical optical path Network design algorithm based on a traffic demand expression in a cartesian product space
IEEE Journal on Selected Areas in Communications, 2008Co-Authors: Isao Yagyu, Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a hierarchical optical path Network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesian product space that allows the 'closeness' among wavelength paths to be assessed. By grouping 'close' wavelength paths, found by searching for clusters in the space, we iteratively create waveband paths that efficiently accommodate the wavelength paths. Numerical experiments demonstrate that the proposed algorithm offers lower total Network Cost than the conventional algorithms. The results also show that the hierarchical optical path Network is effective even when traffic demand is relatively small.
-
multi layered photonic Network design considering incremental traffic growth and different service contract terms
European Conference on Optical Communication, 2005Co-Authors: K Kanie, Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a quasi-dynamic multi-layered photonic Network design that achieves Cost-effective incremental expansion to accommodate future broadband services. With several design examples, we give an organized perspective of such a design to optimize the Network Cost. (4 pages)
Hiroshi Hasegawa - One of the best experts on this subject based on the ideXlab platform.
-
large capacity optical Networks applying multi stage hetero granular optical path routing
Optical Switching and Networking, 2014Co-Authors: Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a novel scalable large-scale OXC architecture with a two-stage hetero-granular optical path switching mechanism based on a combination of different granular optical selective switches and an appropriate Network design algorithm that can make the best use of the proposed OXC architecture for building Cost-effective large capacity optical Networks. Simulation results verify that our proposed solution can offer a significant overall Network Cost reduction. The Cost efficiency of Networks based on the architecture is also investigated in relation to switching component Cost and different Network parameters.
-
Impact of electrical grooming and regeneration of wavelength paths in creating hierarchical optical path Networks
Optics express, 2011Co-Authors: Hiroshi Hasegawa, Ken-ichi SatoAbstract:We assess the impact of utilizing electrical cross-connects for the intermediate grooming and 3R regeneration of wavelength paths in a hybrid hierarchical optical path Network. Simulation results prove that they offer a significant Cost reduction. We also investigate the dependencies of Network Cost on Network parameters including optically-transparent reach, electrical switch port Cost, and waveband capacity. It is demonstrated that it is critical to choose the waveband capacity properly in order to minimize total Network Cost.
-
hierarchical optical path Network design algorithm considering waveband add drop ratio constraint
IEEE\ OSA Journal of Optical Communications and Networking, 2010Co-Authors: Hiroshi Hasegawa, Ken-ichi SatoAbstract:A new hierarchical optical path Network design algorithm that incorporates restrictions on waveband add/drop ratios at nodes is proposed. We evaluate its effectiveness by conducting extensive numerical experiments. The effects of the Network parameters, which include Network size, link distance, and Network topology, on total Network Cost are elucidated. The results show that the proposed algorithm, which considers restrictions on the waveband add/drop ratio, yields almost the same Cost as an algorithm that does not consider the add/drop ratio when the ratio is not so stringent, say, greater than 0.3. It is also demonstrated that choosing the waveband capacity properly is critical in minimizing total Network Cost.
-
an efficient hierarchical optical path Network design algorithm based on a traffic demand expression in a cartesian product space
IEEE Journal on Selected Areas in Communications, 2008Co-Authors: Isao Yagyu, Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a hierarchical optical path Network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesian product space that allows the 'closeness' among wavelength paths to be assessed. By grouping 'close' wavelength paths, found by searching for clusters in the space, we iteratively create waveband paths that efficiently accommodate the wavelength paths. Numerical experiments demonstrate that the proposed algorithm offers lower total Network Cost than the conventional algorithms. The results also show that the hierarchical optical path Network is effective even when traffic demand is relatively small.
-
multi layered photonic Network design considering incremental traffic growth and different service contract terms
European Conference on Optical Communication, 2005Co-Authors: K Kanie, Hiroshi Hasegawa, Ken-ichi SatoAbstract:We propose a quasi-dynamic multi-layered photonic Network design that achieves Cost-effective incremental expansion to accommodate future broadband services. With several design examples, we give an organized perspective of such a design to optimize the Network Cost. (4 pages)
Yuri P Molina - One of the best experts on this subject based on the ideXlab platform.
-
allocation of transmission Network Cost using modified z bus matrix
International Journal of Electrical Power & Energy Systems, 2014Co-Authors: Yuri P Molina, Osvaldo R Saavedra, Carlos PortugalAbstract:Abstract This paper presents a new method to allocate the transmission Cost among generators and loads. The allocation is calculated for each transmission line through the identification and quantification of a fair distribution of both generators and loads. This method is based on circuit theory using modified impedance matrix. A two-step scheme is performed here: (1) in order to determine the participation of generators in the Costs of the transmission Network the generators are modeled as current sources and loads as constant impedances. (2) to determine the contributions of loads in the Cost of the transmission Network the loads are modeled as current sources and generators as constant impedances. Numerical results with a four-bus test system, as well as with IEEE 24-bus test system are reported and discussed to demonstrate the applicability of the proposed method.
-
transmission Network Cost allocation based on circuit theory and the aumann shapley method
IEEE Transactions on Power Systems, 2013Co-Authors: Yuri P Molina, Osvaldo R Saavedra, Hortensia AmarisAbstract:This paper presents a new method to allocate the Costs of the transmission system among generators and loads. The allocation is calculated for each branch of the transmission system to identify and quantify the individual responsibility of generators and loads. A two-step method based on the perfect coupling of the circuit theory with the Aumann-Shapley method is proposed here. First: to determine the participation of the generators in the Costs of the transmission Network, the generators are modeled as current injections and the loads as impedances. Second: to determine the participation of the loads in the Cost of the transmission Network, the loads are modeled as current sources and the generators as impedances. The Aumann-Shapley method and the circuit theory are used to calculate the participation of each real and imaginary current component in the “Allocation of the Costs of the transmission system” game by considering them as independent agents. The properties of the Aumann-Shapley method ensure equitable allocation and recovery of the total Costs. Numerical results are presented and discussed to demonstrate the applicability of the proposed method.
Antonio J Conejo - One of the best experts on this subject based on the ideXlab platform.
-
transmission Network Cost allocation based on equivalent bilateral exchanges
IEEE Transactions on Power Systems, 2003Co-Authors: F D Galiana, Antonio J ConejoAbstract:This paper presents a novel methodology for allocating the Cost of a transmission Network to its users based on the principle of equivalent bilateral exchanges, which states that after all physical laws governing the flow of power have been met, each demand is assigned a fraction of each generation and each generator is assigned a fraction of each demand in a uniform manner. Transmission Cost allocation based on this principle presents several advantages, namely, independence from the choice of the slack bus, recognition of counter-flows, and transmission use charges that are stable and always positive.
