Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFundamental Theories in Node Failure Localization
48
0
0.0
(
0
)
Added by
Liang Ma
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
This is a technical report, containing all the theorem proofs in paper Node Failure Localization in Communication Networks via Network Tomography by Liang Ma, Ting He, Ananthram Swami, Don Towsley, Kin K. Leung, and Jessica Lowe, published in ITA Annual Fall Meeting, 2014.
rate research
Read More
This is a technical report, containing all the theorem proofs in paper On Optimal Monitor Placement for Localizing Node Failures via Network Tomography by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin K. Leung, published in IFIP WG 7.3 Performance, 2015.
This is a technical report, containing all the theorem proofs and additional evaluations in paper Network Capability in Localizing Node Failures via End-to-end Path Measurements by Liang Ma, Ting He, Ananthram Swami, Don Towsley, and Kin K. Leung, published in IEEE/ACM Transactions on Networking, vol. 25, no. 1, pp. 434-450, 2017.
The use of aerial anchors for localizing terrestrial nodes has recently been recognized as a cost-effective, swift and flexible solution for better localization accuracy, providing localization services when the GPS is jammed or satellite reception is not possible. In this paper, the localization of terrestrial nodes when using mobile unmanned aerial vehicles (UAVs) as aerial anchors is presented. We propose a novel framework to derive localization error in urban areas. In contrast to the existing works, our framework includes height-dependent UAV to ground channel characteristics and a highly detailed UAV energy consumption model. This enables us to explore different tradeoffs and optimize UAV trajectory for minimum localization error. In particular, we investigate the impact of UAV altitude, hovering time, number of waypoints and path length through formulating an energy-constrained optimization problem. Our results show that increasing the hovering time decreases the localization error considerably at the cost of a higher energy consumption. To keep the localization error below 100m, shorter hovering is only possible when the path altitude and radius are optimized. For a constant hovering time of 5 seconds, tuning both parameters to their optimal values brings the localization error from 150m down to 65m with a power saving around 25%
We revisit the question of microcausality violations in quantum field theory on noncommutative spacetime, taking $O(x)=:phistarphi:(x)$ as a sample observable. Using methods of the theory of distributions, we precisely describe the support properties of the commutator [O(x),O(y)] and prove that, in the case of space-space noncommutativity, it does not vanish at spacelike separation in the noncommuting directions. However, the matrix elements of this commutator exhibit a rapid falloff along an arbitrary spacelike direction irrespective of the type of noncommutativity. We also consider the star commutator for this observable and show that it fails to vanish even at spacelike separation in the commuting directions and completely violates causality. We conclude with a brief discussion about the modified Wightman functions which are vacuum expectation values of the star products of fields at different spacetime points.
The contemporary society has become more dependent on telecommunication networks. Novel services and technologies supported by such networks, such as cloud computing or e-Health, hold a vital role in modern day living. Large-scale failures are prone to occur, thus being a constant threat to business organizations and individuals. To the best of our knowledge, there are no publicly available reports regarding failure propagation in core transport networks. Furthermore, Software Defined Networking (SDN) is becoming more prevalent in our society and we can envision more SDN-controlled Backbone Transport Networks (BTNs) in the future. For this reason, we investigate the main motivations that could lead to epidemic-like failures in BTNs and SDNTNs. To do so, we enlist the expertise of several research groups with significant background in epidemics, network resiliency, and security. In addition, we consider the experiences of three network providers. Our results illustrate that Dynamic Transport Networks (DTNs) are prone to epidemic-like failures. Moreover, we propose different situations in which a failure can propagate in SDNTNs. We believe that the key findings will aid network engineers and the scientific community to predict this type of disastrous failure scenario and plan adequate survivability strategies.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
