Search

In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a given power setting. However, these models are typically quite simple and neglect the impact from fading as well as from dynamic resource allocation performed at the base stations on a millisecond basis. Ignoring such properties of OFDMA networks leads therefore to suboptimal transmit power settings. In this paper, we study the impact from a precise rate prediction model that accurately accounts for fading and dynamic resource allocation. On the down-side, this more precise model leads to a much more involved optimization problem to be solved once per coordination period. We propose two different heuristic methods to deal with this problem. Especially the usage of genetic algorithm results to be promising to counteract the complexity increase. We then study the overall system performance and find precise rate prediction models to be essential for semi-static interference coordination as they provide significant performance improvements in comparison to approaches with simpler models., QC 20130830

In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a given power setting. However, these models are typically quite simple and neglect the impact from fading as well as from dynamic resource allocation performed at the base stations on a millisecond basis. Ignoring such properties of OFDMA networks leads therefore to suboptimal transmit power settings. In this paper, we study the impact from a precise rate prediction model that accurately accounts for fading and dynamic resource allocation. On the down-side, this more precise model leads to a much more involved optimization problem to be solved once per coordination period. We propose two different heuristic methods to deal with this problem. Especially the usage of genetic algorithm results to be promising to counteract the complexity increase. We then study the overall system performance and find precise rate prediction models to be essential for semi-static interference coordination as they provide significant performance improvements in comparison to approaches with simpler models., QC 20130830

In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a given power setting. However, these models are typically quite simple and neglect the impact from fading as well as from dynamic resource allocation performed at the base stations on a millisecond basis. Ignoring such properties of OFDMA networks leads therefore to suboptimal transmit power settings. In this paper, we study the impact from a precise rate prediction model that accurately accounts for fading and dynamic resource allocation. On the down-side, this more precise model leads to a much more involved optimization problem to be solved once per coordination period. We propose two different heuristic methods to deal with this problem. Especially the usage of genetic algorithm results to be promising to counteract the complexity increase. We then study the overall system performance and find precise rate prediction models to be essential for semi-static interference coordination as they provide significant performance improvements in comparison to approaches with simpler models., QC 20130830

In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a given power setting. However, these models are typically quite simple and neglect the impact from fading as well as from dynamic resource allocation performed at the base stations on a millisecond basis. Ignoring such properties of OFDMA networks leads therefore to suboptimal transmit power settings. In this paper, we study the impact from a precise rate prediction model that accurately accounts for fading and dynamic resource allocation. On the down-side, this more precise model leads to a much more involved optimization problem to be solved once per coordination period. We propose two different heuristic methods to deal with this problem. Especially the usage of genetic algorithm results to be promising to counteract the complexity increase. We then study the overall system performance and find precise rate prediction models to be essential for semi-static interference coordination as they provide significant performance improvements in comparison to approaches with simpler models., QC 20130830

In this paper we consider the design of semi-static inter-cell interference coordination schemes for LTE networks. In this approach, base stations coordinate the power settings per resource block over long time spans such as seconds. In order to optimize the power settings, one needs to employ models which predict the rate of terminals over the next coordination period under the usage of a given power setting. However, these models are typically quite simple and neglect the impact from fading as well as from dynamic resource allocation performed at the base stations on a millisecond basis. Ignoring such properties of OFDMA networks leads therefore to suboptimal transmit power settings. In this paper, we study the impact from a precise rate prediction model that accurately accounts for fading and dynamic resource allocation. On the down-side, this more precise model leads to a much more involved optimization problem to be solved once per coordination period. We propose two different heuristic methods to deal with this problem. Especially the usage of genetic algorithm results to be promising to counteract the complexity increase. We then study the overall system performance and find precise rate prediction models to be essential for semi-static interference coordination as they provide significant performance improvements in comparison to approaches with simpler models., QC 20130830

The proliferation of wireless communications has lead to a high interest to establish this technology in industrial settings. The main arguments in favor of wireless are reduced costs in deployment and maintenance, as well as increased flexibility. In contrast to home and office environments, industrial settings include mission-critical machine-to-machine applications, demanding stringent requirements for reliability and latency in the area of 1-10-9 PDR and 1ms, respectively. One way to achieve both is cooperative Automatic Repeat reQuest (ARQ), which leverages spatial diversity. This paper presents a wireless multi-user Time Division Multiple Access system with cooperative ARQ for mission-critical communication. We evaluate two design options analytically, using an outage-capacity model, to investigate whether the relaying of messages should be performed centrally at a multi-antenna AP with perfect Channel State Information (CSI) or decentrally at simultaneously transmitting stations with average CSI. Results indicate that both options are able to achieve the targeted communication guarantees when a certain degree of diversity is implemented, showing a stable system performance even with an increasing number of stations., QC 20160512

The proliferation of wireless communications has lead to a high interest to establish this technology in industrial settings. The main arguments in favor of wireless are reduced costs in deployment and maintenance, as well as increased flexibility. In contrast to home and office environments, industrial settings include mission-critical machine-to-machine applications, demanding stringent requirements for reliability and latency in the area of 1-10-9 PDR and 1ms, respectively. One way to achieve both is cooperative Automatic Repeat reQuest (ARQ), which leverages spatial diversity. This paper presents a wireless multi-user Time Division Multiple Access system with cooperative ARQ for mission-critical communication. We evaluate two design options analytically, using an outage-capacity model, to investigate whether the relaying of messages should be performed centrally at a multi-antenna AP with perfect Channel State Information (CSI) or decentrally at simultaneously transmitting stations with average CSI. Results indicate that both options are able to achieve the targeted communication guarantees when a certain degree of diversity is implemented, showing a stable system performance even with an increasing number of stations., QC 20160512

The proliferation of wireless communications has lead to a high interest to establish this technology in industrial settings. The main arguments in favor of wireless are reduced costs in deployment and maintenance, as well as increased flexibility. In contrast to home and office environments, industrial settings include mission-critical machine-to-machine applications, demanding stringent requirements for reliability and latency in the area of 1-10-9 PDR and 1ms, respectively. One way to achieve both is cooperative Automatic Repeat reQuest (ARQ), which leverages spatial diversity. This paper presents a wireless multi-user Time Division Multiple Access system with cooperative ARQ for mission-critical communication. We evaluate two design options analytically, using an outage-capacity model, to investigate whether the relaying of messages should be performed centrally at a multi-antenna AP with perfect Channel State Information (CSI) or decentrally at simultaneously transmitting stations with average CSI. Results indicate that both options are able to achieve the targeted communication guarantees when a certain degree of diversity is implemented, showing a stable system performance even with an increasing number of stations., QC 20160512

The proliferation of wireless communications has lead to a high interest to establish this technology in industrial settings. The main arguments in favor of wireless are reduced costs in deployment and maintenance, as well as increased flexibility. In contrast to home and office environments, industrial settings include mission-critical machine-to-machine applications, demanding stringent requirements for reliability and latency in the area of 1-10-9 PDR and 1ms, respectively. One way to achieve both is cooperative Automatic Repeat reQuest (ARQ), which leverages spatial diversity. This paper presents a wireless multi-user Time Division Multiple Access system with cooperative ARQ for mission-critical communication. We evaluate two design options analytically, using an outage-capacity model, to investigate whether the relaying of messages should be performed centrally at a multi-antenna AP with perfect Channel State Information (CSI) or decentrally at simultaneously transmitting stations with average CSI. Results indicate that both options are able to achieve the targeted communication guarantees when a certain degree of diversity is implemented, showing a stable system performance even with an increasing number of stations., QC 20160512

The proliferation of wireless communications has lead to a high interest to establish this technology in industrial settings. The main arguments in favor of wireless are reduced costs in deployment and maintenance, as well as increased flexibility. In contrast to home and office environments, industrial settings include mission-critical machine-to-machine applications, demanding stringent requirements for reliability and latency in the area of 1-10-9 PDR and 1ms, respectively. One way to achieve both is cooperative Automatic Repeat reQuest (ARQ), which leverages spatial diversity. This paper presents a wireless multi-user Time Division Multiple Access system with cooperative ARQ for mission-critical communication. We evaluate two design options analytically, using an outage-capacity model, to investigate whether the relaying of messages should be performed centrally at a multi-antenna AP with perfect Channel State Information (CSI) or decentrally at simultaneously transmitting stations with average CSI. Results indicate that both options are able to achieve the targeted communication guarantees when a certain degree of diversity is implemented, showing a stable system performance even with an increasing number of stations., QC 20160512

Spurred by recent industrial trends, such as factoryautomation or phase synchronization in the smart grid, thereis a significant interest for wireless industrial networks lately.In contrast to traditional applications, the focus is on carryingout communication at very short latencies together with highreliabilities. Meeting such extreme requirements with wirelessnetworks is challenging. A potential candidate for such a networkis a token-passing protocol, as it allows to bound latencies.However, it lacks mechanisms to cope with the dynamics ofwireless channels. In this paper, we present EchoRing, a novelwireless token-passing protocol. Cooperative communication andan improved fault tolerance allow this decentralized protocol tosupport industrial applications over wireless networks. Based onexperimental results, we demonstrate the suitability of EchoRingto support demands of industrial applications. EchoRing outper-forms other schemes by several orders of magnitude in terms ofreliability for latencies of and below10ms., QC 20150715

Spurred by recent industrial trends, such as factoryautomation or phase synchronization in the smart grid, thereis a significant interest for wireless industrial networks lately.In contrast to traditional applications, the focus is on carryingout communication at very short latencies together with highreliabilities. Meeting such extreme requirements with wirelessnetworks is challenging. A potential candidate for such a networkis a token-passing protocol, as it allows to bound latencies.However, it lacks mechanisms to cope with the dynamics ofwireless channels. In this paper, we present EchoRing, a novelwireless token-passing protocol. Cooperative communication andan improved fault tolerance allow this decentralized protocol tosupport industrial applications over wireless networks. Based onexperimental results, we demonstrate the suitability of EchoRingto support demands of industrial applications. EchoRing outper-forms other schemes by several orders of magnitude in terms ofreliability for latencies of and below10ms., QC 20150715

Spurred by recent industrial trends, such as factoryautomation or phase synchronization in the smart grid, thereis a significant interest for wireless industrial networks lately.In contrast to traditional applications, the focus is on carryingout communication at very short latencies together with highreliabilities. Meeting such extreme requirements with wirelessnetworks is challenging. A potential candidate for such a networkis a token-passing protocol, as it allows to bound latencies.However, it lacks mechanisms to cope with the dynamics ofwireless channels. In this paper, we present EchoRing, a novelwireless token-passing protocol. Cooperative communication andan improved fault tolerance allow this decentralized protocol tosupport industrial applications over wireless networks. Based onexperimental results, we demonstrate the suitability of EchoRingto support demands of industrial applications. EchoRing outper-forms other schemes by several orders of magnitude in terms ofreliability for latencies of and below10ms., QC 20150715

Spurred by recent industrial trends, such as factoryautomation or phase synchronization in the smart grid, thereis a significant interest for wireless industrial networks lately.In contrast to traditional applications, the focus is on carryingout communication at very short latencies together with highreliabilities. Meeting such extreme requirements with wirelessnetworks is challenging. A potential candidate for such a networkis a token-passing protocol, as it allows to bound latencies.However, it lacks mechanisms to cope with the dynamics ofwireless channels. In this paper, we present EchoRing, a novelwireless token-passing protocol. Cooperative communication andan improved fault tolerance allow this decentralized protocol tosupport industrial applications over wireless networks. Based onexperimental results, we demonstrate the suitability of EchoRingto support demands of industrial applications. EchoRing outper-forms other schemes by several orders of magnitude in terms ofreliability for latencies of and below10ms., QC 20150715

Spurred by recent industrial trends, such as factoryautomation or phase synchronization in the smart grid, thereis a significant interest for wireless industrial networks lately.In contrast to traditional applications, the focus is on carryingout communication at very short latencies together with highreliabilities. Meeting such extreme requirements with wirelessnetworks is challenging. A potential candidate for such a networkis a token-passing protocol, as it allows to bound latencies.However, it lacks mechanisms to cope with the dynamics ofwireless channels. In this paper, we present EchoRing, a novelwireless token-passing protocol. Cooperative communication andan improved fault tolerance allow this decentralized protocol tosupport industrial applications over wireless networks. Based onexperimental results, we demonstrate the suitability of EchoRingto support demands of industrial applications. EchoRing outper-forms other schemes by several orders of magnitude in terms ofreliability for latencies of and below10ms., QC 20150715

In this paper we generalize analytical performance models for proportional fair scheduling in OFDMA/LTE networks. We address the issue of modelling multiple fading interferers present in practical deployments. Specifically, we elaborate on the stochastic modelling of SINR-distribution for which we derive the rate expectation of instantaneously scheduled resources. The resulting analytical performance model is validated by means of simulations considering realistic network deployments. Compared with related work, our model demonstrates a significantly higher accuracy for long-term rate estimation. We illustrate the utility of such high-precision models by studying the impact on terminal assignment in fractional frequency reuse. Simply by using a suitable estimation model, cell-edge throughput can be improved up to 50%., QC 20150123

In this paper we generalize analytical performance models for proportional fair scheduling in OFDMA/LTE networks. We address the issue of modelling multiple fading interferers present in practical deployments. Specifically, we elaborate on the stochastic modelling of SINR-distribution for which we derive the rate expectation of instantaneously scheduled resources. The resulting analytical performance model is validated by means of simulations considering realistic network deployments. Compared with related work, our model demonstrates a significantly higher accuracy for long-term rate estimation. We illustrate the utility of such high-precision models by studying the impact on terminal assignment in fractional frequency reuse. Simply by using a suitable estimation model, cell-edge throughput can be improved up to 50%., QC 20150123

Jamming is a well-known reliability threat for mass-market wireless networks. With the rise of safety-critical applications this is likely to become a constraining issue in the future. Thus, the design of accurate jamming detection algorithms becomes important to react to ongoing jamming attacks. With respect to experimental work, jamming detection has been mainly studied for sensor networks. However, many safety-critical applications are also likely to run over 802.11-based networks where the proposed approaches do not carry over. In this paper we present a jamming detection approach for 802.11 networks. It uses metrics that are accessible through standard device drivers and performs detection via machine learning. While it allows for stand-alone operation, it also enables cooperative detection. We experimentally show that our approach achieves remarkably high detection rates in indoor and mobile outdoor scenarios even under challenging link conditions., QC 20150123

In this paper, we focus on a Cognitive Relay Network (CRN) where only the information of the average channel gains is available at the secondary source. A distributed multiple relay selection scheme is proposed for the secondary transmission. Since the secondary source does not fully control the selection but lets each secondary relay decide by itself, it doesn't know which and how many relays will participate in the forwarding. This brings a serious uncertainty in the number of forwarding relays. We analyze this uncertainty and derive the closed-form expression of the outage probability of the secondary transmission under the uncertainty. Finally, we evaluate the proposed relay selection scheme by means of simulation. The simulation shows the appropriateness of our analytical model. In addition, although having lower interference constraint at each relay, the performances of the proposed multi-relay CRN scheme are shown to be strictly superior to the single relay CRN. Moreover, the simulation results suggest that it is necessary to spend the general overhead for secondary networks on knowing the exact QoS requirement of the primary user (i.e. the interference violation probability) to apply our proposed relay selection scheme with the statistical total interference constraint., QC 20150123

Parallel and distributed simulation have been extensively researched for a long time. Nevertheless, many simulation models are still executed sequentially. We attribute this to the fact that many of those models are simply not capable of being executed in parallel since they violate particular constraints. In this paper, we analyze the INET model suite, which enables network simulation in OMNeT++ with regard to parallelizability. We uncovered several issues preventing parallel execution of INET models. We analyzed those issues and developed solutions allowing INET models to be run in parallel. A case study shows the feasibility of our approach. Though there are parts of the model suite that we didn’t investigate yet and the performance can still be improved, the results show parallelization speedup for most configurations. The source code of our implementation is available through our web site at code.comsys.rwth-aachen.de, QC 20150123

Parallelization is crucial for ecient execution of large-scale network simulation. Today's computing clusters commonly used for that purpose are built from a large amount of multiprocessor machines. The traditional approach to utilize all CPU cores in such a system is to partition the network and distribute the partitions to the cores. This, however, does not incorporate the presence of shared memory into the design, such that messages between partitions on the same computing node have to be serialized and synchronization becomes more complex. In this paper, we present an approach that combines the shared-memory parallelization scheme Horizon [9] with the standard approach to distributed simulation to leverage the strengths of today's computing clusters. To further reduce the synchronization overhead, we introduce a novel synchronization algorithm that takes domain knowledge into account to reduce the number of synchronization points. In a case study with a UMTS LTE model, we show that both contributions combined enable much higher scalability achieving almost linear speedup when simulating 1,536 LTE cells on 1,536 CPU cores., QC 20150123

In this paper we generalize analytical performance models for proportional fair scheduling in OFDMA/LTE networks. We address the issue of modelling multiple fading interferers present in practical deployments. Specifically, we elaborate on the stochastic modelling of SINR-distribution for which we derive the rate expectation of instantaneously scheduled resources. The resulting analytical performance model is validated by means of simulations considering realistic network deployments. Compared with related work, our model demonstrates a significantly higher accuracy for long-term rate estimation. We illustrate the utility of such high-precision models by studying the impact on terminal assignment in fractional frequency reuse. Simply by using a suitable estimation model, cell-edge throughput can be improved up to 50%., QC 20150123

In this paper we generalize analytical performance models for proportional fair scheduling in OFDMA/LTE networks. We address the issue of modelling multiple fading interferers present in practical deployments. Specifically, we elaborate on the stochastic modelling of SINR-distribution for which we derive the rate expectation of instantaneously scheduled resources. The resulting analytical performance model is validated by means of simulations considering realistic network deployments. Compared with related work, our model demonstrates a significantly higher accuracy for long-term rate estimation. We illustrate the utility of such high-precision models by studying the impact on terminal assignment in fractional frequency reuse. Simply by using a suitable estimation model, cell-edge throughput can be improved up to 50%., QC 20150123

In this paper we generalize analytical performance models for proportional fair scheduling in OFDMA/LTE networks. We address the issue of modelling multiple fading interferers present in practical deployments. Specifically, we elaborate on the stochastic modelling of SINR-distribution for which we derive the rate expectation of instantaneously scheduled resources. The resulting analytical performance model is validated by means of simulations considering realistic network deployments. Compared with related work, our model demonstrates a significantly higher accuracy for long-term rate estimation. We illustrate the utility of such high-precision models by studying the impact on terminal assignment in fractional frequency reuse. Simply by using a suitable estimation model, cell-edge throughput can be improved up to 50%., QC 20150123

In this paper, we focus on a Cognitive Relay Network (CRN) where only the information of the average channel gains is available at the secondary source. A distributed multiple relay selection scheme is proposed for the secondary transmission. Since the secondary source does not fully control the selection but lets each secondary relay decide by itself, it doesn't know which and how many relays will participate in the forwarding. This brings a serious uncertainty in the number of forwarding relays. We analyze this uncertainty and derive the closed-form expression of the outage probability of the secondary transmission under the uncertainty. Finally, we evaluate the proposed relay selection scheme by means of simulation. The simulation shows the appropriateness of our analytical model. In addition, although having lower interference constraint at each relay, the performances of the proposed multi-relay CRN scheme are shown to be strictly superior to the single relay CRN. Moreover, the simulation results suggest that it is necessary to spend the general overhead for secondary networks on knowing the exact QoS requirement of the primary user (i.e. the interference violation probability) to apply our proposed relay selection scheme with the statistical total interference constraint., QC 20150123

Jamming is a well-known reliability threat for mass-market wireless networks. With the rise of safety-critical applications this is likely to become a constraining issue in the future. Thus, the design of accurate jamming detection algorithms becomes important to react to ongoing jamming attacks. With respect to experimental work, jamming detection has been mainly studied for sensor networks. However, many safety-critical applications are also likely to run over 802.11-based networks where the proposed approaches do not carry over. In this paper we present a jamming detection approach for 802.11 networks. It uses metrics that are accessible through standard device drivers and performs detection via machine learning. While it allows for stand-alone operation, it also enables cooperative detection. We experimentally show that our approach achieves remarkably high detection rates in indoor and mobile outdoor scenarios even under challenging link conditions., QC 20150123

Parallel and distributed simulation have been extensively researched for a long time. Nevertheless, many simulation models are still executed sequentially. We attribute this to the fact that many of those models are simply not capable of being executed in parallel since they violate particular constraints. In this paper, we analyze the INET model suite, which enables network simulation in OMNeT++ with regard to parallelizability. We uncovered several issues preventing parallel execution of INET models. We analyzed those issues and developed solutions allowing INET models to be run in parallel. A case study shows the feasibility of our approach. Though there are parts of the model suite that we didn’t investigate yet and the performance can still be improved, the results show parallelization speedup for most configurations. The source code of our implementation is available through our web site at code.comsys.rwth-aachen.de, QC 20150123

Jamming is a well-known reliability threat for mass-market wireless networks. With the rise of safety-critical applications this is likely to become a constraining issue in the future. Thus, the design of accurate jamming detection algorithms becomes important to react to ongoing jamming attacks. With respect to experimental work, jamming detection has been mainly studied for sensor networks. However, many safety-critical applications are also likely to run over 802.11-based networks where the proposed approaches do not carry over. In this paper we present a jamming detection approach for 802.11 networks. It uses metrics that are accessible through standard device drivers and performs detection via machine learning. While it allows for stand-alone operation, it also enables cooperative detection. We experimentally show that our approach achieves remarkably high detection rates in indoor and mobile outdoor scenarios even under challenging link conditions., QC 20150123

Parallel and distributed simulation have been extensively researched for a long time. Nevertheless, many simulation models are still executed sequentially. We attribute this to the fact that many of those models are simply not capable of being executed in parallel since they violate particular constraints. In this paper, we analyze the INET model suite, which enables network simulation in OMNeT++ with regard to parallelizability. We uncovered several issues preventing parallel execution of INET models. We analyzed those issues and developed solutions allowing INET models to be run in parallel. A case study shows the feasibility of our approach. Though there are parts of the model suite that we didn’t investigate yet and the performance can still be improved, the results show parallelization speedup for most configurations. The source code of our implementation is available through our web site at code.comsys.rwth-aachen.de, QC 20150123

In this paper, we focus on a Cognitive Relay Network (CRN) where only the information of the average channel gains is available at the secondary source. A distributed multiple relay selection scheme is proposed for the secondary transmission. Since the secondary source does not fully control the selection but lets each secondary relay decide by itself, it doesn't know which and how many relays will participate in the forwarding. This brings a serious uncertainty in the number of forwarding relays. We analyze this uncertainty and derive the closed-form expression of the outage probability of the secondary transmission under the uncertainty. Finally, we evaluate the proposed relay selection scheme by means of simulation. The simulation shows the appropriateness of our analytical model. In addition, although having lower interference constraint at each relay, the performances of the proposed multi-relay CRN scheme are shown to be strictly superior to the single relay CRN. Moreover, the simulation results suggest that it is necessary to spend the general overhead for secondary networks on knowing the exact QoS requirement of the primary user (i.e. the interference violation probability) to apply our proposed relay selection scheme with the statistical total interference constraint., QC 20150123

Parallelization is crucial for ecient execution of large-scale network simulation. Today's computing clusters commonly used for that purpose are built from a large amount of multiprocessor machines. The traditional approach to utilize all CPU cores in such a system is to partition the network and distribute the partitions to the cores. This, however, does not incorporate the presence of shared memory into the design, such that messages between partitions on the same computing node have to be serialized and synchronization becomes more complex. In this paper, we present an approach that combines the shared-memory parallelization scheme Horizon [9] with the standard approach to distributed simulation to leverage the strengths of today's computing clusters. To further reduce the synchronization overhead, we introduce a novel synchronization algorithm that takes domain knowledge into account to reduce the number of synchronization points. In a case study with a UMTS LTE model, we show that both contributions combined enable much higher scalability achieving almost linear speedup when simulating 1,536 LTE cells on 1,536 CPU cores., QC 20150123

Parallelization is crucial for ecient execution of large-scale network simulation. Today's computing clusters commonly used for that purpose are built from a large amount of multiprocessor machines. The traditional approach to utilize all CPU cores in such a system is to partition the network and distribute the partitions to the cores. This, however, does not incorporate the presence of shared memory into the design, such that messages between partitions on the same computing node have to be serialized and synchronization becomes more complex. In this paper, we present an approach that combines the shared-memory parallelization scheme Horizon [9] with the standard approach to distributed simulation to leverage the strengths of today's computing clusters. To further reduce the synchronization overhead, we introduce a novel synchronization algorithm that takes domain knowledge into account to reduce the number of synchronization points. In a case study with a UMTS LTE model, we show that both contributions combined enable much higher scalability achieving almost linear speedup when simulating 1,536 LTE cells on 1,536 CPU cores., QC 20150123

In this paper, we focus on a Cognitive Relay Network (CRN) where only the information of the average channel gains is available at the secondary source. A distributed multiple relay selection scheme is proposed for the secondary transmission. Since the secondary source does not fully control the selection but lets each secondary relay decide by itself, it doesn't know which and how many relays will participate in the forwarding. This brings a serious uncertainty in the number of forwarding relays. We analyze this uncertainty and derive the closed-form expression of the outage probability of the secondary transmission under the uncertainty. Finally, we evaluate the proposed relay selection scheme by means of simulation. The simulation shows the appropriateness of our analytical model. In addition, although having lower interference constraint at each relay, the performances of the proposed multi-relay CRN scheme are shown to be strictly superior to the single relay CRN. Moreover, the simulation results suggest that it is necessary to spend the general overhead for secondary networks on knowing the exact QoS requirement of the primary user (i.e. the interference violation probability) to apply our proposed relay selection scheme with the statistical total interference constraint., QC 20150123

Parallel and distributed simulation have been extensively researched for a long time. Nevertheless, many simulation models are still executed sequentially. We attribute this to the fact that many of those models are simply not capable of being executed in parallel since they violate particular constraints. In this paper, we analyze the INET model suite, which enables network simulation in OMNeT++ with regard to parallelizability. We uncovered several issues preventing parallel execution of INET models. We analyzed those issues and developed solutions allowing INET models to be run in parallel. A case study shows the feasibility of our approach. Though there are parts of the model suite that we didn’t investigate yet and the performance can still be improved, the results show parallelization speedup for most configurations. The source code of our implementation is available through our web site at code.comsys.rwth-aachen.de, QC 20150123

Parallelization is crucial for ecient execution of large-scale network simulation. Today's computing clusters commonly used for that purpose are built from a large amount of multiprocessor machines. The traditional approach to utilize all CPU cores in such a system is to partition the network and distribute the partitions to the cores. This, however, does not incorporate the presence of shared memory into the design, such that messages between partitions on the same computing node have to be serialized and synchronization becomes more complex. In this paper, we present an approach that combines the shared-memory parallelization scheme Horizon [9] with the standard approach to distributed simulation to leverage the strengths of today's computing clusters. To further reduce the synchronization overhead, we introduce a novel synchronization algorithm that takes domain knowledge into account to reduce the number of synchronization points. In a case study with a UMTS LTE model, we show that both contributions combined enable much higher scalability achieving almost linear speedup when simulating 1,536 LTE cells on 1,536 CPU cores., QC 20150123

Jamming is a well-known reliability threat for mass-market wireless networks. With the rise of safety-critical applications this is likely to become a constraining issue in the future. Thus, the design of accurate jamming detection algorithms becomes important to react to ongoing jamming attacks. With respect to experimental work, jamming detection has been mainly studied for sensor networks. However, many safety-critical applications are also likely to run over 802.11-based networks where the proposed approaches do not carry over. In this paper we present a jamming detection approach for 802.11 networks. It uses metrics that are accessible through standard device drivers and performs detection via machine learning. While it allows for stand-alone operation, it also enables cooperative detection. We experimentally show that our approach achieves remarkably high detection rates in indoor and mobile outdoor scenarios even under challenging link conditions., QC 20150123

Parallel and distributed simulation have been extensively researched for a long time. Nevertheless, many simulation models are still executed sequentially. We attribute this to the fact that many of those models are simply not capable of being executed in parallel since they violate particular constraints. In this paper, we analyze the INET model suite, which enables network simulation in OMNeT++ with regard to parallelizability. We uncovered several issues preventing parallel execution of INET models. We analyzed those issues and developed solutions allowing INET models to be run in parallel. A case study shows the feasibility of our approach. Though there are parts of the model suite that we didn’t investigate yet and the performance can still be improved, the results show parallelization speedup for most configurations. The source code of our implementation is available through our web site at code.comsys.rwth-aachen.de, QC 20150123

In this paper, we focus on a Cognitive Relay Network (CRN) where only the information of the average channel gains is available at the secondary source. A distributed multiple relay selection scheme is proposed for the secondary transmission. Since the secondary source does not fully control the selection but lets each secondary relay decide by itself, it doesn't know which and how many relays will participate in the forwarding. This brings a serious uncertainty in the number of forwarding relays. We analyze this uncertainty and derive the closed-form expression of the outage probability of the secondary transmission under the uncertainty. Finally, we evaluate the proposed relay selection scheme by means of simulation. The simulation shows the appropriateness of our analytical model. In addition, although having lower interference constraint at each relay, the performances of the proposed multi-relay CRN scheme are shown to be strictly superior to the single relay CRN. Moreover, the simulation results suggest that it is necessary to spend the general overhead for secondary networks on knowing the exact QoS requirement of the primary user (i.e. the interference violation probability) to apply our proposed relay selection scheme with the statistical total interference constraint., QC 20150123

Jamming is a well-known reliability threat for mass-market wireless networks. With the rise of safety-critical applications this is likely to become a constraining issue in the future. Thus, the design of accurate jamming detection algorithms becomes important to react to ongoing jamming attacks. With respect to experimental work, jamming detection has been mainly studied for sensor networks. However, many safety-critical applications are also likely to run over 802.11-based networks where the proposed approaches do not carry over. In this paper we present a jamming detection approach for 802.11 networks. It uses metrics that are accessible through standard device drivers and performs detection via machine learning. While it allows for stand-alone operation, it also enables cooperative detection. We experimentally show that our approach achieves remarkably high detection rates in indoor and mobile outdoor scenarios even under challenging link conditions., QC 20150123

Parallelization is crucial for ecient execution of large-scale network simulation. Today's computing clusters commonly used for that purpose are built from a large amount of multiprocessor machines. The traditional approach to utilize all CPU cores in such a system is to partition the network and distribute the partitions to the cores. This, however, does not incorporate the presence of shared memory into the design, such that messages between partitions on the same computing node have to be serialized and synchronization becomes more complex. In this paper, we present an approach that combines the shared-memory parallelization scheme Horizon [9] with the standard approach to distributed simulation to leverage the strengths of today's computing clusters. To further reduce the synchronization overhead, we introduce a novel synchronization algorithm that takes domain knowledge into account to reduce the number of synchronization points. In a case study with a UMTS LTE model, we show that both contributions combined enable much higher scalability achieving almost linear speedup when simulating 1,536 LTE cells on 1,536 CPU cores., QC 20150123

The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks., QC 20111116

The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks., QC 20111116

The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks., QC 20111116

The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks., QC 20111116

The simulation models of wireless networks rapidly increase in complexity to accurately model wireless channel characteristics and the properties of advanced transmission technologies. Such detailed models typically lead to a high computational load per simulation event that accumulates to extensive simulation runtimes. Reducing runtimes through parallelization is challenging since it depends on detecting causally independent events that can execute concurrently. Most existing approaches base this detection on lookaheads derived from channel propagation latency or protocol characteristics. In wireless networks, these lookaheads are typically short, causing the potential for parallelization and the achievable speedup to remain small. This paper presents Horizon, which unlocks a substantial portion of a simulation model's workload for parallelization by going beyond the traditional lookahead. We show how to augment discrete events with durations to identify a much larger horizon of independent simulation events and efficiently schedule them on multi-core systems. Our evaluation shows that this approach can significantly cut down the runtime of simulations, in particular for complex and accurate models of wireless networks., QC 20111116

In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available at the source. Both the physical-layer performance (blocklength-limited throughput) and the link-layer performance (effective capacity) of the relaying system are investigated. We propose a simple system operation by introducing a factor based on which we weight the average CSI and let the source determine the coding rate accordingly. In particular, we show that both the blocklengthlimited throughput and the effective capacity are quasi-concave in the weight factor. Through numerical analysis, we investigate the relaying performance with average CSI while considering perfect CSI scenario and direct transmission as contrasts. We observe that relaying is more efficient than direct transmission in the finite blocklength regime. Moreover, this performance advantage of relaying under the average CSI scenario is more significant than under the perfect CSI scenario. Finally, the speed of convergence (between the blocklength-limited performance and the performance with infinite blocklengths) in relaying system is faster in comparison to the direct transmission under both the average CSI scenario and the perfect CSI scenario., QC 20160408

In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available at the source. Both the physical-layer performance (blocklength-limited throughput) and the link-layer performance (effective capacity) of the relaying system are investigated. We propose a simple system operation by introducing a factor based on which we weight the average CSI and let the source determine the coding rate accordingly. In particular, we show that both the blocklengthlimited throughput and the effective capacity are quasi-concave in the weight factor. Through numerical analysis, we investigate the relaying performance with average CSI while considering perfect CSI scenario and direct transmission as contrasts. We observe that relaying is more efficient than direct transmission in the finite blocklength regime. Moreover, this performance advantage of relaying under the average CSI scenario is more significant than under the perfect CSI scenario. Finally, the speed of convergence (between the blocklength-limited performance and the performance with infinite blocklengths) in relaying system is faster in comparison to the direct transmission under both the average CSI scenario and the perfect CSI scenario., QC 20160408

In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available at the source. Both the physical-layer performance (blocklength-limited throughput) and the link-layer performance (effective capacity) of the relaying system are investigated. We propose a simple system operation by introducing a factor based on which we weight the average CSI and let the source determine the coding rate accordingly. In particular, we show that both the blocklengthlimited throughput and the effective capacity are quasi-concave in the weight factor. Through numerical analysis, we investigate the relaying performance with average CSI while considering perfect CSI scenario and direct transmission as contrasts. We observe that relaying is more efficient than direct transmission in the finite blocklength regime. Moreover, this performance advantage of relaying under the average CSI scenario is more significant than under the perfect CSI scenario. Finally, the speed of convergence (between the blocklength-limited performance and the performance with infinite blocklengths) in relaying system is faster in comparison to the direct transmission under both the average CSI scenario and the perfect CSI scenario., QC 20160408

In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available at the source. Both the physical-layer performance (blocklength-limited throughput) and the link-layer performance (effective capacity) of the relaying system are investigated. We propose a simple system operation by introducing a factor based on which we weight the average CSI and let the source determine the coding rate accordingly. In particular, we show that both the blocklengthlimited throughput and the effective capacity are quasi-concave in the weight factor. Through numerical analysis, we investigate the relaying performance with average CSI while considering perfect CSI scenario and direct transmission as contrasts. We observe that relaying is more efficient than direct transmission in the finite blocklength regime. Moreover, this performance advantage of relaying under the average CSI scenario is more significant than under the perfect CSI scenario. Finally, the speed of convergence (between the blocklength-limited performance and the performance with infinite blocklengths) in relaying system is faster in comparison to the direct transmission under both the average CSI scenario and the perfect CSI scenario., QC 20160408

In this paper, the blocklength-limited performance of a relaying system is studied, where channels are assumed to experience quasi-static Rayleigh fading while at the same time only the average channel state information (CSI) is available at the source. Both the physical-layer performance (blocklength-limited throughput) and the link-layer performance (effective capacity) of the relaying system are investigated. We propose a simple system operation by introducing a factor based on which we weight the average CSI and let the source determine the coding rate accordingly. In particular, we show that both the blocklengthlimited throughput and the effective capacity are quasi-concave in the weight factor. Through numerical analysis, we investigate the relaying performance with average CSI while considering perfect CSI scenario and direct transmission as contrasts. We observe that relaying is more efficient than direct transmission in the finite blocklength regime. Moreover, this performance advantage of relaying under the average CSI scenario is more significant than under the perfect CSI scenario. Finally, the speed of convergence (between the blocklength-limited performance and the performance with infinite blocklengths) in relaying system is faster in comparison to the direct transmission under both the average CSI scenario and the perfect CSI scenario., QC 20160408