相关论文: Sequence Numbers Do Not Guarantee Loop Freedom; AO…

For wireless communications using linear large-scale antenna arrays, we define a receiving coordinate system and parameterization strategy to facilitate the study of the impact of three-dimensional position and rotation of the arrays on the…

The OMNeT++ simulator is well-suited for the simulation of randomized user behavior in communication networks. However, there are scenarios, where such a random model is unsuited to evaluate a communication system, and this paper attempts…

Unlike traditional routing procedures that, at the best, single out a unique route, multi-path routing protocols discover proactively several alternative routes. It has been recognized that multi-path routing can be more efficient than…

We define the common randomness assisted capacity of an arbitrarily varying channel (AVWC) when the Eavesdropper is kept ignorant about the common randomness. We prove a multi-letter capacity formula for this model. We prove that, if enough…

Forbidden ordinal patterns are ordinal patterns (or `rank blocks') that cannot appear in the orbits generated by a map taking values on a linearly ordered space, in which case we say that the map has forbidden patterns. Once a map has a…

Sequences have become first class citizens in supervised learning thanks to the resurgence of recurrent neural networks. Many complex tasks that require mapping from or to a sequence of observations can now be formulated with the…

We propose a routing protocol for wireless networks. Wireless routing protocols allow hosts within a network to have some knowledge of the topology in order to know when to forward a packet (via broadcast) and when to drop it. Since a…

The efficacy of address space layout randomization has been formally demonstrated in a shared-memory model by Abadi et al., contingent on specific assumptions about victim programs. However, modern operating systems, implementing layout…

In a wireless network the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Previously, connectivity in wireless networks was analyzed using static geometric graphs, and as we show leads to an…

Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…

This paper investigates on the problem of combining routing scheme and physical layer security in multihop wireless networks with cooperative diversity. We propose an ad-hoc natured hop-by-hop best secure relay selection in a multihop…

Two-way relay is potentially an effective approach to spectrum sharing and aggregation by allowing simultaneous bidirectional transmissions between source-destinations pairs. This paper studies the two-way $2\times2\times2$ relay network, a…

Achievable degrees-of-freedom (DoF) of the large-scale interfering two-way relay network is investigated. The network consists of $K$ pairs of communication nodes (CNs) and $N$ relay nodes (RNs). It is assumed that $K\ll N$ and each pair of…

Degree of freedom (DoF) region provides an approximation of capacity region in high signal-to-noise ratio (SNR) regime, while sum DoF gives the scaling factor. In this correspondence, we analyse the DoF region and sum DoF for unicast…

To render a sequence testable, namely capable of identifying and detecting errors, it is necessary to apply a transformation that increases its length by introducing statistical dependence among symbols, as commonly exemplified by the…

The problem of security against timing based traffic analysis in wireless networks is considered in this work. An analytical measure of anonymity in eavesdropped networks is proposed using the information theoretic concept of equivocation.…

An anonymous dynamic network is a network of indistinguishable processes whose communication links may appear or disappear unpredictably over time. Previous research has shown that deterministically computing an arbitrary function of a…

In mobile ad-hoc networks, nodes have to transmit HELLO or Route Maintenance messages at regular intervals, and all nodes residing within its radio range, reply with an acknowledgment message informing their node identifier, current…

As a special type of mobile ad hoc network (MANET), the flying ad hoc network (FANET) has the potential to enable a variety of emerging applications in both civilian wireless communications (e.g., 5G and 6G) and the defense industry. The…

Vehicular Ad hoc Network (VANET) is a special class of Mobile Ad hoc Network (MANET) where vehicles are considered as MANET nodes with wireless links. The key difference of VANET and MANET is the special mobility pattern and rapidly…