It is noteworthy that neither the source nor the interferer will be aware of the collision.

no immediate recovery means can be undertaken by either of them.


At this point, there exists a schedule under which the link capacities are just large enough to satisfy the stability constraints.

the optimum p is found by a line search over the solutions to the LP problem (7).


Note that in the (T, k, m)-design, T =1, k =1, m =1 (i.e., all intervals are active) corresponds to a network without power management.

in what follows, we use T =1, T = 7 and T = 73, respectively, to denote an always-on network, a power-managed network with the wakeup schedule (7,3,1), and one with the wakeup schedule (73,9,1).


The relative approximation error for X 2, using the principal components of X 1, is in the range (for the same .ows) of approximately 10%.

the .rst week s principal components appear to remain good choices for forming a low-dimensional representation of the subsequent consecutive week.


In our implementation, we continuously measure the channel loss rate and update the ETT value accordingly.

we automatically account for any changes in the loss rate due to channel utilization.


The fact that Node B s transmission power is a limited resource and must be shared among all MBMS users in a cell indicates the need for power control during an MBMS service.

the analysis of the transmitted power plays a fundamental role in the planning and optimization process of Universal Mobile Telecommunications System (UMTS) radio access networks.


Clearly, each friend has the same chance as the node itself of meeting the node s desired communication partners, provided that the positions of the friends are initially drawn from a uniform distribution or provided that the system reached stationarity.

as con.rmed by simulations, the friend mechanism should reduce the average convergence time according to the number of the friends, meaning that t.,f t./(f +1), where t.,f is the average convergence time with the friends mechanism and f is the number of friends of each node.


We showed that nearly optimal fairness between multiple TCP flows in hybrid wireless/wired networks can be achieved by solely modifying the transport layer.

opposed to [12] and [18], TCP- GAP is easily deployable since it does neither require any modifications of standard TCP in the wired domain nor modifications on the link or network layers.


For this, nodes would need to access the channel in a coordinated manner, such that links become active only following the maximum channel reuse pattern.

in order to derive the performance upper bound, the goal is then to separate all links in multiple schedule sets of links; each set representing the links that can be activated at the same time.


card we have: RateMAX = 54Mbps if Prx93dbm.


In RBAR, the total time spent in transmittingany packet is the same as for single-rate IEEE 802.11.

the gain in throughput can be completely attributed to receiver-based rate adaptation based on channel conditions.


However, Figure 10 indicates that the degradation is not signi.cant.

while the performance improvements are instant for the clients that apply ECN, the degradation of non-ECN-enabled clients is gradual, which is a desirable property that we discuss in more detail below.


VIRTUAL MACHINE INTROSPECTION VMI inspects the VM memory and disk from the outside without intrusively injecting agents.

one of its main bene.ts is to protect the VM monitoring tool from being compromised in the event of a successful security attack.


The random variables Sx = |X2 - X1| and Sy = |Y2 - Y1|are independent and their pdf is given by (2).

the joint pdf of Sx and Sy is 4 fSX SY (sx,sy)= (-sx + a)(-sy + b) 2b2 a l / a Figure 1: Pdf of epoch length on a rectangle for 0 = sx = a and 0 = sy = b.


The capture effect, however, is hard to quantify or measure.

we have focused on longer paths to show the impact of spatial reuse.


MINIMIZATION PROCEDURE  recursive optimization procedure is needed.

we can For both distributed architectures introduced in sub-section 3.3, decompose our optimization problem on a per-component basis:  9).... ..Fmin......... , , ..


Since the capacities of wireless access links are considerably smaller than wireline constituents of a typical connection involving service delivery from the Internet to a wireless node, it is highly desirable to deploy an e.cient radio resource management system in order to ensure high spectrum utilization.

modeling of the major components of a radio resource management system, in particular, a scheduler, becomes important from this perspective.


This results in the same PRT as the case of t t < t z .


Theorem 2: If there is a point v .Al not covered by any sensor node, for every cluster Clust(si) there must exist at least one sensor sj .V whose LVor (sj) is not completely covered by Disk (sj,rs).

proof: According to Lemma 1 (iii) or (12), we have  (LVor (sj) nAl)= Al (13) sj .Clust(si) for any v .


Actually, in the strict sense, channel 26 is not a completely no-interference environment.

the percentile of 0.03 mW is supposed to be even larger than 99 in a perfectly no-interference environment.


Also note that it was infeasible to compute M2 for the real data because they had already been aggregated into .ow records.

we focused on M0 and M1, which can be computed from the aggregated data, and the average (Avg = M1/M0).


Users may exhibit spammer-orbot-like behaviors when they visit questionable Web sites, inadvertentlydownload maliciousprogramsand commanddata, or send certain emails.

when alocal switch uploadslocal traf.c data, it needs to anonymize or aggregate potentially sensitiveinformation.


In this Equation (6), the epsilon, eù[0,1), is the scaling constant that controls how large of an impact that the distance should have on the delivery predictability.

to have higher impact on the delivery predictability, the e constant can be set to be larger.


To remedy the problem, ROB provides a series of predetermined report times so that even if a node missed a certain report time, it can always have another chance to receive next report.

rOB at a source node consists of repetition of two procedures referred to as a broadcasting cycle: 1) preparing and transmitting broadcast packet, and 2) waiting for any response from nodes in N(S).


The ultimate objective of our protocol is to con.gure the network in such a way that all ordinary nodes are connected within one hop to the backbone.

data can be transmitted to the sink with a delay smaller than the duty cycle of an ordinary node.


PROOF.FromAlgorithm3,Sr,s selectonelink r,s=0,1,··· ,c2 whosesenderlocatedwithinagridforeachgrid(ifthereexistsonesenderinthegrid).

accordingtoLemma9,OP T (L2) canselectatmostm linksforeachgrid,thus,  OP T (L2)= m ·Sr,s r,s=0,1,··· ,c2  Bypigeonholeprinciple,ourscheduledobtainedbyAlgorithm3:  1 ALG(L2)= (c2 +1)2 · Sr,s r,s=0,1,··· ,c2 OP T (L2) = m(c2 +1)2 · ALG(L2).


4.1Asmart-but-suboptimalattackstrategy We assumed that ASes make routing decisions based on business relationships and path length, and that a manipulator m cannot lie to his neighbor a about their business relationship (i.e., between m and a).

intuition suggests that the manipulator s best strategy is to widely announce the shortest possible path: Shortest-Path Export-All attack strategy.


Conversely, if some time elapses between a domain s prior deletion and its re-registration, then we term it as a retread .

the drop-catch and retread categories are mutually exclusive, and together comprise all members of the re-registration category.


In other words, what is the application-level cost of the very same network layer vertical handover, which may be very diverse depending on how it will impact on the application and the protocol it uses to manage end-to-end data .ows (UDP, TCP, RTP, HTTP, FTP, etc.).

we shift the focus from the network layer to the transport and above layers.


For this experiment, our ADNS returns a random IP address.

if subsequent DNS requests for the same hostname return the same IP address we know with high likelihood the request was satis.ed by a cache somewhere within the resolving infrastructure, either at the FDNS, HDNSes, or RDNSi .


This lets us run over 802.11n rates as easily and in the same way that we run over 802.11a/g rates.

we report results from both 802.11a/g and 802.11n runs for our algorithm.


On the other hand, node 5 recognizes that the indicator value of node 6 is larger than its own value.

node 5 declines to take over an alternate role.


However, the position information of users has not been considered yet which actually has a great in.uence on the performance of the diamond relay channel.

in this paper, it is the .rst time that we study how to select the position of two relays to guarantee the performance of the throughput and delay constraint.


This problem occurs for each area covered by an RSU.

the amount of data transferred at each area (useful for next areas) is not equal.


This happens because there might be two keywords that start the same.

when the server compares the received keyword, with its set of supported keywords, it will obtain a sequence of true comparisons up to the .rst di.erence, and that sequence of true comparisons is output by our module rently able to describe how the increment was derived from the direction .eld value, which would be needed to observe that a constant of value two was added to the length .eld.


In particular, we measured the hop count length of each path (from a monitor to a target pre.x) every 12 minutes.

we have about 3600 hop count measurements for each path.


EtherTrace relies on the following simple observation to discover layer-2 devices corresponding to each IP path segment: Because the bridges on LAN form a tree, only one layer-2pathbetween anypair ofhosts exists atany time.

the bridges along thepathbetween twohosts on the sameVLAN must always receive framesfrom those twohosts on two separate ports.


While energy consumption is related to the phone s battery life, mobile data cost is often associated with the fees paid, especially for the users who do not hold an unlimited data plan.

reducing energy consumption and data cost will hopefully encourage more people to actively participate in crowdsensing tasks.


Since customer-premise routers (e.g., R' in Figure 3) are not part of the OSPF domain, and all data center routers are not part of EIGRP domain, routes from one protocol are injected into the other for ensuring connectivity.

router R of area A in Figure 3 which is connected to a cus- tomer router .R', injects EIGRP routes into OSPF as ex- ternal LSAs.


Five player game PMF and Q-Q plot (HL2CS) remain at a similar level as the number of players increases beyond those for which we have empirical data.

the technique described is likely to remain valid for larger numbers of players.


forM5 , wehave n5 = |{M2 ,M4 ,M5,M8,M10 }|-|{M2 ,M4 ,M5 }|=2 n5 isthemaximum.So,weaddM5 toF4 ,butwe do notaddM2 toC4 becausen2 is zero.


Emulators can hardly integrate accurate models of all networking components, end host operating systems and applications what leads to unrealistic simulations very often.

some work has been issued for developing real experiment platform and network emulators.


Table 1 illustrates that the autonomous systems at the first level are almost fully connected.

a level-1 AS can usually reach any other level-1 AS in one hop; in rare cases, two hops may be required, because the graph diameter is 2.


Location information in a lattice is updated only when the node leaves the nine-square boundary, at which time the distance traversed by the node (possibly over multiple steps) already exceeds the diameter of one square.

we prove that the amortized cost of information updating due to a cumulative movement of distance d is O(d log d).


In addition, although the geometry-based coverage strategy is based on spacial coverage, the key point of our idea is to maximize the contact time between an RSU and vehicles which are similar to a-coverage.

we think that the comparison with a-coverage is better to justify the e.ectiveness of geometry-based coverage strategy.


In the third step, we use the fact that the symbolic and the computational RCF-execution of A have essentially the same de.nition, except that one performs symbolic and the other computational operations.

if we express these executions by a labeled transition system that treats operations on messages as atomic steps, weget the same transition system for both executions, only with a di.erent interpretation of these atomic steps.


Thus, the throughput S can be written as: (1 - p)L 1 Ld S = P {Tn}· ·· , (11) (1 - p)L + pC L s where Ld is the DATA packet length and the term Ld/s converts the expression for the throughput from packets per slot to bps.

the only unknown parameter that still remains to be derived so that the throughput is calculated is the conditional collision probability p. Thisisthe only parameter that depends on the speci.c scenario.


This aggregated data will be transmitted using one GTS slot.

this process can not only reduce the number of GTS slot, but also minimize data latency.


A further problem occurs when a MN visits a cell for the first time, as no profile will exist for the MN.

the BS will be unable to predict the MN s hand-over cell.


We have shown that even a legitimate .ow experiences the retransmission ratio of 93% in poor cellular network environments.

naively setting a threshold could result in penalizing innocent users or tunneling attacks, depending on the value of the threshold.


We assume that the security software and hardware operates as expected.

implementations of security protocols, such as key-establishment, properly execute the complete protocol and do not leave out any steps hereof.


Such networks are characterized with intermittent connectivity, long or variable network delay, asymmetric data rates, and high error rates.

connecting them to the Internet requires the intervention of a service that can translate between incompatible networks characteristics and which can provide a buffer for mismatched network delays.


Moreover, there are AS boundaries with the delay more than 200ms, which is likely to be remote inter-AS links.

it is necessary to exclude these links by a delay threshold.


In reality, cache proxy serves for several servers, and there is a case that any server su.ers from .ash crowds while the others do not.

each member CP has the functionality of mixed-mode operations for the normal C/S mode and the anti-.ash-crowds P2P mode.


From the above arguments, at any given time, only one node communicates with each base station.

there is no additional constraint on the capacity if the capacity of each wired link is at least the rate R at which each node sends data to the destination when given the token by the TDMA scheme.


When the timeout of Address_Request message to the Gateway has occurred, the initiator may send an Address_Request message to other proxy nodes in a partition.

without the Internet Gateway, new nodes can receive a global address from any proxy nodes.


Due to simulation constraints, the con.guration thatis modeled uses8port routers with the8thport used Figure3: Virtualrouter topologyfor cube collective for global connectivity, as shown in Figure 3.

with a 4x4x4 meshthere are64globallinks(onefrom each router) toform65 cubes of 64 nodes each.


Whileits averagefalsepositiveratedecreases with the increasing number of failure samples, its standard deviation remains high.

even with a su.ciently large number of failure samples, the k-means algorithm cannot guarantee correct identi.cation of all FGs in the balanced topology.


Furthermore, if attacking nodes can attract four times as many .ows, the goodput nearly collapses to 8.5% under 10% of attackers.

in addition to quantifying the impact of rushing attacks, this result illustrates the critical importance of preventing rushing attacks.


The network will be the key enabling or blocking factor to disaggregation.

in this paper, we explore questions such as: what will the bandwidth and latency demands due to disaggregation look like?


Similarly, for the following timestep, since L3 > L2 and consequently L3 · k/(N-1) > L1, P3 will be probed next.

once P3 is probed, P2 and P3 will be alternately probed in the following time steps, and P1 will never be probed.


In the FCR algorithm, the contention window size of a station will increase not only when it experiences a collision but also when it is in the deferring mode and senses the start of a new busy period.

all stations which have packets to transmit (including those which are deferred due to backoff) will change their contention window sizes at each contention period in the FCR algorithm.


State-of-the-art radio chips, such as the CC2420, can be con.gured to discard all the received packets that are not addressed to a node.

the overhead associated with overhearing amounts to packet reception and the processing required to deliver a packet from MAC to the link estimator.


Experimental Methodology: Software radios incur arti.cial delays in obtaining samples from the RF front-end to the host program.

detecting a collision and transmitting back the noti.cation will naturally include these delays, conducting a real time evaluation of CSMA/CN is dif.cult.


The notion of re-invoking a matching algorithm every time a transient resource is introduced contradicts the stability of network operation.

we depend on a tunable duration time to utilize as many, not all, transient resources.


The MAC layer usually retries a transmission for a limited number of times (e.g., default retry time in the IEEE 802.11 DCF is 7) before dropping a packet.

a queue may not have yet build up at the early stage of congestion.


6Technically, the notion of a partition is essential only for corrupt players; a honest player will anyway not "lie", leave alone "lie dif- ferently".

without any loss in correctness, we can have the adversary to choose a partition for all the players (rather than just the corrupted players).


Updating CAP[i] for each Vi takes O(1)time(line16), whileupdating each unassigned[i]take O(N) time as it requires removal of O(N) nodes(lines1921).

the entire for-loop completes in O(N2) time as there are O(N) nodes Vi .


From the protocol model in Section 2, each transmission covers an area of T(R2(n)).

the average number of simultaneous transmissions supported in the whole network is upper bounded by Ataa , while the average number of T(R2(n)) transmissions of one multicast session is lower bounded by Am .


Notice that this increase of node v s transmission energy has to be su.cient for it to reach all the nodes that were previously covered by the nodes that were excluded.

the feasibility of a solution is preserved.


Sources were placed at the left side of the field and the sink at the right side so that when the network size is increased, path numbers between sources and sink are also increased (due to the number of nodes).

the impact of network size on PEQ s performance can be more noticeable than randomly selecting the sources and the sink.


The intense exploration partially achieves the best local optimal solution in the whole of problem space, and the diverse exploration underestimates or overestimates optimal solutions conjectured from the current solution.

if a part of the near optimal solution is replaced with another one through the reinforced exploration, the near optimal solution can be improved.


Table 2: Data Distribution EvaluationParameters For eachof the performance metrics, system Con.gurationB(Single SFC) performs better than Con.guration A (Multiple SFCs), because the spatial data is better distributed over the network in the case of system Con.guration A.

the query has to be evaluated at a larger number of peers compared to the system Con.guration B.


In addition, the most popular items on the network are likely to be poisoned.

poisoning could account for a vast majority of the traf.c observed using passive measurements, ultimately making the distinction between poisoning effects and usual network behavior dif.cult.


The PathSelection tries its best to .nd k + 1 parallel paths.

if one path is found not available, the source uses the Breadth First Search (BFS) algorithm to .nd another parallel path.


For n » 1, this distribution can be approximated by a Normal distribution of zero mean and variance n: N(0,n).

18 1 - x2 BER(Eb, J, n)= v e dx n2pn 2n J Eb J 18 1 - x2 = v e dx (1) J Ebn 2p 2 J Eq.


Due to the relatively low server-side bitrate (optimized to ensure that there is never too much buffered video) 9 YouTube clients were not suf.cient to saturate the (high bitrate) wireless channel.

we used 18 Mbps .xed bitrates, very much re.ective of residential/public environments.


The resulting tra.c sent to the network of the MNO in a regular way (i.e., the nono.oaded tra.c) from a single source is then modeled as the product of the two above processes.

the aggregation of several such resulting processes models the tra.c still needing to be handled by the operator in the conventional way, which is the one to be used for the purposes of network dimensioning.


Such decomposition allows the delay to be localized with even .ner granularity within a router if queuing occurs and may facilitate performance debugging within a router.

we focus on a single measurement segment between a sender A and a receiver B.


the test C2 T3 JR MTU512B refers to the test where there were two sources contributing to the background traffic load, .


Y-switches consist of simple core logic, host interface, such as a PCI express bus, and interface controllers.

we expect the price of a Y-switch to be comparable to a NIC.


Moreover, let p0 = Iv(1 - pv) be the probability that the channel is idle at a given time step.

since the covered nodes together have an access probability of at least (1 - 1/(m + 1)) p at any time (Corollary 3.6) and the least recently successful but not yet covered node, v, has an access probability of at most p , it holds that p0 · m P[node in C successful]= L pu I (1 - pw) =· p m +1 u.Cw=v and p0 P[node v successful]= pv I (1 - pw) =· p 1 - p w=v (1 - p )m P[node in C successful] =· P[node v successful] m +1 which implies that the probability that k consecutive successful transmissions are due to v is at most (1/(1 + c))k with c = (1 - p )m/(m + 1).


(15) The evolution of Rout(t)is shown in Figure 4.

it can be concluded that fis the time constant of the .rst-order input response of the system.


Second, as analyzed in Section 4.3.2, with the same routing protocol, GKE will introduce smaller routing communication overhead than PIKE.

neglecting the communication overhead of routing for both GKE and PIKE does not favour our scheme GKE in any aspect, when compared to PIKE.


This metric tells something about the general forwarding capability of the network but it doesn t ensure that the demanded bandwidth can be guaranteed at all times.

we will use a di.erent metric which is able to take dynamically changing tra.c demands into account, referred to as the goodput gain factor (GPGF).


Asthe averagepathlengthis small,literature algorithms, such as RPE algorithm, can become scalable as the network size increases.

no matter how many nodes the network has, the errorintheposition estimationwill notbe spreadby many nodes, because of the small values of path length among all nodes.


A source S simply broadcasts in the network its encrypted packets, which can only be decrypted by D. Unfortunately, this na¨ive solution is too costly.

the challenge is to develop e.cient mechanisms protecting the privacy of the nodes against such powerful attackers as much as possible.


The tuplespace uses lease-based storage management for factoids.

once a device fails, the stale factoids will be garbage collected automatically.


This is in contrast to typical cognitive radio assumptions, where PNs are assumed to be TV stations or microphones.

cMNs have no need to immediately vacate the spectrum once PNs are detected.


Throughout, we consider that victims will diagnose and react to DoS attacks.

we quantify the relationship between the timescale of diagnosis and reaction to the attacker as compared to the route lifetime.


It is straightforward to show that .ui/..i = 0 and .2 ui/..i 2 = 0, which con.rms that, given .xed pi, ui is a monotonically increasing concave upward function of .i.Likewise, given .xed .i, ui is a monotonically decreasing concave downward function of pi since .ui/.pi = 0 and .2 ui/.p2 i = 0.


Although the weight attribute has the highest priority, it is not de.ned as the standard [12] and cannot be distributed outside Cisco routers.

the BGP-controller utilizes the local prefattribute for controlling the best path selection.


Second, no QoS metric condition has been violated.

there must be a path from s to each destination under the QoS constraints, which means that a solution exists.


Since VCI does not consider a network scenario with potential hidden nodes, N tacitly means the total number of nodes within the same contention domain.

vCI also cannot avoid interference from hidden nodes as in DID-MMAC.


5.3 Performance Metrics for Channel Sur.ng In this study, we used the following performance metrics to evaluate the e.ectiveness of channel sur.ng strategies: Network Recovery: The main ob jective of channel surfing is to ensure network availability in the presence of jamming.

we .rst measure whether the channel sur.ng strategies can restore network performance (number of packets delivered to the sink) from jamming.


As resilience of data is as well important for the premium service and the nodes are exposed to a threat of being compromised, the sensor data is at .rst aggregated by the RAN-BAR algorithm.

cDA is only used in a network with several clusters and at least two aggregation levels.


Our key insight is that it is possible to determine whether MIM is helpful by observing the interference patterns on the received A-MPDU frames as illustrated previously in Figure 1.

we can simply count and compare the number of occurrences where MIM was helpful (see Figure 1(a)) versus where MIM was detrimental (see Figure 1(b)) to decide whether and when to enable or disable MIM.


For example, in our data set, most ZigBee links have a SNR higher than 10dB.

this additional noise has little impact on the following decoding process.


On the other hand, the spatial coherence should not detect any anomalies.

the final reputation will fall only if both spatial and temporal algorithms detect anomalies.


When nodes can adjust their transmission power individually, the minimum hop route is not essentially the most power e.cient route.

we need to modify the route selection function for the case where nodes can control their transmission power.


3.2 Problem Statement Suppose the MPR set of a particular node k at time t instance t is denoted by, Mt = {1,2,...,m}, where kk t |Mt | = mk.

our goal is to identify Bt .Mt where kkk Bt denotes the MPR set that is geographically behind k node k at time t.  3.3 Description Assume Ft denotes the MPR set that is geograph k ically ahead of node k, and Ut speci.es the MPR set k that could not be identi.ed as either behind or ahead of node k at time t. we have Bk .Ft .Ut = Mt ttk k Bk nFt = Ø, Bk nUt = Ø, and Fk nUt = Ø. tttt tt Let us inspect if the node, i .Mt is behind node k. k Suppose the neighbor set of k at time t is denoted by, t ttt Nt = {1,2,...,n}, where |Nt| = n, and m= nk.


However, when cryptographic functionality is turned o., the throughput reduction is only 13%.

we can conclude that the LQSR overhead is largely due to cryptography, which implies that the CPU is the bottleneck.


Delay-Tolerant Networking in Restricted Networks Johannes Morgenroth, Tobias Pögel, Robert Heitz and Lars Wolf Institute of Operating Systems and Computer Networks Technische Universität Braunschweig Braunschweig, Germany [morgenroth, poegel, heitz, wolf]@ibr.cs.tu-bs.de ABSTRACT For security reasons, many companies usually allow only strictly regulated communication, speci.c system con.gurations and predetermined software components.

often only communication over the HTTP protocol is possible, which operates by using a request-response approach.


The other products of the enzymatic reaction, denoted here as subproducts, remain in the intracellular environment and do not take part in the di.usion-based molecular communication.

the input of the signaling molecule production is the concentration of enzymes [E], while the output is the concentration of produced signaling molecules at the transmitter, denoted by [S]Tx.


In the worst case, the default rule is dependent on all the rules, which amounts to the size of the whole set.

caching all dependent rules of a matched rule can easily over.ow the switch .ow table and is considered infeasible.


The hardware-only path took 187 µsec, and the hardware+software path 344 µsec.

packets forwarded by the Shunt incur an additional 5 6 µsec of latency,2 which is essentially negligible.


Unfortunately, no results are provided at the end of the study.

we cannot compare our findings with this work.


the computed centroid is di.erent from position p .Therefore, the actor will need to move to the computed centroid, which contradicts the assumption.

the actor cannot stop at a position that is not the centroid.


In particular, the traffic from the connected schools in the MAN should be forwarded to the Greek School Network, the traffic from universities on Greek Research and Technology Network GovernmentHealthEducation - Research 1 73,37 Universities Research Institutes 6 117,39 Elementary Schools 76 102,72 High Schools 44 108,58 Public occupational centres 2 5,57 Hospitals 4 622,16 Region 1 158,48 Prefecture 1 70,43 Municipalities 2 76,30 Libraries 1 3,22 Sum 140 2218,63 etc.

the designing approach is to configure the equipment in such a way that will provide Transparent LAN services [11], connecting the building to their service provider transparently and friendly.


By using SWIG, an interface compiler which allows an easy integration of C/C++ into scripting languages, GNU Radio provides a simple interface to the signal processing blocks from Python.

the power of scripting languages is used to simply connect the signal processing blocks which can run at native speed without any interpretation.


However, often, it is not possible since the targeted network is already in production, and setting up a real testbed for a WAN environment is difficult due to high costs and long distances.

alternative solutions must be considered, such as network simulation [9], WAN emulation software, and emulating network characteristics using tun/tap devices (virtual network kernel devices supported entirely in software).


Let vi,i =1,K be a revenue produced by each connection of class i tra.c.

the real revenue generated by class i tra.c (accepted connections) is vi.i(1-B(ni,.i)).


Aside from the parallelization task, the sequencing task is needed to be applied on sets SNGi and SNGj to guarantee that the efficient schedule U(SNGi.SNGj) can maintain the sequential relations existed in SNGi and SNGj.


We strongly suspect that some sort of (potentially manual) vetting procedure takes place.

only a minority of uploads are actually accepted for publication on YouPorn: only 18% of videos are active in the identi.er range we studied.


Obviously, a random permutation of node IDs will help generate a random clusterhead set.

we use random permutation of node IDs to represent a chromosome.


Signaling traf.c can be delivered over these bands together with data traf.c, but that typically requires broadcasting signaling traf.c on all the available bands in worst case.

instead, we assume another band for signaling traf.c, like ISM band.


We leverage the fact that the WiFi channel response remains invariant over the course of a single packet.

if (a) Original (b) Precoded Figure 3: WiFi packet structure for both original and precoded versions.


Notice that Theorem 1 also implies that forwarding packets satis.es IR with high probability for .> 0 and suf.ciently large N. Similarly, by induction, every intermediate node will forward the data with QoS .r.

forwarding truthfully without hidden action is a subgame perfect equilibrium for all intermediate nodes.


We assume that the frame overhead is speci.ed in terms of the number of slots that are needed to initialize a frame and we denote this quantity by t .

a frame size f actually uses up f + t slots.


Similarly, when 0 <.A < 1, the interdeparture time of ACKs A1 and A3 atqueue QA is no more than that when .A = 1.


Due to locality, an LT router s pathlets do not depend on pathlets constructed elsewhere.

it has the same number of pathlets originating from its vnodes, and hence the same small routing tables regardless of what other routers do.


In our proposal, we propose none centralized; different roots for different pairs of source and destination, and each node will play an equal and important role in network.

we can say that our proposal is better than the existing proposal.


After the evaluation, we can determine the system s reaction to all input parameters and all possible interactions between the input factors.

we know the e.ects of A, B, C, A:B, A:C, B:C, and A:B:C on the system s output.


After being noti.ed by the BS, the MS uses the current antenna subset to transmit pilot signals in the .rst available pilot symbol, and then sequentially uses disjoint antenna subsets to transmit subsequent pilot signals.

the BS can estimate the channel response associated with each di.erent antenna subset used by the MS in the uplink, and determine the optimal transmit antenna subset that the MS should use.


We assume that our sensors already know their positions (the coordinates might be virtual).Note that our algorithms do not try to precisely locate birds but give an estimation on the birds populating an area.

geometric information is only needed to found this estimation using a basic sound triangulation scheme.


In the case of cyber security, the experimentation subjects are, among other things, malware samples, exploit programs, software having known vulnerabilities, etc.

to conduct experiments in cyber security, a controlled environment is required: (req.


For example, suppose a group of commuters using these two cellular carriers periodically travel between these two cities, then users of Carrier 2 may share their services with users of Carrier 1 in City 1, while utilize the service from Carrier 1 in City 2.

with data of.oading, all users can bene.t in the long run.


This leads to congestion and high packet loss due to interference, particularly on the 2.4 GHz band used by the more popular IEEE 802.11b/g technology and other technologies and devices such as Bluetooth radios and cordless phones.

no quality of service can be guaranteed in practice.


(2) The increase in plots for a certain picture category sharply varies especially when anomalous tra.c appears.

the suitable time interval for a single picture category .uctuates over time.


Regardless of the protocol details, we believe that any technique to harness partial packets should adhere to the following guidelines on how to handle each type of packets: Correct Packets: Figures 3 and 8 show that even channels opti mized for correct-byte throughput still see more than 30% fully correct packets.

we would like a technique that does not introduce any extra overhead to correct packets.


Wi-Fi has three different coding rates (1/2, 2/3, 3/4), where the rate is de.ned as the ratio of data bits to actual encoded bits that are sent.

the lower the coding rate, the higher the redundancy.


Sibling ASes: ASes from sibling organizations may share their address space and may also have cooperative routing arrangements.

next-hop anomalies wherein the two Data-plane path Control-plane Part of AS O uses Adjacency addresses from AS N s address space 2 Figure 15: AS O uses part of its provider N2 s address space and this leads to erroneous AS-level paths.


The robustness of VIRTIO-based con.gurations is instead accidental, and derives from the inability of the VIRTIO QEMU frontend (which in the non-VHOST case runs in the userspace emulator) to deliver more than 700Kpps (in our experiment) to the VM.

in this con.guration we do not see livelock only because the guest is never running out of CPU.


|D| 2 (2) xx.D This function penalizes the di.erence between each input data vector bx and its reconstruction bz.(bx).

the optimal neural weights may be computed using standard optimization algorithms such as the limited memory Broyden Fletcher Goldfarb Shanno (L-BFGS) algorithm.


This works well with ß = 0, since the beginning of the interencounter time distribution for the used mobility model follows a power-law.

the time elapsed from the last encounter with another node can be used to predict the time left until the next encounter.


In practice, tra.c .ow is determined by the local routing policies used by each AS, which are arbitrary and not publicly known.

we use a standard model of routing policies (Appendix A) based on business relationship and path length [14, 6].


Frame F2 is a B-frame and there are no other frames intercoded with respect to it.


Since in this scenario the interfering nodes transmit independently, their control packets arrive on the control channel independently.

we assume that the aggregate process formed by the control packet arrivals of the N interfering nodes is Poisson.


The combination of ultra-wide spectrum and very low power allows UWB transmissions to achieve very high data rates over short distances in indoor wireless environments while keeping the level of interference very low.

uWB holds great promise for high rate WPAN such as 802.15.3 [4].


For example, the IBM Rack-Switch G8264 only recently added MPLS support [4] and only supports 1000 MPLS push and 1000 MPLS pop rules, which we believe represents the capabilities of the underlying Broadcom Trident [10] switching ASIC as well as similar ASICs from other ven dors.

using MPLS to manage the core of a large network requires buying high-end switches, waiting for future switches with large MPLS tables, or both.


Each vehicle ends its CFP either because the expiration of its NAV or upon the reception of a C Fend frame.

c Fend frame is transmitted with same power as the beacon.


Since the mean of ud(t)in a sampling interval is zero, it doesn t a.ect the output of the plant.

the AP and PD controllers are essentially identical, as seen in Fig.


Morespeci.cally,we haveshownthat theoutliersinthe outdegree distribution of email networks to a large extent represent the spamming nodes in the network.

thesocial network properties of email networks can potentiallybe used to detect malicious hosts on the network.


It has a limit when n goes to in.nity: 1un 1 lim f(n)= lim 1- = n.8 n.8n e and it is easy to verify that for any practical n, say, n = 106 , f(n)= 1 e .

we can obtain E(p(k+ 1)) 1um = E(|O(F reeI n(k+ 1))|)= n1- n 1un n p(k) = n1- = = n ee Case 2: m < n and p(k)= m. For m = 1, it is trivial that the algorithm converges after one more iteration.


M, the condition in Corollary 12 (b) is violated for k = min(dmin + 1, d(G * )) (which requires min(dmin + 1, d(G* )) = s - 1).


the TCP/IP address of the previous DTN router) in their forwarding tables to be the next hop for any data addressed to the user.

data to be transferred to the user follows the reverse of the default path taken by the REGISTER message, while data to be transferred to the Internet from the user follows the default path.


Application to Multi-rate WLAN: As mentioned before, WLAN products based on IEEE  802.11 speci.cation commonly support multiple data rates in order to provide not only stable communication performance but also extended wireless coverage.

our previous scheme should be extended to be useful in multi-rate WLAN environment.


The varying RF power a.ects the amount current that is provided to the transistor and leads to unstable edges of the generated OOK signal.

decoding becomes challenging when the data rate is high.


Di.erentiating with respect to t and setting t = 0, we obtain p1' (t)+ µp1(t)= .ep0(t) (10) where p1(·) and p0(·) represent the state probabilities for state 1 and state 0, respectively.

since p0(t)=1 - p1(t), we have .e -(.e+µ)t-(.e+µ)t p1(t)= [1 - e ]+ p1(0)e (11) .e + µ we have .e p1 = lim p1(t) = (12) t.8 .e + µ µ p0 = lim p0(t) = (13) t.8 .e + µ Also using the Kolmogoro.


Third, since multiple nodes are involved in the congestion, they should coordinate their packet drops, rather than act independently.

an appropriate RED scheme for ad hoc wireless networks should consider an aggregate of multiple queues in the bottleneck.


In fact, in some cases bandwidth-constrained placement may be a continuous process as copies of objects axe pushed to caches at some low background bandwidth, new objects axe created, and existing objects axe updated.

it is important for a bandwidth-constrained placement algorithm to work well in a dynamically changing environment and provide good performance at intermediate points in its execution.


Since multiple REFER are typically used within the context of an application, the user generating it has generally an application-specific means to discover the result of the transactions initiated by the enabler.

multiple-REFER is normally combined with an extension that eliminates the implicit subscription that is usually linked to REFER.


Moreover, the traf.c of an individual user may self-interfere if traf.c assignment may change link latency.

a comprehensive evaluation on the global effects of smart routing should address the following issues: (i) how well the smart routing algorithms perform when traf.c assignment can affect link latency; (ii) how well different smart routing users co-exist; and (iii) how well smart routing users co-exist with single-homed users whose routing is controlled by the network.


Furthermore, they are unattended nodes as it is almost impossible to recharge them in a hostile or relatively large area.

if a sensor node dissipates all the energy in its battery, it will stop functioning (die) and the whole network may cease to work for the loss of coverage or connectivity even when most of the nodes still have su.cient energy.


As opposed to the RBS protocol, the time stamp of the sender must be embedded in the currently transmitted message.

the time-stamping on the sender side must be performed before the bytes containing the time stamp are transmitted.


We believe that in deciding how best to solve the problem of orphan DNS servers, it is necessary to determine if they have legitimate uses.

we take a di.erent approach, starting with TLD zone .les instead of just with malicious domains, in order to .nd the general prevalence of orphans.


The listing below shows the output of SymNet (the client uses the IP 141.85.37.151 and DST ad pendencies.

our approach can be naturally extended from Click to any network speci.cation language.


Zhang and Zhang [2] observed that the work by Khandani, et al does not consider the contention that is common in a multi-hop wireless ad-hoc network.

they proposed an enhancement work to accommodate multiple flows that will contend with each other.


The reason is that as the number of redundant nodes increases, 400 minimax moving distance (d) m there will be more nodes nearby to choose from for each grid point in the greedy algorithm.

the re sults obtained by the greedy algorithm will be close to the optimal approach.


Then we can show by induction that N t (t)(t) P{TF >t}= q= xx0Q1, (25) 1j j=1 where q1(tj ) is the .rst row and jth column element of the following matrix Q(t): Q(t) = Pk1 Pk2 ···Pkt ,t =1.

(26) if we can prove that for any given trajectory Bof node B, there exists constant c 0 (independently of B) such that xx0Q(t)1 =ce -.t for all su.ciently large t, then from (23) and (25), we are done.


Un.nished jobs are discarded at the end of an interval.

a delay bound of t time slots is imposed on all jobs.


Besides, sensor networks need to maintain sufficient coverage quality to capture the timely changing targets.

saving energy consumption and maintaining the coverage quality are two important aspects in design and deployment of wireless sensor networks [2].


The dynamic ranges (i.e., measured difference between max and min) for car density, CO2 level and sound level are 12, 11 100 and 70, respectively.


Being a candidate for the 4G network, WiMAX wants to dominate both data communication and telecommunication networks.

smoothly handover between heterogeneous networks is a very important problem.


As more re.ections are closely spaced within a sampling period, the problem of uniquely reconstituting them becomes more dif.cult.

reconstruction error increases since the optimization algorithm struggles to .nd a good .t.


The paper .lls the gap between the proof that O (equivalent to ¬O1) is the weakestfailuredetectorto solve consensus[6] and theproof that anti-O(equivalentto ¬On-1)is the weakest failure detectorto solve(n -1)-set agreement.

this paper closesthelong-standingquestfor .nding theweakestfailure detector for general k-set agreement[6,22,9,13,24].


The baseband/MAC processor uses the reference clock to control access to the wireless network by regulating timing, encryption, encoding/decoding, and data transmission.

slowing or increasing the clock rate affects 802.11 timing parameters.


Anothersourceforoverestimationinourmodelisthefuid approximation.Infact,thetransmissionrateofTCPdoes notincreasecontinuouslybutratherjumpswhenthenumber INRIA - Paris b.RTT RTT  1415161718 1920212223 Figure12:Fluidmodelvs.packetmodel Day time (hours) INRIA - Australia Figure10:MANconnection INRIA - Australia  Time (hours) Figure13:WANconnection Day time (hours) areclosetotherealthroughputontheLANandMANcon Figure11:WANconnection nectionandnotontheWANone.Ingeneral,themodel in[27]isclosetotherealthroughputintwocases:when ofpacketsinjectedintothenetworkincreasesbyone.Howthelinearrateincreaseassumptioniscorrectandlossesare ever,thewindowatthesourcecanbeassumedtochange quitedeterministic (MANconnection)orwhenthelinear continuouslyasafunctionoftime.Weusethepacketlevel rateincreaseassumptionisnotvalidandinter-losstimes varyconsiderably(LANconnection).Thecorrectnessofthe modelinthelattercaseisduetoerrorcancellationbetween modelin[27]tocorrectthisproblemofdiscreteness.Fig ure12showshowthenumberofpacketsinthenetwork changesasafunctionoftimebetweentwocongestionevents.

thedashedthicklinerepresentsourfuidmodelandthe continuousthicklinerepresentsthediscreteTCPbehavior describedin[27].AssumethatX(t)ismeasuredinpackets perunitoftime.Agoodapproximationistoshiftdown ourprocessX(t)by1/(2RTT)thentosubtractfromthe throughputthedeteriorationcausedbythelastRTTbefore theresumptionofthetransmission(Figure12).Ithasbeen assumedin[27]thatthenumberofpacketstransmitteddur-ingthelastRTTisequaltohalfthewindowsize.half E[Xn* ].RTTmustbesubtractedfromtheaverageintegral ofthetransmissionratebetweentwolosseventsinorder toaccountforthislastRTTbeforetheresumptionofthe transmission.Wegetthefollowingthroughput 1E[Xn* ].RTT Xd =X;;2RTT2E[Sn] () b1 =X;+ RTT 22(1;v) Usingthiscorrection,wecompareinFigures9,10,and11 ourmodelwithdeterministicinter-losstimes(11)withthe packetlevelmodelin[27].Theresultsofthesetwomodels practicallycoincideforallthreeconnections.Theseresults themodelforTCPandthemodelforlosses.


Later versions of OpenFlow take into account even more fields, but we consider that bridging the large gap between the classical 5-tuple fields and the 12-tuple fields used in version v1.0.0 is the most important aspect of the research that needs to be done.

the algorithms proposed in the literature should be revisited to evaluate and improve their performance in this context.


If acommunication node fails at RA, it cannot establish a Radio Resource Control (RRC) connection for its data transmission and reception.

failure at RA maycause urgent data to be delayed (in the blocked-customer-delayed (BCD) queue cases) or cause measurement reports to fail (in the blockedcustomer-cleared (BCC) queue cases).


While reputation is the opinion of an entity about another, trust is the expectation of an entity about the actions of the  Figure 2: Untrustworthness region for convex void other.

the expectation value will be the measure of trust.


For example, the sensing data from a vehicle may need to be sent to a sink that is deployed miles away, or a vehicle may want to send queries to a remote site such as gas station, restaurant, or parking area.

a multi-hop routing algorithm is needed in a large vehicular network for these applications.


(3)) is only a function of the mean sojourn time, and is independent of the sojourn time distribution.

even in the case where the vehicle speeds are changing during the sojourn (for example speeding up or slowing down), as long as we know the mean sojourn time of the vehicles, we can use Eqns.


At the same time, more CH nodes are required to transmit the data over a large distance to the BS.

in order to minimize the energy consumption the clustering mechanism must be able to find the optimal number of clusters all the time.


In summary, these two approaches are inherently limited: [11] haspoor delaybounds and[1] considersa limited model.

these approaches cannot be directly extended to the problem we are considering.


The larger the portion of the enhancement layer used for downtranscaling, the higher the quality of the resulting scalable video.

and since partial decoding of the enhancement-layer represents some form of computational scalability, an FGS transcalar has the option of trading-off quality versus computational complexity when needed.


The use of static components in the path means that if the adversary observes two di.erent connections using the same static hops, they are more likely to belong to the same user.

instead of looking only at his knowledge of a given connection, we must examine the adversary s overall view of which connections occurred.


This further increases the number of don t-care nodes that are covered with multiple routing regions.

the .exibility of balanced routing is higher while simultaneously the routing table size is reduced because of the more .exible areas where it can be placed.


Using (13), the interference range is 27.83, which is smaller than the distance 29.90 between nodes 13 and 11.

node 11 is not in the interference range of node 13.


As discussed earlier, the code it ran scanned a very small subset of the IP address space, and did not manage to produce even one infection during scanning.

there are signi.cant factors that may lead to the continued use by worms of simple PRNGs such as LC, which, along with the availability of disassembled code, will facilitate the development of structural models of worm behavior to use in conjunction with telescope observations for detailed reconstructions.


However, nodes must keep choosing as successors to destinations those neighbors that o.er labels that are always smaller than the smallest labels they have attained.

even if there are physical paths from node A to destination D, it is possible for node A to be unable to pick any neighbor as successor to D if F LA is not larger D than any label reported by a neighbor of node A.


The path duration PDF for the RW, FW, MH and RPGM models seems to be exponentially distributed when Vmax = 10 m/sec and h = 2.

figures 8, 10 and 9 show the path duration PDFs for the RW, FW and RPGM (with 4 groups) from our simulations, we observe that if Probability 0.3 0.2 0.1 Vmax = 10 m/sec and h = 2, then the path duration for the RW, MH, FW and RPGM can be approximated as an exponential distribution.


Their solution does not make use of the geometric structure of ad hoc mobile networks, nor address their high dynamism.

their solution is not easily adaptable to dynamic mobile settings.


on T is ßN(T)= 1 d((latj ,lonj ),prevloc(Tj )) |T|·.N (T) Tj .GN (T) where prevloc(Tj ) is the location of the last task completed by phone AN(Tj ), prior to its starting task Tj.

the numerator is the total distance moved to ful.l each accepted task, and the denominator is the cardinality of the set of all accepted tasks.


It is expected that when the pattern is present in the arriving signal, their crosscorrelation would yield a high correlation value.

by tracking the correlation value for such a spike, a station can verify the presence or absence of a pattern in the received signal.


The event handler then keeps on polling the completion queue until there are no more completion descriptors.

in this design even though back-to-back RNDZ START messages might arrive, only one interrupt is generated.


The reason is that after the departure of a long space-time batch, the queue suddenly becomes empty or with few packets inside.

resulting in a short next space-time batch.


Unfortunately, the widely applied BGP policy quali.es for this property.

perhaps the most compelling question raised in this paper is what can we do if stretch doesn t help?


That is, T (n)= nT (1), where n is the node level.

the expected round-trip time of a data packet depends on a number of hop counts from users to the server and the miss probability of each node.


Cellular-side data is coarse-grained at the resolution of sectors.

there are clear analogies between inferring a trajectory based on such low-resolution observations and identifying the most relevant road segment based on inaccurate GPS positioning data, although errors in distance can be quite different.


From this we conclude that whenever pb= 1/n, the .ood log n-log |I0 | ing time is, w.h.p., at least , that is at least log(1+e pn) O( log n p = c log n pn) ).

independently from p, if 1 « b log( bnn with c< 1, then, a.s., logn logn « Ts = O+ .


However, a person s stride is usually multi-modal: The stride length varies depending on how fast he/she is walking.

in this section we study the impact of errors in the stride-length measurement on the localization accuracy.


In this approach, whenever a channel is idle, it will be reused by the reader to communicate with the currently unidentified tags.

the channels can be utilized more efficiently.


However, they are inherently more rigid because they rely on innetwork components.

it is not clear whether they can be made .exible enough to support diverse application requirements.


Assumption 5 implies that nodes transmitting a copy of I during the dissemination phase retain I in their bu.ers.

the terminal nodes of any edge eover which I is transferred (i.e., with ze = 1) posses a copy of I.


Note that the realm-routing protocol may establish different forward and reverse paths between a host and its frontdoor.

we do not require any routing path symmetry assumptions9.


As a data source, the mobile host can control of the TCP sender, it can be expected that the processing overheads how much and what data to send by using TCP.

using will increase only minimally when RCP is used at the mobile host.


When the background tra.c is increased, however, the impact of uncorrelated losses on the two WiFi links (from BS1 to A1 and A1 to BS2) in the InterBTS and InterAST con.guration is more pronounced than the e.ect of self-interference in the IntraBTS case, thus the loss is higher.

the background tra.c trace from Macha, Zambia or the TCP streaming (which is higher than 1Mbps), is less detrimental in the IntraBTS case, as was shown in table 1.


alert messages throughout the network, since vehicle safety applications require reliable delivery of warning messages to nearby and approaching vehicles.

in this section wevarythepriority of regular(background) tra.ctoassess the impact in terms of warning messages e.ectiveness.


For example, on a communication link, at most one packet is transmitted at a time, and on a CPU, at most one packet is (typically) processed per core.

the only way to achieve DRF allocation is to share the resources in time instead of space, i.e., multiplex packets from different .ows to achieve the DRF allocation over a longer time interval.


Once those terminals are covered by the SCH and they are within its transmission range, the routes that are coming from them will be rerouted by the SCH.

no need to invoke the regular route recovery process of the applied routing protocol.


These factors include protocol properties (e.g., hierarchy via supernodes ), graph properties (e.g., power-law vs. k-regular graphs), client counter-DoS strategies (e.g., parallel download and randomization strategies), and user-behavior factors (e.g., willingness to share .les and persistence in downloading a .le when the system is under a DoS attack).

our .ndings provide critical guidelines for DoS-resilient design of p2p architectures, protocols, and client counter-strategies by characterizing attack scalability and even collapse points associated with each design decision.


The JID can also have an optional resource tag that allows a particular user to log in from multiple locations simultaneously with different resource tags.

a JID has the following form node@server[/resource].


the callee should be informed of a new hierarchical path name of the caller in order to continue an ongoing service.


In terms of the shaped residual for each link, each increase is no more than s(rupper), i.e., ..

the total increase in shaped residuals, .rsnapped, must satisfy (7): .rsnapped = (k - 1).


In particular, when the multi-rate MAC indicates that the channel quality allows transmission above the base rate, OAR grants channel access for multiple packet transmissions in proportion to the ratio of the achievable data rate over the base rate.

oAR nodes transmit more packets under high quality channels than under low quality channels.


However, CDS-based protocols require their nodes maintain k-hop (k = 2) neighborhood information.

a node needs to include the (k-1)-hop information in its periodical Hello packets.


The m +1 estimate for the next talk interval is computed based on TI est , and by recalling that the talk interval must also allow the parent node to send a beacon packet.

the next talkinterval estimation is computed as m +1 m +1 TI = .


One example of broadcast transmissions is a digital TV broadcasting channel where all MSs watch the same TV channel at the same time.

instead of using a BF technique during a data transmission phase, the BS uses only one transmit antenna element (denoted by 1-Omni transmission) to equally radiate the transmitted signal to all MSs.


In essence, the front radio can scout the likely channel condition for future receptions by the rear radio.

we can send back the observed channel condition by the front radio at its current location l. By the time the rear radio reaches the same location l, the base station can use this feedback made earlier by the front radio to choose better transmission parameters for the rear radio.


For this reason, a larger set of peers receives pieces from the local peer.

a lower fraction of bytes uploaded to the best remote peers.


First, there exist the simple analytical power-control policies [1][16] for uncoded transmissions, while for coded transmission, it is di.cult to .nd such a policy.

we assume uncoded transmission for analytical convenience.


Putting interfaces to sleep means that several links in the network disappear.

iBGP will need to be re-run to recompute the best routes to various external destinations.


Also, for simplicity, router solicitation (RS) message is not considered here.

only RA message can affect the movement detection of the MN.


5 shows that the proposed scheme obtains a slight increase in performance when the wireless link transmission speed increase.

the proposed scheme is more effective than TCP Reno and TCP Westwood in utilizing bandwidth.


We energy is denoted by P , which is equal to mB.

the energy in the ith bin is equal to .iP .


Every time a mapping is used, its cache timer is reset.

less frequently used cache entries are automatically purged from the cache.


However, the di.erences between simulated and com puted results are far less than the di.erences between the GT-ITM and observed latency distributions.

what ever precision we have lost by using computations rather than simulations are more than made up for by the increase in accuracy in modeling reality.


This yields v 3/2 T = O(I · TA ' )= O( aK · aK log a)= O((aK)log a).

the total decoding complexity of the three stages is equal to O(slog(K)+cK +(aK)3/2 log a).


(1), the probability of packet reception is always non-negative albeit small over long distance.

if there does not exist any relay node in a cell, a direct transmission to the destination node is made.


In this case, inter-BSs cooperation is challenging as user, CSI, and signaling data need to go one layer up in the wireline network hierarchy, i.e., via a metro or core network, before reaching the destination BS.

a signi.cantly larger part of the mobile network is involved in exchanging additionaltra.c withstrict latency constraints(Figure2).


Since such interference cancellation is performed by AP1, clients in Cell 2 with the fewest (Q1, Q2, · · · , QK ) antennas can be picked to enjoy such bene.t.

cell 2 is left with M -K clients with QK+1, · · · , QM antennas, and Cell 1 is left with N-K clients with PK+1, · · · , PN antennas.


Given a squarelet s, the probability that a random 2 multicast .ow will be routed via the squarelet s is at least k · 5ra2 .

given any squarelet s, the expected number of .ows that v will be routed through the squarelet s is at most c6 · ns k ar , given ns multicast sessions.


In a typical enterprise deployment, a WLAN is made up of multiple APs and usually APs have overlapping coverage areas.

a STA in an overlapped area can associate with any AP that has su.cient signal strength.


For instance, the cost of a service could be another criterion for the routing of an outgoing call.

we propose the import of new Feature Tags in order to cover the above issues, in which we would be reported from now on as Network Feature Tags In table 1, Network Feature Tags are added to the original registration template as defined in [6].


In a multimedia cloud framework, HAS can leverage knowledge of the characteristics of the encoded video available at the server side.

we propose a cloud-assisted HAS procedure that exploits information on the encoded video content available at the cloud side to control the clientoriginated download requests.


This derives from the fact that there can be conflicting objectives.

a new concept of optimality should be established for MOPs.


As pointed out in [16], the major cause of the last drawback in the above list is the averaging mechanism of the LPF.

the authors suggest using the instantaneous queue length and applying a PI controller to it.


When peers are not contributing to the network, it becomes a major concern in P2P network because it significantly degrades the overall performance.

it is also important to study the effect of peer s behavior to determine the network performance.


In the same manner, the costs that receiver r3 must cover are 30 MU for link l6 and 10 MU each for the additional cost of QoS3 on l4 and l2.

there are 80 - 30 - 10 - 10=30 MU left on the bid of r3.


The receiver then declares a collision if within a window of 20 bytes (from the point of preamble detection), SofPHY hints suggest that more than 30% bits have con.dence less than a.

if a preamble-correlation spike is followed by a train of low con.dence symbols, the receiver stops reception, and transmits the collision noti.cation.


This is because the email client needs to write the re-ceived email data into the inbox database.

more data were written to flash storage for larger email.


In contrast, the one-time payment ' pi decreases in the claimed cost of node vi.

each node out of the lowest-cost path has incentives to decrease its claimed cost, as long as it remains out of the lowest-cost path after the decrease.


Even if the MN moves to another PMIP-enabled mobility domain, the new mobile access gateways do not have any relation to the previous local mobility anchor.

the new domain cannot continue the mobility support established by the previous domain but has to establish a new one.


C3 and C4 are able to obtain theirpacketsby reversing thenetwork coding and .llinginremoved chunks from their caches.

rEfactor + COPE reduces the number of transmissions to 3 - d, where d is the relative difference in the size of afull un-encodedpacket(e.g., abd)and the above coded packet along with the shims.


x.F '' ' and I13(xB )and I14(xB ) are exactly the same as I3(xB )in (19) and I4 ' (xB ) in (20), respectively.

the overall interference is I1' (xB )= I11 ' (xB )+I13 ' (xB )+ I14 ' (xB ).


Second,information of how Alice and each correct node has behaved in the past conveys no information about their actions in the current slot.

ourprotocoldoes notyield any advantage to an adaptive adversary.


According to (11), in SF=1 cognitive receivers do not suppress the received interference.

they receive high interference from the PBS in this case.


Flow 3 delivers more than 90% of the sent packets while only 10% of packets are reached at the destination in Flow 2.

flow 3 throughput, about 180Kbps, is higher than Flow 2 throughput, 55Kbps, while S2 sends packets with higher rate than S3.


Specifi- cally, each concave utility function achieves a corresponding fairness model.

any fairness objective in shared wire- less channels can be modeled by the following system of equations: Maximize ~ U(ri), where ri = Axi(t)/At, i subject to Vj, ZIi'j(t) < 1, Vt Vt, Vi, x~(t) = x~(t-1) + l, if Ii,j (t) = 1, V(i, j) e E" = xi(t-1), otherwise.


¦ Our analytical model can be easily applied in some specialized cases.

broadcast can be considered as a special case of multicast when M = N. the constraints (39) and (40) in the formulation (see Fig.


However, as there is very little data, the receive checks are often unnecessary, resulting lost energy.

the size of the wakeup interval must be adapted  (a) Without DBP.


Besides determining the input space partition, we log the output results produced when executing each codepath(e.g.,welog whatpacket comesoutfrom whichport).

for eachinput subspacethere exists a corresponding output trace.


Losses of connectivity or partial packet losses (i.e., bit or packet errors) should trigger the protocol to take appropriate actions.

unlike in the layered communications paradigm, transport protocol operations and critical decisions should be supported by the available information from lower layers.


the search for the minimal solution of G(pi) has the e.ectiveness which decreases the occurrence of out-of-order packets because of the equalization of the delay of source link and destination link.


However, di.erent from [9] and [3], which consider only awake-mode MSSs, our algorithm takes not only awake-mode but also sleep-mode MSSs into account.

a new priority sequence should be implemented.


However, when changing the type do not solve the lack of PCI for macrocell or femtocell, the GCI can help the macrocell to identify a detected cell.

we anticipate following benefits through the proposed scheme: Flexible use of the PCI: The PCIs are flexibly utilized depending on the number of deployed femtocells in a macrocell.


Then, we store the item in the lists associated with each of the kbuckets.

a single item is stored ktimes in the off-chip memory.


For example, consider a part of an MANET shown in Figure 7(a), the path S-A-B-T is the optimal path for a connection from S to T. The metric for optimality can be hop count for shortest path routing.

nodes A and B will continuously be used in forwarding the tra.c, leaving the other nodes free from the tra.c load.


We also see that the bound is translation invariant, i.e.

it only depends on t = t - s. the computation cost 2 of (1) is O(n) instead of O(n ), where n is the number of cycles during a network measurement interval.


A Multi-frequency time division multiple access (MF-TDMA) scheme where users packets are distributed over 100 carriers (i.e., 100 frequencies).

frame of 45 ms length is composed by 100 × 40 slots.


Each slot has the mandatory MAC header and may have other subheaders (fragmentation or packing) and the optional CRC .led.

the number of bytes available for user data is less when compared to the overall slot size.


The low level does introduce a better precision, however, the authors goal is to predicted what it is going to be the next cell the node will move to.

the precision requirements for this scenario are much lower than the requirements for VANETs as we propose.


However, the traditional protocol models, such as Node Exclusive, 2-hop Node Exclusive and Sensing protocol models have the drawback that they do not accurately model interference.

the actual throughput provided by these traditional protocol models is poor no matter how good the theoretical throughput o.ered.


These stations may strongly suffer from network traf.c congestion.

the node populations and TXOP limits should be controlled to preserve network stability and provide some guarantees for throughput and access delay for all the traf.c classes.


Overhead of control packets: the transmission of control packets such as NC ACK packets can cause the overhead in the traffic load and power consumption.

studies in control packet compression and efficient piggybacking schemes of control packets are desired.


Using this continuously updated transmission rate and the subtree size we obtain the data generation rate, which is in turn disseminated to both subtrees A and B.

a di.erence in loss probabilities causes the entire network to adjust its data generation rates.


10, the system average throughput of PF and GLB are much lower than RA algorithms.

it is quite clear that the traditional resource allocation algorithms are not suitable for a noncooperative WMN.


Underlying our approach is an assumption that given an SNR value, one can determine the optimal combination that maximizes the throughput independent of location and time.

in this experiment, we show that the SNR value robustly determines the best bit rate.


The reason is that the client can accommodate the whole burst into application bu.er and TCP receive bu.er completely.

eStreamer will never detect ZWAs for any T and will .nd the optimal burst interval at Tmax, as a result, achieve more energy savings.


Its bursty behavior is clear, and the marginal distribution is non-Gaussian.

before proceeding to handle the data more e.ciently, we normalize them (i.e., resemble a normal distribution), by employing a suitable transformation.


An attribute, such as bandwidth, is considered individually to determine whether a given link or node meets user requirements.

if the attribute value associated with a topological element (either a link or a node) violates the QoS requirements, that element is eliminated from the path selection.


If the route is withdrawn by the producer and the elector fails to propagate the withdrawal to the consumer, the consumer has no way to detect this.

sPIDeR allows ASes to trigger an extended veri.cation for a given commitment, which works exactly like a normal veri.cation, except that the AS must also re-announce all routes it had announced originally, with timestamps equal to the commitment time.


BACKGROUND AND MOTIVATION 2.1 Channel Model The transmitted radio frequency signal is re.ected by both natural and man-made objects.

the signal at the receiver is a superposition of di.erent re.ections of the same signal, received with varying delays and attenuations.


For instance, 0.1 link probability gives you a sparsely connected network than a link probability of 0.5.

higher link probabilities result in a better delivery ratio.


(10) Now, the event Ak(i)occurs iff iis covered by less than k sensors.


However, the current rules for the security group may not allow the response tra.c to reach the instance.

when the outbound rule is generated, the controller installs a corresponding temporary rule for the response packet.


When an administrator injects new data to a single node, that node knows the data is newer.

disseminating new data withTrickleis comparativelyfast.


Thus, a high utility v0 is obtained for each of these services if the minimum rate r0 is allocated, while the allocation of additional units(ontop of r0)results in lower value than v0 .

the social welfare attained over a slotif anadditional usergetsserved evenwith theminimum rate r0 ishigher thanthe one attainedifthe samequantity of bandwidth was given to a set of users already being served.


However, false positives on the version .lter can lead to a PND believing that both PNDs have the same version of a .le when they do not.

at the end of a full synchronization, two PNDs may not have detected all .les to transfer.


Fortunately, as shown in the Figure 3, POND covered most of surveillance area.

the compensation process only need to cover those holes generated by POND.


We assume that all the nodes have the same BO and SO values (duration and interspacing between superframes).

a schedule of superframes corresponds to a TDMA assignment with timeslots of a .xed length.


distribution is uniform on a .nite set of tags, Di(x) = 0 or c for some constants.

wLOG, we can also represent Di as a subset of L-bit tags.


If there are M brokers in the routing AG, the total number of messages circulated in this phase is (M - 1).

the message load for this phase is O(M).


According to Markov s inequality, W n -FiPr(t = u)= Pr(X = u -Fi)= W(u -Fi) 1 n -u 1 n -u = (1+ )< (1+ ).

wu -Fi Wu -ß · n Suc(t) = Pr(t = u)(1-Suc(u))+Suc(u) n -ß · n < (1-Suc(u))+Suc(u).


If the packet is discarded from the virtual queue, then the arriving packet is dropped, otherwise it is forwarded to the appropriate output line.

no queueing delay is caused by any limiter.


Security Issues in Privacy and Key Management Protocols of IEEE 802.16 Sen Xu Manton Matthews Chin-Tser Huang Department of Computer Science and Engineering University of South Carolina Columbia, SC 29208, USA {xu4, matthews, huangct}@cse.sc.edu ABSTRACT Without physical boundaries, a wireless network faces many more security threats than a wired network does.

in the IEEE 802.16 standard a security sublayer is specified in the MAC layer to address the privacy issues across the fixed Broadband Wireless Access (BWA).


We cannot predict accurately the growth of botnets, or the growth of network resources and technology advancement.

we choose to hypothesize the power on each side based on the current best estimate.


Any reasonable channel should have a high probability of successful (uncorrupted) bit transmissions.


The cost of AS#2 is similar to the cost of AS#1, except without the transit cost of AS#1 s tra.c.

the cost of AS#2 consists of the two terms below.


This is mostly due to the fact that the vast majority of load balancers observed (85%) use the per-.ow technique, and are located in the networks that compose the core of the Internet.

more paths are likely to traverse a single per-.ow load balancer.


The reason for this .ltering lies on the straightforward veri.cation heuristic we employed; for each email address coupled with a name, we looked it up using Facebook search and, from any pro.le results returned, considered a match only if the name was exactly the same as the one in the dataset.

entries with middle names or special characters, having a larger possibility of being written di.erently across disjoined social networks, were excluded.


As there are at most w.B(v,2) log n colors, this sum over all colors ful.lls pw O(1) = log n = O(1).

ce log n ce log n w.B(v,2) if c is suf.ciently large, the average number of transmitters is smaller than 1/4, and by Markov bound no one transmits with probability 3/4.


In contrast to the an- alytical calculations without consideration of biased sampling, we detected a significant increase of signaling traffic.

we can conclude that the biased sampling of the velocity has to be taken into account in analytical calculations in any case.


Remember that, the longest edge of EMST is always the critical power [26, 29].

the result in [20] is actually stronger than that in [11] since it will give the probability that the network is connected.


4.1 RWP Mobility Based on our observations in section 3, we choose to use AODV when the network density is above 40/(500 m * 500 m) and epidemic routing otherwise.

in order to obtain the network density, we assume that the communication range of all nodes is 130 m and then, based on the number of nodes that we are communicating with, we can calculate the node density: n/(p * r 2), where n is the number of neighbors and r is 130 m. we learn that n is 8.5 for the borderline density.


For small values of Eo,the behavior of our M/D/1/k may be well estimated using the relations for the M/D/1.

substituting each term by v 2 the values found before, we get to B = .+ .


In that case, the node receives less signal power than signals transmitted omnidirectionally from the same transmitter.

overheard signals are not used to estimate the path loss from the transmitter and the node does not update the cache table on the reception power.


This is due to the fact that we generated column E as E=ABCD.

we have confounded the main e.ect E with the e.ect of the four factor interaction A:B:C:D which we expected to be not distinguishable from noise.


a point(., a, ß) must be within a tetrahedron.

we simply select one of the four vertex of this tetrahedron to store the datum.


While formulating the communication range requirement, we make use of the required information freshness metric obtained in Section 2.1, as we are interested in the separation distance between a node pair when a su.cient information freshness level is achieved.

reliable range of communication is de.ned as the maximum separation distance at which a node is able to receive at least n packets from the neighbor node within an information freshness interval with a certain probability.


Issues such as device heterogeneity, GUIadaptation and application loss can hamper user experience in pervasive computing environments.

in this paper we propose a novel contextaware architecture called A2M.


This implies that a node s utility function must assign effectively zero cost to forwarding, since it must never be pro.table for a node to refuse to forward, irrespective of its own rate of packet transmission.

utilities measure positive outcomes, such as packets delivered by the network for that node, and consequently a punishment must be in the form of a reduction in delivered packets.


asj (T)/Isj ;  (8) return 3.1 Max-Min Minimal Cover (M3C) A sensing cover, or simply a cover, ceases to be a valid, if at least one sensor in the cover is dead.

the lifetime of a cover is limited by the lifetime of the weakest sensor in the cover.


There are, however, instances in our data sets where multiple tests are run consecutively in relatively close geographic proximity and when plotted on a map, we can see that the positions follow roads perfectly.

we can infer that a subset of our tests were run while users were traveling.


Cellular networks have the largest coverage across the whole world, whereas WLAN networks are only available at hotspots.

it is obvious that a WLAN is always under the coverage of a UMTS.


For the AIMD algorithm, the total bandwidth used varies linearly between ßB and B,where B is the capacity bandwidth of the bottleneck.

tCP ß+1 utilizes on average only 2 of the available bandwidth.


Over time, these nodes will become popular (so called, Eclipse attack [21]) since they are always online and contribute to the P2P network.

they will attract more messages and more Storm nodes will know of these nodes (even bootstrapping from them).


If at the end of slot 1, the CS suppresses A and D, then even though the set of linear equations has 2 variables (A and D) and 2 equations (samples received at AP1 and AP2), still it is not possible to decode both A and D without the exchange of samples.

we need another mechanism to compute the set of suppressed transmissions.


Consider the ith term in the expansions of OHHBA and OHHB from equations 8 and 10.

oHHBA is less than OHHB if: r "r log(1- r )r "r 1 ii 1 i-1 k =.i .


Most of the existing protocols focus on a single aspect such as either location or power-awareness and do not generally consider the existence of asymmetric links even though a heterogeneous ad hoc network is mostly composed of asymmetric links.

the novelty of this work comes from the combined e.ects of not only location and power-awareness but also the usage of asymmetric links throughout.


(This is because di.erent links in the network have the same delay distributions.)

in the remainder of this paper we will focus on the constant delay case.


To find the minimum value of LN 2 MPn,b , advantage is taken of the arithmetic gn n=1 n geometric means inequality: 21 2 21 N NN f( ) g g g [ f( )] 2 gn 1 2 N b +b + + b -N n 12 N 2b -1 ;N N 2 MP =L 2 222 L gn n,b n 2 n=1 n=1 hn h1 h2 hN (9) When each term on the left-hand side of (9) is equal, the sum is the minimum.

if each term of the left-hand has the same value as 2 21 N f( ) g g 2 g [ f( )] gn 1 2 N 21 b -1 b +b + + b -N 22 =N 2 n 12 N 22 2 hn h1 h2 hN n =12, ,...,N (10) Then the total transmission power interference has the minimum value.


If the time is greater than Tlatency, it means that the packet may expire and the scheduler will increase DC of rtPS by the packet length.

dC of rtPS will be calculated by formula (4).


Although it could be useful when no interferences cause carrier busy, the interferences from noise and other systems such as other wireless LANs must be considered in real situations.

this paper investigates how much the interferences a.ect the throughput by using real access points and terminals as well as the retransmission.


When the DSD Agent of router 1 replaces the encryption module before an appropriate decryption module has been installed by the DSD Agent of router 2, packets encrypted by the new algorithm will be discarded.

figure 1: Simpli.ed network setup consisting of two routers connected with a secure communication channel to preserve the integrity of the network while the adaptation is in progress, a coordination mechanism is required that involves doing the service deployment in a coordinated manner.


However, this meeting, as well as the one with the sender S, could happen with some delay, and in this case a hybrid approach can have better results.

in order to meet both reliability and delay constraints, each sender will have a timer t for any information it wants to deliver to an actuator.


If only one or two packets are lost and there is still normal data .ows between the two hosts, it is not necessary to reduce the transmission rate rapidly by using slow start.

fast recovery mechanism performs congestion avoidance instead of slow start, after a fast retransmit of the missing segment.


Actually, the service quality of the streaming service is in most cases acceptable to users although the layer 2 connection is disconnected for a few seconds due to the temporary channel switching of pre-scanning phase.

the service quality of the multimedia streaming application service may not be degraded even though the layer 2 is intermittently disconnected due to the periodic pre-scanning operations.


For link (i, j), we denote the neighboring CS tra.c as .cs, and the neighboring HT tra.c as .ht.Considering self-tra.c interference, the CS tra.c becomes .cs +CSFi ×., and HT tra.c becomes .ht +HT Fi ×..

the LPTT of link i to j which has considered self-tra.c interference is LP T T (.cs + CSFi × ., .ht + HT Fi × ., .).


We view a small sampled frequency gj as a variable that arose from a Poisson distribution whose mean is estimated by gj.

we can say that gj is distinguishable from 0 at signi.cance level eif the probability that gj would have been zero under the Poisson distribution is -gj less than e. we require e <e, in other words, gj = j(e).


The biggestgain of SVBF is that, it relies on burst reads which are simpler than random reads that COMB suffers from.

instead of k memory accesses, we only need .k/w.


Second,duetobusiness relationships and dense interconnection among ASes, churn becomes localized, and each vantage point does not see the same set of routing events.

correlation between update churn seen at di.erent vantage points can serve as a measure of the maturity of the underlying network and business relationships.


However, GPS-based localization systems [4] are not suitable for indoor environments due to attenuation and the scattering of microwave signals.

di.erent indoor localization technologies are necessary.


This in turn, creates more resources and hence more transmissions in the same contention region if the interference caused by some links is weak.

while the total number of resources used in any contention region can potentially be greater than K, the total number of resources used up by any link in any contention region cannot exceed K. If the array gain is to be used towards increasing the capacity directly rather than increasing the range, then the resource in each contention region (K) can be viewed to be scaled by a factor (Cj, given in equation 9) with each link s allocation being limited to {0,Cj}.


Also both LTE and WiFi based small cell services are expected to be o.ered in the 3.5 Ghz shared use band currently utilized for military and satellite operations [2].

in the near future, dense deployment of LTE and WiFi based small cells may be expected to coexist in shared spectrum.


In other words, use cases exist where the simulation of a large surrounding area is only used to produce the input for a small embedded area that requires a high simulation accuracy.

a possible solution is to use a tra.c simulator with ahigh accuracyfortheinner area, whereasthe vicinity instead is simulated by a simulator optimized for e.ciency.


5.5 Tracking Users in real Time For tracking shoppers in real-time, we use the same scheme as above except that we only consider the shopper s locations as unknown.

the moment the shopper sees a product while gazing, a WiFi scan is performed and his/her location is initialized.


hostsmust notrespondaf.rmativelytoveri.cation requestsforpacketstheydidnotoriginate.eachhost maintains a small cache of the hashes of very recently sent packets.


These deadlocks have to be broken by the transmitter because the receiver cannot distinguish this scenario from that when the transmitter has no packets to send.

after waiting for a con.gurable timeout, the transmitter knows that either all of its outstanding packets were erased, or the resulting acks were erased.


This is because any set of coordinates that satis.es the minimization condition can be rotated, translated, and .ipped while still satisfying the minimization condition.

we need to canonicalize the computation so that all nodes performing it independently will arrive at the same solution.


Thus, according to the ITU-T recommendation G.114 one-way delays should be below 150 ms (or at most 400 ms).

we measure the packet delay during the VoIP calls.


On the other hand, if the real transmission power level is higher than pdata, more Type II guardian nodes will hear the messages and detect the redeployment.

adjusting transmission power level cannot elude our neighborship-based redeployment detection (except for some edge nodes who may not have enough monitors).


Video A will have a high request frequency during short time windows, while Video B has higher frequency over a longer time window duration.

different caching choices may be made depending on the time window.


Similarly, sensing devices could be employed in monitoring patient health at home, in order to supply assistive services.

sensors can be conveniently grouped implementationally by type (e.g., scalar, staring-array, spectral), functionality (e.g., temperature, surveillance camera), or location (e.g., within a building or an office complex, or outdoors).


However, the simulation results re.ect reality only as much as the used models do.

realistic models are a crucial factor for the credibility of the simulation results.


3.2 Secure Location Query & Reply Messages The secure geographic forwarding concept developed in Section 3.1 can generally be applied to any unicast message if a source and a destination share the same secret key.

it can be applied to end-to-end unicast location control messages such as location queries and replies.


For the action of S1, forwarding to port S1x,if x> 2, then the action of S3 is forwarding to port S32,otherwise, S3 will forward it to S31.

we only need to save the action of S1 and the prediction tree, using them to infer the values of S3 accurately.


They are chosen to be representative of various different kinds of TV content and vary in level of detail and movement complexity.

they result in different frame-level properties and encoding ef.ciency; A) an interview scene, B) a soccer match, and C) a movie.


qi.Q(e)Let e be the lth edge in path Pi of packet qi.

then, Yi =1 if and only if Xi = t - l. Pr[Yi = 1] = 1 , and PP C E[Ct(e)] = E[ Yi]= E[Yi] = 1 Since the qi.Q(e)qi.Q(e)random delays are chosen independently, the variables Yi are independent Bernoulli trials and by the Chernoff bound, we have Pr[Ct(e)= ..E[Ct(e)]]= 2-. ,.. = 6.


Message Reliability: Commercial backscatter systems use a checksum to decide whether a message is decoded correctly and send a NAK if the checksum does not pass [14].

the number of messages decoded incorrectly represents a lower bound of retransmissions needed.


The aforementioned attacks aredamaging to both wireless clients, such as laptops, and wireless services, such as APs, particularly since the distinction between client and service devices is becoming increasingly blurred; e.g.,aclient gamestationsometimesprovideswireless service to others as an ad hoc AP.

we want to limit the linkability of packets transmitted by both clients and services.


Instead, an ACK is sent only if at least NMP packets were received from the stream S since the last sent ACK, or if at least a time duration TS elapsed since the last ACK sent to the stream S. When receiving an ACK containing the counter value C, the stream S will assume that it is the ACK for the Cth sent packet.

it will compute an RTT estimate RT Tc based on the current time moment and the time moment when the Cth packet sent by S was sent.


A NAT that treated DF packets differently than non-DF packets for the same protocol would thus leak the fact that at least two different policies exist behind it.

to preserve privacy the NAT should do the same thing--send a unique Ip id field--on all packets.


This is an important issue for large and enterprise networks, where bandwidth management and users compliance with their policies is of utmost importance.

network administrators have a binary approach in managing P2PTV related tra.c, to either block it completely or allow it with no control.


As a consequence, in some of DL subframes, there is no traf.c in BS waiting to be transmitted to some of the SSs.

in each DL scheduling, opportunistic and round robin schemes are applied to the channels that have some traf.c to transmit to the SSs.


This model results into a perfect circular coverage area around each node with a maximal radius R(Pt) de.ned as follows: « 1 Pt K ß R(Pt)= (3) .

a node can only sense the environment and detect other nodes only within its maximal sensing area R(Pt).


With the CPU and GPU sharing the same memory storage, the explicit memory copy is not necessary.

we do not need the memory copy APIs any more.


By assumption µe = en/c for some c = 1,so the probability that a single sample detects cheating is at least e/c.

theprobabilityofreturning ACCEPT after f samples is at most (1 - e/c)R = e -Re/c, which implies the claim.


This suggests that for a strictly achievable QoS metric that is prametrized by (.1, ..., .M ), for which these conditions hold with strict inequalities, there exists some E > 0 such that K K max diE[zi] = di.i(1 + E).

(23) i i the drift in (21) reduces to .V [k] = M/2 - E i di.i.


In this experiment, packets arriving at a single port were sent to a single RX queue processed by a single thread, as would happen with one .ow under RSS.

in the rest of our evaluation, we focus on experiments with addresses drawn uniformly at random from the entire FIB.


Evenwhen the approximation error inducedbythe transformation of contact sequences to static graphs is acceptable, individualDTN nodes cannot alwaysbeawareof the full social graph resulting from the encounters of all network nodes.

realistic protocol implementations such as [5] and [9] rely on egocentric approximations of the original sociocentric metrics, computed across the nodes ego networks [12],[6].


The ovlist(e) only collects packets of the .ow carrying the same sequence number identi.ed by seq(e).

if seq(P) is less than seq(e), the packet is ignored.


distribution of the fast fading process.

it is assumed that the instantaneous rate is linear in the received signal-tonoise-ratio up to a maximum rate c0 with the parameter m modeling the impact of path loss and .the fast fading process.


However, such measures are naturally too costly for delay-sensitive applications.

in our comparisons, we will use an enhanced TCP-like RTO estimator, where RTOmin is set to zero and the exponential timer backo.


We note that the bandwidth consumed for path setup is negligible compared to the bandwidth consumption for elephant .ow detection.

our evaluation results would still apply, even if we install all paths proactively.


When the piggybacked response contains more than one packet, the DNS response in the .rst packet is still suf.cient for obtaining the rest of the content via a normal HTTP Range request to the Web server.

the LDNS handles a loss of a subsequent DEW response packet from RDNS by sending to the client a DEW response containing just the contiguous portion of HTTP data that was successfully received.


The de.nitions of F and M do not necessarily guarantee that the nodes will eventually reach a complete stop, i.e., a state of static equilibrium.

an important problem is to determine when a node should stop its movement.


First, FLARE design enables multiple software-de.ned networking control using slivers in an isolated manner.

we may apply software-de.ned networking control to di.erent .ow spaces.


Universidades, 24 48007 Bilbao, Spain +34 944 139000 dipina@eside.deusto.es user preferences.

the context represents the surroundinginformation that must be checked to determine the need for settingup some concrete preferences.


The propagation delay is negligible because the sensor .eld size will typically not be more than tens of kilometers and the transmission speed of the sensor network is low compared to the speed of light.

the delay Di is proportional to the hop count between nodes in the tree.


Interactive communication in a short time is no longer available in our target environment.

all the application programs must assume asynchronous message delivery.


The longer is Tc, the more is the effect of the second part of the simulation, the network under light load of non-real-time traf.c is considered.

in some of DL subframes, there is no traf.c in BS waiting to be transmitted to some of the SSs.


This tells us that any non-randomized algorithm must either use O(m) space or have a relative error of at least 1/3.

we see that if we use only randomization or only approximation we cannot hope to use a sublinear amount of space.


read() { task loop() { ... resume(); while(!isFlashReadDone) post loop(); yield(); } return flashData; } With our context switching mechanism, the yield() call in read() causes control to exit from the resume() call of the loop task.

tinyOS can schedule other tasks and process pending events.


For instance, the majority of gaming, malware or SpamAssassin .ows are characterized by a series of packets of constant size.

constant packet size can discriminate certain applications.


Traditional contention-based schemes require sensor nodes to keep their radios on to receive possible incoming messages.

such schemes are not energy-ef.cient due to idle listening.


On the other hand, if the tra.c from adjacent satellites to satellite E is too small, satellite-destination link cannot be used adequately and it deteriorates the utilization of satellite-destination links.

it is necessary to maximize the use of the link between satellite E and destination, and minimize the amount of data that satellite E needs to send to satellite A.


INTRODUCTION Recently, the amount of wireless tra.cs rapidly increases as the market for mobile device and its applications grows.

it becomes more di.cult to accommodate increasing services through existing cellular systems.


For sustainable WLAN links, the SNR has to be greater than 3dB at the lowest PHY rate of 6Mbps.

this value is extracted from table 1 in [4].


Step2: due to the fact that in the Hamiltonian path all nodes are visited in ascending order (in the high channel subnetwork) or descending order (in the low channel subnetwork), all of the selected neighbors in Step1 do not necessarily satisfy the ordering constraint.

if the labels of the selected neighbors (in Step1) are between the label of node u and destination d, it/they can be selected as the next hop (pseudo code in Fig.


f =1/.f (G,d) and hence the third claimed relation is true.


The synchronization method of the receiver is suitable for low transmission speed.

with a bigger FFT length, the receiver is capable of receiving and correcting more packets.


If each node maintains r vsetpaths to its virtual neighbors and the average path length is p, the total number of routing table entries in an n node network is nrp.

each node will have on average rp entries for vset-paths in its routing table: r entries for the paths to its virtual neighbors and r(p - 1) additional entries for vset-paths through the node.


When employing the right hand rule node v2 will send the message along the path v2v3v4v5v6v1 while v1 is the .rst node which is located closer to t than the greedy failure node v2.

greedy routing can be restarted at node v1 which will in turn send the message to v2 again, i.e.


For data sessions over long periods of time, there is a good chance that the initial route discovered will fail before the session ends.

an intelligent protocol should be more proactive in maintaining routes so that packets may be readily switched to an alternate route when the route failure occurs, rather than wait for the route to break to restart the route discovery process.