Fast packet forwarding Since the maximum fanout in an XIP address is four edges, an XIA router may have to inspect up to four XIDs to make a routing decision.

even without hardware optimizations, Linux XIA can efficiently instantiate XIA s forwarding mechanism by not serializing these lookups.


However, k hash functions might generate fewer than k different hash values in practice.

we proactively compute sufficient extra hash values for each address, which we refer it as internal collision avoidance.


Particularly, our results show small filters require k hash values of an address to be different in contrast to large filters.

hash functions might generate fewer than k different hash values in practice.


Caesar's focus is on very small filters, which is different from a similar usage of the core property in previous work [31].

our results show small filters require k hash values of an address to be different in contrast to large filters.


Recent studies [8, 6] have predicted that the number of connecting devices and active address prefixes will jump to 50 billion and 1.3-2.3 million, respectively, by the end of 2020.

the current rapid growth of the number of address prefixes (i.e., about 17% per year) is the root of many existing problems for operators, who have to continuously shrink the routing and forwarding tables of their devices or upgrade to increasingly more expensive data planes [13].


The backup path is built from the fast memory and handles uncommon cases where the primary path is not reliable due to false positives in the filters thus rarely is less efficient when it accesses the RIB (Sec 4).

the primary path ensures the common-case high-speed forwarding while the backup path guarantees the correctness.


Moreover such hardware features have helped developers write efficient IDS systems that now achieve processing performances that are comparable with commercialized hardware solutions.

nIDSes based on such heterogeneous systems (GPU-based) [3, 4] do have some drawbacks: it is normally difficult to program a SIMD module on a GPU such that it delivers peak performance while keeping the power consumption and processing latencies in check.


For 512k flow entries, the total DRAM space needed is 6.5 MB.

the memory space requirements for these tables can be accommodated in the SRAM and DRAM available on board.


The sketch data structure is capable of summarizing high-speed network traffic in real-time and producing accurate estimation result of a specific traffic measurement task.

due to the fixed hardware implementation of the sketch counter array, the flexibility of adopting the same data structure for various traffic measurement applications is limited.


However, in the multiple flow tables, a final action stored in the Action Table is cascaded by the multiple middle actions of the rules.

one action of a rule cannot be found in the Action Table anymore.


We also assume that the attacker knows all positions of all nodes at all times.

it knows the exact positions of the verifiers at the reception of its location claims already when sending those claims.


In an indoor environment, many users use WLAN technologies such as IEEE 802.11 access points to connect to the Internet.

iEEE 802.11 technologies operate on an ISM band, which has limited bandwidth, and experience interference from nearby access points and other devices.


Note that when channel condition is good, our proposed scheme shows similar performance with the legacy one.

as the channel condition deteriorates and increases transmission failures, the proposed scheme divides large packets into smaller ones and thereby increases the number of successful transmission.


In recent years, future Internet architecture proposals have revisited the idea of source routing for its benefits while addressing its scalability and security problems.

the scalability problems have been addressed by using source-based path selection, a system in which the source obtains a list of paths that it can use to reach the destination, rather than a full topology map as in generic source routing schemes.


To improve the performance of cell edge users, the system has to allocate more resource to cell edge users, and hence the resource allocated to the inner users decreases, and thus, the sum throughput decreases.

we can control the efficiency and fairness by appropriately adjusting the QoS requirement.


Especially, in this heterogeneous network (HetNet), the interference to each user increases sharply, since the number of entities transmitting simultaneously increases as the number of cells is increases.

the enhanced intercell interference coordination (eICIC) is considered as one of key schemes to reduce interference in the HetNet.


First and foremost, we thank the many engineers at Akamai who designed, implemented and rolled-out end-user mapping, making it possible for us to evaluate its impact.

we present our experience and insights obtained in deploying end-user mapping for clients around the world in the first half of 2014.


Western Europe sees low distances appearing in a small band.

korea and Taiwan are significant in having the smallest distances.


A total of 37,294 ASes with the most demand were analyzed.

the cached resolution is only valid for the IP block for which it was provided and not for any client IPs that do not belong to the block.


However, if the client cluster has a large radius, i.e., the clients are far away from each other, there may be no single server assignment for the entire cluster that is optimal for 1000 all clients in it.

it is inherently difficult for NS-based mapping to perform well when the client cluster has a large 0 radius, even knowing client-LDNS pairings.


One heuristic approach to reducing the number of mapping units for end-user mapping is to use the IP blocks (i.e., CIDRs) in BGP feeds that are the units for routing in the Internet.

if a set of /24 IP blocks belong within the same BGP CIDR, these blocks can be combined since they are likely proximal in the network sense.


The second server then serves the content to the client.

this process incurs a redirection penalty that is acceptable only for larger downloads such as media files and software downloads.


The reason is that the mapping system could discover the client cluster and assign servers that provide good performance for the entire cluster.

if the client cluster has a large radius, i.e., the clients are far away from each other, there may be no single server assignment for the entire cluster that is optimal for all clients in it.


It is clear that EU provides a large benefit over the other schemes for higher percentiles of ping latency.

NSbased mapping provides diminishing benefits beyond 160 deployment locations for the 99th percentile latency, and is in particular unable to reduce it below 186 ms even with 1280 deployment locations.


Our measurement study of client-LDNS distances in Section 3 is based on a much wider global cross-section of clients and LDNSes than prior work and largely confirm prior conclusions on public resolvers.

different scoring functions that incorporate bandwidth, latency, packet loss, etc can be used for different traffic classes (web, video, applications, etc).


In fact, both CDNs and content providers are focused on improving the performance of the worst-performing client.

we computed the 95th and 99th percentiles of the latencies, i.e, latencies for 1-5% of the worst clients.


δ represents a tradeoff between safety and efficiency; larger values of δ yield alibis who are so far away from a forbidden region that, if packets were to traverse both, there would be a very large increase in latency over a normal path through the alibi.

with a large δ, one may be less likely to find a viable alibi, but that alibi is likely to work even in the face of variable round-trip times and congestion.


The goal of provable avoidance routing is detection, as opposed to prevention.

alone, it is unable to ensure a user s packets will not traverse a region of the world we do not require modi.cations to the underlying routing protocols or hardware, and so we are subject to all of today s uncertainties as to where packets will travel.


Consider for example a peer who has a satellite link with extremely high latencies: such a peer may never satisfy the alibi conditions, regardless of the path his or her packets take.

a benevolent relay whose packets never traverse the forbidden region might never be viable simply because it has poor connectivity.


This obviously has higher costs than the previous solution, but it might be the only possibility in those areas where the density of home APs is not sufficient, or where the buildings are too far from the street.

operators can use hardware of better quality for these dedicated APs, thereby providing increased throughput and extended coverage to their users.


The first possibility is to leverage existing wireless access points (APs) that are nowadays installed in almost every home, office, or caf´e.

this means sharing the physical capacity of the 802.11 radio channel(s) and the available bandwidth of the Internet connection between a private and a public Wi-Fi network.


The Android API is used to execute the algorithm choice, basing on previous measurement for particular location.

there is a trade-off between frequent updates and the amount of transferred data, hence the update rate should be chosen wisely.


There exist also several solutions based on Kalman filter formulation [1, 2, 8, 9], but the analysis is only based on simulations without assessing their implementation feasibility for sensor nodes.

the solution proposed in [6] is simple enough to be implemented on sensor nodes but lacks the accuracy to meet the ever increasing synchronization demands of WSN applications.


For these rules, existing algorithms are still inefficient in terms of classification speed.

the number of required bits is always prohibitively high, making this solution impractical due to the memory footprint of the 2l buckets.


Packet classification is required to achieve high throughput while fitting into a commodity memory hierarchy.

fewer memory accesses and a reasonable memory footprint are the main concerns when designing a packet classification algorithm.


Experiments show that ESCC (only leave trace in routers two hops from clients), has already achieved better performance than the universal caching, in term of access delay, link traffic and server load reduction (Fig.3-5).

eSCC could be a substitute for the costly universal caching.


Public Key Infrastructures and thus also the RPKI are complex systems.

current tools to inspect these objects are based on command line interfaces.


A recently deployed example is prefix origin validation, which authorizes an AS to announce an IP prefix.

table 1 shows the performance gain in terms of rsync calls and download time thanks to reduced communication overhead.


MultiSpot charges different types of devices simultaneously.

we need a second equation that determines the relationship between the voltage one applies to the transmitter, VT and the resulting transmitter current, IT .


The figure shows that initially, the phone closer to the transmitter (i.e., Rx1) charges faster since it has a stronger magnetic coupling with the charger.

once this phone is fully charged, MultiSpot transfers the power to the second receiver (Rx2), increasing its charging rate.


With this increased efficiency, it may be possible to charge a receiver at a larger distance when more receivers are in the system.

this experiment is aimed to find the maximum distance from the transmitter a phone can still charge from, given a number of receivers.


Unfortunately, in practice, one has to use a voltage source instead.


However, even when the number of multi-paths changes due to environmental changes, the speed of change in lengths of multi-paths does not change because it depends on the movement of human body and not on the number of multi-paths in an environment.

the frequency components in the CFR power stay the same as long as the person performs the same activity, and DWT gives higher energy in the same levels regardless of how many multi-paths have appeared or disappeared.


Furthermore, once CARM is trained on the given training set, it can be directly applied to environments and persons that have not been included in the training set.

cARM does not need the on-site training data collection as for Eeyes [27].


For example, running and falling both have similar frequencies but the duration of falling is shorter than running.

to analyze CFR power for human activities, we need to extract frequencies from it at multiple resolutions on multiple time scales.


Several network management tasks require fine grained traffic classification.

a number of techniques have been proposed over the years to address this problem; a survey of these may be found in [9, 18].


Cov and max stand for the ratio of apps identified by SAMPLES rule set and all identifiable apps in the test set.

the length of the hash divided by the cardinality of the app executable archive repository.


The hash for identifier type app id contains within it the app id as key, and a constant 1 as the corresponding value.

the hash for app name contains the app name as the key, and the corresponding app id as its value.


Through experiments over a vast corpus of mobile applications (over 700 K), we have demonstrated the comprehensiveness and applicability of our approach across all three platforms.

the coverage is significantly higher than the other state-of-the-art methodologies from literature.


Nowadays most of metropolitan areas are overloaded with WiFi APs, many of which are private.

it is still a waste of energy to blindly wake up a WiFi NIC when an arbitrary AP shows up, without knowing if it is accessible or not.


We see that different tags have different response delays and bit durations, which result in bit misalignment and non-overlapped state transition boundaries.

the response delay offset and the bit duration offset (normalized by period) can be up to 30% and 1% for each bit, respectively.


To investigate channel coefficient distributions in practice, we first characterise the backscatter channel of multiple tags using the SDR testbed.

the WISP tags are programmed to backscatter known preambles and payloads, so we can directly identify the states of all the tags in each symbol cluster.


Around 40% of cases have 0 bit errors in BiGroup when four tags transmit concurrently, and around 20% have an average BER below 0.05 in BiGroup when five tags transmit concurrently.

the lowest average BERs when four and five tags collide for the LA based scheme are much higher (>0.1 BERs for all collisions).


The RNC provides control functions and radio resource management for the cellular base stations (NodeBs).

the dynamics of each chunk include a high bandwidth initial burst that quickly exceeds the downlink RLC buffer threshold, triggering a promotion to DCH.


Obviously, the common post denoising process not only cannot recover the original video, but also deteriorate the video quality compared to the watch-only version in all five basic metrics due to recognizing noise incorrectly.

kALEIDO is insusceptible to common denoising attack, and guarantees the reliable video privacy preservation.


Notice that the recording schemes of smart devices are typically designed to mimic the basics of how human views the surrounding world.

there is a very small design opportunity for such a transformative technology.


The usual pirate videotaping scenario would be worse than this ideal testing scenario.

if the quality of the pirate video in this ideal scenario is intolerable, the pirate video taken in worse conditions will experience more severe quality degradation.


Additionally, unstable inter-frame intervals of most commercial onboard cameras aggravate the information loss and distortion for both Case 1 and Case 2, hence making the color distortion of recorded frames even worse.

during a single capture time window (Tc), rolling shutter effect and unstable intervals could cause a temporal information loss or deviation in the recorded frame if the displayed frames for each original video frame are time-varying.


The average keystroke recognition accuracy rate for user 10 in previous experiment, which used 30 samples for training classifiers was just 80%.

we can conclude that increasing the number of training samples increases the accuracy of WiKey.


For the features extracted for keys 'I' and 'o' shown in figures 5(a) and 5(b), the DTW distance among features of key 'I' was 18.79 and the DTW distance among features of key 'o' was 19.44.

the average DTW distance between features of these keys was 44.2.


For an ADC sampling rate of 20 kHz and modulation window of 128 points, a light beacon lasting for 6.4 ms is sufficient for the photodiode to separate light rays.

the overhead of transmitting light beacons is negligible given that a data packet typically lasts for hundreds of ms based on the IEEE 802.15.7 standard [8].


Consider a single photodiode on the floor, we hypothesize that if any opaque object stands in the direct path between the point light source and the photodiode, the photodiode will not be able to perceive any light coming from this point light source.

the photodiode observes a light intensity drop compared to the case when there is no object blocking its direct path to the light source.


The design of light beacons is driven by the observation that while the perceived light intensity represents the sum of all incoming light rays, these light rays can be separated in the frequency domain if they flash at different frequencies.

if we transform a time series of perceived light intensity to the frequency domain using Fast Fourier Transform (FFT), we can observe frequency power peaks at the frequencies at which these light rays flash.


Hence, an LED light Li flashing at frequency fi leads to not only a global power peak (main frequency power) at frequency fi, but also small local power peaks at all the harmonics frequencies (Figure 5(c)).

if the perceived light intensity from light Li changes, it will affect not only the main frequency power at f, but also the power peaks at harmonics.


The nice property of the FI is that the forwarders (C) are sending the symbols that the previous nodes (B) along the path have already seen.


The reason FI cancellation works is based on the fact that the signal of FI is correlated with the output signal from the same radio so that FI can be predicted.

this does not hold for all the interference components, like the one shown in Figure 2(b).


To deliver data direct from this radio, Y is a better choice.

when the radio is a forwarder and the channel to its ancestor is bad, delivering the packet alone in that link takes 200µs.


Realizing in-band cut-through in wireless networks, however, is challenging in many ways as we will discuss later.

wireless cut-through not only improves delay performance but also improves end-to-end throughput.


Typical DASH protocols [5,8,10] use the throughput observed from each video segment to estimate the available end-to-end network bandwidth.

such estimations stay blow the bandwidth unless the segment size (and equivalently the video bitrate) is large enough to saturate the network pipeline.


When the buffer level is low (we empirically set the threshold to 2000ms), even if a rare mistake can incur intolerable buffer underrun.

the bandwidth (estimated by the PIRS component) is considered to jump to another level when the highest video bitrate below the bandwidth (i.e., the quantized bandwidth) changes.


A recent world-wide measurement survey [2] reveals that, even in regions with wide LTE coverage, LTE only increases video quality by 20% over 3G.

the average stalling time remains 7.5 to 12.3 seconds for each minute s mobile video playback [2].


For CSI collection, there is a fundamental gain limitation of 1 because CSI consists of only information about the link between one antenna and another antenna.

signals received at other antennas do not contain information about that link's CSI.


Since these down link sequences need to be detected prior to synchronization, they must have low streaming auto-correlations, both with themselves and the other sequences in the orthogonal set.

since the sequences must be detectable without knowledge of when they start, the receiver must perform a full correlation at every sample, thus a time-shift of the sequences must produce a low correlation; otherwise it could cause an erroneous detection.


In the low RSSI regime we see that the 64-length beacon begins to perform poorly, and is only able to correct 80% of the beacons to within 2 kHz error.

the 128-length beacon with low RSSI is performs similarly to the high RSSI 64-length, which indicates extending the beacon length could further reduce CFO estimation error.


Our second key insight is that synchronization and association are not time-critical.

synchronization is valid for 100s of ms and association only happens once; thus by reducing the frequency of synchronization Faros is able to substantially reduce the channel overhead of these operations in the no-CSI mode, at the cost of slightly increased association latency at the cell edges.


LTE already provides a compelling random access solution which fits well within the Faros design, with the exception that Faros allows for longer length sequences to be employed to finely tune the gain gap.

with each users path delay to estimate timing advance, with small computational overhead.


Users which send reference signals in a given resource element gain spatial resource elements in the corresponding time and frequency coherence interval for both the uplink and downlink phases.

any given reference symbol provides an estimation that is valid both for the coherence time interval, as well as a wider frequency coherence interval.


To obtain CSI, the transmitter sends a pre-known sequence, called a pilot, which the receiver uses to compute this amplitude and phase shift for each subcarrier.

this requires time-frequency synchronization, as without time synchronization the receiver would not reliably know where the pilot starts, and without frequency synchronization there would be inter-subcarrier interference that causes inaccurate channel estimation


In an 802.11-like CSMA MAC, the beacon would need to be replaced by the beamformed Faros beacon immediately followed by the CSI collection phase, including the dedicated random access and association slots.

cDD spreads the power output of all M antennas spatially, and can be thought of as arbitrarily beamforming on different subcarriers.


Through our study, we observe that for any three consecutive WiFi bands, if the CSI phases in the first and the third channels are well compensated, they can serve as two anchors to further calibrate the CSI phase from the second band if its phase error is not fully corrected.

we can rotate the CSI phase from the second band and stop when its phase differences for the overlapped sub-carriers with other two bands are minimized.


Our evaluations show that the localization accuracy can be substantially improved.

splicer improves the CUPID localization accuracy by 71%, with median localization errors about 0.95m.


The reason is that offsets are frequency independent.

we find that the CSI phase accuracy can be further improved by leveraging the primarily spliced result


We plan to adapt this threshold with varying SNR values in our future work.

a single threshold is performing pretty well as explained.


ToneTrack makes mistakes only in the very low SNR region (below 6 dB).

ToneTrack leverages the insight that we can sometimes still retrieve useful and relative accurate information from these inaccurate pseudospectra.


Compare the relative amplitudes of the two peaks.

the smaller reflection path peak has a much larger error, so we can still extract relatively accurate information from the MUSIC spectrum in these scenarios as we only care the directpath peak.


µACK in [58] can also harvest such a throughput gain with the help of extra hardware (additional antennas working on another frequency band).

in Figure 17, we further evaluate two approaches in three typical 802.11 WLANs environments: a open-space academic hall, a large library, and an indoor of.ce, where the frequency selective fading levels increase.


Figure 4(b) shows that error events usually contain ed or ed + 1 coded bit errors for all the code rates.

ed and ed + 1 together account for more than 80% of the error events for all four code rates.


The first two applications aim to evaluate the accurate PER prediction of Recitation.

the former one focuses on the PER prediction when PER is close to zero and the latter one focuses on the prediction with the PER transition range.


The vast majority of service issues are rapidly detected via the network and/or application.

figure 7h shows the CDF of the loss ratio of detected failures during quiet hours (i.e., low usage period) and busy hours (i.e., peak usage period).


Moreover, approximated users' location could be used to localize geographical location of a failure to benefit root cause analysis.

as shown in Figure 6, ABSENCE consists of four components: historical usage retrieval, hourly usage retrieval, time series processing and user location profile retrieval.


Thus, one could natively assume that we could look for drops in load on network elements to identify service outages.

where in the network to look for such reductions in carried load is an intriguing challenge - traffic is regularly shifting around a mobile network, typically without any service impact.


However, users might still be impacted, even when the RAN accessibility KPI is good, because users that lost radio coverage are not even accounted for in the KPI calculation or when the root cause of the service problems are beyond the RAN (e.g., congestion on a core network element).

service disruption occurs when accessibility is bad, but accessibility being good does not necessarily imply that service is good.


However, if the transmitter is a client device, the WiDrawenabled receiver may have to periodically probe the device to obtain its AoA values.

wiDraw may only be able to leverage a few neighboring clients.


MUSIC can compute both the azimuth and elevation of an AoA if the receiver s antennas are arranged in a special pattern [12].

when applied to linear antenna arrays such as those within a laptop or tablet screen, MUSIC can only compute a one-dimensional representation of the AoA (.


If large environmental variations affect an AoA near the hand's trajectory, this will reflect in our trajectory tracking error.

if such an AoA is far away from the hand's trajectory, it needs to be detected as an outlier.


Expectedly, as the word gets longer, it is more difficult to recognize it correctly.

even by using a simple handwriting recognition software such as MyScript, the average word recognition accuracy is more than 91%.


If the transmitter is an AP, WiDraw can obtain the CSI and AoA of its transmitted signal by leveraging periodic beacons.

if the transmitter is a client device, the WiDraw enabled receiver may have to periodically probe the device to obtain its AoA values.


Researchers have analyzed the performance of Multipath TCP in such hybrid networks [7, 1, 5, 2].

exploring Mobile/WiFi Handover with Multipath TCP.


Thereby, MPTCP follows the end-to-end principle and does not require changes to the network or the application, i.e., an MPTCP connection appears like a regular TCP connection to the network.

many approaches, such as Mobile IP [5] and application layer solutions, were proposed, but are not widely used.


We set the alpha threshold to 0.05 (i.e., the model should describe 95% of the data), and we find that indeed the p-value is always lower than alpha, validating that multiple linear regression can properly .t our data, and therefore our multiple linear regression results can be trusted.

we do that so to determine if 802.11ac is a standard that could possibly support low latency show control systems in the future (Fig.


Second, operators can perform active measurements with client devices to probe the network.

these samples can only provide a rough estimation of the network performance, as they only cover the geo-temporal-span of the active measurements.


Therefore, it is of great importance to stimulate user participation so as to obtain high-quality data.

simply providing monetary rewards is not feasible because rational users can untruthfully report information of real costs, arrival and departure time, for maximizing their benefits.


Figure 1 shows some of the potential indoor application scenarios at 60 GHz.

60 GHz links are highly vulnerable to propagation loss.


compared with indoor localization schemes, CLaWa is a lightweight solution which does not require expensive localization operations or supporting devices.


The utilization of intermittent networks will become increasingly important with the explosion of mobile data traffic.

use of the extremely high frequency bands to augment the mobile access network remains a work in progress.


The JUJU services together with Metal As a Service (MAAS) are able to program physical severs on-demand allowing for programmability of cloud resources (computing, storage, and networking) and RF hardware in the remote radio head.

jUJU and MAAS can be seen as key enablers behind the so called programmable cloud, which adapts the infrastructure according to the requirements of slices instantiated (e.g., by deploying an appropriate number of adapted cloud servers with the LXC virtualization).


If the shortest path between a pair of sites is longer in the proximity graph than in the Delaunay triangulation, it indicates missing edges, or a lack of connectivity in the proximity graph (which may not be a problem).

one can infer geographic information from handover behavior.


From such data one can infer that if a user appears in two different cells within a short span of time, that a handover took place, and that the coverage areas of the two cells overlap.


Many testbeds for WSNs have been proposed with the goal of enabling users to test new methods and algorithms in a realistic environment.

many of these testbeds have only been developed for indoor use [8, 4, 7, 3].


In case the device has not received the chunk yet by the end of the dissemination period, it will make a new query to the Azure Mobile Service to request the chunk.

at least one query and up to two queries per chunk are performed.


In this work, we focus on the design and implementation of solutions that address the problem of video content delivery in practice -by far the most challenging in terms of network resources among the set of use cases above.

our ideas and concepts can be applied or reformulated for other use cases as well.


Each chunk that has not be fully downloaded due to communication failure is lost.

the size of the chunk should be sufficiently small to guarantee an efficient delivery, e.g. in presence of users with short contact duration δ.


Our aim is not to develop a new estimator, but fusing link quality with the routing metrics already in place in opportunistic routing protocols.

we are interested in the message replication, so for each message (with a given ID) we measure the time between replication on a particular node.


We run a simulation scenario re.ecting our broader research interest in the use of opportunistic networks for sensor data collection, specifically for challenging environments such as after a natural disaster.

we assume constrained low-power wireless nodes with transmission characteristics of those seen for typical wireless sensor nodes.


To test out this hypothesis, and to gain insights into ways of providing effective content delivery services in public transportation systems, we analyze a dataset collected from an Internet service provider in public transport buses in Sweden.

traditional content delivery mechanisms, such as using caches within the network is not effective in the context of public transportation systems.


Safari browser accounts for 86% of the iOS traffic.

majority of the Android traffic is divided between the Chrome Mobile (55%) and the Android Browser (33%).


Since contact opportunities may take an arbitrarily long time to occur, nodes, who often have limited storage capabilities, may have to store data for long periods of time and network congestion can quickly build up.

dTN congestion control is critical to ensure nodes are congestion-free and, when needed, can serve as relays for messages to be delivered end-to-end.


This increases the number of relayed messages in the network considerably while the number of delivered messages remains the same which increases the overhead.

it increases the amount of network resources that are used to deliver one message to its destination.


the SPMBM [9] model uses Dijkstra's shortest path algorithm to calculate the shortest path from the current location to a randomly selected destination.


A Bluetooth scatternet can thus link together more than 8 devices.

the notion of macronet is wider than that of scatternet, as the micronets forming a macronet can use different communication technologies.


This is supported by the large Pearson correlation coefficient presented.

selection of DCU deployment sites must evaluate the site's ability to support minimum data volume requirements.


Sharing opportunities are sparse but exist.

we observe one pair of home APs, node 0 and 7, which exhibit reciprocal sharing relationships.


Prior work has studied optimiz ing the AP placement to maximize the signal strength in certain areas [16].

moving the AP to improve the strength in one area would also result in the decline of signal strength in another area.


Each molecule, during its trip, can hit the spherical receiver with radius rr and, in this case, the hitting molecule is absorbed by the spherical receiver.

a molecule can contribute to the signal just once.


As for the boundary conditions of the shell, we use the partially inelastic model.

when a nanoparticle collides with the shell from both inside and outside the shell (both spherical and cylindrical), we handle a partially elastic collision with the plane that is tangent to the shell in the collision point.


For an aperture of 90°, the performance begins to depend on the radius of the shell, even if still not providing any gain.

for small values of the shell radius, the effect influences the absorption process, and improves with R.


It appears that most of absorptions occur in the front side of the receiver.

our idea is to put a shell to trap the carriers which have passed beyond the receiver, but still between the shell and the receiver itself.


Based on the SNRs, we see quite expected error performance curves, with the best performance represented by the highest scattering case due to the largest received energy.

even with the largest transient, the error quickly approaches the boundary of 0.5.


The power delay profile describes the power transfer in the channel.

it gives a power impulse response for a signal.


In the previous work, we used log-normal size distribution for the diameter of the scattering particles.

there are commercially available small particles, which have desired features for possible scattering measurement campaigns, including controlled spherical shape with known mean diameter and standard deviation.


The delayed energy also potentially increases the probability of inter-symbol interference (ISI).

we leave the ISI analysis to the future work.


The multiple scattering helps the detection of the symbols due to higher bit energy at the receiver.

this exposes the system to potential ISI if the symbol separation is not sufficiently large.


It lays its eggs inside a particular kind of mussel.

endangered fish habitat monitoring Sensors We installed five types of sensors (water temperature, air temperature, dissolved oxygen (DO), illuminance, and humidity) into the biotope.


In Figure 8 (1), the RTT is evaluated for different ICMP packet payloads and for different distances.

the policy concerning the TCP sender window is examined for direct link and multi-hop network scenarios.


In other words, Kbest is equivalent to a global optimal solution in IHS under the conditions that the problem has a global optimal solution.

hA assumes that Kbest is a local optimal solution vector.


It can be seen that IHS converges after about 3800 iterations and SA doesn t arrive in a stable state.

but the illumination requirement is left out of account.


We can take advantage of IHS to find the regions of the solution area and increase the diversity of solution vectors in the HM.

respectively, the dynamic update method of PAR and BW are discussed in details in [7].


When the light beam is blocked by human body, the existing pulse will disappear in frequency domain.

by detecting the change in frequency domain, for each pair of LED light and photodiode on the floor, the system will know whether the light beam is blocked.


To address the above limitations, in this paper, we seek a different approach to human identification.

we examine the feasibility of using the ubiquitous light around us to recognize who we are, without requiring users to carry any on-body devices, neither using any cameras constantly monitoring users.


In [4], computer vision and triangulation is used to estimate the relative location between several lights and the camera.

our future works include enhancements in the following aspects.


A lens is placed in front of the LCD to project light going through different pixels of the LCD toward different spatial locations.

different spatial locations on the same plane would receive different positioning signals, which allows the receiver to estimate its own location with respect to the transmitting light.


The testbed capabilities are demonstrated through multiple graphical user interfaces (GUIs) at the relay, destination, and trace recorder nodes.

in each relay node we plot the instantaneous SINR and queueing information, while a GUI at the laptop-PC controlling the destination node and primary receiver (Fig.


The DTS packet is used to announce the information update on code, transmit power, and queueing to neighboring nodes.

we build a 7-node software-defined radio testbed and implement a distributed algorithm that maximizes the secondary network throughput, while at the same time avoids interference to primary users through joint Routing and cOdewaveform CHannelization (ROCH).


A tradeo↵ exists between the CPU cost and the simulation accuracy in terms of received messages.

the primary nodes locations can be changed during the demo execution time.


The pendula are custom designed wooden devices operated via servo motors, which we will operate using our Z1/TelosB nodes.

time synchronization provides the basis for several applications in wireless sensor networks but the limited memory and computational power, and the use of low precision oscillators make the task of time synchronization non-trivial.


The initial trust establishment, or Device Pairing, cannot rely on physical interactions between unfamiliar device holders.

such a receipt is, and only is, verifiable to A, B and BS using their private keys, while the obfuscated feedback is verifiable to the receiver without revealing its actual value.


The emerging Device-to-Device (D2D) communication techniques [2] such as WiFi Direct, Bluetooth Smart, and LTE direct have a great potential to provide cost-e.ective solutions to collaborative interactions among mobile devices for mobile crowdsourcing [3, 4].

since participating devices are private and temporarily hired, there is no prior trust relationship between devices opportunistically encountered.


They promise unprecedented new abilities to observe and understand large-scale, real-world phenomena at a fine spatio-temporal resolution.

this potential does not come for free; WSNs have been known to be vulnerable to several types of attacks aiming at compromising their security.


The analysis involves several network characteristics and is aimed towards identifying easily measured features that can be used for efficiently detecting and classifying DoS attacks in WSNs.


Figures 5-7 depict the BER performance of the DF scheme described above under Rician fading.

each figure corresponds to a different Rician k-factor (0, 10 and 20 respectively).


In this topology, the wireless links between both transmitters and the relay are considered ideal, i.e. the SNR value of the frames received by the relay is very high and the frames are always decoded correctly.

the SNR value of the frames received by the receiver from the relay and the two transmitters varies.


In hypervisor approach to virtualization (i.e. VM), IO virtualization is done through the hardware emulation layer under the control of hypervisor, where as in container this is done through the device mapping.

direct access to the hardware is easier in containers than in VMs as they operate at the host OS level.


The evaluation results in Section 3 confirm that uplink processing dominates the downlink, and that the total processing increases with PRB and MCS.

the contribution of each underlying BBU functions to the total processing time and how they scale with the increase of PRB and MCS remains to be analysed so that an accurate model could be build.


ROCH capabilities are demonstrated through multiple graphical user interfaces (GUIs) at the relay (R1, R2), destination (D), and trace recorder (TR) nodes.

gUIs at both secondary relay nodes illustrate real-time SINR and queueing information, while the laptop-PC, that controls the secondary destination and primary receiver (PRx) nodes, compares the instantaneous throughput between the primary link (PTx– PRx) and the secondary two-hop network.


All these works consider WPANs, where all clients are located in a single room, the traffic pattern consists mainly of client-to-client connections, clients themselves can act as relays, and each client maintains a connection to the AP.


In order to recognize these patterns, their colors must be distinguishable, even in cases of low light, hardware noise, and ambient light.

there must be a noticeable color transition between different patterns.


For example, the grayscale value of 100 might normally be considered black and representing 0 in QR Codes, but for ImplicitCode, it could be 1 if the carrier video block is even darker.

we also need to determine the threshold between the colors representing 1 or 0 relative to the carrier video, even though we cannot assume any a priori knowledge of the carrier video.


Across all four datasets, WiScan consistently achieves 90%+ of the optimal connectivity, demonstrating that our SSID learning scheme accurately predicts future SSIDs.

wiScan achieves 97% of the optimal in the Canberra dataset.


Overestimating the scan interval will make the system miss potential connectivity until the next scan.

we configure scan interval Ts conservatively.


There is only a single point for WiScan in Figure 9 because WiScan automatically adapts it scan interval based on user mobility and AP distribution.

wiFisense and existing method in Android work with a fixed scan interval, so we configure their fixed scan interval to different values and examine their tradeoff between energy consumption and achieved connectivity.


endpoint congestion over a long period of time.

copyrights for components of this work owned by others than ACM must be honored.


These speculative packets travel on a low-priority virtual channel (VC) [12], and are only allowed a limited queuing time inside the network before being dropped by an otherwise lossless network.

hPC networks may not always be dominated by large message transfers.


Overall, varying the number of indirect routes considered at each packet injection (nI ) affects slightly the throughput saturation point under worst-case traffic, with higher numbers providing better results, as more available routes are available.

cSF affects the average delay under high loads of uniform traffic.


All end-nodes of RA send their traffic to the end-nodes of RC and all nodes from RB send to all nodes of RD.

the link that connects RB and RC becomes overloaded, with 2p flows passing per direction, resulting to 1/2p of the maximum throughput.


If Rook causes unlikely values to occur more frequently then there could be a shift to a more uniform frequency distribution versus the normal traffic.

it might be that the velocity of an avatar is never actually greater than 100.0.


The authors do not show that the availability subproperty is met.

the authors did not evaluate the impact of address rotation on the network infrastructure near the hosts.


Future work could integrate these mechanisms into the DNS capabilities system itself to better distinguish legitimate users from adversaries.

attackers may avoid using the ISP DNS infrastructure associated with each compromised system to avoid detection when performing large-scale scanning.


We then created another application, fpanaly.py [21], to analyze the results.

as an example, consider these TCP options (which happen to come from a SonicWALL firewall device): NOP, NOP, MSS=1440, SAckOK, NOP, WScale=0


we wanted to determine which probes produced the highest amount of variability in the responses.


KL-divergence also requires large data sampling and dense fingerprints in signal distribution comparison.

it cannot adapt to the noisy airport environment.


Moreover, the signal coverage of APs in our campus corridor and HKCP is constrained by the wall partitions, which helps differentiate the RPs.

we expect a better localization performance on HKUST and HKCP than in HKIA.


We first show the metrics’ abilities to accurately interpret the probe reception history.

given the history, we observe how precisely a metric captures the performance of the corresponding link.


Based on the observations in the previous section we design cETX on top of the Gilbert Model.

this model is only capable of representing the status of a single link.


In this work, we observe that spatial correlation interplays with temporal correlation to exhibit reception correlation at consecutive links.

there exists spatiotemporal correlation, i.e., the packet reception of a link is dependent on the recent reception at preceding links along a path.


Immediate forwarding is likely to exhibit spatiotemporal correlation.

when the delay is sufficiently large, cETX reflects the inde-e2 e4 pendence between consecutive links (i.e., no spatiotemporal correlation) where cETX still remains more accurate than ETX due to its consideration on temporal correlation.


The packet reception ratios of Link3 and Link4 are 0.49 and 0.5, leading to approximately the same ETX of 2 for both links.

the difference in the true average transmissions is quite large; 2.05 and 2.98 for Link3 and Link4, respectively.


End-to-End Delivery Ratio: The success probability of a packet delivered end-to-end.

figure 19 shows the endto-end delay of metrics in the three protocols.


the number of (re)transmissions in each link in a path do not exceed the retransmission limit.


To further maintain fairness, both metrics use the history of up to 90 probes, the value suggested by ETX [11].

when there is a data packet to be forwarded (every 10s in our case), both metrics use the history of the last 90 probes to estimate the number of (re)transmissions until a successful delivery.


(ii) Spatiotemporal correlation captured via data traffic in cETX naturally reflects the forwarding scheme adopted by the network.

the corresponding degree of spatiotemporal correlation is captured regardless of immediate or delayed (e.g., duty cycled networks) packet forwarding.


The flattening phase still presents room for improvements: increasing its efficiency is largely a matter of e.ective engineering.

the solving phase is difficult to further optimize, as the problem is inherently NP-hard.


The goal of our design is to find the largest idle intervals of the microcontroller for Fountain coding, under the precondition of controlling the synchronization offset between the concurrent transmissions of constructive interference within 0.5 µs.

we need to guarantee that the generated idle CPU intervals are constant and the coding computation occupies deterministic time.


During the dissemination, the power consumption of Pando is the same as the previous protocols, since all of them keep the nodes in active mode.

compared with the previous protocols, benefiting from a shorter dissemination time, Pando reduces the energy consumption of individual nodes by the same reduction factor as the dissemination time.


As in Figure 5, the leaf nodes only transmit in their even TX slots, corresponding to the oddRXslotsoftheirparentnodes, inwhichtheparent nodes listen to the feedback from the leaf nodes.

the silence of leaf nodes in the time slots of odd packets does not impact the feedback process.


Unlike CAs, IP PKGs need not to interact with users during the signed object verifying procedures.

once private keys are obtained, the sIP address holders will no longer necessary to communicate with the IP PKGs, thus significantly reducing the communication and transmission cost while implementing routing veri.cation procedures.


Besides, consecutive requests may also impact content delivery in terms of added queueing and processing delay which we assume to be roughly proportional to the number of messages.

the cost can increase faster and requests may be dropped in a busy network.


It is worth noting that many topological properties (e.g., average degree, density etc.) are homogeneous on random networks.

a randomly chosen sub-network possesses similar characteristics as the whole network which is also known as self-similarity.


The reason is that the optimal radii of the nodes with high ( values in both static and dynamic flooding are small and close to each other.

dynamic flooding usually significantly increases the radius of the nodes with low B.


A server managed by an administrator is considered to be a trustable message exchange point among related peers or a kind of portal site for this SNS that is known to everybody in the serving network.

the SNS administrator can observe any message sent to the public or to a specific friend group.


Therefore, in NDN, security is built into contents, rather than connections between end hosts.

content publishers must sign all of their contents, i.e., any content in NDN has a signature to prove its provenance and integrity.


Originator-signed signatures inherent in Information Centric Networking assure the integrity and provenance of messages exchanged among peers, which makes it possible to realize moderator-controlled information sharing in which a peer can become a moderator and control the distribution of his private message group as a trustable server.

moderated content requires multiple signatures, which increases the size of the exchanged message and is inadequate, especially for short message services.


Boneh et al. proposed the concept of aggregate signatures in [4], in which it is possible to aggregate n signatures on n distinct messages from n distinct users into a single aggregated signature of constant size.

(5) The moderator sends the content to corresponding subscribers or peers within his group.


Current NDN testbed key management [3] uses a simple hierarchical trust model with a root key, which signs the keys for each site.

this NDN’s default pull-based communication model can also be extended to have pushbased multicast capability (pub/sub), as demonstrated in COPSS [6].


For example, passive probing cannot detect link recovery, that is, a QoS improvement of a path which is not among the current working paths; it is hard to determine the performance of an interface that does not send or receive data.

active probing can probe interfaces other than the current working path to find recovered or better interfaces.


One key difference to our approach is that they use routing to locally address content: peers add known content chunks to their FIB and the consumer application performs a longest prefix match on the chunk name, which returns only the face of the local peer.

our system relies mainly on forwarding: we assume that the FIB contains multiple interfaces per prefix (prefixes can be more coarse-grained than chunk-level) and let the forwarding strategy decide which one to use.


For that, NDN has a built-in security mechanism based on digital signature.

resultingly, the content is verified repeatedly at each insertion(more precisely, when a cache-hit occurs after each insertion).


As concerns the cache hit rate, a smaller value of p results in a higher hit rate when s = 0.7.

as the content popularity becomes more skewed, the benefit of probabilistic caching disappears, and CBS achieves lower hit rates than the proposed scheme.


This decoupling of content from location enables efficient content distribution by minimizing redundant transmission on the links.

it brings about new types of security problems as well.


Especially, if poisoned contents lie in the network cache, called content store(CS), interests would be served by the poisoned content rather than they propagate toward the content server.

users whose interests pass through the contaminated CS cannot access the valid content.


Like in the TCP/UDP case, the continuous space representation captures the aggregate flow behavior neglecting microscopic packet-level dynamics.

the smaller the packet size and the larger the number of multiplexed flows/packets, the more accurate is the fluid approximation of system dynamics.


First, our analysis is based on the simplifying assumption of a perfect allocation of IO name registrations into BF containers, while the actual number of BFs depends on the merging process throughout the hierarchy (see Section 3).

we consider the selection of a BF configuration among the ones satisfying Equation 5 for s = S.


However, to overcome the high path loss inherent at these high frequencies, mmwave networks must employ highly directional beamforming antennas, which makes link establishment and maintenance much more challenging than in traditional omnidirectional networks.

maintaining connectivity under node mobility necessitates frequent re-steering of the transmit and receive antenna beams to re-establish a directional mm-wave link.


Finally, the related issue of neighbor discovery in directional wireless ad-hoc networks has been widely discussed in the literature [21, 18, 9, 13, 4].

these works focus on fast discovery of multiple directional links between all pairs of nodes in the network, rather than the fast establishment of the individual directional links between one node pair.


Other schedulers do not give priority to the faster vehicles; hence, they may experience larger delays resulting in larger position error.

the SLA scheduler gives the priority to faster vehicles, and therefore prevents large errors for faster vehicles, resulting in greater control of the position error of the vehicles.


As LTE is an infrastructure-based network, vehicles cannot broadcast their safety messages directly to their neighbors; thus, all messages should pass through the infrastructure.

these messages may congest the network and lead to high delays for some vehicles.


There remain a number of outstanding issues to address in order for the co-operative scheduling protocol to achieve the robustness required for use in wireless LANs.

a mechanism should be added to detect and recover from a lost schedule packet.


The affected nodes then need a way to return to normal scheduling.

once we have the scheduling architecture in place, the Intent protocol proceeds as follows.


We note that the results of the fixed case (without cell zooming) is same in any scenarios because it keeps the complete coverage regardless of user distribution until all batteries run out.

the BS cell is a circle with a radius ranging from 0m to 400m with 20m steps.


The usage situation of these transmission lines is essential information for carrying out the simulation at each terminal.

it is essential for the protocol for carrying out carrier sensing, such as CSMA/CA.


Computer simulations are used because they can be conducted comparatively easily.

simulations using inexpensive computers have come into wide use due to the improved performance of personal computers in recent years.


Since the frequency of memory access increases due to increases in the number of threads, there is some increase in calculation time due to memory bus competition, but compared with a CPU, a GPU is almost unaffected by an increase in the number of terminals.

when the number of terminals was 1024, it was confirmed that the GPU can calculate at a speed about 4.6 times greater than the CPU.


In particular, simulations using inexpensive computers have come into wide use due to the improved performance of personal computers in recent years.

calculation time and precision depend greatly on computer performance, and if the simulation scale increases due to factors such as a large number of sensor terminals, the amount of calculation needed to obtain high-precision results will be tremendous, and it will take an extremely long time to obtain results.


If the simulation scale is large and the number of terminals will not fit in the same thread block, then transmission lines can be realized using global memory.

in this case the memory access latency will become extremely large, and as a result, there will be a major increase in the time needed for the simulation.


In general, even though real-time image processing places an extremely high load on hardware, the nature of the processing itself is comparatively simple, and thus is suited to implementation in hardware.

nVIDIA Corporation and other GPU developers are competing to improve performance through higher level integration of high-speed memory and powerful processing capabilities.


The cluster coefficient measures the tendency of nodes to cluster on the graph.

we can measure the density of connections among the neighbors in the graphs.


The IEEE 802.11 standard [6] does not have collision detection, and so the protocol places more importance on avoiding collisions in the first place.

when a node with a frame to send senses the medium transition from busy to idle it does not deterministically start its own transmission and instead a node waits a random backoff.


In vehicular networks, the packet losses in the path between source and destination occur due to packet collisions, fast movement and a limited communication range of vehicles.


As a consequence, the total amount of static overhead is N H .

figure 5: Fraction of Monitored Vehicles 2 different vehicular densities in the district of Manhattan, NY, and in Rome.


In previous work it has been shown that the proposed mechanisms are capable of improving CoAP-based end-to-end communications in IoT networks [2, 3].

the investigations of advanced congestion control mechanisms so far only have covered reliable CoAP communications, not taking into account unreliable communications, such as the ones based on CoAP observe.


Xiang et al. [5] developed an algorithm for SVC flow adjustment for video streaming over wireless networks using DASH (Dynamic Adaptive Streaming over HTTP) [6].

before the simulation phase, it is also necessary to generate two additional traces.


VANETs face particular challenges such as fast topology changes, low link lifetime or a potentially high number of nodes taking part in the network, among others.

the two former issues have encouraged researches to propose geographical routing protocols for VANETs that make their routing decision based only on local information and that do not need to construct end-toend paths.


The simulated results comprise the energy needed by the radio transceiver and the microcontroller of each node in the network.

simulation was carried out (i) without timing annotation, i.e., ignoring execution times of firmware, (ii) including execution times of low-level drivers, and (iii) including all firmware runtimes.


[13] made a strong case for including application code in the simulation, as the complexity of firmware used in modern WSNs is increasing.

to the best of our knowledge, we are the first showing the impact in terms of energy consumption of ignoring firmware runtimes in WSN simulations.


sQualNet provides good scalability, accurate battery models, and also models the clock drift of nodes.

the integrated data logger enables longrunning measurements.


Despite the considerable improvements achieved by IG and FIG algorithms compared to other benchmarks, several issues can be found in the algorithms: 1) each UE greedily maximizes its immediate payoff based on its neighbour UEs’ strategy of the last iteration.

the quality of the solution is highly sensitive to the UE update sequence; many such sample paths may lead to bad local optima.


Compared to IG and FIG, RL and FP make more intelligent decisions on strategy updates by exploiting historical information.


But no matter what content is in rm, the FC can still give the same result as long as the number of malicious SU's false reports is below the aggregation's threshold which is usually set as half the number of SUs [20].

if less than half SUs are malicious, our scheme's correctness can be kept.


All the parties in the semi-honest model must follow the protocol of collaborative sensing and our scheme, but they can keep their own intermediate results, and in this model, honest users are the majority [15].

sUs and the FC must honestly do coin flipping and send their result whether they are semi-honest or not.


Generally, we randomly choose a SU as the Helper for one round before the sensing starts.

for example, a malicious Helper simply drops all reports from SUs and sends a mess to the FC, then the sensing process cannot finish as expected.


In that case, varying the channel too quickly creates a lot of overhead.

the channel still needs to change often enough to avoid long delays.


Based on this novel approach, we develop service process characterizations for fading channels with finite blocklength channel coding, leading to novel probabilistic delay bounds that can give a fundamental insight into the capabilities and limitations of wireless networks when facing low-latency M2M applications.

we show that the Shannon capacity model significantly overestimates the delay performance for such applications, which would lead to insufficient resource allocations.


Based on this novel approach, we provide a performance model for wireless systems that operate at finite blocklength.

the core contributions of this paper are: We derive probabilistic delay bounds for wireless systems that use channel coding at finite blocklength.


The reason is that the encoder and the decoder do not hold the same version of the reference frame.

the en-coder does not perform quantization and only has the lossless version of the video frames, while the decoder only has the distorted version.


Generally speaking, the digital video coding efficiency is quite high, although the B-frames should be disabled in a low-delay setting.

digital transmission in a varying wireless channel is known to have the thresholding effect and saturation effect [15, 14].


Stereo video (or 3D video) has attracted increasing interests in recent years, and there is a trend that a large portion of the stereo videos will be captured and consumed by mobile devices [1].

several virtual reality (VR) head-mounted displays (HMDs), including Oculus Rift [4], Sony Morpheu [5] and Microsoft Hololens [3], will be available as full products in the early 2016.


In a dramatically varying channel, the sender tends to select a robust modulation scheme and a strong channel code to ensure reliability.

this significantly reduces the effective bandwidth and as a result the source encoder has to operate at a low target video quality.


The noise trace is used to test the references implementations to ensure fairness.

we divide the channel SNR into 2dB bins, and all traced data falling into the same bin is averaged for performance computation.


The digital bit stream must be transmitted without error to guarantee basic visual quality and identical side information at the transmitter and receiver.

strong protection should be provided to digital transmission.


In a bigger area with the same MC the distances are longer thus the MC does not have enough speed and sufficient time to keep a high % of overall alive nodes.

as the network scales the use of local distributed network information achieves good performance-overhead trade-offs.


Considering the relatively high performance, we used for our strategies evaluation the exponents in a uniform manner (i.e. all exponents equal to 1).

according to this strategy the MC is moving along the one dimension of O until it reaches its border.


Conserving the buffer between consecutive optimization windows is particularly useful when the content duration is longer than the optimization window and it is thus not possible to guarantee the QoS over its whole duration.

the streaming requests that cannot be scheduled with guaranteed quality must wait for the system to have enough resources for them to start streaming.


To measure the accuracy of COExiST we carry a series of experiments using three nodes, with two nodes representing the secondary network and the third the primary user.

at the routing layer we use OLSR with an ETX implementation.


However, this strategy only works when the players can correctly determine who is the first player, which may not be possible in distributed applications.

a player-independent strategy is desired.


A detailed mathematical formulation is derived to estimate the degree of overlap in terms of expected quorum overlap size.

rDV on a channel is rather influenced by channel quality or CR user s preference on which it wants to achieve RDV on available channels.


According to the definition of ATTR, (presented in section ??) it can only be minimized by increasing the number of RDV which is also illustrates in fig. 8b.

rDV only achieved if both CR users observe same set of channels.


In asynchronous approaches, the nodes duty cycle schedules are decoupled.

at an arbitrary instant, only a subset of the nodes are in active mode, providing network services.


In synchronized approaches, nodes negotiate a schedule in order to align their active or sleep periods.

the sender node knows when its neighbors are awake and able to receive data packets.


The selected candidates forward the data packets toward the destination in a prioritized way, such that a node transmits the packet only if all the high priority candidates failed to do so.

a packet should be retransmitted only if none of the candidates receives it, which helps to reduce the energy consumption and packet collision.


Memory management : release buffer space until enough vacant memory space in its generation can store the message.

therefore, the concept of Adaptive Collaborative Network Coding of Intra/Inter-Flows based on Bayesian Network(ACNC) is proposed.


However, in a network with multiple generations and various lengths of messages, this scheme would cause less satisfactory performance because it cannot re-adjust the degree dynamically.

the adaptive collaborative network coding of intra/inter flows(ACNC) method is put forward in section 4 to solve this problem in a further step.


That is, existing broadcast strategies for DTNs do not perform well with human body mobility.

however the relative typically small WBAN dimension limits the problem of the flooding algorithms that, with very large networks, makes the retransmissions uncontrollable.


Besides the chosen strategies, these contributions confirmed that the transmissions efficiency increases with the knowledge of the mobility pattern.

knowing how nodes move allows to reduce the number of unnecessary transmissions and the delivery delay.


However, the discussion presented throughout this paper shows that this approach does not offer any advantage over the plain application of the PWP model.

the former solution makes the modeling task considerably more involved.


While the quantization error of the local station may be alleviated by newer WiFi chipsets operating on wideband channels (such as the 160 MHz clock of 802.11ac), the variability of the target offset implies that some level of intervention of the target station would be needed to increase the precision of the measurement, such as the 802.11v amendment which would allow location-related timing information to be shared between local and target stations.

as of today, there is very limited support of 802.11v features in chipsets and drivers.


We study the statistical error distribution of the ToF and characterize how it affects the ranging accuracy and precision.

we aim to answer the following key questions related to timing information extracted for 802.11 ranging: How deterministic and predictable are the time offsets for ranging measurements using regular IEEE 802.11 chipsets?


Sleep Capability Some approaches in the literature consider that the SUs can switch between sleep and awake states to reduce energy consumption during idle periods [6].

a SU can choose to turn their transceiver off when a PU is detected present, because no secondary transmissions are allowed during that period.


During no change (baseline) or a temporal change the GeMREM sensor sends either a keep-alive signal or just the temporal feature, respectively at a low data rate of 1.16 kbps.

when there is a change in morphology the GeMREM sensor sends the full data at high data rate (82 kbps).


In CCN, hierarchically structured names are used to simplify the name space management and aggregation similar to IP.

iP addresses reveal the physical domain relationships while the hierarchical names cannot.


In a first evaluation step, we can use this analogy to theoretically estimate the flooding overhead inherited from the topology prior to adaptive FIB optimisations.

we can derive the worst, best, and average case scenarios for flooding branches of subtrees.


The last class of approaches that we discuss in this paper are countermeasures that analyze PIT consumption per name prefix.

this observation can be easily misused by an attacker when launching real-world attacks.


The easiest implementation is the request of non-existing content as entries need to expire until they are removed.

even the request of existing content may harm the infrastructure when the entries in the Pending Interest Table (PIT) exceed the content delivery rate (e.g., due to large network delays) [5].


The Pi boxes scan for bluetooth devices and keep track of the devices that they see.

the multicast features of CCN allows to forward an alert to multiple end points: the gateway of the function, but also the tag's user or the local authority to retrieve the missing tagged item.


Such a service is not valuable until it has many users to detect tags.

since early adopters would only see little value until that critical mass is reached, they would be less likely to encourage others to adopt.


One popular technique for flat name is Distributed Hashing Table (DHT) based approach [3-5], where multiple servers form circular linked list and the bindings are stored in the appropriate server.

we will demonstrate the benefits of utilizing BFs by our prototype.


The current Internet is addressing on the order of 109 nodes, whereas the number of addressable ICN objects is expected to be several orders of magnitude higher.

scalability on the ever-increasing number of NDO becomes one of the most important challenges on designing NRS.


Initially, dashboards will be statically defined.

we encourage researchers to contribute reports at the completion of research projects, and moving forward we hope to allow everyone to dynamically define new reports.


We will continue to maintain the scans.io interface, provide continued access to our historical datasets, and allow researchers to upload other data.

we will no longer post our regular scans to https://scans.io, but rather encourage users to download these directly from Censys's web interface.


Finally, it is our hope that by publishing scan data, carefully acquired and properly curated, we can reduce the need for Internet scanning performed by other researchers, and thus reduce the overall burden on destination networks.

it is well established that attackers already use Internet-wide scanning to find vulnerable machines from botnets and bullet-proof hosting providers [17].


According to Shannon Theorem [1], a large SNR can support a high speed service than a small SNR on the same channel bandwidth.

we would like to enable a receiver at the desired location to always achieve a large SNR, and an eavesdropper at an undesired location to encounter a low SNR, so that it cannot distinguish the received signal from the background noise and fails to decode received data.


We observe a clear and fluent video when the receiver is located at the desired position, and the video quality deteriorates when the receiver moves away from undesired locations.

we encounter frequent video stuck while playing, and severely distorted images.


Service providers may use existing localization algorithms like time-ofarrival (TOA) and angle-of-arrival (AOA) to find the locations of wireless users, and encrypt the service data so that users at target locations can use appropriate keys to decrypt it.

cryptographic encryption may cause a significant latency, and thus fail to support common services like high-speed downloading and online video watching.


At other locations where constructive interference vanishes, j1 and j2 do not cancel each other, and instead they serve as jamming signals to decrease the SNR at receivers at these locations.

the receivers will experience a service of bad quality.


Note that the propagation synchronization may introduce overlapping time slots due to the varying time shifts experienced by different users.

proper time guard should be inserted between time slots to eliminate the overlaps and avoid the interference among multiple users.


Assume an ideal synchronization algorithm is in use and these packets arrive at the receiver at the service location simultaneously.

they constructively interfere with each other to form a boosted received packet whose magnitude is twice of that of an individual packet.


Effect Multipath effect is the phenomena that signals sent by the transmitter travel along multiple paths to reach the receiver.

since users are located at different locations, the transmit signals may need to be sent at distinct times to compensate the time difference, and thus asynchronous CDMA scheme is required at the transmitter.


Also, a malicious FWD could collaborate with a malicious IdP and send information about the RP to the IdP, and hence, undermine privacy.

for our system to provide authentication and privacy, we require that FWDs behave honestly.


For the proof, we first show some general properties of SWS auth.

we show that encrypted communication over HTTPS between an honest relying party and an honest IdP cannot be altered by the (network) attacker, and, based on that, any honest relying party always retrieves the “correct” public signature verification key from honest IdPs.


This is the first SSO system which respects user's privacy.

the system allows users to log in to RPs with their email addresses.


Informally, these properties can be stated as follows: (A) The attacker should not be able to use a service of an honest RP as an honest user.

the attacker should not get hold of (be able to derive from his current knowledge) a service token issued by an honest RP for an ID of an honest user (browser), even if the browser was closed and then later used by a malicious user, i.e., after a CLOSECORRUPT (see Section 3.3).


RPdoc sends this address in a POST request to RP 3 .

the third component, script, is an injective mapping from a script in S to its string representation script(s) (a constant in Σ) so that it can be part of a messages, e.g., an HTTP response.


This full day tutorial on synchronization and security in Named Data Networking (NDN) will share important architectural concepts we are exploring in these areas, the software we have built to perform these tasks, and remaining open issues.

it will emphasize how the existing open source toolset provides a platform for exploring the open research questions.


This tutorial will share important architectural concepts we are exploring in these areas, the software we have built to perform these tasks, and remaining open issues.


Tactical scenarios normally cannot rely on such infrastructure and events like natural disasters can severely damage the network infrastructure in rural and urban environments.

there is a need to develop solutions that provide SoA-based application and services running on heterogeneous and often constrained devices that compose tactical and mobile ad-hoc networks with Quality of Service (QoS) levels that meet their requirements.


Network traffic characterization constantly analyzes the volume of traffic in the network to provide the decision making component of NetProxy with updated information about what nodes and applications are generating traffic, what types of data are being transmitted, the current bandwidth consumption, and observed radio/link performance.

the QoS related decision making process in NetProxy is both application- and network- aware.


ACM NetProxy [3] [4] provides transparent integration between networked applications and the ACM.

as shown by experimental results obtained during a test in a field demonstration event, GM enables multiple nodes in subnetworks to benefit from NetProxy and the ACM.


When either happens, NetProxy intercepts the ARP request, changes the source hardware address (SHA) of the requester with that of the ENI of the proxy gateway, and finally forwards the modified packet on the other network interface.

similarly, Figure 3b shows that the density distribution of the number of packets in the EN during each interval has much gentler slopes than that describing the conditions in the IN in the same intervals.


Consequently, expansions were made to networks of roads to accommodate the increasing number of vehicles.

these changes resulted in an increase in the rate of deterioration of road health, out-pacing current road health monitoring techniques and increasing the number of accidents.


The significant increase in the number of drivers can be put to use to help address these challenges, through continuous monitoring and reporting of events by the drivers and their vehicles.

to enlist the help of the public and their vehicles the system must be inexpensive to attract participants.


Emergency and periodic messages are transmitted over the CCH and infotainment messages are transmitted over SCH.

to transmit these messages, the transmitter is switched alternately between CCH and SCH in a 100 ms long Synchronization Interval (SI), as shown in Figure 1.


As discussed earlier, periodic messages are generated after every SI.

when a safety critical event occurs, an emergency message is generated which attains higher priority than periodic messages for transmission in the CCH [3].


Last, we evaluate the online detecting lag and the offline training time of Opprentice (Â§5.8).

since anomalies occur less frequently in practice, an arbitrary training set is unlikely to cover enough anomalies [16].


The above describes how to configure cThlds based on the PCScore in an offline or “oracle” mode.

we configure cThlds after the data to be detected (also called a test set) have already arrived.


For example, stop growing the tree earlier after it exceeds a threshold of depth.

it is still quite tricky to determine such a threshold.


LPR reveals the actual usage of MPLS according to the inferred label distribution protocol and is able to make the distinction between ECMP and TE multi-path forwarding.

the distribution given in Fig. 9 does not show the Mono-LSP case9 .


This means we do not observe transit tunnel diversity, the same LSP being always used whatever the destination.

for this tunnel, we are not able to reveal ECMP load balancing (by definition of the class) or the deployment of several FECs used to reach different ASes with different routing constraints (although 4 we consider at least two destination ASes as stated in the filtering subsection).


In practice, if the vast majority of LSPs disappear for a given AS, we reinject the whole set of its LSPs to perform a standard classification on a given snapshot4 .

we do not remove such an AS and continue to process it as the others but adding a dynamic tag to it.


It must be applied once the data has been collected, as long as this data contains information related to MPLS tunnels [7, 8].

further, we are able to observe the evolution of each Autonomous System (AS) independently and understand whether it enables path diversity, how, and when it evolves (e.g., from almost no path diversity to a wide deployment of TE).


Based on an extensive and longitudinal traceroute dataset obtained from CAIDA, we apply LPR and find that each ISP behavior is really specific in regard to its MPLS usage.

we are able to observe independently for each ISP the MPLS path diversity and usage, and its evolution over time.


These results suggest that by studying the PLC network and its temporal variation, probing can be optimized to achieve a good tradeoff between overhead and accuracy.

81% of station pairs that are connected by PLC links, are also connected by WiFi links.


It turns out that the devices maintain the channel-estimation statistics, as the estimated capacity resumes from the previous value before stopping the probing process.

the convergence time of the capacity estimation does not apply in realistic probing conditions.


the variation of µ is governed by the electrical load.


It also enables a sniffer mode with which we can capture the SoF delimiters of all received PLC frames.

hence, we create two different networks, shown with different colors in Figure 2.


100% of station pairs that are connected with WiFi are also connected with PLC.


The authors find that hybrid networks contribute to increase coverage in home networks; they also argue that using alternating technologies for multi-hop routes yields good performance.

they do not study link metrics that can be used to optimize routing in such networks.


It shows that P Ber r decreases as throughput increases, as expected.

because the tone maps are updated based on this metric, some average links might have lower P Ber r than the best links of the testbed.


Along these same lines, we argue that the periodicity present in Figure 3 stems from users sending less business mail on week ends and instead relying on personal accounts provided by major providers.

on weekdays between April 1 and 26, 2015, Gmail encrypted 79.8% of outbound messages, while mail servers encrypted 53.7% of incoming connections.


In terms of sheer volume, during April 2015, Gmail was able to validate 94% of inbound messages using a combination of DKIM (83%) and SPF (92%).

among the Alexa Top Million mail servers, only 47% deploy SPF policies and only 1% provide a DMARC policy, the absence of which leaves recipients unsure whether an unsigned message is invalid or expected.


In our scan, 414,374 Top Million domains (52% of domains with valid SMTP servers, and 64% of domains that support START-TLS) present certificates that validate against the Mozilla NSS root store [38], as detailed in Table 5.

only 0.6% of domains present trusted certificates that match their domain name, while 34.2% present trusted certificates that match their MX server.


We identify most parking domains with more than one of our three methods.

we identify all but 124 of nearly 280,000 domains on our set of parking name servers with another approach.


Defensive registrants purchase domains to defend the string but with no intent to develop content, while speculative registrants purchase domains to resell later with no intent to develop content.

speculative registrants are monetarily motivated on a per-domain margin, while defensive registrants have revenues outside the domain business.


To map Web pages to inputs for a clustering algorithm, we follow a conventional “bag-of-words” approach which extracts HTML features from the Web pages.

we compose a dictionary of all terms that appear in the HTML source code, and for each Web page, we count the number of times that each term appears.


ICANN intends the use of WHOIS for any lawful purpose except to enable marketing or spam, or to enable high volume, automated processes to query a registrar or registry's systems [14].

iCANN encourages its use by consumers, registrars, and law enforcement, and discourages its use by spammers [29].


Thus, we iterated this approach to achieve greater coverage.

we clustered the remaining unlabeled Web pages, manually inspected and labeled homogenous clusters, and performed thresholded nearest neighbor classification now with a larger set of labeled examples.


Our analysis shows that smartphone users select appropriate network interfaces taking into account the deployment of emerging technologies, their bandwidth demand, and their economic constraints.

users show diversity in both how much traffic they send, as well as on what networks they send it.


In our measurements, the median cellular download traffic volume is 36MB/day and the median WiFi download traffic is 51MB/day in 2015 (Â§ 3.2).

58% of smartphone traffic is WiFi; a 1.4:1 ratio of WiFi-to-cellular traffic.


In particular, in WiFi networks at home, this category accounts for a high percentage of traffic volume due to online storage software that uploads/downloads large files only if a WiFi interface is available.

applications seem to play a major role in promoting WiFi offloading.


Our results show slow but clear growth of WiFi traffic offloading during these three years.

the deployment of public WiFi networks provides users both simple network connectivity and also more bandwidth for bandwidth-intensive applications such as video streaming and software updates.


Most commuters in this area use public transportation (e.g., trains, subways, and buses) rather than personal cars.

the probability to encounter public WiFi networks is likely high, and resulting WiFi traffic volume in public spaces is also high.


The success of these WiFi deployment hinges on this key question: how do smartphone users select a network from the alternatives available to them?

wiFi-user ratio differs between the two device OSes rather than cellular carriers.


The percentage of the productivity category increases in upload volume.

in WiFi networks at home, this category accounts for a high percentage of traffic volume due to online storage software that uploads/downloads large files only if a WiFi interface is available.


The application usage and resulting performance in cellular networks also indicate large diversity [47, 16, 28, 51, 44, 27].

the usage pattern of applications in smartphones depends on the mobility and geographical region of users [47, 51, 52].


For iOS devices, the software does not report detailed information about the WiFi interface.

we conclude that iOS devices connect to WiFi 30% more than do Android devices, as shown in Figure 9(c).


Accurate Detection: The main idea underlying our diagnostic application here is as follows: Elements in the virtualization stack deliver packets to each other via intermediate buffers or function calls, and they typically use nonblocking I/O in doing so.

if an element cannot write to its successor, or its target buffer is full, packets get dropped.


Likewise, in Figure 5, the shared datapath of input traffic and output traffic (purple/solid arrows) can be the software resource in contention; similar contention can arise for other software resources such as shared buffers/queues.

the remaining middleboxes in the candidate set are returned (line 18) as the plausible root cause middleboxes.


Whereas traditional dataplanes consisted just of hardware switching elements and network links connecting network end points, the advent of NFV means that we need to rethink what constitutes the data plane.

it now also includes the software components shown above that are traversed within middlebox VMs.


At this point, using PerfSight the operator identifies that the TUN of load balancer 2 is dropping packets and it is in an Overloaded state.

the operator has identified tenant 2 s bottleneck.


An AS will prefer routes through a neighboring customer, then routes through a neighboring peer, and then routes through a provider.


Those that are actually connected experience very poor performance.

de Telecomunicaciones de Cuba, S.A. (ETECSA) to provide direct international long distance telephony between the USA and Cuba [16].


The Internet suffers from well-known performance, reliability, and security problems.

proposed improvements have seen little adoption due to the difficulties of Internet-wide deployment.


In this case, the camera can perfectly capture the displayed image.

if the displayed image is a visual code of any kind, all data from the code can be extracted.


In our demo, we show how our Focus prototype copes with different channel impairments.

we will showcase Focus’s performance on smartphones with different capabilities, ranging from older models with poor cameras to recent smartphones with high-resolution cameras and high-quality lenses.


Although RPL decouples the routing metric from the main standard, the most widely used routing metric is the combination of ETX and hop distance.

this routing metric cannot be used in RPL over BLE since BLE MAC (in Figure 1) does not provide the number of retransmissions for the upper layers.


This is because developers do not need to choose a suitable protocol out of many existing protocols.

in the first experiment, the 94 nodes generate packets and we vary IPI (Inter-Packet Interval).


In a full-duplex wireless network, an access point and sensor nodes transmit information and power signals simultaneously.

this simultaneous transmission leads to a collision problem.


Third, data should be downloaded from the nodes in a fair way.

the amount of data collected from each node should be greater than a certain application-specific threshold.


Based on the two experiments discussed in the previous section, we observe that the WPT efficiency is one of key factors for the scheduling model.

fS-WPT is proposed to prioritise the nodes for scheduling based on a ratio of the link quality and harvested energy.


Although Broadcast Encryption (BE) [3] exhibits excellent distinctions, most BEs are k-resiliency systems, where k + 1 exposed keys can collude to generate shared secrets.

although our storage overhead is linear, it is feasible in practical settings as it is quantified in Fig. 1(c).


There have been many efforts geared towards improving energy efficiency of different components of the system including data sampling, query processing, radio communication and processor duty cycling.

these individual components may not be flexible to adapt to changing network and application dynamics.


After a reboot, anti-replay data stored in RAM get lost.

to prevent replay attacks after reboots, anti-replay data must be stored across reboots.


The uncontrolled movement experiment is carried out in the same environment as the controlled movement experiment.

the transmitter and the 4 receivers are located in different rooms as shown in Figure 10.


The estimation result -the CSI -is used by a receiver to extract the transmitted information.

as the CSI depends on the communication environment and the transmitter hardware, it can be used as well for security purposes.


By different defected ground structures (DGS) like folded slot, dumbbell shapes slot, interdigital slot, meander slot are used for realize dual passband filters [3-6].

these bands utilized for Satellite communication, mobile communication and Aeronautical radio navigation.


Cloud Computing is the latest technology that has come to the center-stage because of its ability to achieve economies of scale, quite like mass-production.

shifting to Cloud comes with certain strings attached, especially security concerns associated with outsourcing critical data and processing to a third party.


And when we use the new approach only 8 users are connected to the MBS.

the new algorithm has reduced the load on MBS which is our main objective.


Also this algorithm is developed for only one macro base station.

its feasibility for more than one macro base station also needs to be checked.


If we can utilize ubiquitous WiFi devices, it will be a major breakthrough in terms of costs, feasibility, universality, etc..

wiFi signals suffer from limited bandwidth and insufficient time resolution, which brings challenges for WiFi based detection [3] [4].


We detail our two human detection schemes in section 4 and 5, respectively.

context-aware technology is of rising demand in our everyday life, which aims to sense the variations of surrounding environment through deployed sensors or related technologies.


Managing remotely deployed sensors has been thoroughly studied in the context of WSNs.

existing WSNs solutions exhibit poor efficiency due to a wide variety of emerging IoT issues such as mobility, heterogeneity, scale, connectivity, security and privacy, energy, and the ease of management.


The structured overlays have been widely used in a variety of distributed systems.

the structures of smallworld networks (originated in [17]) inspired several popular DHT designs, e.g., Chord [28] and Symphony [20].


This work was supported by the Director, Office of Science, Office of Advanced Scientific Computing Research (ASCR), of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231.

tCP interprets packet loss as network congestion, and reduces its sending rate when loss is detected.


From these results we are comfortable making the claim that pacing flows does yield the effects that our daemon looks for when selecting candidates for pacing.

our daemon would not select this same flow for pacing again, given the fact that the retransmissions have fallen to 0.


However, the very mechanisms that make TCP so survivable also make it perform poorly when network conditions are not ideal.


After developing and deploying our traffic shaping tool on the ESnet testbeds, we modified the tool so that it would only run in a monitor only capacity.

it would not be able to actually shape any traffic, only monitor traffic from the user-space.


What is immediately visible, is that the download speeds are very variable.

for the green node (the one with relatively stable RTT times), most measurements lie around the same average throughout the duration of the tests.


Proposals such as nutrition labels [24] could also help empower consumers by making them more aware of the QoS to expect and then use the information to make better choices when buying data plans.

unless TRAI does not mandate some minimum QoS standards to which providers can be held accountable, or the published information is not made available to consumers easily to be able to exercise their choice in selecting providers, even these stronger regulatory measures may arguably not yield much benefits.


In addition, it is not allowed to use RC-QP for all source-destination pairs because RC-QPs consume prohibitive amount of memory with millions of MPI processes.

the MPI library need to select mapping of RC-QPs and DC-QPs according to the current communication pattern.


DC, on the other hand, consumes less memory than RC but its performance drops when sending messages to different destinations or when many DCs sends a message to the same destination DC.

the library should find the best mapping of RCs and DCs to pairs of source peer and destination peer according to the communication pattern of the application.


They conjectured that this was due to network contention, but did not investigate it via lower-level analysis.

the performance predictability of applications over moderate time periods could be predicted given a model of application performance to network contention, or given a sufficient amount of empirical data, could be predicted based on past application performance with the given network environment.


Besides, this area has a complex ocean tidal current due to Kuroshio Current and local currents, which results in the most complicated flow distribution area along China's sea-coast.

zRS Island is a suitable place for tide and current observation.


Usually, expedition ship are armed with various observatory equipment and massive personnel, and can only do the observatory along its route.

along with expedition ship, the moorings system are also developed.


We assume that a beacon AUV is able to obtain its accurate absolute location via satellite.

there is no mean error for localization of beacon AUVs.


According to previous studies [12-14], prolonging of the acoustic transmission range leads to narrower bandwidth, lower communication reliability, worse localization accuracy and more energy consumption.

a multi-hop communication pattern is more practical for MUWNs [15, 16].


Unfortunately, in SpaceHub, we cannot assume that the signal structure is always available (i.e., being wireless technology agnostic).

we cannot acquire channel coefficients through such measurements.


For example, Wi-Fi, ZigBee, Bluetooth, Digital cordless phone, and many other proprietary wireless technologies for surveillance camera or remote controller, all operate on the same 2.4GHz ISM band.

interference among these wireless technologies may result in unreliable communication or low network throughput.


The core idea is that all separated signal copies from one unique source should show a strong correlation, whereas signal streams from different sources are uncorrelated.

spaceHub clusters all the separated signal streams into several groups according to their cross correlation.


It is not straightforward as the signal structure is not available, and therefore we will not be able to identify the destination by decoding the MAC address.

similar to the identification of multipath signals, SpaceHub applies a preprocessing algorithm to cluster signal copies based on cross correlation results.