Traversal time and hop count analysis (TTHCA) is a recent wormhole detection algorithm for mobile ad hoc networks (MANET) which provides enhanced detection performance against all wormhole attack variants and network types. TTHCA involves each node measuring the processing time of routing packets during the route discovery process and then delivering the measurements to the source node. In a pa...

Wormhole attacks can destabilize or disable wireless sensor networks. In a typical wormhole attack, the attacker receives packets at one point in the network, forwards them through a wired or wireless link with less latency than the network links, and relays them to another point in the network. This paper describes a distributed wormhole detection algorithm for wireless sensor networks, which ...

We review Coleman’s wormhole mechanism for the vanishing of the cosmological constant. We show that in a minisuperspace model wormhole-connected universes dominate the path integral. We also provide evidence that the Euclidean path integral over geometries with spherical topology is unstable with respect to formation of infinitely many wormhole-connected 4-spheres. Consistency is restored by su...

We study the structure of a family of static, spherically symmetric space-times generated by an anisotropic fluid and governed by a particular type of f(R) theory. We find that for a range of parameters with physical interest, such solutions represent black holes with the central singularity replaced by a finite size wormhole. We show that time-like geodesics and null geodesics with nonzero ang...

Mobile Ad hoc Networks (MANETs) are prone to a variety of attacks due to their unique characteristics such as dynamic topology, open wireless medium, absence of infrastructure, multi hop nature and resource constraints. Any node in mobile ad hoc networks operates not only as end terminal but both as an intermediate router and client. In this way, multi-hop communication occurs in MANETs and thu...

The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer siz...

As sensor-driven applications become progressively more integrated into our lives; issues linked to sensor privacy will become increasingly important. In wireless sensor networks, adversaries can make use of the traffic information for locating the monitored objects. Network coding has been shown to be an efficient approach to improve the wireless system performance. In a wormhole attack, the a...

Wormhole routing networks are emerging as an effective solution for high bandwidth, low latency interconnects in distributed computing and cluster computing applications. An important example (in the local area environment) is the 640 Mb/s crossbar-based Myrinet. A key property of conventional LANs, which is valuable for many distributed applications, is transparent, reliable network level mult...

A pointlike static (or quasistatically moving) electric charge q is considered in the spacetime which is a wormhole connecting two otherwise Minkowskian spaces. The electrostatic force acting on the charge is found to be a sum of two terms. One of them is uniquely determined by the value of q and the geometry of the wormhole. The other has the Coulomb form and is proportional to a freely specif...

In this paper, performance of multistage interconnection network with wormhole routing and packet switching has been evaluated for cache-coherent shared-memory multiproces-sors. The evaluation is based on execution-driven simulation using various applications. The traac in cache-coherent systems is very diierent from the traac in message-passing environment and is characterized by traac bursts,...