Routing in wireless ad hoc networks is a challenging issue because it dynamically controls the network topology and determines the network performance. Most of the available protocols are based on singlerate radio networks and they use hop-count as the routing metric. There have been some efforts for multirate radios as well that use transmissiontime of a packet as the routing metric. However, ...

Covert communication can hide the information transmission process from warden to prevent adversarial eavesdropping. However, it becomes challenging when location of is uncertain. In this paper, we propose a covert scheme against with uncertain locations, which maximizes connectivity throughput between multi-antenna transmitter and full-duplex jamming receiver limit outage probability (the foun...

In this paper, we present a study on the performance of TCP, in terms of both throughput and energy consumption, in the presence of a Wideband CDMA radio interface typical of third generation wireless systems. The results show that the relationship between throughput and average error rate is largely independent of the network load, making it possible to introduce a universal throughput curve, ...

This paper investigates theoretical properties of throughput and cost in linear loss networks. The maximum throughput of the network with exponential service times is derived and the arrival process that maximizes throughput, given a fixed arrival rate, is established. For general service times, an asymptotically critical loading regime is identified such that the probability of an arbitrary cu...

We introduce optimizations to the ZMap network scanner that achieve a 10-fold increase in maximum scan rate. By parallelizing address generation, introducing an improved blacklisting algorithm, and using zero-copy NIC access, we drive ZMap to nearly the maximum throughput of 10 gigabit Ethernet, almost 15 million probes per second. With these changes, ZMap can comprehensively scan for a single ...