Whenever data is transmitted from trusted end-hosts to the controller spoo.ng identity and repudiation are a threat.

the usage of appropriate authentication mechanisms and digital signatures is recommended [6, p. 108].


Secondly, it will consume their resources.

the software should provide some value adding service.


This probability is negligible for large k, so we assume that V should expect to receive no invalid replies.

even a single invalid reply indicates the presence of a malicious intermediary on the route.


For example, in the case of web content delivered through the proxy to the user, even though the initial HTTP preambles may differ between the incoming and outgoing .ows, the web page content will still match.

we leverage Rabin .ngerprints [13, 34] to calculate the (partial) similarities across .ows.


Secondly, a simple adaptive scheme allows dynamic tuning of p in order to keep the total number of samples within a given bound.

in the context of flow measurement, the number of flow statistics transmitted to the back end system can be controlled.


However, since PBSs have mobility, coverage holes by personal-cells can occur anywhere in a macro-cell.

sINR of MUE under macro-and personal-cell scenario becomes lower than that of other scenarios.


Nevertheless, more complex routing solutions, speci.c for VANET, still follow either the reactive or proactive paradigm.

in this paper we evaluate the performance of thetwo most representative routingprotocols for the two common routing approaches, drawing conclusions that are valid also for more complex routing schemes.


For instance, if a vehicle A has received messages with IDs 1 and 2, then for every beacon it transmits, it will insert these IDs in the beacons to act as a list of received messages.

if a neighbor of A,say B, has received messages with IDs 1, 2 and 3, when it receives the beacon from A and notices the missing ID 3, it will forward this message to A.


However, these approaches are designed without considering security.

a compromised or malicious node can claim virtually any location.


Thus, we have the following theorem THEOREM 23.

with probability at least 1 - O( v 1 ), the kn log n number of multicast .ows that pass through a squarelet is at most v v v 8 10 2µ = 5 v c · k · n · ln n = c11 kn log n. by letting .i = vc12W , 1 = i = n, for some proper kn log n constant 0 <c12 < 1, then with high probability, the total traf.c load at any speci.c squarelet is at most c11c12W bits/sec.


Again, the burstiness of web tra.c reduces the number of competing .ows within the parking lot tra.c matrix.

the throughput of the fair shares of web tra.c is over twice that of the statically rate limited, fully backlogged download scenario.


For example, our study could be extended to a wider class of routing geometries, theoretical bounds could be derived for many of our simulation results, and the impact of a routing geometry (and in particular its symmetry or the lack thereof) on the cost of maintaining the associated overlay structure should be studied.

we view our paper as only the .rst step in a more fundamental investigation of routing algorithms.


The pre.x DAG, taking only about 180 KBytes of memory, is most of the time accessed from the cache, while fib_trie occupies an impressive 26 MBytes and so it does not .t into fast memory.

even though the number of memory accesses needed to execute an IP lookup is smaller with fib_trie, as most of these go to slower memory the pre.x DAG supports about three times as many lookups per second.


We apply our reduction technique on the scenarios considered in [8] and find that our results agree with the simulation.

one could have chosen among the [8] hierarchies analytically.


The number of levels in a hierarchical network is O(log(N)), where N is the network size.

the average communication and storage overhead for maintaining the hierarchical network is v O(log(N) · CLa ).


Another prevalent characteristic is the use of multiple recipient emails sent using unveri.ed email lists.

this leads to the highest email rejection rates (24%), and highest bounced CAPTCHA requests.


As a result, using this approach means that the video would have to be simultaneously transmitted on all paths, which is clearly an unacceptable requirement.

we cannot rely on such closedloop quality estimation approaches and must instead investigate open-loop solutions.


It sends a trigger-packet over the Teredo server to host H, which then opens a new IPv6-over-IPv4tunnel to the Teredo relay.

from then on, the relay node is able to relay IPv6 packets through the NAT box to host H. initial packets of a communication experience a signi.cant delay until a context in the NAT box has been established for the relay node.


6e2(n - 3)2 The right hand side is larger than 0.11, while the left hand side is less than 0.11 when a = 4.17.

a = 4.17 leads to ps * <ps * , a contradiction.


However, because nodes periodically sleep and the contention window is a constant, most nodes are largely inactive until something is detected and the chan nel access cannot adapt to the change of network tra.c.

although S-MAC greatly reduces the energy con sumption and achieves good scalability which are two most important issues in the MAC protocol design, the through put, fairness, latency and bandwidth utilizaton of S-MAC are strongly weakened which impleads the application of S- MAC.


Inthis scenario, whentheHsensors broadcast their geographical position, a higher number of L-sensor will receive this message.

aL-sensor will compute its position based on mixed positions of H-sensors and L-sensors and the error in position estimation will be small.


The node illustrated in Figure 3(a) is an embedded system based on a VIA Epia Board, equipped with a PCI-to-MiniPCI expander thatpermits to install up to four MiniPCI wireless cards.

this node can act simultaneously both as router and access point.


Since what is being considered is the channel gain of the primary link, the SU can allocate more transmission power when the primary link channel gain is large than the transmission power of the SU under the interference power constraint for interference temperature.

the SU will have more opportunities to transmit its signal in accordance with the channel condition of the primary link than under the interference power constraint for the interference temperature.


Every time a node forms a link, it has probability 1 of becoming inactive (and thus forming no more links).

2 the probability of a node having more than C incident links falls exponentially.


Therefore, when a new route is re-complexity limits their use in these applications.

quired due to topological changes, the computation and con-it is necessary to derive a composable control scheme, where trol con.gurations must also be recalculated.


The T-IP private key should be generated with the lifetime control.

the T-IP private key can be generated by applying IBE technology to a string combining the IP address and a period of time [2].


The exchange may be compromised with an active manin-the-middle attack.

resistance to eavesdropping and injection attacks is critical.


After deleting a sensor node from the convex hull, it takes O(log2 n)time to reconstructthe convexhull[14].

thetotaltime complexity of the convexhull construction and mainte  nance is O(n logn +log2(i-1)) = O(n log2 n).


It is important to note that in experiment groups with noise existence (10% to 75% deviations in client demand probabilities), proposed algorithms reported similar results.

our method is efficient enough in noise existence.


Due to BAP s underestimation of the delivery ratio on an asymmetric link, ETT with BAP overestimates the transmission time over the asymmetric link.

eTT with BAP always takes a detour via B in the topology T3, consuming more network resources (e.g., BAP s Nd Nt is only 0.574 in Table 1 (b)).


This category of algorithms is still not implemented, but scheduled for this year.

we just implemented a faked localizationalgorithm where thecoordinates of the nodes are hard-coded with their positions in our test bed.


If we associate each color with a transmission slot, every node gets one chance to transmit in n1 slots.

the average transmission rate of each node is: W .


In this case, even if the average queue length of DAP1 is the same as that of DAP2 as 0.5Mbytes, it amounts to 50% of the queue length of DAP1 while the average queue size corresponds to only 0.05% of the DAP2 s queue.

we must consider both the average queue length and the maximum queue length of a DAP to represent the relative congestion level of the DAP compared to those of other DAPs.


the sequence B1 i (t0) since the stopping rule {N1(t0)= n}is completely determined by the information up to n+1 n+2  time n, and is unrelated to B1 (t0), B1 (t0) and so on.

wald s equality [1] can be applied to (37) to yield E[Z1(t0)] = E[N1(t0)]E[B1(t0)].


Events triggered by a fault are typically generated by a small, constant-size subset2 of nodes that are topologically related to the faulty node.

each event arriving at the NMS only needs to be correlated with a small, constant-size subset of events in the cache, yielding a linear complexity of event correlation.


However, in a TVC network, x may not know the current best next hop node y, because the subset of awake neighbors changes over time.

x may not be able to put any speci.c next hop address in the message.


To reach their respective destinations, data packets which meet a void are delivered in FT-SPEED by using only nodes on the boundaries of voids.

these nodes will consume much energy and the void area will be able to increase.


Even in the same femtocell, one user may suffer from larger competition than others who enjoy a larger bandwidth.

resource allocation without considering link contention level (e.g., [12, 3]) is insuf.cient and may result in a waste of resources.


THE MEDUSA MODEL We give here a short summary of the MEDUSA model, whose basic idea is to quantify the level of satisfaction for each of the N users, which depends on both the perceived QoS and the price paid.

for each user i, an Acceptance value Ai = [0, 1] is de.ned, that depends on the utility ui and on the paid price pi.


Similarly, tasks that are usually done using the pen in an actual Palm are also performed using the mouse.

when account- ing for power and energy consumption of the pen and key components in the emulator, we need to keep track of mouse events.


The registration and noti.cation delay of the JXTA-SOAP communication is sensible greater than the others.

it was not plotted on the graphics as it is not comparable to other models measurements.


for each .xed physical location we sample SS measurements from all APs for eight di.erent orientations and consider them as eight di.erent points in the RM.

if n physically distinct points are selected, the RM consists of 8 × n points which we call o.ine or RM points.


Note why the test did not make use of a real network tool (like tcpdump, Etherealor Snort) is that these tools tend to execute a lot of display and I/O operations that hide the weight of actual packet acquisition and processing.

they are not suitable for the goals of this paper and have been excluded for lack of space.


This node is referred to as the relay group root.

routing a message to a groupID is effectively performing an anycast to the relay group members.


This results in low-resolution shadow maps, making gesture recognition more di.cult.

we need to recover the full observation data from limited samples.


The algorithm Max-Split-Welfare has a running time that is exponential in f, but runs in poly- nomial time for any fixed L We here demonstrate that if is given as part of the input, then the problem becomes NP-Hard to even approximate.

we should not expect a significantly more efficient algorithm for max- imizing network welfare in the split session paradigm.


Unfortunately, the calculated BI of 802.11 can vary in a wide range because it is randomly selected from a range which can be expanded exponentially for each collision.

it is di.cult to estimate the next transmitting time which is important for QoS-sensitive applications.


If it responds, information about the new node is not stored, otherwise the stored information about the least-recently seen node is replaced by the information of the new node.

an old node is only evicted from the k-bucket if no recent messages have been received and if it fails to respond to PING requests.


5.2 Replay attack In the improved scheme, each entity generates own timestamps, TMU, TFA,and THA in authentication phase, to prevent replay attack.

even if an attacker retransmits the intercepted message, MU, FA and HA can easily detect it by checking those timestamps.


Because the negotiator needs to be available on the default channel at all times, a design decision we made was that a negotiator does not route tra.c (routing tra.c would entail switching channels).


Distribution AIC AW Exponential 297,340 0 Power law 262,410 0 Gamma 258,960 0 Truncated Pareto 245,890 1 Weibull 253,800 0  dent of the locations at the initial time.


If a MN can receive a strong signal from a BS, the MN must be close to the BS.


We de.ne the load induced by user u on AP a to be Clearly,the NBV of a fractional max-min fairness allo cation always has the same or higher lexicographical value than the NBV of the integral max-min fairness allocation.

we will use this property to construct our solution for the thetimethatisrequired of AP a to provide user u atra.c volume of size xa,u · wu.user u produces a load of integral-association case.


although an artifact of our setup is the inability to usefully probe or transfer data during the .rst few seconds following an association, we are able to carefully characterize and analyze performance over the remainder of the association.


Instead, we normalized all protocols to consume the same amount of energy and compared theperformance of all of theprotocols when they operated at the same duty cycle.

our results show how di.erent protocols perform in terms of latency when they use the same amount of energy.


Furthermore, in the next three subsection, we evaluate the performance of the metrics (b), (c), and (d) by setting k=10.

based on the Chi-Square distribution table ([16]), we obtained the critical value 200  5.4 The impact of the number of nodes We investigate the effect of the variation of the number of nodes in our analytical model and confirm the results against simulation using the Chi-Square test.


1 - pu,x1 =0 if the joint distribution of xk is the product of a marginal distribution with an indicator function, and the two marginal distributions are identical, we can infer that both sni.ers observe the same set of users.


While the previous prediction method [21] with SVR uses both measurements of data transfer and the network metrics, the SVR predictor uses the actual throughput for the connection pair only.

it is much simpler than the previous method.


The same holds if the receiver is closer v X dra X a · .r than ß to s1.

there are two hyperspherical 1 jj I = = da da areas blocked around sender and receiver of request 1.


Given that the power-law distribution topology has out-degree exponent: the frequency fd of an outdegree d is proportional to the outdegree to the power of a constant, i.e., fd = Ndc,where N is the proportion constant.

assume that end hosts have degree 1, then the number of end hosts is N. If c< -1, then M-1 dc M = N (9) d=1  M-1 = N1+x c dx(10) 1 8 = N1+x c dx(11) 1 1 = N1 -(12) 1+ cc = N (13) 1+ c N 1+c the fraction is at least =1 + 1 .If c =-2 M cc N =1 then .


We assume that 802.11 media access control protocol, CSMA with RTS/CTS/ACK is used to protect unicast transmissions.

as a result of carrier sensing, a transmission between u and v may block all transmissions within RI away from either u (due to sensing RTS and DATA) or v (due to sensing CTS and ACK).


While dual-radio sensor platforms (e.g., Stargate1) are feasible, the cost is still much higher than a single-radio platform (e.g., Berkeley motes series).

the cost of deploying a large number of dual-radio nodes in sensor networks is prohibitive.


However, this would adversely prolong the migration tour.

there is an inherent tradeoff between the number of sensors to be recharged and data gathering latency.


The key point of our scheme that prevents this is the time asymmetry in checksum veri.cation: A node uses a checksum to verify only packets that are received before the creation of the checksum.

unlike traditional hash functions where the attacker has a chance to .nd a collision because he has the hash value, in our scheme, the time asymmetry in checksum veri.cation prevents the attacker from computing a suitable polluted packet that will pass the veri.cation algorithm.


In this way, region-based forwarding also exploits the advantages of the geographic network area.

dead-ends can be addressed in the same way as in case of forwarding toward geographically-de.ned nodes.


A set of these slivers participating in the same activity at different nodes is called a slice.

planetLab consists of virtualized nodes on the Internet.


AA A T A  With a constant but high set of attenuation values at each attenuator position, one can imagine a situation where each node can communicate directly with only two neighbors: one to the left and one to the right.

the node at one end of the network can reach the node at the other end in five hops over the network.


an agent is connected to a node, has a .xed location and deals with incoming and outgoing traf.c, i.e., packets.


Complexity in setting up simple communication scenarios would present a major hurdle in technology acceptance.

the goals for the design of end-to-end abstractions in our network service architecture are: Develop simple speci.cation and composition mechanism for network services,  Use familiar functions for connection setup and data operations, and  Provide abstractions that can make full use of the capabilities of service-enabled networks.


much space for us to reduce bandwidth consumption by using more e.cient multicast schemes.

it worths much e.ort to design e.cient reliable multicast schemes for wireless networks such that we can reduce the bandwidth consumption of these applications as much as possible.


Due to these stochastic e.ects, in order to compute a statistically meaningful value for the WSN performance factors, each evaluated WSN topology is simulated multiple times with di.erent random seeds.

since the standard error of the mean of an n-dimensional sample whose variance is s is v s/ n, and applying the central limit theorem to approximate the sample mean with a normal distribution, a sample size n =16s2/W 2 guarantees a 95% con.dence interval of width W .in order to guarantee con.dence interval W = s regardless of the actual value of s (which is not constant in the search space) we always run n =16 simulations per each WSN evaluation.


From an application s point of view, however, aggregated data is presumably of higher value than a single stream of data.

we would expect the application  Reliability (BER) Time (s) 10-9  Figure 8: Dynamic voltage scaling enables latency scalability Range (m) for Viterbi decoding.


11(a), during morning and evening, cranes generally do not .y and stay in their territory and roosting site, respectively.

x-axis acceleration can be used to reveal posture since the walking speed e.ects are negligible compared to gravity.


Importantly, these assumptions allow us to view the ALOHAlike neighbor discovery as a Coupon Collector s Problem.

the time to discover the n neighbors is the same as the minimum time to collect at least one of each of n coupon types.


INTRODUCTION The network evolution has been recently characterized by an increasing need for higher bandwidth availability and resource management .exibility, in order to cope with new functionalities and features coming from emerging applications and services.

one of the main challenges Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Mobile stations may contend simultaneously for medium access.

transmissions of packets from distinct mobile terminals are more prone to overlap, resulting in packet losses.


Since vehicle density changes over space and time, the measure of the density over the entire road segment does not reflect the local traffic conditions experienced by vehicles.

to measure local densities, the entire road segment of 1km is divided into short sections of 150m length each.


The algorithm keeps a multidimensional control array which contains caller_ID, Tdelay, Loss, R1, R2, Rmean values to enable sudden calculations and reactions without waiting for the next RTCP feedback.

algorithm processing time will be milliseconds.


To deal with this increased complexity, we have to measure the SIR more than one time to verify the successful reception of just one packet.

the SIR condition must be in fact veri.ed for every superposition of interfering packets which occurs during the reception of link e. .rst of all, we sort the interfering packets in non-decreasing order of arrival.


This might be explained by their RTT distributions, where 4MB and 8MB .ows tend to have higher RTTs.

when a packet is out-of-order, it needs to wait for the later arriv  1 5 10 50 100 500 1000 Out of order delay with log scale (milliseconds) ing packets from the slow path (in this case, the cellular network).


We combine the two scores to an Figure 6: MOS scales used in this paper overall one as follows: z = max {0, z1 -z2 }.

if z1 is good (i.e., due to negligible loss and jitter), but the z2 is bad (i.e., due to large delays), then the overall score z is low, re.ecting a poor quality and vice-versa.


If i< j -1, v s parent node is n(w, i+1) .Yi+1 by Definition 2.7.


[8] have shown that 75% of users do not view more than the top 20 results and most users are interested in at most 5 results per query.

the Thedu proxy needs only to pre-fetch top documents for a high probability of satisfying the user.


F where T0 and T1 are the events the guess bit b ' is equal to the challenge bit b in games G0 and G1, respectively.

by the Di.erence Lemma [13], | Pr[T0] - Pr[T1]|= Pr[F ].


In addition, the shortest path from ni+1 will not go back across the incoming link, li+1.

the cost of ni+1 in the graph Gli+1 is the same as in G. Combining these facts we have cost(Gli+1,ni+1) <cost(G, ni).


Recall, however, that the optimal value for .s depends on the state of the operator, thus we further collect this state information from the individual operators.

the sources of the determined event streams are forwarded to the root of T , which can determine from the collected set of sources the subtrees of T which require a recon.guration of the operator tree.


However, we believe that, in order to obtain a concrete proofof conceptofthe sharingparadigm,itis mandatoryto assess itsperformanceinrealisticsituations,i.e., withalargernumberof nodes and a wider range of applications.

the support ofapropersimulationenvironmentisfundamental forhigh-quality appliedresearch.


Even for L = 1 (i.e., when there is no link layer retransmission), the queueing delay is fairly large.

throughput (packet/time unit) 2 1.5 1 0.5 accurate estimation of the queueing delay is very important for calculation of TCP throughput.


On the receiving side,thegeonetworking layerbuilds aMACframe tobedelivered totheIPv6layer, wherethesourcelink-layer addressisgeneratedfrom thegeonetworkingidenti.er of the source.

the IPv6 layer believes that the other nodes in the VANET are attached to the same link.


The problem (3) cannot be solved directly, since the functional form of the performance measures are not explicitly known for any realistic system.

we have to construct estimators for these either based on models of the real world , or prior knowledge from, for example, earlier deployments.


In this case, with a¯i (r), node i is still not on the packet forwarding path, be cause increasing an upstream neighbor s cost to reach a node cannot move this node itself to the lowest cost path.


As mentioned above, the ARQ works on the top of the basic MAC functionality.

once the BS allocatesadataburst,theARQ mechanismstartstoutilize it in excatly the same way as the non-ARQ connection does.


3.1, an overlay edge in G(m) is directed from a node v to vnew if v can serve as the parent of vnew to retrieve data from.

all nodes which have an overlay edge directed towards vnew are its candidate parents.


Moreover, it has long been understood that network-layer fragmentation is detrimental to end-to-end performance [27] so modern network stacks implement automatic MTU discovery to prevent fragmentation regardless of the underlying media [30].

we believe that our encoding will interoperate seamlessly with existing protocol implementations in the vast majority of cases.


mobility, growth of DFZ routing tables, multihoming), even though it is not the only option.

it is more and more deployed by ISPs and web service operators (like Google, Facebook, Microsoft, etc.)


In addition, it can avoid the starvation of lower priority service classes such as nrtPS and BE.

aDPQ is a more efficient scheduling scheme for transmitting real-time applications than DFPQ and PDFPQ.


For the Hello technique, however, the increase in collisions is quite dramatic (Figure 9 (c)) because of large and periodic (every second) broadcast hello packets.

the ef.ciency of the MAC layer is negatively affected resulting in more number of unsuccessful transmissions and triggering of link failure signals to the routing protocol.


Clearly, an EPC Gen 2 tag does not perform any operation related to sensing.

sensor sampling, data migration, bu.ering, and other tasks would incur additional overhead.


On the transmit side, the hypervisor or kernel knows where the packets originate from, and hence can support fair sharing in software.

a hardware lane does not require its own dedicated transmit hardware rings.


the new keys are generated, i.e., P and Q are .xed after key generation.

the partition of N into P and Q needs to be done only once, before the RSA computation starts.


There, pl is optimal during the first and third time intervals, and p2 is optimal during the second and fourth time intervals.


2.2 Average Trajectory Durations in Ad Hoc Networks A basic assumption in KADER is to assume that nodes move following a linear trajectory, then predict to update the topology when a trajectory change occurs.

kADER scalability is highly dependent to the number of trajectory changes (or transitions) per unit of time, thereafter called (.


And assume packets from each node i in a speci.c group must be delivered to all the other nodes within the group.

any two nodes within a same group is a pair of sourcedestination.


Lastly, nothing but real data will suit the needs of the incident responder who must share data about speci.c attacks under investigation on real machines.

there is a high demand for methods to share real log .les and network traces within several communities.


There are only35K ASes on today s Internet[7], whilethe number of compromisedhostsinvolvedin a DoS attack could reach millions[17].

compared toper-host fairqueuing,NetFence can signi.cantlyreduce the amount of state keptby abottleneck router.


Each node limits its routing table size by evicting neighbors that it judges likely to have failed: those which have been up for only a short time or have not been heard from for a long time.

high churn leads to a high eviction rate.


first,if an uplinkpacket Pu fromclient(UE) totheservertriggers a statepromotion, e.g., from IDLE to DCH, which happens before Pu is capturedbytheGGSN.theGGSNrecords a later timestamp than the actual arrival time of Pu as shown in Figure 8.


transmission links and current data switching technology allow easy handling of the first two factors.

deployment of high performance routers to forward packets is the key to the success of the next generation IP routers [1].


Two are the main types, deterministic and probabilistic.

5.1 Deterministic Techniques The selected format for summarizing the SS samples from a given AP is a single scalar, usually, their mean value and the metric for testing the similarity between an online point i and an o.ine point j is the sum of the absolute di.erences of the mean values of the SS from each AP m. if denotes the average formatting operation, the similarity metric is given by kff di,j = |Sj,m - Ri,m| (2) m=1  5.2 Probabilistic Techniques The probability distribution of the sample values from each AP m is stored as the SS information for each o.ine point in the RM, i.e.


All transmitters shall send data at the same time, but using disjoint sets of OFDMA subchannels, which translates into an interference-less transmission.

the goal is .nding the aforementioned sets of subchannels which maximize the performance in terms of BER, SER and CAP.


observed some highly volatile dynamic IP address ranges, which they attributed mainly to dial-up hosts [54].

we expected to .nd typical session lengths of several hours.


However, the average number of transmissions per packet is approximately 8.

the average link quality is less than 50% in both cases.


iµ Z i-.i Notice that, due to the help of secondary user, the departure rate of primary packets becomes larger as (14) shows, which may counteract the e.ect of rate reduction caused by packet collisions.

the action of relaying packets for primary users makes more channels available for the secondary user.


5.3 Routing Protocol Considerations In source routing protocols, e.g., DSR [12], each datagram at the network layer contains the entire list of nodes in the route from the source to the destination.

a node X can recognize whether its downstream node Y correctly forwards a packet p to Y s downstream node Z. Node X operates in promiscuous mode.


repeatedly receiving these responses implies that the IP pairs are likely to be aliases.


In addition, phase 2 consumes O(Ni )throughout the non-cooperative sample exchange task and O(i)for distributing the gathered sample measurements throughout each set.

the schedule length for this policy, SL(Two-phase Coop), scales as O(i +Ni )slots.


Fortunately, for the loss processes we target, the probability of having very long loss bursts is typically small.

the above simpli.cation should not signi.cantly affect quality estimation.


We observe time-series (l,c) signal yfor the data at link l and for characteristic c.  After performing the Penalized Basis Pursuit Algorithm on (l,c) the observed time-series network signal, y, we obtain the estimated signal energy relating to the anomaly energy from (l,c) Equation 8, denoted by yenergy.

for each link l, y we would have an estimated anomaly energy vector for each observed characteristic of the link.


there-synchronisation required after a sleep period, nor have they explored the effects of asymmetric wireless links in dense networks that means many of the synchronisation messages may be missing.

we propose EBS, a distributed .re.y based synchronisationscheme, which issimple andguarantees fast synchronisation within a given error tolerance window in thepresenceof asymmetricandlossy wireless linksindense networks.


With resource-based provisioning, the vertical dotted line in Figure 4 shows that depending on channel conditions, .xed resource blocks result in di.erent amount of bandwidth, and hence di.erent utility.

a slice must be more sophisticated to dynamically admit and schedule .ows (much like traditional cellular basestations), and plan for the consequences of variable achieved bandwidth.


When ..>1 (i.e., far-deadline flows), .. increases rapidly even with small increases in .., and approaches 1 as .. catches up to 1.

even minor congestions cause rapid reduction in far-deadline flows window sizes, but severe congestions do not penalize the flows any more than regular TCP or DCTCP would.


Obviously, the Data Transfer phase constitutes the main phase of the multicast packet forwarding mechanism.

in the following paragraphs, we describe the exact steps of this procedure: 1.


Consequently, because of these dependencies on numerous dynamic factors, the data transmission capacity cannot be determined in advance.

the constraint de.ned by Equation (3) cannot be determined in advance.


In this case, the tracking bias can be estimated from the offset of the intersection point of EP and LVL ( EP is the line to join E to P; and LVL is the line to join L to VL).

to compensate tracking bias efficiently, either of offsets of the intersection points has to be chosen.


(1/4, 10) = -1 dB show the same spectral SNR.

the penalty of nonuniform sampling with .


However, we cannot prove or disprove the bid-monotone property of the allocation method DCA (presented in Algorithm 2).

it is unknown whether we can design a truthful mechanism based on this method.


1) the packets from legacy networks are bu.ered at the ingress nodes and aggregated into bursts based on Forward Equivalence Classes (FECs) in what is often called a bursti.er.

an OBS simulation model should allowtheinteractionbetween apacket datanetwork(e.g.


And vertical handoff is really an open and challenge issue in this area.

in this paper, a multi-step vertical handoff mechanism (MVHOM) is proposed for a cellular multi-hop network (CMN).


Then, this bandwidth reduction could lead to a situation where the available bandwidth per user will become lower than the one subscribed between the user and the network operator.

we define the Bandwidth Violation Ratio (BVR) [19], which measures how well the user subscription contract is being respected by the network operator as follows, C 0 if =B N BVR = CC .


Large chunks of radio spectrum are left idle most of the time at a lot of places, while new wireless applications are starving for the radio spectrum.

an open and market-based framework is highly needed to dynamically redistribute the radio spectrum, and thus improve the utilization of the radio spectrum.


In the all-terminal reliability case, this is not the case.

a network resilience measure should be used if network nodes are subject to failure since the all-terminal reliability measure does not consider node failures.


The rationale behind thisdecisionisthatsomeplatformswhere Wiselibisintended to be deployed (see Table 1) do not support dynamic memory or, when they do, incur into fragmentation issues.

we have preferred to not use dynamic memory as long as possible and stick withthepSTLdatastructures, whosesizemust begiven at compilationtime.


Unlike other SDN architectures that allocate at the granularity of .ows [2, 8], Blender allocates resources to tenants as a whole.

blender needs to ensure two important forms of concurrency control.


Then, the time-domain version of the PI controller becomes: p(t)= ß(Tq(t) - Tq * ) - .

(Tq(t - 1) - Tq * )+ p(t - 1), (19) in the new version of PERT, the only change is to replace RED emulation (4)-(5) with the PI controller (19).


reader ACK the tags whose messages have been decoded, so that theyremain silent in subsequent time slots.To silence the tags, the reader would at least need to ACK by echoing the temporary id of each decoded tag.A back-of-the-envelope calculation based on the EPC Gen-2 standard suggests that a 75% overhead on top of the uplink transmission time is necessary to silence these 14 tags [14].

the cost of silencing individual tags seems to outweigh the bene.ts, and soBuzzavoids sucha design.


Furthermore, the hardness result from [10] applies to a network where the routing depends on which nodes are enabled, even if the cost of enabling those nodes is zero.

unless P = NP, we must either make some restriction on the choice of routes, or take an approach similar to that of [17], which considers approximation algorithms for other pricing mechanisms in the simpler network model.


However, the programming interfaces are not fully opened up.

we build our own hardware platform Genius-on-the-Go (GoG), to demonstrate the potential of FM radio.


Notice that, in general, performing operations on the DPI service instances rather than the middleboxes themselves is easier as most of the .ow s state is typically kept within the middlebox, while the DPI instance keeps only the current DFA state and an offset within the packet.4 Finally, we note that allocation, de-allocation, and migration affect the way packets are forwarded in the network.

the DPI controller should collaborate with the TSA (and the SDN controller) to realize the changes and take into account other network considerations (such as bandwidth and delay).


In our proposed scheme, we use the eavesdropping mechanism [8] to thwart malicious nodes trying to alter message packets.

each node can ensure the integrity of the transmitted data.


A radio range r0 covers an area A0 = pr02 .

the probability that a randomly chosen node has n0 neighbors is ()n0.pr02 2 0 P(d= n0)= · e -.pr(15) n0!


In our case, this situation arises because with above condition, it is possible to have two connected nodes whose radios are assigned such that there is no common channel between them.

clica in such case does not preserve the topology.


However, the server might have no information for some BSSs because of no activities of MSs in the network.

the handoff procedure varies according to whether or not the MS received ASIs containing nearby AP information from the server.


These issues deserve more attention because non cooperation could annihilate the entire advantage of the ad hoc capabilities.

there is a need for controlling the network-layer operations performed by the other nodes, including the forwarding.


algorithm grows asymptotically with O(logM) (Lemma 3 and Theorem 4 in CW[9]).

the average contention window size, E( C(0) ), is bounded by K·logM E( C(0) ) <CWmin ·2(43) CW , where CWmin is the initial window size (whose default value is 32 in IEEE 802.11) and K is some arbitrary constant (K> 0) 2 .


We assume a variant of the Dolev-Yao network attacker model (explained in Section 2.2).

these two proof systems are well suited for reasoning about network protocols.


Finally, the scheduling decisions in WiMAX networks havetobe madeina timelyfashion sincethe scheduleis typically disseminated once every 5 - 10 ms which is the typical order of magnitude of coherence time of the channel[20].

the problemof schedulingforfair-rate allocationinWiMAXrelaynetworks poses several unique challenges.


Moreover, they could easily be adapted to network using directional antennas whereas reputation mechanisms are mostly based on monitoring communication of other nodes.

we focus on virtual currency mechanisms and more precisely on enhancing two well-known protocols: the nuggets [2] and Sprite [3].


However, with the rapid growth of different types of users (in the terms of coverage range, transmission power, bu.er space and bandwidth), heterogeneous DTN is a trend in the further.

to provide a guide for this work, this paper focuses on exploiting the in.uence of infostation system on DTNs.


The total cost for group g(v) is B(g(v))(deg(v) + 2), for a total welfare of I for each such group.


The Emulab microbenchmarks indicate Percent packet loss Percent packet loss 16 14 12 10 8 6 4 2 0 UDP traffic rate (Mb/s) (a) With default share 2 1.5 1 0.5 0 0 5 10 15 20 25 30 35 40 45 UDP traffic rate (Mb/s) (b) With PL-VINI Figure 6: Packet losses in IIAS on PlanetLab that CPU contention in particular is likely to be a problem for PL-VINI on PlanetLab; however, PL-VINI uses CPU reservations and real-time priorities to provide consistent CPU scheduling behavior.

we run our experiments from Section 5.1.1 using Plan-etLab s default fair share ( IIAS on PlanetLab ), as well as a 25% CPU reservation plus a priority boost for the IIAS Click process ( IIAS on PL-VINI in the tables and graphs).


Rearranging this inequality yields that (1) (2) (1) (2) ß(v)+ ß(v) =ß(u)+ ß(u), tt tt and thus a contradiction with Inequality (7).

every edge (u,v)with v/.Sdecreases the signed imbalance of uby 1.


This property ensures that the signal samples transmitted on the channel are linearly related to the original pixel values.

increasing channel noise progressively perturbs the transmitted bits in proportion to their signi.cance for the video application, i.e., high-quality channels perturb only the least signi.cant bits while low-quality channels still preserve the most signi.cant bits.


It then determines a good beacon period for itself based on the RTT value and informs the access point (AP) of this beacon period.

an APs has a di.erent beacon periods, BPi, for each active (i.e., currently sending or receiving data) client, Ci.


We found that limits on participation applied to coinvestigators and non-investigators alike: it was not a lack of motivation, but rather that personal and family activities are a necessary part of life, even for co-investigators, and people can only tolerate so much interference due to participation in a residential sensing study.

ground truth validation is a potential pitfall of longterm, large-scale residential sensing studies, and may not be detected until weeks or months into a deployment.


Since the only change in Vij is the mean, E[Vij ]= µS(i) from one state to another, we can decompose Vij as Vij = µS(i) + Vijo , (6) where µS(i) is constant for a given packet i and Vijo is a 0 mean iid process for both i,j ?

1and Vijo is independent of S(i), and therefore independent of µS(i).E[Vij ]=E µS(i) (7) and var (Vij )= sµ2 + sV 2 o (8) S(i) for all i,j ?


We know that r1,r2 must be within the transmission ranges of t1,t2, respectively.

we have d(t1,r1) = r, d(t2,r2)= r. If we have d(t1,t2)>max(a+1,ß)r, as shown in Figure 2, using a triangle inequality we obtain d(t1,r2)>max(a+1,ß)r- r = ar, and likewise, d(t2,r1) >ar.


These E values are used to express the remoteness between the tracking tag and each virtual tag.

and the following step sorts out the set of virtual tags K which is represented by the top-k nearest neighbors, or the minimum elements in the matrix E. And if the top-k virtual reference tags sufficiently close to the tracking tag T, the coordinates should be more reliable to compose the coordinate of the tracking tag T. the tracking tag s coordinate (x, y) is obtained by (9) (9) where wst denotes the weighting factor of tracking tag T to the virtual reference tag VTst.


Replacing sensor network node components or retrieving nodes can be prohibitively expensive.

sensor node lifetime is of central importance.


However, for most of these models there are neither implementations nor synthetic traces public available.

from a user s point of view there are interesting models, but they are not usable.


Then the user is anonymous if and only if the adversary doesn t observe the destination.

we can maximize anonymity by choosing a one-hop path that maximizes t (r1), which is achieved by selecting a most-trusted router.


As a result, i allocates less time slots to its binding MSs at the cell boundary (i.e., MSs of poor channels).

boundary MSs (k, say) will .nd by measurement that their throughput ( T i,k (t)) in (10) decreases.


We found that differences in performance between di.erent .ow-ids can be signi.cant.

ping is in general a mediocre estimator for RTTs and heavily overestimates jitter.


DBRP SPECIFICATIONS As shown in Figure 1, DBRP works on top of the data link layer.

it is independent of the network layer and can be used to route any network layers.


As shown in two constraints, the interference power level at the PRx is set to the constant.

since the channel condition of primary link and transmission power at the PTx are not considered, these constraints may not satisfy the quality of service (QoS) of PU.


The grant size and grant period are negotiated in the initialization process of the video session.

this algorithm can minimize MAC overhead and uplink access delay caused by the bandwidth request process.


Identi.ers are ordered on their corresponding rings modulo 2|id|.

tarzan s lookup(key) method selects peers as follows: Node a .rst generates identi.er id16 via hash(key/16, date) and .nds the smallest identi.er = id16 (with wrap-around) on the /0 identi.er ring; it repeats this process recursively with id24 and id32 on their corresponding rings of increased speci.city.


The fairness controller, on the other hand, uses an Additive-Increase Multiplicative-Decrease law (AIMD), which converges to fairness [10].

the decoupling allows each controller to use a suitable control law.


This is even more emphasized in the context of resource-constrained devices, which are foreseen to densely populate indoor environments.

we investigate the possibility to integrate the proposed approach in the normal functioning of the system.


For links in the critical transitional region, the impact of attenuation through obstacles has twice the impact of directionality.

we choose models which ignore the impact of directionality; it is more e.ective to use the limited training data to better .t the wall classi.cation parameters, which are fewer and have a greater impact on signal strength near the coverage boundary.


Paths between two hosts connected to di.erent ASes are determined not only by the network infrastructure and routing policies inside each network on the path, but also by peering connections and inter-domain routing policies used by BGP.

it is important to study path diversity both inside an ISP network and across multiple networks.


Given p(v, k), the length of the shortest path between v and any other reachable node k, .v is de.ned as: 2 3-1 X .v = 4 p(v, k)5 · (3) k =v,k.V As the network evolves over time, we recompute the centrality metrics accordingly for the current snapshot.

in each snapshot Gt, nodes may have distint centrality values.


This is necessary, because a distributed application is usually spread over several nodes and there is no guarantee that these nodes end up in the same cluster.

application speci.c subscriptions must be e.ective throughout the network in order to route all matching noti.cations from event producers to their consumers.


Notice that, it is meaningless to compare the performance of structures for link weighted network with these structures for node weighted networks.

we consider LCPT(link weighted version), PMST and LST as one group for link weighted networks and LCPT(node weighted version), VMST and NST as another group for node weighted networks.


The schedule dissemination in LiT MAC implicitly conveys the routing path for the .ow in the network [12].

a packet is appropriately routed to the gateway node from the handset and from the gateway node to the handset.


One major drawback though is the high initial effort that is needed to deploysuch a .ngerprintingbased 802.11 positioning system.

in this paper, novel algorithms that pre-process the data collected for the .ngerprints are presented.


There is no expected bene.t when theprobability of the receiver s cache containing the chunkis < 90%,due to thehighcost of cache misses.

we want to minimize cache missesby making a wisedecision on whether or not to remove a redundant chunk.


Since the next hop and MED values received by AS7 have changed, AS7 may change its preference from AS5 to AS6, and announce a new path of P:764321 to the observation point.

a link failure in or between some AS near the origin AS, i.e., AS1 to AS2, can cause an AS path change at a subsequent location on the path, i.e., from P:754 to P:764.


Note that the MN algorithm is triggered only when the available resources in a network are dropped below a certain threshold.

some initialization is required and the MN solution evaluated in this section is a hybrid approach.


This contradicts the optimal |unassigned[u]| ity of R * [].

equal rate assignment to nodes in unassigned[u]is a necessary condition for the optimality of R * [].


Taking these resource limitation into account, the researchers have to deliberately design and implement every bit used in the program embedded in sensor nodes and packets transmitted between sensor nodes.

designing routing protocols in wireless sensor networks is quite different from that in conventional networks.


.ni=1 wi · (xi,yi) ( x, y ) = .n wi i=1 However, estimating distance di using all the RSS information is often inaccurate due to interference and shadowing.

we propose two .ltering strategies to improve the accuracy of a VNDB: RSS .ltering and Grid-based .ltering.


The reflected and scattered transmitter s signal can only fall in the receiver s field-of-view angle in short distances, e.g., 1.5 m while aiming the receiver at the transmitter s reflection, and does not cause interference in long distances, e.g., intervehicle distances in traffic.

the multipath effects are only strong in short distances and do not hinder V2LC's operation in full-duplex mode.


We .nd that sessions during with more Food spent tend to be longer than those during which less Food is spent.

it is in the interest of the developers to keep the users involved in the game so that the users are enticed to use more virtual currency in the game.


In both .gures, the best result is about 20 % better than the worst one.

as the results found by the different runs differ up to 20 %, the statement from the previous subsection that a few runs are suf.cient is disproved.


This modeling approach allowed us to introduce functional timing constraints like the DMT symbol period, from day one.

the top-level test-bench and the functional specification contain the time information that is needed to validate the model in further steps of the design flow (performance simulation at mapping stage, cycle accurate simulations at implementation stage) thus allowing the re-use of the original test-bench in a true top-down manner.


On the other hand, unreliable transmission in such an environment would lead to a great deal of information loss.

treating reliability as a boolean task has severe implications, either in terms of energy loss or in terms of information loss.


We do not assume the system dynamics to be constant and construct the model dynamically based on the changes in the dynamics.

our technique can not only track the evolving attribute dynamic but also adapts in case of unexpected or unpredictable changes in the dynamics.


Base Case: If there is a single time transform performed on the message then by the analysis of Section 4.3 the maximum error possible between the actual time reported and the transformed time is fmax.

if the actual time is t0 then Emax the reported time will lie in the interval [t0 - Emax , t0 + ].


ManyNIDS analysis such as Signature detection occur at a persession granularity.

the signature detection responsibilities can be split across the nodes on each end-to-end path by dividing the sessions across the path as shown in Figure 2.


Now, for the same location at the next hour window h+1, the total number of users is givenbythose who stayedbackfrom thepastwindow as well as those who .rst switched-on their devices at this location and those who moved from some place else: N(x,h +1) = ns(x,h)+na(x,h +1)+ne(x,h +1).

the net change in users at a location across two consecutive hour windows h and h + 1 is composed of two components, a net in.ow and net out.ow and is obtained as in.ow -out.ow or: N(x,h +1) -N(x,h)= {na(x,h +1)+ ne(x,h +1)}- {nl(x,h)+nd(x,h)}.


The reason is that the ratio of the number of candidate proxy applications to the HDR base station remains the same for each route breakage, and high client mobility results in the same frequency of rerouting for both greedy and on-demand proxy discoveries.

high client mobility speed results in higher absolute but similar relative overhead for both approaches.


The nodes may be dense in some places, and sparse in other places.

the node density varies inside the .eld.


(a) Interpolation result in Real (b) Fitting line of .ne frequency part and Imaginary part o.set estimation for WiFi Figure 8: Improvement methods for WiFi IC As the synchronization process in preamble has successfully compensated the clock di.erence between sender and receiver, the phase shifts grow linearly with the accumulative symbols in a constant CFO estimation.

we use linear regression method across symbols in achieving the CFO estimation.


INCENTIVE MECHANISM OF BITTORRENT As they are all interested in the same .le, peers rely on each other more directly in BT than in search networks such as Gnutella.

the incentive mechanism is more appropriate to implement.


Weak authentication in a protocol is less expensive but can be easily spoofed by an attacker with little cost.

preventing a DoS attack or to provide availability property by a protocol is important and hard problem.


In the basic algorithm, the probability of yi = 01 is assumed to be the same as that of yi = 10.

we can design a stopping criterion for on-goingexperimentsbased on the ratio between the number of 01 measurements and the number of 10 measurements.


In the combined RSSI, one of the antennas being located at the deep null can cause up to 3dB di.erence when the number of antennas is two.

to capture the radio signal pattern completely in the radiomap, the resolution of the radiomap has to be as small as the coherence distance.


Due to assumption (3), it is convenient to regard the .rst responsepacket asthe .rstprobepacket bouncedback from the remote endpoint and similarly for the second response packet.

we also use pj-1 and pj to refer to the .rst and second response packets, respectively, but Sf and Sr are generally di.erent.


The quantity V can be looked upon as additional resource reservation in anticipation of channel errors.

the system does not have any packet drop as long as the total erroneous slots in a busy period are not more than the reservation V. the choice of V is a policy decision or V can be adjusted dynamically so as to cater to the system requirement.


The experiments will be done with other devices and other technologies using the proposed architecture, such as devices for measuring glucose, balance among others.

we hope that this work will contribute to the health teams in Brazil at the requirements for mobility and quick service.


Our computational model is sensitive to suspicious behavior and nodes, so it is suitable for dynamic but agile environments such as MANETs and WSNs (wireless sensor networks); likewise, this model is efficient, so it is also suitable for mobile devices and those with low processing abilities.

the communication in the network can be achieved through trustworthy nodes, and avoid malicious nodes provided that they show uncooperative behavior.


All named information would have to be routed frequently and most often over long distances.

they conclude that, despite the substantial bene.ts of P2P, infrastructure-based solutions will be the ones preferred  at least in the near future.


the probability that u fails in every round of the phase is bounded 1 1 log2 n - log n 4.rc as (1 - p)c < ec , which, for su.ciently large constant c ' , is less than 1/n9 .


The calibration values (in dB) where then added to the measured values (via an interpolation process) when plotting the spectrum data in this report.

the plotted power level values are the absolute value in dBm at the antenna input.


Most of the available DDoS attacking tools [12, 13] do not alter the initial TTL values of packets.

the .nal TTL value of a spoofed packet will bear the hopcount value between the .ooding source and the victim.


The proof is almost identical to that of the case nR = w, and is skipped to avoid repetition.


Without loss of generality, we can normalize the chunk size to be one, and choose the video streaming rate as the bandwidth unit.

the chunk transmission time on a unit bandwidth link is 1time unit, which equals to the chunk playback time.


If without topology control, the nodes transmit the sensed data to the distance nodes through the long-range links.

the data can be relayed in fewer hops to the destination node incurring a lower delay, albeit at a higher energy cost.


The distance between both chains is 400m.

wireless nodes of opposite chains are within each other s interference range but out of each other s transmission range.


Transition from IPv4 to IPv6 introduces a co-dependence between the protocols.

unlike when studying IPv4 topology independently, when studying IPv6, we must consider the parts of IPv4 that glue together islands of IPv6.


Hence, when a routing path changes, packets using an anycast address may not be sent to the same node.

they presented two mechanisms: source identi.cation option and anycast address mapper to deal with the issue.


Each cluster covers a specified domain with a high degree of overlapping between cameras.

all clusters sense their domains concurrently by waking up their members sequentially with a time interval related to the clustersize.


Compared to transit, remote peering has lower tra.c-dependent costs.

from the cost perspective, remote peering represents a trade-o.


Our lottree mechanism thus marks a fundamental departure from existing incentive mechanisms in that it incentivizes participation even in these systems.

neither our formal de.nitions nor our theoretical proofs rely at all on the notoriously hard-to-de.ne notion of utility.


In Lemma 3.7, stated below, we claim that the graph (B, Ev) is connected.

we can .nd a spanning tree for B which has exactly |B|-1 virtual edges.


Unfortunately, the distribution of streaming media faces a signi.cant scalability challenge because of the high server and network requirements.

numerous techniques have been proposed to deal with this challenge, especially in the areas of media delivery (also called resource sharing)and request scheduling.


In general, this is a dif.cult problem we want to estimate these in.nite objects from a .nite amount of sample data.

often strongly limiting assumptions are made: It is assumed that the covariance of any two random variables is only a function of their distance (isotropy), and independent of their location (stationarity).


Any mobile attached to the network is dynamically routed to the SGSN as per the current load distribution [11].

the speci.c SGSN that serves a mobile at a certain point in time does not need to be the same SGSN that serves the mobile at a different time.


Since the AES is designed to conduct large numbers of lightweight (small) experiments (i.e., using small networks) as quickly as possible, pulling the virtual machine images from the hard drive (at the beginning of every experiment) is a time-consuming process.

the desktop computers are more cost-e.ective for us in terms of experiment per minute per dollar.


The queue size in Figure 2 shows that the queue length is periodically over the ECN threshold.

if SYN packets for new connections or retransmitted packets meet the conditions during congestion, these packets may get dropped and the performance degraded.


To avoid loops, a node should only associate with a parent closer to the PAN coordinator.

there is no way of maintaining several parents in the original ieee 802.15.4.


Since the energy spent by a network interface in its power-saving sleep mode is directly proportional to the sleep duration, this .nding indicates that wait-for-server and inactive periods longer than 1 s account for most of the network interface sleep energy.

considering that it requires the network interface to perform the energy-consuming operation of waking up to receive a beacon every 100 ms, the 802.11 PSM seems too .ne-grained to minimize energy consumption effectively.


Selecting 1 out of N is done most e.ciently when the N - 1 comparisons are performed in a balanced binary tree giving us a depth of log2 N. To select the second out of the remaining N - 1 we also do this in a binary tree but the result of the last comparison of a N × 1 merge is required here.

if we get the output of the N × 1merge at depth log2 N then the second output of a N × 2merge can only be got after performing one additional comparison giving us depth log2 N + 1.


we have the following theorem: THEOREM 14.


We assume that t = 0 corresponds to the .rst slot after the reception of the beacon packet.

t = j denotes the j-th slot (from j · db to (j +1) · db), after the reception of the beacon, that is the interval of time between 120Ts + j · db and 120Ts +(j +1) · db.


As a consequence, in the P2P streaming scenario, each peer which receives and decodes an SP frame correctly may also create the corresponding SI frame.

it can subsequently use the resulting SP and SI picture pair adaptively to either reduce the bit-rate or stop the error propagation its descendant might be experiencing.


The Transmission Request Frame STA_ID STA identifier (1-63, 6 bits) Priority Priority of transmission frames (1-3, 2 bits) Queue Queue size of pending frames (0-255, 8 bits)   The information of the transmission request messages from all the STAs are stored in the scheduling table of the AP.

the AP can determine a schedule sequence by using the information in the scheduling table.


when a link or a router goes up or down).

lSPs provide valuable information about the occurrence of events such as loss of connectivity, route changes, etc.


All the points of the same channel have the same id attr part in their label.

each channel may be distinguished by grouping the points in L(v) by the id attr part of the label.


The payload is encrypted using a key (shared during discovery1; that is, when the two nodes .nd each other and share keys to secure the communication), and the MAC M is computed over the entire packet (i.e., header||payload) using another key (also shared during discovery).

for an adversary to forge a packet with a payload of his choice (i.e., selective forgery), he requires work proportional to 2h+m (he needs to guess the correct h-bit header and m-bit MAC).


The reason for this di.erence in the prediction accuracy is that the map phase typically consists of a number of waves.

any outlier map tasks that are straggling in the earlier waves get masked by the latter waves and they do not in.uence the observed phase completion time signi.cantly.


MAC TECHNIQUES FOR BAN Body Area Networks are envisioned to be 1-hop networks with a central gateway playing the role of the coordinator.

techniques that need centralized planning, such as centralized TDMA, or polling can be very effective and are explored by researchers.


In XML, it is easy to create new tags with new semantics according to the requirements of some environment.

xrML and ODRL both provide a core language that can be easily supplemented with XML extensions as required by a particular application area.


INTRODUCTION There is a general consensus in the architecture community that the best way (in terms of performance per watt) to harness the bene.ts of Moore s law is through parallelism.

from servers to mobile phones [1], future chips will contain dozens (if not hundreds) of processors, memories, and/or hardware accelerators connected by on-chip networks.


As can be seen on Figure 1, the analytical and simulated values of Dm(Z) do not coincide for the Markov model.

to better discriminate the quality of the distribution, the value of fmodel is derived for the Markov model and the simple exponential MAC service distribution.


However, the number of coding structures alone is not enough to offer satisfactory performance in power savings.

the study of NC-aware routing protocols and construction of general coding conditions are needed for effective application of NC in wireless network [10].


When a slot is reserved for transmission between p1 and p2, the total number of free slots at R(p2) decreases by 1 (since the slot cannot be used for transmission from p2 to p3).

the total number of slots available at R(p2) can be considered as B - 1.


The number ofpackets that relay node r already E[Cr ] has a copy of follows a binomial distribution, B(.E[Tp], N-2 ), ] E[Cr with mean .E[TpN-2] .

amongthe .E[Tp] sourcerelay packets that the source node carries, relay node r in average E[Cr ] has alreadycarries a copyfor .E[Tp] N-2 packets.


A FIRST SYSTEM: TRAFFIC INFORMATION SHARING Let us now sketch a .rst, naive peer-to-peer based traf.c information system that allows cars to exchange information about the current traf.c status, e. g., in a city or in a network of highways.

this system is very similar in intention to VANET-based systems like SOTIS [32] or Traf.cView [24].


Furthermore, multiple radios would be necessary if nodes want to participate in multiple networks, e. g. since various communications should be protected di.erently.

in our solution nodes can be assigned multiple protection levels at the same time and thus, a single mesh network is su.cient.


4.3 Queuing and Scheduling For the University network to supports the applications shown in Table 3: the guarante ed De v i ce 1 ( U n i ve rs i t y L i b r ar y )  service applicati De v i ce 2 C o l l eg e of S c ienc es  ons should be allocated a De v i ce 4 guarante C o l l eg e of E n g i ne er in g ed portion of the network resources, the controlled-load service applications should be allocated minimum amount of resource so they can achieve their functionality, and the rest of the applications should be treated a best effort.

a scheduling block should be deployed in the network with a class-based queuing mechanism, so the application traffic is classified and serviced by separate queues to which the scheduling algorithm assigns the desired priority and resources according to the service level agreements (see Section 4.2).


Although a short transmission radius can save per-link energy, it may not be the case for end-to-end path transmissions because the minimum energy paths are not always preserved by these algorithms.

a Localized Shortest Path Tree (LSPT) has been proposed in [16], which can outperform GG and SMECN in terms of total power consumption.


A region can reach k regions on each direction: right, left, top, and bottom.

a region will reach other 4 × k regions.


These anomalies waste network resources, cause performance degradation of network devices and end hosts, and lead to security issues concerning all Internet users.

accurately detecting such anomalies has become an important problem for the network community to solve.


4, compared to the ASP-based approach in [1] that points out that their approach is about one order of magnitude faster then the PB encoding using hop-based routing encoding, we can further enhance the required runtime by much more then one order of magnitude.

we state out to even outperform the ASP-based approach [1] in case of runtime, while also o.ering much more capabilities for a multi-objective DSE, currently lacking for ASP.


4.1 Tasks and Tasklets Tenet tasklets and the base Tenet implementation, particularly its tasking and memory subsystems, should be lightweight enough to allow many tasks to execute concurrently on a mote for instance, to run diagnostics tasks concurrently with sensing tasks.

as an end-to-end evaluation of the Tenet tasking software stack, we .nd the maximum number of copies of a task that a mote can support.


TCP PERFORMANCE IN URBAN-X TCP is the de-facto standard for transport protocols when operating over the internet.

e.cient operation over cognitive multi-hop networks as Urban-X is important.


We let Y be the t × m measurement matrix, which denotes the timeseries of all links.

each column i denotes the timeseries of the i-th link and each row j represents an instance of all the links at time j.


A .ow needs to carry the identi.er for its parent task.

all physical servers involved in a task need to know its task-id.


If the target rate is smallerthanthee.ectiverate,it meansthatthetransmitter deliverstoo muchpowerandlesspower wouldbeenoughfor ensuring thedesireddatarate.

the maximumdeliveredpower of the considered transmitter willbedecreased by a given quantity .


counter by one per each time slot during a super-slot duration with probability 1 - .M .

similar to the methods in section 3.1 with replacing Pbusy = P {H =0} = .M , then the PGF TW (i, z) is given by Wi-1 1 s TW (i, z)= .


N will get at most .Bi/.. channels and will pay at most ..Bi/.. = Bi.


This issue may be more critical in smart spaces as many embedded devices do not have direct Internet access for security patches.

to make communication mechanisms resistant against malicious attackers and malformed content, careful coding practices and input validation should be utilized as well as mature and security tested interfaces.


An asynchronous heuristic based on one-at-atime transmission outperforms the synchronous heuristic for orthogonality factors above 0.5.

when the congestion e.ect of interfering users is strong, it is better to apply the asynchronous model with one-at-a-time transmission; oth 0.2 0.1 0 user index Figure 6: Time share allocated to di.erent users using greedy heuristic with threshold pricing (solid line), and using resource pricing (dashed line), gi(t) exponentially distributed with mean i. time share 0.4 0.3 erwise synchronous distributed scheduling is better.


Proof sketch: The number of combinations is exponential in the number of bu.ers, and the probability of collision is less than P 2/C where C is the number of combinations.

even switches with o(P ) storage can provide a guarantee that a single hotspot will not stop messages from being delivered to any other processor, with high probability.


Other than that, our proposed scheme does not require any substantial changes to LTE, but mainly additional communication between MNOs and OEMs over regular internet connections.

our scheme only requires minimal changes to LTE.


Hence, it is not predictable when the transmitter expects feedback from the receiver.

no other MP, which may be outside of interference rang to the transmitter, can reuse the frequency channel concurrently, as the transmitter may be in receiving mode itself at any time.


To .nd a replacement row, we need to compute a sparse matrix-vector product involving G,which takes O(n 2 × (average path length)) operations.

since most routing paths are short, the dominant cost will typically be the update of R. the complexity of Algorithm 2 is O(k2).


After the failure of primary working lightpath, dynamically search is initiated for the allocation of a free wavelength over the pre-provisioned backup paths.

the failed primary lightpath connection may not be recoverable from failure if the spare wavelength not found over the pre-provisioned backup paths.


Only the corresponding sensor module needs to be changed.

changing the Bluetooth pro.le from SPP to the scale-speci.c pro.le with ID 1234 was easy to do and had not in.uenced the other devices or other parts of the middleware.


In contrast, the UDP jitter (Figure 5(d)) reveals a hybrid behavior: the values oscillate, though at a lower amplitude, and the mean shifts towards zero.

the correlation among the samples is low.


If, instead, for example, the CONNECT messages were to outrace the JOIN Ok messages, Aand B would know already know about a new fourth member of the group when they received the JOIN Ok message.

by the procedure of Section 3.3, A and B would include D and C in their JOIN Ack messages to C and D, respectively, informing them of the new member.


As the repair server has B buffers, no retransmissions of the packet are possible if B additional packets arrive subsequent to the packet in time less than 5'.

we define the random variable Q0") to denote the number of packet arrivals at the repair server within a time interval of length T. t P(H=O) = P(Q(5 ) >_B) For i = 1, 2, 3,..., t t P(H=i) = P(Q(iS ) < B <_ Q((i+ I)5 )) For i = 0, 1, 2,..., , S--1 (iA6,)ne_i~ 5' P(Q(iS ) >_B) = 1-E n!


P t ): This space represents original source address and .nal destination address of header spaces of packviolation detection and enable network-wide access control, a .reets that can pass through the .ow path.

it is a combiwall application needs to not only check violations at the ingress nation of the source address of the incoming space (P s i ) and switch of each .ow, but also track the .ow path and then clearly identify both the original source and .nal destination of each .ow in the network.


Recall from Figure 1 thatthefollowing needs tobe satis.ed: DDD + DAP = F (1) In Sections 3.1.2 and 3.2.3 we discussed how increasing the value of either DDD or DAP will result in less message transmissions inthenetwork.

inordertokeepthenumberofmessagetransmissiontoaminimum,weneedtomaintainthesumDDD+DAP as close to F as possible, in an attempt to exhaust the available freshness budget.


This allows to eliminatephysical shortcutsbetweengroups, which would bias the evaluation of the ability of policies to bring data objects from one community to the others.

nodes can exchangedata onlydue to social mobility of nodes and not due to random colocation.


Moreover, it must be noted that messages are forwarded asynchronously, i.e., there is no reason for the root to .nish the r(s) sequential data sendingof a node to start sendingdata of another node.

each node forwards messages coming from its parent according to the Forward data algorithm(cf.


Anyway, a deeper analysis is necessary to assert that all components running on a platform are good.

the script veri.es if a measured 5 This was chosen to exactly identify the package history related to a speci.c distribution, as vendors use proprietary naming convention and release updates 6 https://fedorahosted.org/bodhi 7Available at http://security.polito.it/tc/ra/verify  .le is up-to-date or if a newer version has been released to .x security .aws, by using the version and the full history of the packages containing it.


The two unexpected .ndings are the richness of upstream connectivity of this eyeball AS and its decision to peer remotely at MIX rather than locally at NaMEX.

when trying to determine the actual upstream connectivity of eyeball ASes such as RAI, one may quickly run into a bewildering web of real-world peering relationships [17, 8, 12, 11].


So the chosen solution is based on sending usual text commands to guest OS s command shell (e.g., Bash or Ash) and then collecting and reporting the output to the user.

the most severest restriction for a guest OS is to provide a command shell on its .rst serial console.


Although it is inexpensive, broadcasting uses a .xed and low data rate (2Mbps), which is more tolerant of bit errors than other rates, and which may differ from the actual datatransmission rate (e.g., 11Mbps).

as we will show later (in Figure 13), BAP yields less accurate link-quality information than a unicast-based approach (e.g., 10.2% error by broadcast vs. 1.6% error by unicast).


From Equation (4), removing uk from F(v) is equivalent to setting w(v, uk) to 0.

we can use a function f: C.{0,1} to represent F(v) so that f(uk)=1 iff uk.F(v).


On the other hand, a P2P user may be browsing the web or sending email while connected to a P2P network.

to minimize false positives we exclude from M3 all .ows whose source or destination port implies web, mail, FTP, SSL, DNS (i.e., ports 80, 8000, 8080, 25, 110, 21, 22, 443, 53) for TCP and online gaming and DNS (e.g., 27015-27050, 53) for UDP 2 .


Box 3000, FIN 02015 TKK, Finland  ABSTRACT In wireless multihop networks each node acts as a relay for the other nodes.

the distribution of the traf.c load has a strong spatial dependence.


5.1 Data Access Patterns Storing data in ad hoc networks is a complex task that, depending on the level of availability required, may consume substantial resources (bandwidth and power).

the way data is accessed in a tuple space should a.ect how tuples are stored in the ad hoc network.


As implementing these tools is time-consuming, we decided to retain the most representative ones while still covering the di.erent types of approach.

discoverer uses a syntactic alignment approach, ScriptGen uses an inferred automaton and ASAP relies on statistics over message bytes.


Since mobile nodes select the same strongest network as the handoff-in network, it causes the available bandwidth of the strongest network is not enough for these mobile nodes and yields unbalance traffic loading among networks.

in the second phase we first propose the competitive on-line (COL) method to define the handoff cost for all candidate wireless networks, which are added in the list of or .


Nr Case 2: There is an interval [t, ¯bk], t< ¯bk, in which all MSFQ servers are continuously busy: Let g be the smallest integer, such that all MSFQ servers are busy between ¯bg and ¯ bk.

let m be the largest integer greater than or equal to g that satis.es both g = m = k-1and dm >dk.for mdk =di Then, packet pm is scheduled before packets pm+1,··· ,pk under MSFQ but pm departs after all these packets under GPS.


This transition is based on the reservation made for pi in part (I) for the whole row ..

the portion of pi before the bend in s is accounted for by part (I).


This blind detection method causes hardware burden as the number of random access code increases.

the reasonable grouping of the random access code set is necessary.


Unfortunately, our WiFi cards did not support thisfeature.

for the multiplePSM client experiments, we set the beacon interval to a small value (25ms) and simulated staggered beacons by only advertising the TIM bit for each client at the appropriate beacon corresponding to the associated virtualAP.Wethen measured theoverhead of waking up the clientsforbeacons corresponding to other virtualAPsfrom our power readings, and subtracted this overhead from our .nal measurements.


One major drawback of OMNeT++ is that it does not have an energy model.

while OMNeT++ certainly is a feature-rich and powerful simulation platform, it was not possible to implement and test SPAN completely.


INTRODUCTION As mobile computing devices and wireless sensors are deployed in large numbers, the Internet will increasingly serve as the interface between people moving around and the physical world that surrounds them [22].

we expect to see more and more applications having multiple protocol domains involved during one application session.


(5) Now that we have all intermediate functions de.ned, we can combine them to obtain the overall load each node will experience.

we have to multiply all direct transmissions and receptions with the sum of header and payload size and add the result to the product of all indirect transmissions and receptions with the payload size.


Every node includes its own latest sampled data into its packet.

there are .-1 remaining items that the node will select from its cache.


The Cyclops camera is currently available only as a prototype.

we use the Cyclops platform for our individual component benchmarks and substitute it with a similarly constrained but higher power CMUcam for our multi-tier experiments.


2.2 Internal Attack Surface (IAS) Since the network administrator has a direct access on most network components, it can discover a larger attack surface through internal scanning and testing.

the internal attack surface is usually larger than the external attack surface.


In this implementation (§6) we have used a 256-point FFT that corresponds to one OFDM symbol (3.2µs).

this window of 256 samples should have all the subcarrier information.


The other cryptographic operation in our scheme is RC5 encryption/decryption and the key size is .xed to 8 bytes due to the availability of open-source in Tinysec [27].

we need to truncate the .rst 8 bytes from the hashed value in the one-way key chains.


On the other hand, if the E ' event NoHalt occurs, then the output of B is random, so that we have | Pr[b ' = b|NoHalt]| =1/2.

1 ind-sid-cca ' Adv(B)= | Pr[b = b] -| .


8.2 Multi-port embedded memories The number of hash functions k,is essentially the lookup capacity of the memory storing a Bloom .lter.

k =6 implies that 6 random locations must be accessed in the time alloted for a Bloom .lter query.


However, such medium access is unpredictable as distributed, decentralized scheme is performed.

even in a full Downlink (DL) scenario with traf.c generated by a single source only frames collide due to uncoordinated transmission attempts.


There are very few prior studies of this type, which leads to a lack of baseline data.

at this point, the best data collection policy for ecologists is to get all the raw data in order to establish a baseline for future experiments.


If a given node accepts all transmissions only because it has energy capacity, high load traffic can be directed to this node.

the power consumption tends to be higher in this element, resulting in a battery reduction ratio much more aggressive for the nodes that accept new sessions purely based on the level of their batteries.


with which it is being queried, and it s normalized to the sum of each weighted value of up to n entries at the local directory.

the query interarrival time for each respective entry is recorded at the local directory (either FD, or MD), since this value is referenced for the recurrent SER calculation.


Furthermore, as the environment is not fully under control, the experiments might not be comparable due to unknown e.ects that are introduced in between experiment runs.

we implemented a simulator in charge of replaying o.ine raw RSSI traces, collected as previously described.


This difference is due to the fact that the queue in ns-2 can only take integer values, while the queue in the hybrid model can take fractional values.

the probability that the queue is nearly full is represented by a probability mass at qmax -e for the hybrid model, while it is represented by probability mass at qmax - 1in ns-2.


radio spectrum is low in spatial and temporal dimensions [1].

a new trend is to make spectrum access dynamic [2].


Due to potential route asymmetry between two networks in BGP routing, it is possible that a destination AS is still reachable though certain ASes along the forward path to it are polluted, e.g., two nodes c and d along the forward AS-level path [a, b, c, d, e] are polluted while node e is not.

in this case, a probing tool such as traceroute may proceed to subsequent hops when probing to the hops in c and d returns * , and .nally reach e. the returned path may contain one or more * s followed by more IP hops reached further down the path.


In a Di.Serv capable router, the output bu.er is normally divided into multiple logic queues, served under a certain scheduling algorithm, to provision di.erent classes of services.

the tra.c aggregate associated with an output port needs to be split again according to the Di.Serv code point (DSCP) carried in each packet header [16] to generate the input process to the queue for each class.


In contrast, PVRN provides what is essentially a multiply-linked list to multiple contexts with the links tightly integrated into the UI.

the reader can safely and readily explore alternative contexts and informatiion spaces.


Second, the biggest advantage of this scheme is that, it relies on burst reads which are simpler than random reads that COMB and BF su.er from.

instead of k memory accesses, we need at most lk/wl + 1 memory accesses for each hash index as shown in Table 2.


From the frame-error distribution, we define an average retransmission times as Navg for each link.

the average consumption of transmitting power on each link can be computed to Pt ·Navg.


Recall that pf denotes the number of packets in f. Thus, 1 L() µf = uf,R[z]-uf,S [z] pf .z (L L) 1 1 = uf,R[z]- uf,S [z]= (tf,R -tf,S ) pf pf .z .z Note that the value of pf can be measured by tools such as NetFlow available on Cisco routers or by schemes proposed in [22, 26].

to estimate the value of µf, we need to obtain the estimated values t f,S and t f,R for tf,S and tf,R, respectively.


However, these approaches proposed for centralized scheduling.

they are not satisfied for use in adhoc and multihop networks.


In other words, as long as there is a very small but constant difference between the measured busy times of the two .ows, the rates will converge to incorrect values.

the above analysis suggests that there is no optimal .for the asymmetric topologies with small, constant difference in measured busy times.


In particular, DS-Lite [9] that is deemed to be promising, assumes and includes the use of CGN devices to conduct NAT44 function within the DS-Lite architecture.

given these expected wide deployment of CGN devices, it is important to test the performance of CGN devices.


Therefore, BTA gives more opportunities to construct a DB-k with higher degree than SA.

the BRA adopts the branch policy to construct the DB-k and hence further utilize the weak grids.the BRA outperforms SA and BTA in terms of the maximal value of defense degree.


This means that the WSN should be able to selforganize as nodes fail or die.

there is a tight constraint on the consumption of power resources in the WSN.


Our .ndings suggest that entropy summarizations are more resilient to sampling than volume metrics.

while not perfect, sampling still preserves suf.cient distributional structure, which when harnessed by tools like entropy, can expose hard-to-detect scanning anomalies.


Because of the small payloads, introducing redundancy across packets only increases the packet transmission time slightly, and hence has negligible impact on the packet collision rate.

we obtain large gains from redundant transmission essentially for free.


In our model, the sequences are the features and their frequencies are the corresponding feature values.

the sum of the feature values is always equal to 1.


This limitation restricts the application of automated botnet detection systems to those entities that are informed or motivated enough to deploy them.

we have the current state of botnet mitigation, where small pockets of the Internet are fairly well protected against infection while the majority of endpoints remain vulnerable.


Pi,n,a (t) = RxTha + Li,n,a (t) (1) (t) is the propagation loss from the BS for system a i,n,a to node i at time t and increases when the distance between each node and BS becomes greater.

a node located nearer to the BS consumes less power and a node that is remote from the BS needs more transmission power.


As the autonomous system evolves by interacting with its environment, it also becomes vulnerable to malicious control by adversaries.

it is imperative that an airborne network requires security strategies that can protect the integrity of its embedded sys 800 600 tems and allow for its veri.cation so as to make the system trustworthy.


as OAB makes an isosceles triangle, .OAB = .OBA = a + f. AC = BC = R cos(a + f).


Yet, even such large experiments are not su.cient to evaluate all the possible options and parameters of the many proposed protocols.

simulation is still the primary tool for performance evaluation in vehicular networks [10].


Due to such condition, the power supply for sensor in the network cannot be usually rechargeable or replaceable.

instead of battery replacement, we develop a solar energy recharging hardware to charge the battery of sensors to prolong the lifetime of each sensor recharging in the network.


Players are partitioned in ngroups of size n. Players in group kare interested in markets k,kn1,kn,,kn n. All budgets and costs are equal, i.e., for all 1:i:n 2 n and 1:j:n 2 , BjCf.

now, it is not hard to see that there exists a Nash equilibrium in which all players of group kprovide market k. there exists a Nash equilibrium with the social value Hn11 1 .


The separation of RC traf.c is enforced through bandwidth allocation .

for each virtual link vli carrying an RC frame fi the designer decidesthe Bandwidth AllocationGap(BAG).ABAGis the minimum time interval between two consecutive instances of an RC frame fi.


Thus, considering all levels, the expected scanning time is bounded by ST.

our goal is to .nd the optimal parameters to minimize ST (Eq.


Figure 2 shows that as pthresh increases the expected lookup hops decreases due to fewer timeouts; however, as table entry as follows: .talive i = (5).talive +.tsince Since p = ia, a monotonically increasing function of i, there exists some ithresh such that any routing table entry with i< ithresh will also have a p<pthresh .

if nodes can estimate the value of ithresh corresponding to pthresh ,no estimate of a is necessary.


With only minor modi.cations, we customized it to collect statistics on query propagation times and the time required for nodes to receive query hits.

we could establish a baseline for comparison of Gnutella with the proposed modi.ed version.


A key observation is that -for short .ows -the size of the bu.er does not depend on the line-rate, the propagation delay of the .ows, or the number of .ows; it only depends on the load of the link, and length of the .ows.

a backbone router serving highly aggregated tra.c needs the same amount of bu.ering to absorb short-lived .ows as a router serving only a fewclients.


Moreover, debug and pro.ling of micro-controllers and more generally distributed embedded systems is clearly a hard task.

there is a real need for a development framework that would give developers the opportunity to test and simulate their solutions at the di.erent layers; from the high level design to the implementation through the hardware choices.


Nodes willbe responsiblefor disseminatinglocally receivedpublicationstodi.erent areas of the network after they move.

with su.cient movement,publicationswillbeabletotravel thewhole network and reach interested nodes spread through it.


Notice that all the proposed protocols have been enhanced with respect to their originals.

they are aware of the desired packet propagation direction and exploit it for the forwarding strategy.


In each possible sensor set, the sensor with the highest cost, referred to as HC, determines the remaining lifetime of that sensor set.

under a given system state, the sensor set with the lowest HC is preferred to be selected.


In real situation, however, interference must be a factor of throughput degradation, and therefore an experiment which quotes a result of simulation experiment without interference may mislead wrong result.

an e.ect of interference must be taken into consideration also in simulation model.


However, such an amount of data traf.c cannot be handled by a single CPU core in our PC server.

we need to further exploit multi-core parallelism to handle network traf.c as well.


However,in the integral solution user u is associated with a single AP, lets say a,and the load of this AP is ya int =1.

the int frac ratio between ya and ya is m and it cannot be upper bounded by any constant.


The rationale behind this choice is that a plain environment evidences at best differences which are solely attributable to the mobility description, avoiding any bias that complex road topologies and activity models could induce.

we simulate a regular 3x3-block grid, each block measuring 250 m of side.


Even when processing 1200 samples at a time, which consumes about half the application s available RAM, the execution time is a mere 14.8 milliseconds.

a mote running several tasks that gather statistics will only be CPU-bound when the aggregate sampling rate is approximately 81,000 samples per second.


Since a maintenance RREQ has to discover a current path metric, only the destination should reply to these route request messages.

the destination only flag is always set in maintenance RREQs (DO=1).


In order to keep the white spaces fully utilized, we need to prevent the control channel from becoming the bottleneck.

it is important to ensure that the rate at which handshakes are generated, Rl, is not less than the rate at which nodes return to the control channel, Rr, i.e., Rl = Rr.


As Z-MAC is implemented on top of B-MAC, it uses LPL by default wherein each node maintains listening duty cycle separated by a check period and each transmission is preceded by a preamble as large as the check period.

the energy consumption of Z-MAC for idle listening especially under low duty cycles is comparable to that of B-MAC.


From our qualitative arguments and our simulation experiments it is evident that the random swap model out performs the random spread model for the PeopleNet architecture.

for the rest of this paper we focus mostly on the random swap model.


Also, with more than one flow transmitting on the same channel in the same slot, interference causes a decrease in throughput per flow.

when the network is overloaded, the overall network throughput decreases with increasing values of a .


o f t m Consider a video sequence with frames of sizepixels, we use [)TJ(of size i ) to denote the 1-D vector obtained by line-scanning frame ), and [j)mJto denote the corresponding frame restored by the decoder.

the error signal in frame ) is m[)mJn [j)mJg[)mJ, which represents the signal impairment in frame )caused by packet losses.


Only when the indicated transmission rate is above a threshold, the node will send the data frame.

for a node to actually transmit a data frame, it may need multiple RTS and CTS handshakes to probe the channel and find the right time to transmit a data frame.


However, it is ob 2 K A served that i=1 Bi i is minimized when each channel Ci vAi shares the same .

the major objective of Bi high-level scheduling of TOSA is to schedule items such that vAi vAj , .i, j .


For instance, the values of C are 26.71 and 1.8 for the ixp and patricia, respectively.

for a context switch overhead of 2 cycles, while the ixp is able to achieve a utilization of 26.71/(26.71 + 2) = 0.93, the patricia is limited to 1.8/(1.8 + 2) = 0.47.


Besides, there is a need to monitor the status on the lines.

two image sensors, whose angle should be parallel to the lines, must be deployed, each for one span.


On theinterface between the packet processor and the instruction memory, the least signi.cant bits (the lower eight bits in the system shown in Figure 2) are connected directly to the instruction memory.

the address translation operates in chunks of 256 bytes.


This can bring us stuffed packets at nodes in networks.

authors think we have to speculate the methods to solve these problems.


To emulate the real scenario, we captured the real Reproduction from crossover may only result in a locally optimal solution because the genes only come from parents.

we used mutation to produce new information for genes.


Besides there is the limitation that readers do not allow modi.cations of Query messages, making any such approach impractical.

we ask the question: How can CRFID sensors use the existing EPC protocol to e.ciently coordinate bursts?


The mean download times are 960, 973 and 961 s for the overlay, star and German network topology, respectively.

the packet-level results are less than 20% above the theoretically optimal value of 811 s, which can be computed by dividing the .le size of 100 MB with equation (2).


Due to the bit-shift routing of the de Bruijn graphs, the nodes in set S must have the same i -h .rst bits as u has last bits.

the .rst h bits can be anything, and |S|=2h.


In practice, however, the cross tra.c consists of packets with discrete packet sizes, commonly following a strongly modal distribution.

the amount of cross tra.c that interferes between each probing packet pair can often take 0.92 0.9 0.88 Figure 3: E.ect of cross tra.c burstiness.


2a Notice that to guarantee a connected network with high probability, we have a< pn · r with high probability.

log n 22 t·k·log n - n·t·k·r - (|D(T )| ) 22 1 2(c0)2·a2pc2 Pr C = n ·= e = e 0 = 2 t2·k 2a 2pc2 0 n |D(T )| Consequently, when n .8, Pr (C = n · 2 ) .


However, increasing transmission interval and decreasing transmission range will increase the delay and the risk of missing communication opportunities when a vehicle passing by at a high relative velocity.

both transmission power and transmission interval need to be adapted according to the local traffic and communication circumstance to distribute traffic information efficiently.


Logic 0 is coded by a positive transition; logic 1 is coded by a negative transition.

no change state is not permissible during data transmission and it is recognized as an error if it is happen [1].In Figure 3, there is no change at the transition of bit, it recognizes that as a collision, and can also detect the location of collision bit.


The stability of such systems is then defined as the ability to avoid fluctuations in routing assignments when a computed routing is applied.

adaptive-routing stability is different from our definition of adaptive-routing convergence, i.e.


A ball b(i, r)of radius r around node i is the subgraph that consists of all nodes j such that dij < r, their connecting edges and the fraction (r-dij)/(dik -dij ) of any edge (j, k) with only one endpoint, say j, belonging to the ball, i.e., dij = r (note that dij is de.ned for all nodes i, j).

the ball b(i, 0) around node i contains node i and all the nodes j .


i=1 N (wi ) +1 Suppose the average number of close neighbors of each node is Nave.


When the same scheduling scheme is applied to both the networks, the departure process from N will be a s-dilated version of the departure process from N ' , i.e., a packet that departs from N ' in time slot t will depart from N in time slot st.

the delay experienced by a packet in N is s times the delay experienced in N ' .


Over a period of time [0,T ], the fraction of time link e is P active on channel i is given by ( t=T yi t(e))/T .

the mean .ow on channel i over link e is given by P t y ci(e) t=T i(e) fi(e)= .


Moreover, joint optimizing solutions lead to complex architectural problems.

we propose a less complex solution that uses straightforward scheduling methods, such as delay and proportionally fair scheduling, but combine this with a mechanism that solves the fairness problems associated with delay scheduling.


However, the central node will not actively to include all of its one-hop neighbors.

in order to join a node s group, the newly joining node needs to send a membership request message to the central node for the communications between them.


In the beginning the latency decreases as more parallel messages are used to resolve the query.

each message has to travel less through the network.


PROO F. The symmetry property from §3.3 implies that all out going links to a destination lead to equally-capacitated paths.

the maximum load on any link is minimized by splitting a .ow equally over all outgoing links; this is achieved by lines 6-10 of LocalFlow.