Similarly, there should be a way, for the team of miners, to issue requests to the WSN through the base station.

existence of a direct communication link between the team of miners and the base station is required in this approach.


Figure 3 shows a possible identi.cation of radio hole due to radio irregularity.

figure 3: Hole de.nition with irregular radio range an accurate de.nition of radio holes due to radio irregularity is given in the following.


As soon as concurrent flows starts to appear, the advantage of using TPA becomes higher (see Figure 66).

we can speculate that in even harsher configurations TPA will further outperform TCP.


The direct indexed array which processes the initial k-bits and selects a sub-trie has 2k entries.

an initial stride of 12, which requires a 4k entries table, is preferable over 16, which requires 64k entries table.


This integrated approach should be a critical part of a unicast routing system which can deployed in practice.

for the implementation of our unicast system, we will save our effort and borrow the approach proposed by Zhong et al.


PathSplice performs better,but it still can be 100% higher than the optimal while R3 based schemes are within 30%.

the traf.c intensity ofPathSplicing can be 54% higher than R3.


In large, mobile ad-hoc networks, this model is not practical.

in this section we examine the impact of power control on routing e.ciency when nodes have only partial network information.


Let Xi = {0, 1} be an indicator variable denoting whether the ith node vi falls inside the region D(T ) for a multicast tree T .


However, such a computation is not so easy assuming a push-mode based monitoring as a link might be used by several .ows which do not start and end at the same time.

flowSense creates a checkpoint at the arrival of the .rst (PacketIn ) and the last packet (FlowRemoved excluding the timeout) of each .ow.


Finally, the capacity violation cannot happen to any nodes outside unassigned[u] since the total packet .ow at Vu does not change after the rate equalization.

we have proved that in R * [], any nodes in unassigned[u]must use a common rate.


Since our network ar x chitecture is consisted of static and mobile nodes we wanted to understand how the RSSI is changed for di.erent types of nodes.

we observed that for the static nodes the  sigma value between the obtained signal was 0.65 whereas in case of the mobile node the sigma value was 4.85.


This is due to the fact that an attentive cache admission policy is used, in order to cache a segment of a video.

when most of the decisions to cache a segment are right, it is preferable to cache a large segment.


Nevertheless, when broadcasting packets that will be accepted only by nodes inside the cluster, the smaller is the cluster, the smaller is the strength needed to reach all the nodes.

this modification aims to reduce the energy consumption when broadcasting packets inside a cluster by limiting the broadcasts to a range which is sufficient only to reach all the nodes in that cluster.


It is either a video .ow when i is a multiple of 3, or a voice .ow otherwise.

the video and voice .ows arrive alternatively.


The lower bound depends on system parameters and the number of interfering nodes within the neighborhood of each .ow.

it can be computed using only local information.


Instead, they are connected via other intermediate nodes.

different problems, e.g., inconsistent context, cascading effect, can happen during the mobility of ad-hoc nodes within a MANET domain if multiple IGWs exist [3-5].


3.1 Signal Correlation A wireless transmitter maps the bits of a packet into complex symbols as part of digital modulation.

a transmitted signal can be treated as a sequence of complex symbols.


Second, due to its capability to estimate not only the circumstances in which performance is maximized but also actual expected performance, the model allows selecting the (routing, placement) strategy itself.

overall, it allows for the identi.cation of the complete con.guration of a workload such that that workload completes in a minimum amount of time.


As we use information retrieved from social networks, our approach follows their growth rate.

harvesting method Figure 2: Ratio of tra.c volume per email address for various harvesting methodologies our technique is fully automated as it expands, and no further manual intervention is needed for collecting more names that will be used as seeds.


Hence, when using fewer zombies, more attack packets can be dropped.

the attacker should intend to use many zombies in most cases.


By Lemma 4.3, if Zn(fi, -8 ,b,8 ) is k-barrier covered, then Zi-1 would also be k-barrier covered, which is a contradiction.

zn(fi, -E ,b,E ) is not k-barrier covered.


For a densely deployed WSN, we have LVor (si) or i= i sihi+ ihs m i.


It is likely that for such a test, few hosts would belong to the .rst category.

the results of such a test would always be questionable.


1 -.dkl.=m =M -.dkl., glk(m)= 0 otherwise.

in time slot t, if the m-th position from interfer- L ing link l carries a symbol payload, then the glk(m)-th and R glk(m)-th positions on link k cannot carry a symbol payload.


As we will show, the main strength of ZAA is their strategy to choose the physical nodes at which virtual nodes will be allocated.

the Hybrid strategy applies the ZAA to allocate nodes and the MPA to allocate links.


Thisleadsthemtousethe tie-breaking mechanism,which favorscamera-panpairs that coverhigher number of targets.

both the cases directly lead to increasing the overall coverage gain.


In reality, however, it is difficult for a cognitive radio to have a direct measurement of a channel between a primary receiver and a transmitter.

the most recent work focuses on primary transmitter detection based on local observations of cognitive users.


It can only calculates its expected payment from Um which is expressed as ( ) EE E Rn C n = .C n mm m P (n, m) (8) where P (n, m) is the probability of Fn selected by Um and Cn E when m .8, P (n, m) .1.

fn has an incentive to report larger average subchannel capacity because it cannotget paymentifitis not selected by anyFUE.


If they match, the registration record is authentic.

it s A .eld is changed as 1, i.e., as authenticated, and routing table is updated according to the new registration table.


qualities for edges (S, A), (A, B), (B, C), (C, D), and we used lower link qualities for edges (S, B) and (S, C).

the network assumes many packets are routed through the path  6.


From Information Theory, it is possible for multiantenna AP to pre-code multiple frames to reverse the channel effects and simultaneously transmit to multiple mobile stations.

each mobile station will receive signal only for itself while other interferences are nulli.ed [15].


calculations show that 22 da(x) 4 - x - x = v (F(x) - F(-x)) · e 2 - xe 2 dx 2p 4 - x2 2 <( v- x) · e< 0 2p a(x)is monotone decreasing in [3.3, 8].


(11) R As in the case of the single hop system, we model false removals, at each receiver, as an independent Poisson process with rate Aw.

the system transits from a slow path state to the recovery state (,) with rate NAw.


We also note in passing that whenever control messages are slowed down by contention among themselves for a shared link, the same will be true for the .ows.

the range of .ow size for which the overhead is su.ciently low is insensitive to topological congestion and perhaps even bene.ts from it.


As this cannot be held for the reason above, the range extension by directional reception is unable to rely on physical carrier sensing to avoid collisions.

packet exchanges via links extended by directional reception are more vulnerable to interference and collisions, and selection of such links must be done carefully to not degrade the overall network performance due to frequent link breaks.


Hence, E[k0] = g/7 under the assumption that all useful time steps t satisfy pt > 6.

our Chernoff bounds yield k0 = g/2 w.h.p.


5 with two egress nodes, at most three such topology views are needed regardless of the number of pre.xes.

given the topology view corresponding to a destination pre.x P, FIFR can then be applied as is to determine interfacespeci.c forwarding entries to P at a node such as E. Based on this view, the failure of primary NEXT-HOP node A or primary egress node C or primary peering link A-C, is inferred by E as the failure of node A, when the packet arrives through an interface along the reverse shortest path from E to A, i.e, A is the key node for that interface for destination P. E will forward the packet towards the secondary NEXT-HOP B via egress node D. Since the topology view is consistent at all routers within the AS, the packet under FIFR gets rerouted consistently from a node adjacent to the failure to the destination via secondary egress D. Occasionally, FIFR may reroute packets to the secondary egress on a few intra-AS failures even when the primary inter-AS link is still up.


we use the standard Lagrangian method to solve the unique optimal solution.


Parameter settings in our scheme X 10000 Bytes Y 20000 Bytes Z 50000 Bytes D21 0 s D22 0.002 s D23 0.005 s D24 0.01 s Updating interval T 2 s  Xu Kaixin et al [4] identified the severe unfairness among TCP flows across wireless ad hoc and wired networks.

we first adopt a scenario similar to situations used in [4] to show how our scheme solves the problem.


Instead, when one or multiple tags respond, the reader has to wait until the end of tags transmission (lasting for the time needed to transmit tags ID), before issuing a new command.

idle slots are much shorter than collision and identi.cation ones.


Recall that our objective is to minimize ii the maximum cost over all servers.

we de.ne the social cost of a mixed assignment by C = E[max Cj ] .


We note that if one employs FIFO,then if stability is achieved,bounded delivery time is guaranteed.

using Observation 25 and Theorem 16,we have that FIFO on a directed almost-acyclic graph has bounded delivery time against any bounded delivery time adversary.


This becomes increasingly important as many CDNs continuously deploy servers at the network edges or within ISPs.

one can not infer the operator of a cache by simply looking at the IP address or AS number [15].


Our model is able to capture independent packet forwarding and node recommendation propagation misbehaviors.

it is able to withstand against the presence of misbehaving nodes and bad recommenders.


The IBE technology can guarantee that the session key can only be generated by the sender and receiver who have the T-IP private key for the packet s source and destination address respectively.

t-IP can achieve an authenticated and secure data transmission directly without costing the time on credential based authentication or key negotiation.


Each message contains avector with k values of Wv.

in the example above the message size is O(nlog nWv).


However, for large n, if we choose one node, the other (n - 1) nodes are still uniformly distributed on the line.

equation (12) also denotes the probability that a node has n0 neighbors if the radio range is set to r0 = x0/2: (.


However, such a word still has a low JI value owing to the large number of bigrams in it.

the JI value is thus computed as 6/(8 + 35 -6) = 0.16.


That is to say, Ingress Relay Node transforms multicast packets into unicast packets and sends them to Egress Relay Node.

mAPT enables multicast data to be transferred across the Internet section without increasing MTU size.


Note that these two types of histograms are shift invariant.


In the example in Figure 7, since AP3 enters the second round with backoff=5, we should pretend that 5 time slots have elapsed, and deduct it from AP2 s backoff.

when AP2 contends later, it uses a backoff of 3, and transmits on the third subcarrier.


The area of the shaded region Da is A = vt · 2R.Using Assumption 5, the average number of nodes in Da is found to be equal to 2Rvt·s.

the average number of nodes in Da with velocity v is equal to 2Rsvt·f(v, f)dvdf.This is just the average number of nodes with velocity v entering the zone within the next t seconds.


However, it is still required to sort packets in ascending order of their timestamps.

they still have a time complexity of O(log N) per packet.


This frees two domains to peer with a variety of technologies and layers (such as optical, MPLS, or Ethernet); different domains can choose to peer in different ways, and a single domain might employ many different peering technologies simultaneously.

this separation of interdomain and intradomain addressing, by enabling general forms of peering, not only makes changing the L3 protocol easy, it does away with the concept of a universal networking layer altogether.


Note that the observation time depends on the tunnel stability which is a.ected by the node mobility.

we can infer how the mobility of nodes may Table 4: Error Probability versus the number of observations number of observations per node tPF PM 100 0.935 0.006 0.161 500 0.970 0.005 0.026 1000 0.978 0.007 0.003 a.ect detection performance, noting that tunnel instability may also degrade the e.ectiveness of the attack.


Furthermore, the heuristic algorithm .nds trees that are very close to the minimum cost trees in both cases.

it provides a reasonable approximation to our minimum cost algorithm for these networks.


Consider the case where a node A belongs to a smaller clique in comparison to another node B, but that they are connected to each other via an edge A- B.

a has fewer interfering nodes compared to B and is likely to discover B before B discovers A.


Moreover, though the Colorado approach discussed the possibility of authenticating SNACK packets to partially address the DoS attacks exploiting the Deluge propagation and suppression mechanisms, it overlooked the authentication requirements for advertisement packets.

it is still vulnerable to similar DoS attacks.


Further extensions that are intriguing but beyond the scope of this paper include  Depending on the measurements taken by the network, the data rates at different locations of the network may vary due to data fusion.

it will be helpful to determine the transmission base  of each node as needed.


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

a general SINR protocol model is proposed to more accurately represent the interference.


For DVS, we consider an additional constraint because, in practice, there is a minimum rate below which scaling 1To simplify notation, we omit the explicit indication of dependence on time t. Figure 1: Network topology Web traffic load Figure 2: Number of Power State Transitions the link rate offers no further voltage reduction.

we introduce a maximum scaling factor f, such that f (µ)=O(µ3)for µ .


However, modern NICs have programmable processors and internal memory,enabling themtoperformpacketprocessing work for the host.

the host can dedicate more of its cycles to applications for higher performance.


If routes are changed dynamically, traf.c using those routes may experience temporary outages or noticeable delays.

more traf.c .ows whose routes are modi.ed implies a larger disruption caused by the link failure and resulting restoration.


A topology that ensures connectivity necessarily contains edges that interfere with each other.

a way has to be found to schedule the use of these edges.


This is because a processor can cross at most two di.erent segment boundaries during a single superphase.


Users can be subjected to these attacks without their knowledge because an adversary can carry them out without being visibly or physically present.

in addition, users are vulnerable even when using thebestexisting securitypractices,such asWPA.10ms 100 ms 1sec 1min 1hr SIGCOMM 2004 1.4 3.2 7.6 24.7 80.1 OSDI 2006 4.6 9.0 20.6 60.8 221.3 UCSD 2006 2.4 7.1 17.9 76.6 176.6 Table 1 Mean number of devices that send or receive 802.11datapackets atdi.erenttimeintervals attwoconfer-ences(SIGCOMM[25],OSDI[11]) and one o.cebuilding (UCSD [12]).


In other words, it is only when the relative load is high in stable networks that Epidemic underperforms both MANET protocols and sophisticated disruption tolerant protocols that intelligently route using a single copy.

the question is how far can we get if we simply .x the one place Epidemic Routing is weak in when it is forced to drop packets due to storage or bandwidth considerations.


This enables a message to propagate itself to the destination incrementally, which is an advantage over traditional message transmission ap- proaches in which the entire path from the starting location to the destination must be available.

the communi- cation protocol we propose is an application-layer protocol (rather than a network-layer protocol.)


Conventional radio chips have no problem to meet them, because the logic is implemented near the physical layer processing units.

latency in processing and bus transfers are negligible.


In TCP, the retransmission timer is estimated by the RTT value.

after a vertical handoff, previous RTT values, including smoothed RTT and RTT deviation, and retransmission timer are considered obsolete and need to be recalculated from scratch.


In this scheme, the system uses only a single path to every entity in the system  all alternate paths are ignored.

the problem of reaching a user reduces to .nding a unique path from a sender to every custodian for that user, and from every custodian to every user registered with that custodian.


Indeed, if the failures rate exceeds the robots capacity, appearedholesin theWSN will take a long time to be repaired.

the following occurred failures can t be reported to the maintainer robot and the WSN will eventually disappear.


In a static network, x s awake neighbors remain the same over time, and hence x can determine the best next hop node yfrom its neighborhood information (set of neighbors and their locations).

x can stamp the message with address y so that nodes other than y can ignore it.


However, the cross-correlation property of CDMA codes which are used for ranging process is prone to broken in the multipath fading channels, and the amount of this breakage depends on channel characteristics.

it is essential to analyze ranging process in terms of channel characteristics.


In the worst case, all the k servers have just started transmitting a packet of maximum length.


The purpose of transit domains is to interconnect stub domains efficiently.

real-world Internet type topologies generated using Transit-Stub model of GT-ITM [7] topology generator is used to test our proposed scheme, where transit domains are treated as different Internet Service Provider.


If we divide data into eight fragmental data blocks and utilize CRC-4 to protect data blocks, the probability of undetected errors is very high.


However, water requirements in the fields vary based on the soil condition (moisture, temperature etc) and the availability of water in the fields.

designing an adaptive or field specific irrigation system is greatly required to reduce the environmental impacts, improve productions and to get more efficiency.


In particular, it is possible to use entire segments (including their checksum) as a symbol.

these Luby-type codes are a very interesting extension for the segment-based schemes described so far.


In contrast, x is the receiver s clock, which increases by 32768 every second.

x is a much larger quantity than y - x with many more bits of precision.


An IDMS stores the information of where to query unknown mapping information, that is, the home information of AIDs and SRIDs.

a method is needed to find the home IDMS which stores the needed mapping information.


Let this be E(dk = 1), and simi trustlarly for those who advertised 0 be Ej (dk = 0).

the trust WTBF result is 1 if(dk =1) >(dk =0) Ej Ej trusttrust Elu FairTrust ji .


1+r1+(1+r)2 thenumberofgreenpaketsremaininginQ(f) attheendofstage2are rs(1+r)1+r+r 2 rs-rs 2+2r+r2 1+(1+r)2 thenumberofpurplepaketsremainingatthesametime are 2r 2 s(1+r)sr 2(1+r+r 2 rs 2+2r+r21+(1+r)2 andthenumberofbluepaketsare rsrs(1+r)rs(1+r+r 2) -.


The fixed values of each simulation put lenient stress on the network delays and throughput.

we obtain four scenarios: Scenario Values of Fixed Parameters Variable 1 pctb=0.05, pct~=0.1, r=100 ), 2 )~=0.06, pct~=O.1, r=lO0 pctb 3 )~=0.06, pctb=O.05, pct~=0.1 r 4 )~=0.06, pctb=O.05, r=lO0 pct~, Table 1: Four Scenarios and Their Parameters Secondly, we also simulate the static scheduling algorithm, UxDMA, specified in [17], for comparison with PANAMA in the same simulation scenarios with as many similar param- ieters as possible, such as percentage of inactive links and .channel divisions into NAMA-UN, PAMA-UN and signal :sections, where UxDMA uses a different coloring scheme for each section.


The nodes transmit by default on the 430MHz and the 2.4GHz ISM band and can not communicate with each other directly.

one computer runs a bridging application written in GNU Radio which translates messages from the 2.4GHz ISM band using IEEE 802.15.4 for the physical layer to the 400MHz ISM band with a FSK modulation, such that they can be received by the CC1000 radio chip used in the Mica2 motes.


Increases in data rate willincrease thepower requirement, whileimprovements inprocess technology andinterconnect technology willdecreaseit.

for short electrical links, we evaluate pro.les of 1, 2, and 3 pJ/b.


From this result, the delay consists mostly of accumulated and route construction times.

the whole delay can be suppressed by decreasing them.


We showthatingeneral, solutions obtained underthe protocol model may not be feasible in practice.

solutionsbased onblind useof theprotocol model may o.erincorrect resultsasthereisnofeasibility checking mechanism in place after a solution is obtained.


Experiment C : The same scenario as the Experiment B, but it is realized inside the corn crop where reached its maximum height, 285cm.

the wireless communication is performed subject to the e.ects of the canopy.


Despite this cautious set up, some users complained because they experienced an excessive battery consumption.

in the subsequent versions of the Portolan app, we decided to not trigger RSS measurement remotely.


Interestingly, use of matchings does not necessarily reduce the complexity of the problem as there can be exponentially many matchings.


In our dataset, due to asymmetric routing (see Section 2.2.3) only approximately 10% of the .ows are symmetric, where both the e-mail and the corresponding mail server reply are available in the collected traces.

we have decided to not further classify the rejected e-mail transactions.


The latter two together determine the transmission rate for the user.

for example, Sd dd = Y d/cdd(Z), where Y d refers to the size of the downlink .ow (in bits), Z its distance from the base station, and c dd(z) the transmission rate (in bits/s) at distance z in the dd mode.


Also, as remarked in the evaluation, the channel and interface selection done by the routing metric has a significant effect on the dynamic channel assignment, since only the free interfaces are considered by the dynamic algorithm, We believe that complex algorithms can offer an upper bound on the expected performance of a network, but do not fit well with the dynamic nature of multi-hop wireless networks.

in real networks, it is common to implement more simple solutions like the ones analyzed in this paper.


In contrast, Ubicarse s SAR localization can identify the global positions of the device s camera accurately, but has no information about the object.

by combining the two methods, we can localize an object to within tens of centimeters in global coordinates a promising step towards a future where we can tag or search for objects in the physical world using only our mobile devices, much the way we currently search for information on the web.


Clearly, we cannot allow the adversary to use the signature oracle to sign every bit string.

the signature oracle refuses to sign bit strings belonging to the exception set speci.ed in the protocol description.


The charge assigned to each node depends on the network topology and the traf.c conditions (through queue length 6For example, in large networks, a typical node may be connected to many other nodes, making c o much less than 1 for all iand j.Given o c o. that both Ejiand kEjkO(E)where Emaxi,jEij, c oeis ce much less than 1 for all iand j.

the approximation can be used directly for such large networks.


Without knowing the traf.c pattern, MAC protocol and routing protocol, it is dif.cult to accurately predict the concurrent transmitters in the network.

for simplicity, we assume that the probability that a node is transmitting equals its normalized traf.c demand m in the long term.


of IT Convergence Engineering Pohang University of Science and Technology (POSTECH), Pohang, South Korea {johns, jwkhong}@postech.ac.kr  cisions or access network selection.

we need to develop a more .exible and user-friendly tool in order to test mobility of mobile devices in HMNs.


Backscatter is so incredibly simple in terms of circuitry that even matching the e.ciency of backscatter becomes a challenging architectural design problem.

the crux of our argument is the following: backscatter drives down the optimal cross-over point between computation vs communication, such that communication of raw data may be preferable to computation in a wider spectrum of real-world scenarios.


As stated in Section 2, permutations are reversible using .ngerprint attacks.

in the worst case, an attacker could .rst reverse thepermutationbut would then again be confronted with the indistinguishability of hosts.


Finally,note that the objective function of the formulation Prob(Y>r-1) can be rewritten as: 2n-1   ( )() -1th th ProbY>r joutcomeProbjoutcome j=0 This is because all the 2n outcomes are mutually exclusive and exhaustive.

the objective function has a term yj wj for the jth outcome.


Fully understanding the semantic of each photo by traditional resource intensive image recognition techniques would be a luxury if not impossible.

how to identify the most relevant data and eliminate redundancy becomes an important issue.


The price pn(tn)can be interpreted as a measure of the congestion in contention neighborhood n when the total channel busy time is tn [11].

qf (t)represents the congestion in all congestion neighborhoods traversed by .ow f. It has been shown in [11] that for any initial condition xf (0),the congestion control algorithm (8) converges to the unique solution of the relaxation de.ned in (4).


Instead, we rely on the RSS value obtained from the receiver hardware.

in the case of ZigBee we set Hj,k (n) to the RSS value measured in decibel units for the jth transmitter-receiver antenna pair for packet n, also k = 1, .j as we have measurements from a single channel only.


By following a multi-hop communication paradigm data are routed to the sink and through this to the users.

multi-hop ad hoc techniques constitute the basis also for wireless sensor networks.


The second radio is the same as the single radio.

the energy used by the dual radios is: Ed = (0.36mA)(1.8V)(r - t) + (0.36mA)(1.8V)i +(0.66mA)(1.8V)q + (11.66mA)(1.8V)(2t) Figures 4 (bottom) and 5 (bottom) show energy costs (in milliwatts per second) of transfered data for biking and walking speeds, respectively.


The mapping system plays a crucial role which is how to map a node to its new location and to its Locator in the case of movement and in the case of normal routing, respectively.

it can act as the bottleneck for ID/Locator separation approach if not well designed.


Otherwise, the sever undergoes a busy period between the departure of the two packets, meaning that .i =(s+Oi)/Ci.


This is because the peak value of the background traf.c will be higher when the Peak Reduction (%) 30 20 10 participation rate is low.

according to Theorem 2, the peak reduction achieved by CoAST will be much lower.


Since every node of the ad hoc network transmits its own synchronization burst, a node has to evaluate the accuracy of the received synchronization sequences in order to adjust its own time base.

some additional information qualifying the accuracy of the time base of the corresponding node is transmitted by each node.


Moreover, because RNCs are geographically distributed, signi.cant additional long-haul capacity would be needed to collect all handover events in a centralized location.

in large 3G networks, it is only practical to collect such information infrequently or in aggregate form.


As the nodes are initially distributed randomly, it takes some time until the nodes reach astationarydistribution(cf.[45]).

along enough initialperiod shouldbediscarded.


After each round, the forwarding paths may change due to decreasing energy levels.

for all forwarding strategies, the paths are recomputed periodically.


Recall that in topology 2, Mand mi are not ready when uiis generating a busy tone.

when M is ready, all the multicast receivers are also ready.


The nodes have exchanged the veri.cation values and have established a symmetric key with each other node.

cN1 stores CH CN2 CN3 CN4 CN5 CN6 c , c , c , c , c , c and the pairwise keys.


In addition, the schemes do not use IETF MONAMI6 WG MCoA but use their own idea for using multiple interfaces.

the schemes cannot be adapted to an overlaid heterogeneous wireless network environment that consists of WLAN, WiBro, cdma2000, UMTS, etc.


In [28] the authors have found that even the simplest of the models (AR) produces a very good estimate of the current throughput based on throughput measurements in the recent past.

we have kept our analysis limited to AR models only.


The value of ti is computed simply as 2-1-it/k, and the coordinator has to send only a constant number of bits to each site to signal the end of round i.

we obtain a bound of O(k log 1/E) bits, compared to the O(k/E log t/k) scheme presented in [18].


In future design, ZIMO could be enhanced into a composite AP for both ZigBee and WiFi networks.

downlink design is needed for e.ective communications.


Since the count to in.nity recon.gures the network leading to the .ushing of the bridges forwarding tables and since the receiving end does not send any packets, bridges do not re-learn the location of the receiving end host.

bridges fallback to .ooding packets destined to the receiving end host.


According to Fig.2, each new reduced duty cycle is composed of a fixed RTS/CTS interval and a varying sleep interval depending on Ri.

if we know Ri, the reduced duty cycle can be computed as: T +T .


Second, the system must support high throughput since it may generate high volumes of traffic.

it is important for the system to achieve predictable and bounded end-to-end latencies.


This makes each FA act as either a regular FA or an MHA.

the network traffic is feasibly allocated to each FA.


The optimal solution of the linear program (1) uses the shortest path for each demand to maximize the spare capacity.

the demands connecting S and Ti follow the shortest path with k + 1 hops, rather than the longer path through the Bi nodes.


only the initial seed can serve the missing pieces shown in Fig.


250 q 200 p Lower Bound 150 100 50 Z Figure 13: Region with the same connectivity as p. 6.

sensor p can move distance z' without changing the connectivity, but it cannot move distance z without ' changing the connectivity, while z< z.


The above de.nition mandates that the number of overlapping slots should be shift-invariant.

the problem of designing optimal WSFs can be stated as follows: Problem 1.


However, the standard leaves unspecified the mechanism combination and durations.

wi-Fi card and AP models highly influence the overall handoff duration, which can vary from some hundreds of ms to even 2s, as shown in [12].


Qa,s-1.This is also true for the user u * .

qa,s that is matchedwithnode va,s.' ' frac,w x (va,s,u ) y(va,s-1)= = ra,uu .Qa,s-1 ' ' x (va,s,u ) 1 int,w = = = y(va,s) ra,u ra,u * * u .Qa,s-1 We now consider the backhaul link.


Since .ow table is a limited resource, there may not be enough space when multiple .ows are updated at the same time.

it is a viable solution to split the update process into several steps [2, 3, 4].


If there is no activity for a certain time, the node switches its radio o. before the active period ends.

nodes can go to sleep early, which further saves energy.


The same is true of many implementations of Di.erentiated Services [3].

due to the large number of queues, even logarithmic complexity can be a signi.cant barrier to implementation.


This is an effect of the increased multiuser diversity: the greaterthenumberofUEs,thehighertheprobabilitythatfor each subchannelthereisatleast oneofthemwithagoodCQI.However, thisincreaseissigni.cant only whenthe numberof usersislow.

when more usersareinthesystem,themarginalimprovement due to multiuserdiversitybecomeslower sinceforalmostall the subchannelsthereisa userwithgoodCQI.the curves seemto saturate around 18 users.


(1) For the same tra.c, the number of plots in all the picture categories is signi.cantly di.erent.

the suitable time interval for a picture from a certain category does not necessarily suit the pictures from the other categories.


CDS represents the dynamic con.guration because we allow state changes to happen.

these compartments at theApplicationLayer are not deemed entirely trustworthy, they are monitored and if their state changes(e.g., alibraryisloaded) theirtrustworthinesshastobereassuredby thepeer viachecking the new con.guration with respect to its security policy.


FACH, as a Common Channel, needs to be received by all the UEs in the cell, also those near the cell s border and hence, it requires more radio resources (power) than a DCH.

few DCHs might outperform one Common Channel in terms of radio resource efficiency, whenever the users are "few and located near the Node B.


The probability of a single packet going through without queuing is much higher than the probability of a packet pair su.ering the same fate.

by comparing the delay of the .rst (second) packet in the minimum delay sample with the minimum delay of the .rst (second) packet, we can identify incorrect minimum delays sums with the same probability as that of the .rst (second) packet not being queued in the network.


Furthermore, since cellular 3G/4G antennas have state machines for radio resources allocation and management of energy consumption, the state promotion delay (the time duration required to bring the antenna to ready state) is often longer than packet RTTs [11, 12] and might signi.cantly impact our short .ow measurements.

to avoid this impact, we send two ICMP ping packets to our server before each measurement, and start the measurements immediately after the ping responses are correctly received to ensure that the cellular antenna is in the ready state.


Moreover, the routing topology varies dynamically because WSNs are susceptible to changes in the surrounding environment.

mAC protocols for WSNs should flexibly allocate network resources, such as frequencies and time slots, to the nodes in the network.


we calculate ni approximately, i.e., ni ai-1 · xi (3) = Lai-1 · xi + 0.5J where ai-1 is the frequency ratio estimated in the i - 1th calibration.


i i=0 Consequently, the issue which the paper describes about quality of coverage service can be transformed into a mathematical problem: find the extreme value (the minimum N) of objective function (Formula 4) under the linear restrict conditions (Formula 2 and Formula 3).


Indeed, by Lemma 4.3 (i), fa is continuously di.erentiable, so its antiderivative Fa is twice continuously di.erentiable, and so is La.

by the second order mean value theorem, we obtain an equation similar to Equation (9): La(Q(t +1)) - La(Q(t )) LL ' di(t )fa(Qi(t)) fa(Qi(t )+ .di(t ))d2 = i +1 ii (t ) La 2 a(Q(t)+ .d(t)) a(Q(t )) La L a ( i di(t)fa(Qi(t )+ .di(t)))2 - .


It is also obvious that any particular set partition solution can be veri.ed in linear time.

the Heterogeneous-Rate Layer Allocation problem is NP-complete.


The extra time at the end of a reservation is usually called tail , and is a mechanism used to minimize signaling costs when traf.c is intermittent yet somewhat closely spaced.

depending on the precise timing of data streams, network usage characteristics such as energy requirements, latency and bandwidth vary widely, even within a single location.


Thus,byexploiting multiuserdiversity,the systemthroughput canbeveryhigh.However,UEswith lower CQIs will never be served.

an additional technique hasbeenintroduced,i.e.,the fairness mechanism which, as visibleinthe .gure,willprovideserviceto alltheregisteredUEs.


The smaller this angle is the further away P is from the hole and of course, the larger the angle is the closer P is.

after the second phase, relating to the considered hole all the nodes are divided into three regions as shown in .gure 3.


A consumer (C) now cannot retrieve any content from MS that has not been cached in the network, because interests for /Z/ms will be routed to domain Z.

the problem is very similar to the mobility problem in IP.


While the odds of A s packet being received at 11 Mbps are somewhat worse, they are still very good for most pairs.

although there are many external interferer pairs, their impact on performance is limited.


Traffic Trends Across Days Bytes toward Endpoint 1e+06 10000 100 1 0.01 0.0001  Endpoint ID Endpoint ID (a) Traffic from a CE to all other CEs in a VPN remains similar across multiple days.

there is only coarse grained aggregate SNMP data of tra.c on the internal PE-PE links of the service.


t1 ti i=2 (21) t1 k k · exp- .u ti dudtk.

0 i=2 f (k,n) (t1, ..., tk-1) has the same form as the solution in (19) and is given by .


The cloud environment rede.nes theTRE system requirements, making proprietary middle-box solutions inadequate.

there is a rising needfor aTRE solution that reduces the cloud s operational cost, while accountingfor applicationlatencies, user mobility and cloud elasticity.


10 000 Probe Response packets were created in 53 167 ms and the validation of 100 000 Probe Responses took 340 301 ms.

on average Probe Response is created in 0.53 ms  Probe Response are veri.ed in 0.34 ms  on a low-cost hardware such as Meraki Mini.


Also, at the end of the construction, the sum of the lengths of the dead-end paths, and the sum of the lengths of the jumped paths will be both bounded by O(n).

the total number of intermediate nodes will be O(n), and IWI= O(n).


Note that the forwarder interference not only has the signal originally sent by the previous hop, but also has the white noise from the forwarder node.

even theoretically, the forwarder interference cannot be cancelled perfectly.


Exploiting the full potential of GPUs is particularly challenging because of their unique parallel programming model, which demands in-depth knowledge of the underlying hardware architecture to support high speeds.

existing software-based packet classi.cation schemes designed for sequential general-purpose CPUs model cannot directly exploit the GPU parallelism.


7.2 Simulation Set-up: We use a 3GPP-calibrated system simulator to create a outdoor heterogeneous cellular network, with 19 macrocell sites (each has three sectors) and ten small cells per sector.

the network has a total of 627 cells (57 macro + 570 small) based on the scenarios de.ned in 3GPP 36.814 [2].


Thus,there is no directed link in G between a node representing a bottleneck AP to a node representing a non-bottleneck AP.

nodes that represent APs in F are not included in any directed path ending with a white node.


In other words, when ni|/( ni+ i becomes larger, ni becomes smaller, and |ni - ni ) becomes larger.

the errors in estimating the tail 9We experimented on many other NLANR traces, which yield similar results as reported in this paper.


This is because the larger number of channels reduces the di.erences between the items allocated to the same channel.

the side e.ect caused by the .at broadcast of the GREEDY algorithm becomes less.


Furthermore, over the proposed ESnet topology, we were able to magnify TCP s inability (particularly Reno) to adapt appropriately to congestion over high bandwidthdelay links.

the work presented here concludes that if we continue on the path that we are on using TCP Reno as the networking substrate for high-performance computational grids overall network performance will suffer.


For instance, Figure 2 indicates that most of the packets experience less than 1/4th of their expected worst-case delay.

reserving resources to cover for the worst-case delay is wasteful since it is rarely encountered in practice.


A utility function is introduced, which determines a maximum allowable node speed during each route discovery phase.

only nodes which are travelling at a lower speed than the one speci.ed in the utility function will rebroadcast.


In this case, pi (Section 3.5) will be low,and the multiplicative decrease factor could be lower than 0.5(the constant multiplicative decrease used by TCP).

in this regime, RCRT may be more conservative than TCP sAIMD, but that mechanism it not known to work well in lossy conditions anyway.


However, because bjn = bjn-1 ,then Lemma 9 implies bS = 0.

we only need to decide which channel to probe when u<ajn .


The network topology of the University is an extended star; where the central node is located in the main campus, at Los Chaguaramos.

networks of secondary campuses, research institutes and offices situated outside the main campus are attached to the central node via frame relay links.


This has paved the way for a new generation of smart receivers that are able to select the most appropriate access technology among those available.

the notion of ubiquitous services becomes extremely appealing, enabling a service to be accessible through any available access technology, and enabling receivers to choose the most suitable one, based on the QoS, connection costs, and channel quality.


Speci.cally, upon receiving bids or updates to bids, the seller device sets (tc) .lters to classify .ows into one of a .xed number of priority classes based on their resampled bids, which enables the kernel to enqueue packets in the appropriate priority queue.

we get e.cient strict priority queuing without any kernel modi.cations, with the caveat that we can only use a small .xed number of queues.


This can be attributed to the fact that video QSTAs no longer use a fixed AIFSN value of 2 which is also used by voice streams.

the voice traffic can have more frequent channel access leading to reduced delay.


Apply the design guideline "'turn contracts into ob- jects".

define a separate object per contract, providing pro and post operations for checking the contractual obligations.


For in-band measurements the BS quiets the channel so that incumbent sensing can be carried out, which is not the case for outof-band measurements.

in-band sensing requires tight control at the MAC (see Section 3.2.2.2), while out-of-band sensing is less critical.


i}i=1 are known at the base station through the N feedback channel vector, all e.ective channel gains {di}i=1 (as de.ned in Section 2.2) of selected subchannels are available in the base station.

the sum rate of the receive ZF scheduler can be further improved by using water.lling power allocation.


Remember that this last value is positive for the data generating positions, zero for the relays and negative for the sink.


Those two studies are based on somewhat arbitrary user access models and not on real workloads (although [18] uses real workloads to motivate their access models).

the accuracy of the proposed lower-bounds is still unknown.


The rules for building the recommendation are di.erent from the contextual cases.

the selection of Energy as a parameter in the goal is only complicated by the number of relationships which a.ect Energy.


each node performs a task periodically with a period T .we can model each node as an oscillator with frequency .


Railroad cars should not be hauled in just to service the WSN infrastructure, but it is plausible to service the WSN infrastructure during regular maintenance of a railroad car.

each sensor node s energy lifetime must be at least as long as the maintenance cycle of a car, which can exceed .ve years.


We consider the new time period Ti, where all .ows are mapped to their new groups as starting with the transmission of the FIRST signal.

the mapping matrix during transition phase X[ti]is simply equal to the mapping matrix of the previous time period, X[ti] = X[Ti-1 ].


Here we de.ne normalized throughput as the ratio between the measured data message throughput and the maximum measured throughput of 62.8 Kbps.

a value of 1 implies a fully-utilized channel.


In our environment it implies that, in normal operation, two consecutive ACKs are spaced by, approximately, 140 ms.

if tid is around this value, the effect of the algorithm is imperceptible.


Corollary 1 For any .ow aggregation p that enters the path at link Li, i.e., p 8 ei = p, the process {Vi(p,t)} has ergodic stationary increments.

the traf.c intensity random variable Yi,d (p) converges to xp in the mean-square sense [()2] lim EYi,d (p) -xp=0.


On the other hand, the only provably secure accountability protocols that are known to date require nodes to deploy a PKI or have shared keys, so having no PKI for FS-BGP-PD would yield no practical gains if the Internet does deploy a provably secure accountability protocol.

in the beginning stages of partial deployment of secure path vector protocols, it may be more bene.cial to deploy link certi.cates rather than have some nodes possess public keys but deploy no link certi.cates at all.


The reason for checking for 3 consecutive BPDUs announcing increasing costs is that BPDUs are sent out if the bridge has new information to announce, or periodically every hello time, which is typically 2 seconds.

it is unlikely that a path cost to the root will increase twice during two consecutive hello times, due to any reason other than a count to in.nity.


A s gateway then translates the message to OSCAR (AOL s protocol) before forwarding the message to user A. Bifurcating Presence Information: The gateway must relay the presence information for users to their base networks while updating the user s status in the gateway-to-gateway network.

in Figure 2, when MSN User M comes online, M s gateway will proxy the presence messages (as usual) to the MSN Network.


For example, many modern routers support different queuing for prioritizing real-time tra.c (e.g., VoIP, video) over regular data transmissions (e.g., Web).

in these cases, there exists very little correlation between the delays of packets that end up traversing two di.erent queues.


But this approach will degrade TCP performance when multiple traf.c sources exist because of increased routing overhead.

stale routes present a serious challenge to TCP.


Since this .eld is still in its developing stage, not many MANETs have been deployed yet.

most of the research in this area is simulation based.


For example, in our system, some sensor data was collected by the gateway through a wireless bridge while other sensor data was collected through the home WiFi network and router.

data is lost if either the gateway or the router fails.


For these protocols, the redundant copy results due to broadcast nature of the transmission.

the nodes located next to sea surface, can be located in the communication area of the more than one sonobuoy.


The number of transformations that are recorded during a given time interval is bounded by the rate at which the router is able to process the packet transformations.

sPIE aims to handle packet transformations at a rate equal or greater than the router.


In order to demonstrate the e.ectiveness of fake messaging, we assume that these messages are of the same length as the real messages, and that they are encrypted as well.

the adversary cannot tell the di.erence between a fake message and a real one.


With aggregation, although tra.c becomes slightly more uniform, it is still skewed towards the pre.x.

lFU and Pre.x2 are useful at L2 proxies.


For a given beacon, parameters which were allowed to mutate include the number of Tar and Tsr receptors per cluster and , Kof f , Kon the reaction rates for the receptors (Ka on a s ,and Kof f s ).

the pathway for a beacon has 6 parameters and the pathways for all 3 beacons have a total of 18 parameters.


Cells in the L queue must be transferred to the H queue, in order to be served.

even those cells in L queue have tags smaller than cells in H queue, the last one will be served first.


Combining both metrics, we can achieve overall link e.ciency and fairness through a common eligibility measure of a neighboring node.

we de.ne: .j =.j · .j (17) A node i having node j in its transmission range calculates .j ,0 = .j = 1.


Variables a and .i are chosen to ensure E[Xi(t)] = E[(Xi(t)- Xi(t -1))2]= µi, where µi is the required mean.

we again ensure that the variance of innovations for a .ow are of the same magnitude as the volume of the .ow, as seen in empirical studies [15].


From the results, we can see that although polling can result in better performance, we should be judicious about using it in environments that have strict power constraints.

we have the following observation: Observation 6: Except for those applications that are very sensitive to communication latencies, blocking should be the preferred communication mode for saving power.


The packet size of a probe packet is 10 bytes.

the tra.c generated by the probing process is 4 Kbps, which is much smaller than the link bandwidths used in the simulation.


Moreover in CSMA [12] like protocol, collision could carry out over time resulting decrement in service rate.

detecting congestion and necessary measure to mitigate are obligatory.


.0 = 2i log nPopt.As results, we have .i = (i +1) log nPopt, (8) 1 =i =Llog nJ.

the total transmission power of an approximate minimum-energy broadcast tree is Llog nJLlog nJ .. 3 .i = (i +1) log nPopt = O(lognPopt).


Clearly, a simple broadcast based on the connecting dominating set constructed previously will also W achieve a capacity for group-multicast at least .+1 .


It is important to note that "Maximal Source Coverage" presents a greater normalized overhead.

the need for adapting the value of the TMRA isreinforced.


Our analysis on the synthetic classifiers generated by ClassBench [4] find that 95.8% of the time the number of matching rules is no more than 10.

the number of 0  0 1 0 2 0  0 3 3 0 eqID1 eqID CBM  0 80001 0 1 91001 2 1 10 0111 23 11 12 5 OIndex (100) 15 7 Chunk 1 eqID2 17 ranges to be matched after the first stage is limited.


BACKGROUND AND MOTIVATIONS In this section, we present evidences to show that the advances in hardware technology improve bare-metal performance, but existing software is not developed to take advantage of these advances.

multiple bottlenecks and issues still exist along end-to-end data transfer paths.


However, this option is introduced mainly to achieve better medium utilization, at the price of potentially higher MAC delay and jitter [2, 9].

we do not include the CFB option in our simulation.


Given the asymptotics for the harmonic numbers, we have the bound that 1/ pe · Hn = O(1/ pe · log n).

the .nal upper bound on expected probing delay would be O(log log n· 1/ pe logn).


The trajectories change signi.cantly for distant users.

hi-were collected over a one week period to account for erarchical clustering techniques for users similar to [15] variance of RSSI signals over time.


Wehave analyzed the latency from the client viewpoint.

the latency measures the time interval starting when an HTTP client sends the HTTP request, and ends when the last packet of the HTTP response arrives at the client node Short Flows(SF) Long Flows(LF) Short Flows Long Flows 0.8 10 DropTail 0.6 8 RED 6 0.4 PLF Packet loss (%) 0.0 0.5 1.0 1.5 2.0 2.5 3.0 3.5 Packet loss (%) 0.0 0.5 1.0 1.5 2.0 2.5 3.0 3.5 PLF RED DropTail 4 0.2 2 1000 10 0.0 12 0 800 5 600 6 85 400 10 10 4 200 2 15 15 0.8 10 0.6 8 6 4 0.4 0.2 2 1000 0.0 12 0 800 10 600 5 85 6 400 10 10 4 200 2 15 15 2 4 6 8101214 2 4 6 8101214 HTTP Traffic Load (conn/s) HTTP Traffic Load (conn/s) Figure 7: Packet loss for short and long .ows.


Therefore, MN is always greater than or equal to one since every node has at least one neighbour in a connected network assumption.

total control packets transmitted per unit time would be, hN + tMN N (14) Since MN << N therefore, using MPR set immensely reduces the broadcast overhead.


This would result in a network partitioning and significantly affect the packet delivery fraction of the routing protocols.

it is even more important to study the performance of various protocols in the presence of failure nodes, which would give us guides when we design the wireless LANs.


FF s low latency cancellation technique achieve this purpose.

fF s relay acts as an ampli.ed multipath component at the receiver.


The criteria of choosing the best query execution plan lies on the satisfaction of query issuer to the best extent, in the sense that results should be available before the specified delay.

there are two obvious constraints affecting the decision making.


Hence v s routing labelisstoredinthe tree T (n(u, M -1),M -1).

in the worst case, v s routing label is retrieved by Search(n(u, M - 1),M - 1,v) in Phase 1.


In fact, our simulation consistently shows that the average number of packets exchanged to decode a whole snapshot with small bu.ers is less than 2N .

combined with the large bu.er analysis of Lemma 2, we know bu.er sizes do not change the order of GC s data e.ciency.


The remote JTAG access to the Opal nodes allows for sending simultaneous start/stop requests to all nodes within the network.

it is possible to stop the application running on the nodes and take a snapshot of the network state for further analysis.


Choosing random matchings is intractable as well.

we resort to a heuristic to pick random matchings.


Sometimes, it is possible to identify these details automatically and otherwise users may need to enter them manually.

identifying the machine speci.c and platform speci.c information is also a critical step.


For example, upon joining a overlay session, the new node needs to .rst know which nodes are its neighbors in the OG, then choose the one with the shortest distance in terms of overlay edge weight.

certain bootstrapping mechanism has to be in place to help the new nodes acquire such information.


)-1 with respect to the innovations covariance S. Empirical data has shown [15] that the innovations in .ow volumes have a variance of roughly the same magnitude as the .ow volume itself.

it is expected that [S]ii is of the same order of magnitude as Xi.


Finally, we compare two possible optimal retrieval sequences to obtain the optimal one with minimized access latency.

p = {p1, p2, p3, p4, p5, p6, p7, p8, p9} (2)  Figure 2: Convert ODR-TC to DAG p1 = {node1, node2, node7}, p2 = {node1, node7}, p3 = {node1, node4, node7}, p4 = {node1, node6, node7}, p5 = {node3, node4, node7}, p6 = {node3, node7}, p7 = {node3, node6, node7}, p8 = {node5, node4, node7}, p9 = {node5, node6, node7} (3) we develop an algorithm SAP (M) to search all paths based on Algorithm 1, as shown in Algorithm 2.


These are situations that are not typical for a majority of the population, and also tend to be in settings that usually are very wellconnected.

the measurement results are usually not applicable to more general, larger scale, user populations.


See Figure 6 (b) for an illustration of the situation where a sequence of links will be removed: all links uivi, for i = 2 will be removed.

the shortest path connecting nodes un and vn could be arbitrarily long in the resulting graph.


For query q1q2 qx, all tags which match q1q2 qx are recognized by q1q2 qx0 and q1q2 qx1.

any tag can be recognized by all the leaf nodes in the tree of the last frame.


Furthermore, to effectively prompt the bearer selection, we design the lingering index according to the following general rules: (i) the index is positive when a node is well within the target area or it is approaching it; (ii) the index is negative when a node is at the area border or outside the target area.

a negative lingering index is associated with the need to look for a better bearer.


Itiseasytoseethatthe reroutedtraf.c is upper boundedbythe capacityof eachfailed link(aslongasno link is fully utilized under the base routing r).

for every link in the network we create a virtual demand that is equal to its link capacity; the convex combination of all such virtual demands should cover the entire space of rerouted traf.c.


How- Fy ever, since we work with the (unsigned) magnitude of the Fourier transform, we cannot tell whether the person is walking forward or backward along this angle.


This .gure shows a knee around the CV of 0.3.

we used this value as our threshold to identify stable APs.


The selective monitoring reduces the overheads by identifying areas with a similar spectrum condition and merging them together 60 40 20 as a unit measurement block.

the main questions that the selective monitoring has to answer are: (1) how small or large the blocks are, (2) how to make a trade-off between ef.ciency and accuracy, and (3) how much of bene.t the selective monitoring can provide over the complete monitoring.


Some engineers advocate four slightly-overlapping simultaneous channels [17].

in the simulation the number of channels was chosen to be K = 4, with channel 1 being the control channel and the other 3 channels3 serving as data channels.


Thedefer timeisgivenby the expression 2d*C R * DTmax, where dC is the distance of the responding vehicle from C, R is the transmission range, and DTmax is a constant value expressing the maximum defer time.

a vehicle closer to C will respond sooner than a vehiclefartherfrom C.Thevalueforthe maximum defer time DTmax is strongly related to the density of vehicles traveling along the avenue, which can be estimated based on statistics stored on the vehicles devices.


In case 2, indicated in Figure 9b, at first the browser sends the Client Hello with the modified cipher suites.

the WAP gateway replies with Server Hello, which means it agrees with the cipher suites proposed by the client.


Noticethateach route-re.ectoris closerto another route-re.ector s client router.

when a route-re.ector learns a route from another route-re.ector s client,it willdiscardits own client s route.


Thus, it compensates relatively close detected targets similar to the generic M/N method.

we acquire the weight values which are added to M for subsequent N times, by mapping the detection distance to the intended initiation method trajectory.


the 0.2·11Mbps lower rate is preferred; in other words, the shorter transmission time does not compensate the signi.cantly lower success rate of the higher rate.


In basic DEAR, the objective function F(bb, p) is the revenue function; and in extended DEAR, the objective function is the revenue function divided by the number of channels.

in a spectrum auction, once the graph of bidders location is given, the allocation scheme bx is only depends on parameter bb and p. we can denote the revenue function as Q(bb, p), and Q(bb, p)= pSixi(bb, p).


However, it has been observed that in packet forwarding applications the miss rate can be as high as 75% because of poor locality patterns and cache con.icts.

any reduction in misses should signi.cantly improve the average case performance of the router.


(due to the symmetry of the construction) that variables xi and xj are set to false, while variable xk is set to true in the assignment, thus the clause c =(xi,xj,xk) is 1-in3 satis.ed, and thus the radii of nodes xi and xj are 1 and the radius of node xk is 2.

variable node xk reaches its sink tck directly and nodes xi and xk reach their sinks tci and tjc via node xk.


While accuracy increases as more samples are added to the training sets, the rate of increase slows when t = 4.

even small training sets give good accuracy, and additional training data give diminishing returns on accuracy.


Figure 1: Network architecture for IP-based herd monitoring The wireless network composed of data collector nodes is de.ned as a single IPv6 link and data collector nodes IP addresses are built on 802.15.4 short addresses following [6].

iP addresses do not change when cattle move on the pasture.


It is also easy to see that the bundle is at d at T (by de.nition 2.3).


However, shipping this data over cellular networks would be expensive.

it is best to ensure such o.oad happened over WiFi networks (available in the bus depot) [2].


A. Modelling of resources Software and hardware resources populating dynamic pervasive environments, such as that considered in Figure 1, can be of various nature.

the service responsible of performing context introspection must be able to de.ne and to handle dynamically some abstractions modelling these different kinds of resources.


However, if we look at the sensor deployment in Figure 4, it would be harder to seefor what valueof kthis region is k-barrier covered.

it is desirable to have an ef.cient algorithm for determining whether or not a given belt region is k-barrier covered.


The sender can try another super node, if it suspects its previous message might not be forwarded by a super node.

unless the adversary compromises all super nodes in the ring, the sender still be able to communicate with the recipient anonymously.


On the other hand, the l-r bits of gv(u) -2r mod q must be 0, and thus K- is the most v,u signi.cant l-r bits of q-1.


Note also that routers originally introduced as core routers are routinely conscripted into being edge routers a few years later when core speeds increase.

it is quite common in modern high speed router design (for either the edge or the core) that a single scheduler ASIC design struggles to maintain the scheduling state for a large number of queues using a bounded amount of on-chip SRAM.


Updating the schedule V The FS produces a conflict-free matching W between inputs and outputs not matched by PWWFA, which means that the sets of inputs and the sets of outputs matched in V and W are disjoint.

updating the original schedule V with the augmentation W is trivial.


If a channel is fractionally shared by m sessions, then at most one out of m sessions has a fractional allocation of 2 21 .

reducing each fractional allocation by 12 and rounding to the nearest integer, will automatically result in the channel being assigned to only one of the m sessions.


By subtracting the duration of the packet transmission and the length of the preamble we can recover the exact time at which the frame was transmitted.

to prototype our implementation of detection of hidden terminals, we used two wireless interfaces on each station in the network.


The case without a winner elected where two pri- orities are the same and also the global maximum is rare and negligible.

cRA-FP allows live utilization of the common channel in each contention context.


Although the frequency of broadcasting CBS messages vary with network operators and base stations, our studies have indicated that on an average we receive nearly three CBS message per minute.

we receive one location information every minute using CBS messages.


We state that the observed tra.c signal can be approximated by a linear combination of dictionary components.

the observed tra.c signal can be stated as, y Fx (2) = [Fnon-anomaly Fanomaly ][xnon-anomaly ] xanomaly Where the coe.cient xi .


trality of u with respect to the destination While similarity is de.ned on an ego-centric view, be d tweenness is de.ned on geodesics, the shortest paths between Uv(d) The utility of v for transporting a message two points.

the calculation needs global knowl to d edge.


Furthermore, AIPN and NGN investigate the network architecture that accommodates diverse communication media.

future wireless access networks will be composed of diverse wireless systems.


As Tarzan initiators will never choose themselves as intermediate relays in their own tunnels, unlike Crowds, the initiator is always at position i =0.

.j> i,Pr(Ii|Hj)=0; in other words, Pr(Ii|H(i+1)+)=0.


Inacluster,these machines are connected via Ethernet switches and this typically results in uniform bandwidth across machines.

systems such as Condor do not typically consider machine bandwidth in their scheduling decisions.


In its surroundings almost no capacity may be left over.

other radio communication in its neighborhood may be affected too.


Appendix I The derivation of p and q Since p represents the probability of .nding at least two nodes in a particular cell, the opposite event of it is there is no node (and this happens with a probability of (1 - 1 c )n) or only one node in the cell (this occurs with a probability of n )n-1 c (1 - 1 c , where n infers that the node in the cell can be any one among all n nodes of the network).


: P1, P3) are pushed down to the leaves.

each node stores either a prefix pointer or a pointer to the array of children.


If node 1 is unable to perform function 1 and ceases to include information related to function 1 in the HELLO packets, the corresponding Time-Stamp entry in the NMT in the neighboring nodes is not updated.

nodes 5 and 6, which neighbor node 1, recognize that function 1 of node 1 is damaged.


In live P2P media streaming, traffic dynamism is not a known priori.

one has to resort to stochastic models [7] for network optimization.


Thus, Np v provides an unbiased estimate of v. However, as discussed in section 2, the sample count of each entry is Ne = Nv + cmin,with cmin the smallest amount by which the m counters corresponding to a .ow have been raised by other .ows when detection occurs.

by estimating .ow Nv+cmin sizes on the basis of Ne,wehave that v = p ,which translates into a mean square error (MSE) given by 2v(1 - p) E[c 2 min] E[(v - v )]= + 2 .


Indeed, while the traditional tier-structure of the Internet is still recognizable and can be largely recovered, the observed rich peering fabric at this IXP enables connectivity among networks of all different types and is essentially agnostic of any tier structure.

at least as far as connectivity for the part of the Internet that involves this IXP is concerned, the observed IXP-related peerings provide a myriad of shortcuts and essentially complement any perceived or real hierarchical structure.


Moreover, SPIHT orders the bits in the steam such that the most important data is transmitted .rst.

the decoded data can achieve high .delity even with few packets transmitted.


This is because, with multi-threading, the number of memory accesses made during the time taken to serve one grows linearly with the number of threads in use and saturates at Penalt y/(C + Cont ext Swit chOverhead) where C denotes the number of compute operations performed per contextswitch, and Penalt y denotes the memory access latency.

processor utilization achieved by multi-threading is limited not only by C but also by the available memory bandwidth.


Compared to the centralized TDMA scheme, the CSMA protocol has two distinguishing characteristics: i) CSMA is an ACK-based protocol, such that the receivers are required to reply an ACK packet for each successful transmission.

bi-directional communications need to be explicitly considered when formulating the constraints on simultaneous transmission imposed by CSMA.


Causes of Duplicate-LSA Traffic In the enterprise network under study, all areas have identical physical connectivity.

it initially came as a surprise that one area saw significant duplicate-LSA traf- fic and another area did not.


In the worst-case scenario where the loss period equals µ,choosing .

= xr implies that the probability of sending a probe in a loss episode is less than 1/2x.small values of .


4.6 On the number of captured .ows In S3, .ows must be sampled at least once to get detected.

an upper bound for the detection probability for a.ow of v bytes is the probability that it gets sampled at least once, i.e.


As the assumed probability of false alarm is PFA=0.2, we approach an average of the expected number of clutters for each snapshot of the sensor node as in Equation 1. .

= PFA · V (1) for normal cluttered scenarios, we assume that we have on the average .=2 false alarm detections uniformly distributed inside the sensing region of each sensor.


Different data sources have different granularity of location information.

we use the most detailed common location for correlation purposes in Section 3.3 .


As discussed in Section 6, prior studies have shown multipath to be a dominant e.ect in the packet delivery ratio of a particular modulation rate.

we evaluate rate adaptation accuracy within this context.


Yet, in the list of items watched, serial content constitutes nearly 79.5%.

we conclude that users prefer serial content items over non-serialised or one-o.


However, since there can be several quality and spatial layers, computational cost of performing many FEC operations per each video frame can be too high.

we replicate the au- Figure 5: Authentication of a sequence of GoPs.


The routing infrastructure code is much easier to understand in the new design.

the reduction in complexity makes the code less prone to programming errors.


This equivalence turns outtohappeninthe.uidlimit, evenif the coupling ofinput processesandservicedurationsisnot exactinthestochastic and discrete queue.

it is possible to consider the .uid multiclass processor sharing queue as a single-class one and use results from the literature for this system, e.g.


APPENDIX Deriving z-Transform of Pr{M =0,U = u} Given M =0, we have Pr{N = n|M =0} Pr{M =0|N = n}Pr{N = n} = Pr{M =0} (19) [1 - pg(h, t)]nPN (n) = .

pr{M =0} the probability generating function of N given M =0 is * PN|M=0 (z) 8 n =n=0[1 - pg(h, t)]nPN (n)z Pr{M =0} (20) PN * [(1 - pg(h, t))z] = .


If we take Interval equal to L.T T I and RT T equal to R.T T I, the sum of Interval and the dead time is (L+R)×TTI.

bmini can be formulated as following: { .Ai×TTI × (L + R)., ifAi > 0; Bmini = S (3) L + R, ifAi =0.


From the following Lemma 2, we know that the payment to link ek is the same for cost pro.le d and d .

the utility of link ek under pro.le d by payment scheme p becomes p k(d ) - ck = p k(d) - ck = p k(d) - (pk(d) - d 2 ) = - d 2 < 0.


Gliders follow a sawtooth path though the water and have lower velocities compared to propelled-driven AUVs.

gliders have a constrained motion, whereas AUVs are not constrained in mobility.


An additional important consideration is that in campus networks a user can obtain service from any of the APs in transmission range.

any design may need to carefully consider issues such as loadbalancing of users across APs along with power control.


The mean relative di.erence over all 2 .ow sizes is obtained by taking the mean of relative di.erence over all possible .ow sizes 1, 2, 3, ..., z.

the MRD between the estimated and actual distribution is given by: .


Moreover, transmission range control can cause partitioning in the network because of the disconnected nodes in the WSN.

in [17] the authors formulated lifetime maximization in the presence of position dependent maximum transmission range limitations in WSNs as an LP problem.


In order to perform a fair comparison, we assume that the traditional buses have two sub-buses, each of which can be used independently.

when the communication traf.c on those traditional buses is high enough, the effective bandwidth is always 2.


Likewise, the acknowledgement packet in response to a data packet must be sent within a Short Interframe Space period (SIFS).

a tight control over the latency and timing is necessary to meet these deadlines.


In this case, peers need to receive pieces from the skipped points and need not to receive pieces before the skipped points.

we have to think of methods to determine sending peers considering the skipped points or to change sending peers when they have sent all pieces and cannot send any pieces.


InDIFANE miss packetsdonotwait for rule caching, because they are sent through the authority switch rather than bu.ered at the ingress switch.

3 In DIFANE, every packet matches some rule in the switch.


Current high-speed links in the interconnection networks require continuous pulse transmission to keep both ends synchronized, even when no data is transmitting.

the average power consumption of such links is almost identical to their worst-case power consumption.


cause that reliable transmission is used.

in SS+RT, the We de.ne the state space as S={(n,8)}, where 0:n:N is the number of consistent hops, and 8is a special variable taking transition rate from state (i-1,1)to state (i,0)becomes on values of 0 or 1 to indicate whether the Markov chain is in a fast path Markov state (8=0)ora slow path (8=1) Markov state.


In the rest of this article, we take a margin of 3.5 dB.

for the scenario clear sky , we consider that: (Es/N0)random =(Es/N0)dedicated - 3.5=8.5 - 3.5=5 dB.


The probability of a successful transmission in a time slot of epoch i isgiven by: « n-i-1 ps(i)= pi(1- pi)n-i-1 =1 1- 1 n - in - i It is easy to see that each Wi is a geometrically distributed random variable withparameter(n - i)ps(i).

n-1 n XX 1 E[W]= E[Wi]= ` = ne (4) ´i-1 1- 1 i=0 i=1 i wherethelastinequalityfollowsfrom Lemma1inAppendixA.


This precludes the use of the known full-multiplexing achieving precoding schemes.

in[15] an alternativebased oninterference alignment and cancellationisproposed.


The .gure shows that the buffering can clearly reduce the frequency of longer intervals with no voice.

the playback quality should be improved.


While focusing on trace properties of a packet (or .ow), i.e., the invariants related to the hopby-hop journey of a single packet (or .ow) in the network [11,12,18,20], is invaluable in preventing certain classes of incorrect network behaviors such as loops, black-holes, or congestion, it is far from su.cient for today s networks.

there is a need for de.ning a new notion of correctness that takes into account the sequence of observations made by the  controller and end-hosts, with potential interdependencies.


However, measurements conducted by the FCC have revealed that large portions of the spectrum are only sparsely occupied.

the traditional approach allocating the spectrum resources is coming to be seen more as an outdated policy choice than a technological necessity because of the ine.ciency in the way the spectrum is currently being utilized.


Clearly, non-detections do not admit high-con.dence estimates: we essentially have no idea where the phone went, until we hear from it again.

additional trace portions are not produced during periods of non-detection.


That is, the entries of N(S, C) are expected to be highly coherent.

we can identify a cluster with a coherent submatrix N(S, C).


If some nodes have not .lled all their available connection slots, they would still accept connections from distant servents.

intercontinental connections would therefore still be possible, although less frequent.


In this situation, wi should be zero to ensure multiple decrease.


Hence, the probability that two sensors share one slot is () .

> 1-(1 -d)d. by Theorem 3.3, the strong DC-R-WSN radius must satisfy: Percentage Connectivity 97 96 95 94 93 92 d Figure 2: Strong radius in DC-R-WSN when d varies.


4.3.2 Enhancement of the Key Generation Technique Our proposal is based on the q-RPB schemes.

we can inherit its advantages such as a host-oblivious and multi-key generation in random.


Third, UDP traffic results under mobile conditions indicate that the TCP response to the wireless conditions could be better.

finding ways to lower the gap between the performance observed between UDP and TCP-based traffic would certainly be a good topic for future research.


On(i ) consists of On(i)/d(i ) intervals of length d(i), and according to the 79 lemma, in each of these intervals the overall average latency is equal to hu(i)d(i)2/2.

the overall average latency accumulated to retrieve item i during the n-th cycle is given by: Ln(i) = ~'-~) (rn(i)2 + On(i)d(i)) (8) and the long-term overall average latency to retrieve item i is ~ven by: N(i.T)   In(i) L(i)= lira n-I (9) T-,o* T The following theorem gives lower and upper bounds forL(i).


In addition, wireless network is wide spreading in home as users become mobile and now expect to run their applications in wireless environment the same way they do over wired network.

entertainment services should be guaranteed in home wireless networks as well.


Each module communicates with the other modules thanks to a standardized XRL interface.

the handling of requests from the clients is strictly separated from the prediction of path performance and path performance prediction is separated from path measurements.


Moreover, network emulators can change the link characteristics in response to users triggers.

the network emulator should change drastically according to different user con.gurations, and it is not suitable for reproducing the process of how different problems produce their various consequences.


is a route that minimizes the total transmission time of all hops along the route.

the Application-Aware Shortest Path (AASP) algorithm is proposed to find the best path .as follows: (11) CTA.


Each sensor lifespan is associated with a cost es .

sensors lifespan could be represented in terms of t energy by Esij .


The degree to which an SDP stage must be hardware-pipelined is equal to the ratio of the required lookuprate to its access delay, which depends on its size.

different SDP stages may be hardware-pipelined to different number of hardware stages.


with decentralized network manToday s computer networks support very diverse sets of agement, service discovery becomes an important part of services, and network administrators must manage and promaintaining and protecting computer networks.


If a node in a mobile scenario is geographically isolated, it does not require access to the RF environment.

as a mobile network scenario evolves, only those nodes that are within communication range of other nodes aregiven access to the wireless medium.


Analyses show that the participation of the sensor nodes with the signal quality lower than a minimum threshold in the collaboration has negative e.ects on the quality of the superimposed signals.

to reject the low quality nodes from collaboration is advantageous in terms of signal quality and energy saving.


This has been one of the key points why business rules and geo-fences are transferred and get executed on the TREC.

besides the regular heartbeats every few hours, communication will only occur when an incident has been detected (out of temperature range alert, geo-zone change, etc.).


Furthermore, even the use of the generation function (10) does not allow us to obtain explicit expressions for the average number of messages in a buffer.

we have to explore on simulation results and compare them with the theoretical values obtained for a network with infinite buffers.


For instance, if the user mutes the audio, it is not required to send audio of a video clip.


Also, the traf.c data was captured in 1998, hence it contains no traf.c from recent applications or anomalies.

this data must be carefully used as it is not representative of real traf.c [34] and does not contain recent anomalies.


However, the main functionality lies in the deployment mechanisms initiated and coordinated by the tool.

the Con.guration Tool communicates with the Rule Management component of the framework, using con.guration events.


This observation can be explained by the fact that CONFIDANT does not use paths which contain malicious nodes; instead it tries to find other paths which are safe.

as being an on-demand protocol, more routing packets must be exchanged in order to find new paths.


Such a non-convex optimization problem has exponential complexity in the K matrix variables.


Given a counter epoch CX of length n at observation point X where each counter subvector is of length m, let tX denote the sum of all counters in CX, the estimate t f,X of the sum of all time stamps of the packets in .ow f is calculated as follows {m } L f t f,X = 1 n SX[j]-mtX (4) n -m j=1 Proof.

given CX and .ow f, we can easily obtain the values of every counter in the counter subvector Sf of f. 1 Lm Sf we can calculate E[C]as E[C]= [j].


Diagram of an OFDMA system model 2.2 Channel Allocation Methods 2.2.1 OFDMA-FDMA statistical allocation In the fixed allocation method of OFDM-FDMA for multiple user interfaces, different users will be assigned to different subcarriers and the subcarriers are assigned to each user during user operation [13].

this method is known for poor adaptability as well as no anti-interference mechanism.


However, observe that t t t t 2 i( .k-.l) 2 2 E{|A(t)|}= E{RkRle }= E{Rk}= st k,l=1 k=1 from E{e i.

}= 0 and the independence of the random variables for k = l. its standard deviation or the average v displacement of node A during time t scales as O( t).7 In other words, after a duration of time t, a node will typically v travel a distance of O( t) from its original position.


By an almost identical argument, w.h.p., Alice does not exceed her budget of Cn 1/2 lnn.

for C suf.ciently large, Alice and the correct nodes are guaranteed to reach a round where there are no blocked phases and, therefore, Lemma11guarantees thatatleast (1-o)n nodes areinformed and terminate; the o-fraction that might terminate without m follows from our observations about an n-uniform adversary.


The intuition behind this reuse distance function which increases exponentially in dig is that in the power assignment scheme adopted, the transmission power of senders with small links is scaled up signi.cantly.

scheduling small links requires an enlarged safety zone in order to avoid interference with simultaneously scheduled longer links.


We also showed that Wi-Fi and cellular network interfaces (802.11b and GSM/EDGE in our study) have energy profiles with complementary strength.

we proposed to leverage increasingly available Wi-Fi networks to improve the data transfer energy efficiency of cellular networks.


[15, 1023], WC * is a monotonically increasing function of WA.

setting a minimum WA would lead to minimum WC * .


Figure 6 shows that the average cluster residence time in case of the SERC protocol is larger than the average time in the case of the WEAC protocol.

we can conclude that the cluster topology in the SERC protocol is more stable.


However, since the test in the .eld was being carried out in a region that had an impact due to foliage, the performance assessment of SON was negatively in.uenced by an external factor (in this case, foliage).

by only focusing on the study group, one would inaccurately conclude a performance degradation because of the SON feature introduction.


We observed that a large number of replies of Refused error are sent to 1,275 local resolvers from two authoritative nameservers at 4-5am.

.uctuations in the entropies of the authoritative nameservers in Refused errors decreased and those of increased due to the skew of sending queries from two authoritative nameservers to many local resolvers in the academic network.


One single multi-hop lookup , forwarded along the requested route in the overlay, can collect all the required data.

the look-up messages differ from the ones usedby the original CAN in an important aspect: theycontain not one singlekeyto be looked up,but the whole sequence of road segments for which information is requested.


As we are assuming that all the input values B, ei,t, and bi,1 are .nite, it follows that the feasible region is also bounded, and therefore compact.

for the aforementioned problems, lexicographic maximization produces the max-min fair assignment of the sensing rates {.i,t}.


IPv6 introduces some additional features (like flow label) and the current support for QoS mechanisms in IPv6 implementations approaches the corresponding QoS support in IPv4.

a number of tests with DiffServ QoS mechanisms applied on IPv6 traffic have been carried out on a testbed created specifically for this purpose, in order to validate the mechanisms and evaluate the router s overall performance.


In the case of the adaptive array antenna, when the slot i + 1 is successful with responses from L tags, the reader read all L tags one by one.

the second subset is asked to transmit in slot i + L + 1.


For example, given an update in network state, the log-listener checked the local network state before incorporating the update.

through periodic reception and analysis of network logs, we could detect the failure of a link or failure of a node.


To create a closed multimedia conference, it is also possible to set an authentication scheme required for participation in a closed access model.

only users who present valid authorization credentials are allowed to join.


Unfortunately, we cannot predict when a transmission will happen.

a phone may pass by a monitor without transmitting anything, and remain undetected.


Internet traf.c is known to be very bursty [28].

traf.c measurements made within a short time interval are not very reliable.


In this case, a sensor running MERR selects the neighbor closest to itself just as with NC/MTE.

both algothims have equal power consumption.


With respect to the example of health status monitoring this could mean that not each single reading from the body temperature sensor is important, but only if the temperature is falling below 34 °C or getting higher than 40 °C.

it is important to support subscription languages to perform content-based filtering at the source.


Only 24% of our survey respondents stated that they do not get bored easily and would watch a video multiple times.

it is important that users are given suf.cient choice to ensure that they are provided with novel items they would wish to watch.


From the lifetime estimate of a node, we can calculate the expected number failures of that node over time .,which is l. i .

average latency of detecting failed neighbor i is t2 i + r.. the average latency of detecting failed neighbors over time .


We must ensure that all paths through the program contain distinguishing values.

each subconstraint must contain some identi.er of .. * Case (3) Assume that µ = .x .µ '.


BGP permits at most 218 = 65536 AS numbers and the number of AS intercon- nections tends to grow linearly in the number of ASes [5].

it is possible to run the cycle-detection algorithm whenever an AS updates its list of providers to ensure the conformity to the hierarchical relationships at all times.


Note that we will use these probabilities for initializing every node in the network, not incorporating any additional information about a given node or its neighborhood.

{p1,...,pq}could even be pre-computed of.ine by a role compiler and disseminated to the nodes together with the role speci.cation.


The DNS parser generates an event for every request and reply and for every answer in the reply.

the generated events allow almost all essential analysis on HTTP and DNS, except that HTTP data bodies are not exported through events.


Particularly, [4] proposes force-based algorithms to solve a connectivity and movement problem that has similar objectives as ours: maximize the number of connected nodes while minimizing the movement.

we implement this force-based technique in our simulator and show its limits.


Although ISPs hold different commercial agreements, the common charge model is based on the 95-percentile of the peak bandwidth usage of the inter-ISP links.

reducing inter-ISP traf.c amount in general minimizes the Figure 1.


In the reactive approach, a node initiates a route discovery throughout the network, only when it wants to send packets to its destination.

nodes only maintain the routes to only active destinations.


more than 90% estimation accuracy for links with the characteristics of Wi-Fi networks required measurement up to 2-3 minutes.

an attacker would need to monitor an MPTCP sub.ow that lasts up to 2-3 minutes to achieve good accuracy for such links.


That is, there is no ef.cient algorithm, especially for large graphs such as those of data center network topologies.

we resortto designing ourown algorithms basedonthe particular properties of data center structures and our real-world application scenario.


Currently, we do not actually use multi-hop transmissions in mobile k-hop clustered networks because multi-hop transmissions require signi.cantly higher overhead due to the need to discover cluster heads at a further distance away and to establish multi-hop paths on demand.

we proposed a simpli.ed routing strategy to avoid the technicalities of a more complicated one which may obscure our main target.


Considering the new figure of merit, even RR outperforms Max C/I due to better characteristics of fairness and coverage.

the new figure of merit provides a better picture on the distribution of throughput across the network.


The e.ect of corruption is further complicated by the fact that most MPEG video frames are further divided into packets before being streamed.

loss of a single packet can result in corrupted frames, and these corrupt frames can adversely impact the video decoding process.


The reason is that the parent nodes repeatedly send the data which came from child nodes.

proposed MAC protocol reduces this based on star plus mesh topology.


(R) =d} Area(R) (21) then w.h.p., we will have .

(RG) = cpPer(RG)log3/4 L for all regions RG which have boundary lying on G. we need the following lemma: Lemma 1.


..(HSMS L + H AR1) ×tout + (L + 2) ×tin .. ×2 (10) i CN1 SMSiL (11) (HSMS L + H ) ×tout + (L + 2) ×tin AR1 i As shown in Figure 4, SIP+HCoP-B omits the SIP URI allocation, SIP REGISTER and 200 OK messages.

the total number of messages for session initialization is the sum of (h)+(i)+(j)+(k)+(l)+(m) and equal to (5×2L+1-6).


In addition, nodes communicate using a radio channel, which makes all communications susceptible to eavesdropping.

sensornetwork security can easily be breached either by passive attack, such as eavesdropping, or active attacks, such as denial of service attacks, which can be launched at, for example, the routing or the physical layer.


In fact, Access time is the time from a client tuning in a channel to downloading all requested data items.

tuning time denotes that the client stays at active mode during access time, because each mobile device has two modes: active mode and doze mode.


Denote the packet scheduled by ALG by p. By the de.nition of ADV , it waits one time unit, sets used = in(p), increases i by one and the iteration ends.

at the end of iteration K -1 the claim holds, since i = 2, used = in(p) and p has remaining length of 2K-1 - 1.


But this will not take obvious in.uence on the whole mechanism because of the fading factor which can gradually recovery this kind of small error with the elapsed time.

the ATVal can be calculated as:  ATV al(s)t (t-t ) latestlatest =0.5+(ATV al(s)t " - 0.5) × ß" ARV al(o)tlatest - dsus (t-t ) latest +( ) × (1 - ß" )(5) drev Where, 0.5isan initialvalue of ATVal for each node.


The function delete deletes the region and removes its key from the key set.

to allocate an object in a region, Vault pro- vides a primitive new operation taking the following form: new(rgn) T [init] Given a tracked region rgn with key R, the new construct returns an object of type R:T, that is, an object guarded by key R. 7 this object is accessible as long as the region is accessible.


Conceptually, a node is most likely to use a .ow more recently established.

our protocol allows the use of the most recently established .ow with no per-packet overhead for most packets.


Moreover, the cycles are invariant across di.erent values of ß except for a shift of the backlog size.

the average backlog can be directly controlled via setting ß, without a.ecting other aspects of the system performance.


While separable trees drastically reduce replication, each packet has to be looked up in all the trees, requiring more memory accesses and exerting higher bandwidth demand than in HiCuts or HyperCuts single tree.

in the trade-off between memory size and bandwidth, HyperCuts trades size for bandwidth whereas Ef.Cuts does the opposite.


Note that blindly using RTS/CTS upon collisions is not a viable strategy, because the RTS/CTS overhead can be prohibitively expensive, especially at high rates.

we Figure 7: Loss patterns with interference turn on RTS/CTS only when the potential gain outweighs the overhead.


The only requirement for our method is relatively clean normal data (i.e., attack free data or noisy data whose normal data vastly outnumbers the number of attack data).

its performance prevails over both the current unsupervised and supervised anomaly detection methods.


Packets with destination port numbers larger than 49151 are grouped into a single class.

in this dimension, packets are divided into a total of 104 +482 +1= 587 classes.


The value of the statistical (chi-square) .2 (26.73) is greater than the theoretical .2.

h0 hypothesis is rejected and additionally, P value = 0.008 which is smaller than or equal to 0.01.


Factors such as the vehicular density, the road topology size and shape, and the drivers activity model all fall within the scope of movement description.

one could wonder how the results we obtained in the previous analysis are affected by these factors, and if the properties we derived hold in more complex traf.c environments.


Note that packet formats and state machines are largely separate from route processing, and that all the real magic route selection, policy .ltering, and so forth happens within the table of routes.

from a software structuring point of view, the interesting part is the table of routes.


Other mechanisms like rule-based identi.cation and non-parametric classi.ers cannot achieve both .exibility and high-quality results if applied on their own.

we propose a two-stage identi.cation system using a combination of the latter mechanisms.


For a .nite graph this holds almost surely, which means that the fraction of all graphs that deviate from the formula tends to 0 as n grows.

for a random graph, one can practically determine the desired quantity with vanishing error probability, despite its worst-case algorithmic intractability.


The probing duration is important since observations made in short time intervals are correlated.

to obtain su.ciently many independent observations, we need a su. ciently long probing duration.


The main observation is that if k is large, the delay distribution converges to a constant.

with the erasure-coding based approach, one can be almost assured of a constant delay.


The expected value of the average run size of 1s is a monotonic function of the number of tags, which means that a unique inverse of this function exists.

given the observed average run size of 1s, using the inverse function, we can get the estimated value t of tag population size t. Similar to other tag estimation schemes, ART also uses multiple frames obtained from multiple rounds of the framed slotted Aloha protocol to reduce its estimation variance and therefore increase its estimation reliability.


Finally, with respect to predictability, there is variabilityinperformanceover time, but thisvariabilityismuch smaller than therangeof di.erent APs performance, so historical information shouldbe predictable enough to compare APs.

our results suggest that a collaborative reporting service may improve AP selection.


RON routing traffic has H = 60 bytes of header information, plus P = 20 bytes of information to describe (N--1)×(H+P(N--1)) the path to each peer.

each node sees R0trrxsa.x~wL bytes/see of routing traffic.


path diversity can e.ectively reduce time-correlated losses in dynamic wireless channel conditions.


the prob- lem of the original Hong/Rappaport model does not exist which is further discussed in the next section.


The information to be gathered shall be originated from the vehicles, reach one of the access points .rst and then the processing center.

a typical scenario consists in a road intersection with an access point (AP) located, say, on the tra.c light pole and in a number of vehicles arriving at and departing from the crossroads.


Note that each algorithm takes either dc or k as an input and determine the other.

we can say that dc determines k, and vise versa.


Having developed the first version of the Agent Communication Transfer Protocol we suggest that it contains a significant degree of generality, reliability and flexibility to support agent conversations in heterogeneous environments.

the ACTP can be standardised as a communication platform for multi- agent systems.


Note that the state evolution of a path is a continuous-time process, while different .ows can be considered as sampling this process at different time granularities.

we can .rst use a probing .ow (with relatively large probing interval to reduce probing overhead) to sample the path, and then a discrete-time HMM representing the loss process experienced by the application .ow can be obtained given the sampling intervals of both the probing .ow and the application .ow.


The overall e.ect of the bandwidthhungry applications and human-centric service provisions cumulate to massive surge in data-tra.c, which will create bandwidth bottleneck imposed by regulated spectrum in wireless telecommunication.

ensuring Quality of Experience (QoE) per user will be a challenge for networks and service providers alike [2, 3].


Even if each of the nc oR-broadcasts was received by f nodes that were to crash soon after reception, nc×(n-2f ) oR-broadcast messages are destined for nc nodes.

at nc (n-2f ) least one correct node receives at least = n - 2f nc estimates.


If the threshold of candidate selection is high, a suspicious node can be excluded earlier; however, a node with no malice could be excluded prematurely due to transient network problems such as a wireless network congestion.

it is necessary to derive a good threshold value that can balance the speed of suspicious node exclusion and potential false positives.


Let us assume that for some values of p and k, GOSSIP(p, k) reaches X% of the total number of nodes.

irrespective of success or failure of search X E[C]= × [number of nodes] 100 (8) .