The Experts below are selected from a list of 7686 Experts worldwide ranked by ideXlab platform
Meng-lin Hung - One of the best experts on this subject based on the ideXlab platform.
-
Finding Routing Paths for Alternate Routing in All-Optical WDM Networks
Journal of Lightwave Technology, 2008Co-Authors: Hwa-chun Lin, Sheng-wei Wang, Meng-lin HungAbstract:An alternate routing algorithm requires a set of predetermined routing paths between each source-Destination Pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-Destination Pair be link-disjoint. The predetermined routing paths used in previous works on alternate routing are the -shortest link-disjoint paths in terms of hop count. The shared links among the -shortest link-disjoint paths between different source-Destination Pairs may cause high connection blocking probability. Thus, depending on the traffic requirements of all source-Destination Pairs, hop-count based -shortest link-disjoint paths may not be the best choice for the predetermined routing paths. This paper proposes a method to find a set of link-disjoint routing paths between each source-Destination Pair to be used by an alternate routing algorithm in order to reduce the connection blocking probability. The key idea is to find a set of link-disjoint routing paths based on the routing paths that are utilized by the optimal traffic pattern in the network. Then, for each source-Destination Pair, we select a set of link-disjoint routing paths from the routing paths that are utilized by the optimal traffic pattern such that the selected set of link-disjoint routing paths carries the most of the traffic between the source-Destination Pair. Simulations are performed to compare the performance of using the link-disjoint routing paths found by the proposed method as the predetermined routing paths and those of using the hop-count based -shortest link-disjoint paths and employing the routing paths found by the capacity-balanced alternate routing method proposed method by Ho and Mouftah (in 2002) as the predetermined routing paths. Our simulation results show that using the link-disjoint routing paths found by the proposed method yields significantly lower connection blocking probability than employing the hop-count based -shortest link-disjoint paths and using the routing paths found by the capacity-balanced alternate routing method (Ho and Mouftah, 2002).
-
Finding Routing Paths for Alternate Routing in All-Optical WDM Networks
Journal of Lightwave Technology, 2008Co-Authors: Hwa-chun Lin, Sheng-wei Wang, Meng-lin HungAbstract:[[abstract]]An alternate routing algorithm requires a set of predetermined routing paths between each source-Destination Pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-Destination Pair be link-disjoint. The predetermined routing paths used in previous works on alternate routing are the k-shortest link-disjoint paths in terms of hop count. The shared links among the k-shortest link-disjoint paths between different source-Destination Pairs may cause high connection blocking probability. Thus, depending on the traffic requirements of all source-Destination Pairs, hop-count based k-shortest link-disjoint paths may not be the best choice for the predetermined routing paths. This paper proposes a method to find a set of link-disjoint routing paths between each source-Destination Pair to be used by an alternate routing algorithm in order to reduce the connection blocking probability. The key idea is to find a set of link-disjoint routing paths based on the routing paths that are utilized by the optimal traffic pattern in the network. Then, for each source-Destination Pair, we select a set of link-disjoint routing paths from the routing paths that are utilized by the optimal traffic pattern such that the selected set of link-disjoint routing paths carries the most of the traffic between the source-Destination Pair. Simulations are performed to compare the performance of using the link-disjoint routing paths found by the proposed method as the predetermined routing paths and those of using the hop-count based k-shortest link-disjoint paths and employing the routing paths found by the capacity-balanced alternate routing method proposed method by Ho and Mouftah (in 2002) as the predetermined routing paths. Our simulation results show that using the link-disjoint routing paths found by the proposed method yields significantly lower connection blocking probability than employing the hop-count based k-shortest link-disjoint paths and using the routing paths found by the capacity-balanced alternate routing method (Ho and Mouftah, 2002).[[fileno]]2030225010014[[department]]資訊工程學
Giuseppe Caire - One of the best experts on this subject based on the ideXlab platform.
-
Wireless Backhaul Networks: Capacity Bound, Scalability Analysis and Design Guidelines
IEEE Transactions on Wireless Communications, 2015Co-Authors: Harpreet S. Dhillon, Giuseppe CaireAbstract:This paper studies the scalability of a wireless backhaul network modeled as a random extended network with multi-antenna base stations (BSs), where the number of antennas per BS is allowed to scale as a function of the network size. The antenna scaling is justified by the current trend towards the use of higher carrier frequencies, which allows to pack large number of antennas in small form factors. The main goal is to study the per-BS antenna requirement that ensures scalability of this network, i.e., its ability to deliver non-vanishing rate to each source-Destination Pair. We first derive an information theoretic upper bound on the capacity of this network under a general propagation model, which provides a lower bound on the per-BS antenna requirement. Then, we characterize the scalability requirements for two competing strategies of interest: (i) long hop: each source-Destination Pair minimizes the number of hops by sacrificing multiplexing gain while achieving full beamforming (power) gain over each hop, and (ii) short hop: each source-Destination Pair communicates through a series of short hops, each achieving full multiplexing gain. While long hop may seem more intuitive in the context of massive multiple-input multiple-output (MIMO) transmission, we show that the short hop strategy is significantly more efficient in terms of per-BS antenna requirement for throughput scalability. As a part of the proof, we construct a scalable short hop strategy and show that it does not violate any fundamental limits on the spatial degrees of freedom (DoFs).
-
ISIT - Scalability of line-of-sight massive MIMO mesh networks for wireless backhaul
2014 IEEE International Symposium on Information Theory, 2014Co-Authors: Harpreet S. Dhillon, Giuseppe CaireAbstract:This paper considers an extended wireless network with multi-antenna nodes in line-of-sight (LoS) propagation environment. Assuming that the number of antennas at each node can be scaled as some arbitrary function of the number of nodes, we study the scalability of this network, i.e., its ability to deliver non-zero rate to each source-Destination Pair. Since the rank of the LoS multiple-input multiple-output (MIMO) channel starts collapsing with the increasing separation between the transmitter and the receiver, we consider two competing transmission strategies: (i) long hop: each source-Destination Pair minimizes the number of hops by sacrificing multiplexing gain and ideally achieving full power gain over each hop, and (ii) short hop: each source-Destination Pair communicates through a series of short hops each achieving full multiplexing gain. By characterizing the number of antennas required to achieve scalability in both the cases, we show that the antenna requirement is significantly less for the short hop case. These results have key applications in the design of wireless backhaul for cellular networks, where the possibility of having massive MIMO links is becoming a reality due to the increasing maturity of higher transmission frequencies, e.g., 28 and 38 GHz.
Pamela Murraytuite - One of the best experts on this subject based on the ideXlab platform.
-
transportation network risk profile for an origin Destination Pair security measures terrorism and target and attack method substitution
Transportation Research Record, 2008Co-Authors: Pamela MurraytuiteAbstract:Transportation security and mobility often conflict with each other. An open and accessible system provides for the efficient transportation of people and goods; however, this openness also allows malicious entities to exploit the transportation system as a target, weapon, or means to reach another target. Security actions taken to prohibit malicious entities from reaching their targets or to capture them after an attack may degrade the transportation system. Security may also cause the entities to adapt their methods or targets and thus create more complex analysis requirements. This paper describes the incorporation of two types of substitution (method and target) into a methodology to determine the risk profile for the transportation system because of attacks on the transportation system itself, collateral damage to the network because of targeting of adjacent assets, and preevent and postattack security measure implementation. Monte Carlo simulation generated scenarios of target, attack methods, intel...
Hwa-chun Lin - One of the best experts on this subject based on the ideXlab platform.
-
Finding Routing Paths for Alternate Routing in All-Optical WDM Networks
Journal of Lightwave Technology, 2008Co-Authors: Hwa-chun Lin, Sheng-wei Wang, Meng-lin HungAbstract:An alternate routing algorithm requires a set of predetermined routing paths between each source-Destination Pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-Destination Pair be link-disjoint. The predetermined routing paths used in previous works on alternate routing are the -shortest link-disjoint paths in terms of hop count. The shared links among the -shortest link-disjoint paths between different source-Destination Pairs may cause high connection blocking probability. Thus, depending on the traffic requirements of all source-Destination Pairs, hop-count based -shortest link-disjoint paths may not be the best choice for the predetermined routing paths. This paper proposes a method to find a set of link-disjoint routing paths between each source-Destination Pair to be used by an alternate routing algorithm in order to reduce the connection blocking probability. The key idea is to find a set of link-disjoint routing paths based on the routing paths that are utilized by the optimal traffic pattern in the network. Then, for each source-Destination Pair, we select a set of link-disjoint routing paths from the routing paths that are utilized by the optimal traffic pattern such that the selected set of link-disjoint routing paths carries the most of the traffic between the source-Destination Pair. Simulations are performed to compare the performance of using the link-disjoint routing paths found by the proposed method as the predetermined routing paths and those of using the hop-count based -shortest link-disjoint paths and employing the routing paths found by the capacity-balanced alternate routing method proposed method by Ho and Mouftah (in 2002) as the predetermined routing paths. Our simulation results show that using the link-disjoint routing paths found by the proposed method yields significantly lower connection blocking probability than employing the hop-count based -shortest link-disjoint paths and using the routing paths found by the capacity-balanced alternate routing method (Ho and Mouftah, 2002).
-
Finding Routing Paths for Alternate Routing in All-Optical WDM Networks
Journal of Lightwave Technology, 2008Co-Authors: Hwa-chun Lin, Sheng-wei Wang, Meng-lin HungAbstract:[[abstract]]An alternate routing algorithm requires a set of predetermined routing paths between each source-Destination Pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-Destination Pair be link-disjoint. The predetermined routing paths used in previous works on alternate routing are the k-shortest link-disjoint paths in terms of hop count. The shared links among the k-shortest link-disjoint paths between different source-Destination Pairs may cause high connection blocking probability. Thus, depending on the traffic requirements of all source-Destination Pairs, hop-count based k-shortest link-disjoint paths may not be the best choice for the predetermined routing paths. This paper proposes a method to find a set of link-disjoint routing paths between each source-Destination Pair to be used by an alternate routing algorithm in order to reduce the connection blocking probability. The key idea is to find a set of link-disjoint routing paths based on the routing paths that are utilized by the optimal traffic pattern in the network. Then, for each source-Destination Pair, we select a set of link-disjoint routing paths from the routing paths that are utilized by the optimal traffic pattern such that the selected set of link-disjoint routing paths carries the most of the traffic between the source-Destination Pair. Simulations are performed to compare the performance of using the link-disjoint routing paths found by the proposed method as the predetermined routing paths and those of using the hop-count based k-shortest link-disjoint paths and employing the routing paths found by the capacity-balanced alternate routing method proposed method by Ho and Mouftah (in 2002) as the predetermined routing paths. Our simulation results show that using the link-disjoint routing paths found by the proposed method yields significantly lower connection blocking probability than employing the hop-count based k-shortest link-disjoint paths and using the routing paths found by the capacity-balanced alternate routing method (Ho and Mouftah, 2002).[[fileno]]2030225010014[[department]]資訊工程學
Lajos Hanzo - One of the best experts on this subject based on the ideXlab platform.
-
Secrecy Outage and Diversity Analysis of Multiple Cooperating Source-Destination Pairs
IEEE Transactions on Vehicular Technology, 2020Co-Authors: Xiaojin Ding, Yulong Zou, Xiaoshu Chen, Xiaojun Wang, Lajos HanzoAbstract:We study the physical-layer security of multiple source-Destination (SD) Pairs communicating within a wireless network in the face of an eavesdropper attacking the SD Pairs. In order to protect the wireless transmission against eavesdropping, we propose a cooperation framework relying on two stages. Specifically, an SD Pair is selected to access the total allocated spectrum using an appropriately designed scheme at the beginning of the first stage. The other source nodes (SNs) simultaneously transmit their data to the SN of the above-mentioned SD Pair relying on orthogonal resources during the first stage. Then, the SN of the chosen SD Pair transmits the data packets containing its own messages and the other SNs’ messages to its dedicated Destination node (DN) in the second stage. Finally, this dedicated DN will forward all the other DNs’ data to the application center via the core network. We conceive a specific SD Pair selection scheme, termed as the transmit antenna selection aided source-Destination Pair selection (TAS-SDPS). We continue by deriving the secrecy outage probability (SOP) expressions of both the TAS-SDPS conceived, as well as of the conventional round-robin source-Destination Pair selection (RSDPS) and of the conventional non-cooperative (Non-coop) schemes for comparison. Furthermore, we carry out the secrecy diversity gain analysis in the high main-to-eavesdropper ratio (MER) region, showing that the TAS-SDPS scheme is capable of achieving the maximum attainable secrecy diversity order. Additionally, we show that increasing the number of transmitting Pairs will reduce the SOP, whilst increasing the secrecy diversity order of the TAS-SDPS scheme. It is demonstrated that the SOP of the TAS-SDPS scheme is better than that of the RSDPS and of the conventional Non-coop schemes. We also demonstrate that the secrecy diversity gain of the proposed TAS-SDPS scheme is $M$ times that of the RSDPS scheme in the high-MER region, where $M$ is the number of the SD Pairs.
-
Secrecy Outage and Diversity Analysis of Multiple Cooperative Source-Destination Pairs
arXiv: Information Theory, 2019Co-Authors: Xiaojin Ding, Yulong Zou, Xiaoshu Chen, Xiaojun Wang, Lajos HanzoAbstract:We study the physical-layer security of a multiple source-Destination (SD) Pairs coexisting wireless network in the face of an eavesdropper, where an eavesdropper intends to wiretap the signal transmitted by the SD Pairs. In order to protect the wireless transmission against eavesdropping, we propose a cooperation framework relying on two stages. Specifically, an SD Pair is selected to access the total allocated spectrum using an appropriately designed scheme at the beginning of the first stage. The other source nodes (SNs) simultaneously transmit their data to the SN of the above-mentioned SD Pair relying on an orthogonal way during the first stage. Then, the SN of the chosen SD Pair transmits the data packets containing its own messages and the other SNs' messages to its dedicated Destination node (DN) in the second stage, which in turn will forward all the other DNs' data to the application center via the core network. We conceive a specific SD Pair selection scheme, termed as the transmit antenna selection aided source-Destination Pair selection (TAS-SDPS). We derive the secrecy outage probability (SOP) expressions for the TAS-SDPS, as well as for the conventional round-robin source-Destination Pair selection (RSDPS) and non-cooperative (Non-coop) schemes for comparison purposes. Furthermore, we carry out the secrecy diversity gain analysis in the high main-to-eavesdropper ratio (MER) region, showing that the TAS-SDPS scheme is capable of achieving the maximum attainable secrecy diversity order.