Additionally, our detector selection ideas must account for the fact that security detectors often have false positives and false negatives.

the simple binary output model used in this paper will have to be generalized to a model that uses information about detector quality to probabilistically score paths in the AGT instead of completely pruning them.


Indeed, the behaviour of the transport protocols especially when they implement window-based .ow control algorithms and congestion control techniques, as for the TCP protocol is generally dependent on the size of transmit and receive buffers.

to get a better understanding of packet losses and buffer over.ows we will brie.y describe what happens when a packet, coming either from the application program or the network card (NIC), is processed by the station s operating system.


This matches average time spent on GL (~2min 20s).

we expect the results for GL to be representative of Hugged.


The probability that exactly one node announces itself as the relay is therefore «Nr-1 «4 n 11 111 ps = Nr 1-= n 1-= > 0 n n n n 34 where Nr is the number of eligible relay nodes that (from Lemma3.1)liesinthe range[ n, 4 n].

theprobabilityof a successful relay selection is a constant bounded away from 0.


In the remaining busy slots, Lsets threshold G+!.


Higher e.ective rate rg indicates that the slice g needs fewer resources to achieve the reserved rsv e. rate rg .

ug is proportional to the inverse of rg .


.F., ,...min .. the core step of the procedure is the power consumption minimization of each single component.

in order to find the of.. .optimal component configuration, we select the sub-set that respect the performanceconstraintin .. working frequencies , we exploitEq.


Another rule must drive traffic through the right gateway depending on the source address.

policy routing [5] rules will be configured on the client hosts.


In addition, for any protocol message (be it a route request or a route reply), it must also be possible to determine the initiator and the target of the route discovery process to which the message belongs.

there exist functions ini : M. L and tar : M.Lsuch that ini returns the identi.er of the initiator and tar returns the identi.er of the target.


This is possible because the MAC protocol reserves a time duration (via control packets) during which a forwarding node can expect to receive a DATA packet.

if the control packet carries the label, then the forwarding node can use this label to decide the next hop MAC address and the outgoing label no label needs to be carried with the DATA packet.


Motivation and Context For future wideband telecommunication systems with integrated RF-front-ends we need higher abstraction levels and more precise behavioural models considering process and package physics at the same time.

existing methodologies, flows, tools, modeling and process interfaces have to be improved.


We can see clearly that both combining strategies perform the same for .xed-relay based system.

sL-PC is the best choice in term of both implementation cost and throughput performance.


D2TCP requires no changes to the switch hardware, and only requires that the switches support ECN, which is true of today s datacenter switches.

d2TCP deployment amounts to merely upgrading the TCP and RPC stacks.


In a low density environment, a protocol can use more nodes to propagate a packet to every node faster without significantly congesting the wireless medium.

counter and Angle Based have shorter delays than Cell Broadcast even though they have higher control overheads.


If we take m = |S|2, the latter expression becomes c(|Sopt |+1) =2c|Sopt |.

a allows us to obtain a constant factor approximation for the minimal set cover problem.


Three of the .ve causes of frame losses mentioned earlier obstacle attenuation, multipath, and mobility depend on the path traversed between an AP and a client.

the choice of AP and the client s location can signi.cantly a.ect performance.


As the number of nodes competing to respond to a reference message increases, nodes will need to back o. tens of seconds to avoid collision, depending on the number of contenders.

the response time of nodes also increases.


However, changing the trace may result in an inconsistent dialog, e.g., check-sums on protocol messages may be incorrect.

automatically determining which parts of a dialog to change, automatically changing them, and subsequently making the messages consistent in an automated fashion is dif.cult.


The RSU is oblivious to the number and the identity of vehicles in its transmission range.

it can retransmit the msINT for a prede.ned number of times to maximize the number of collected Data.


In practice, this fee is mainly determined by market conditions and thus it is poorly related to the true managerial and routing costs that the ISP selling transit incurs.

a transit agreement includes a certain element of hidden information because the ISP selling transit commits to provide a service for a fee, established a-priori, without knowing exactly the true cost it will incur to provide such service.


A : {|B,nA|}Pub(kA) In Message 2, A communicates to B that B is the veri.er of the current authentication session and asks B whether or not he is willing to start an authentication session with her.


However, in a system providing consistence of bu.er-status among most of the peers, the old frames for one peer are very likely the old frames for the other peers.

under such circumstances, there is no need to retain old frames in the frame bu.er.


This can be attained by minimizing the expected total number of transmissions required.

we can formulate our problem as the following constrained optimization problem: k)1/hk k)hk/hk log(1 - (r )(r i min .. p,t log(1 - tij ) k.S (i,j).fk s.t.


At high SNR (i.e., small noise, the entries in S approach 0), Eq.

3 becomes: -1 XLLSE CY (4) at high SNR, the LLSE estimator simply inverts the encoder computation.


As DE-OLSR generates a smaller routing load, the nodes economically access the medium, leaving a larger bandwidth for user data packets.

in spite of the size of the routing paths, data packets require shorter delay times to reach the destination nodes.


As shown in Section 3, we need at most N piercing points to pierce the neighborhood of a unit-disk D bearing the smallest .q(D) · .n among the (unpierced)disks in its neighborhood, where .n is an orientation that gives N. We call such a disk D a top disk.

at each step of the algorithm, each top unpierced disk D elects itself as a piercing disk and selects the points in PN(D)as piercing points.


Note that for inter-cluster and total-traces there is only one cluster (of virtual APs).

the same metrics M2 and L1 can also be applied to this level of hierarchy (interpreting clusters as sets of virtual APs).


by our construction pi ' == = Ti(pi) Ti(xi) .


The permissible buckets prevent someone from overwriting the key-value data already stored, and it is managed by each node s IDs.

the nodes who initially puts the key-value data to the buckets, can continue utilizing the buckets when nodes left from the CAGE.


Such scattered Cloud deployments, called Distributed Clouds (D-Clouds), can directly reach users due to their inherently distributed infrastructure and the ownership of the network.

d-Clouds can comply with geographically-based requirements and network-based quality of service.


These high speed variants were originally designed for ef.cient probing ofthe availablebottleneck capacity inlargeBDPnetworks.But in bufferbloated cellular networks, they only make the problemworse by constant overshooting.

the bufferbloat problem adds a new dimension in the design of a new ef.cient TCP,especially for cellular networks.


This is due to the fact that the most popular channel and its data items get recognized before all the other channels.

the data dissemination process for the most popular channel can start before than for other channels.


Ahigher threshold implies higher con.dence on whether the device is tethering.

when we increase the classi.er threshold, the precision becomes higher while the recall becomes lower.


In addition, even though events like this might be rare for a single user, the aggregate frequency can be large enough for a content provider to have an incentive to address the problem.

a better understanding of the root causes is useful to the content providers as well.


For example, to support the functionality of personal video recorders, DVB has produced a set of guidelines (DVBTVA [13]) for the use of TVAnytime [14][15] content management and metadata signaling in DVB operations.

the design of DVBIPDC ESG is naturally affected by both DVBTVA and TVAnytime specifications.


After the initial employment, sensor networks are left unattended for a long period of time.

some of the most essential requirements for sensor networks are to save energy and maximize the lifetime of the network [1, 2].


Consequently, the symbol rate Rs cancels out in (7) and (8).

the simulations provide signal-to-interference ra tio (SIR).


Moreover, the ASes experiencing anomalies might not be those causing the anomalies.

we need to infer part of a global view of the routing information to verify whether advertised routing information is spreading as the originating AS intends.


Since the length of probing period does not change as the node moving speed changes, the ratio of the probing period to the whole handoff period becomes larger as the node moving speed increases.

the average throughput increases as the node moving speed increases.


Switching an interface incurs a non-negligible delay (around 5 ms in our testbed), and too frequent switching may signi.cantly degrade performance.

there is a need for a queuing algorithm to bu.er packets, as well as a scheduling algorithm to transmit bu.ered packets using a policy that reduces frequent switching, yet ensures queuing delay is not too large.


constant-bit-rate or CBR) and do not incorporate any self-regulating mechanisms to reduce their sending rate in the case of congestion.

when the network cannot absorb all the generated tra.c, packet loss occurs due to bu.er over.ow.


It is easy to show that the .rst set of constraints guarantees achieving the min-cut max-.ow bound from the source to the destinations for wireline networks.

what remains to show is that the second set of constraints is equivalent to mapping the wireless network to its wireline counterpart described in the previous section.


As expected, the startup delay decreases as the arrival slice size is increased.

the arrival slice size should be carefully designed based on the estimate of the video request arrival statistics.


In this case, the two APs will get out of sync, and due to carrier sensing, will not be able to transmit simultaneously in the same slot.

we usepacket staggering, which requiresdelaying the .rstpacket of thetwoAPsrelativetoeach othersuch thatthe followingpackets ofboththeAPsareperfectlysynchronized.


It can be clearly seen that CABS utility is very close to that of its upper bound and outperforms that of the (baseline) decoupled approach.

adopting a utility based approach to joint CABS, enables ProBeam to bypass some clients from an epoch to maximize reuse gains without compromising on fairness.


This makesTHP outperformZFBF only in very highSNR.However, in a real system implementation, coded modulation schemes based on QAM constellations would be used also with ZFBF, and these su.er from the same shaping loss ofTHP.Therefore,in an actualimplementation,theperformanceofZFBF woulddecrease alsoby roughly 0.5bit/s/Hz perstream.

thee.ectivegainofTHPoverZFBFinan actual implementation can be signi.cant, even at moderate SNR.Thisis consistent with thetestbed experimentsshown in Section 6.1, where symbols from a 16QAM constellation were used.


Assuming that FZone Hash is the area of the forwarding zone between the requester and the TRSU, the number NbHashReq of HashReq msg forwarded from the requester to the TRSU is: NbHashReq = FZone Hash × .

(17) for a total number N of service requests, the total number NbT otalHashReq of HashReq msg exchanged during the simulation time T is: NbT otalHashReq = N × FZone Hash × .


For example, if the customer C has another provider B and prefers to use its link to provider B for outbound traf.c.

the customer C s border router has a default route 0.0.0.0/0 to provider B.


[31] examine an AIMD rate adjustment strategy in which the additive increase is proportional to the number of descendants of a node, and multiplicative decrease is performed whenever a node detects (by promiscuously listening) that its parent is unable to forward its traf.c.

a parent indicates congestion by dropping some traf.c from its child, forcing the latter into multiplicative decrease.


Peers in the system constantly look for more new peers which can provide better service quality.

the more peers in the system, the more are the available resources in the system, and the better the service quality is to each peer.


EIDs are not advertised in global BGP routing.

a globally routable locator (RLOC) is added to each packet before sending it to another domain over the Internet.


Incorporating acknowledgements packets within the scheme to confirm receipt of a data or command packet would have further increased their size.

we decided to omit the use of acknowledgement packets.


If the aggregator cheats, without security mechanism built-in, the aggregator can report arbitrary value back to the home server.

in the rest of the section, we focus on designing ef.cient protocols to detect the aggregator cheating if the aggregator cheats more than a desired bound.


By (5), we can truncate the hierarchy at i " .

in the denominator of (4), the interference contribution of all nodes beyond distance gi* (n) · r(n) from u can be expressed as a constant sum of terms, each of which individually converges to 0 as n .


It introduces a thin layer between the transport and underlying routing layers, which puts TCP into persist mode whenever the network gets disconnected or there are packet losses due to high bit error rate.

this thin layer acts as a shield to TCP, protecting it from the underlying behavior of an ad-hoc network.


As discussed in [1], this proactive action reduces the temporal gap, that is, the time that has occurred between the congestion event and the congestion signal arrival at the TCP sender.

smoothTCP-q can decrease its window size by a very small value instead of halving it.


In 802.11 systems the interference due to hidden nodes can be avoided by listening to the RTS/CTS messages among TCG;yet if the group is large the interference is inevitable.

to avoid the secondary interference, .rst each station checks if its neighbors on that speci.c interface d(uc i ) are greater than dopt.


This is because a peer solely processing information .ltering and message delivery for certain topics may soon become a bottleneck in large scale networks.

rendezvous-based routing algorithms are applied over the structured overlay architectures [2].


Moreover, the reassociation/reauthentication operations have been removed from the current specification of IEEE 802.11p.

it is impossible for an OBU make its presence known to the new AP.


3.4.1 The least constrained subscription This approach is set under the assumption of that subscriptions are client-speci.c in mobile ad hoc network environments, such as important alert messages.

a subscriber who subscribes to everything, causes .ooding and breaks the assumption.


Thus, li,j has at least din G )/b in-coming links such that they interfere i,j (F P with each other.

it implies that any valid coloring will use at least din i,j (F P the G )/b among the incoming neighbors of link li,j .


AODV-SB-RKEQ allows the propagation and penetration of PRREQ packet infor- mation a few hops away [rom the last stable host whereas AODV-SB-RBLEP cannot do this since the RREP packet is originally a unicast packet.

we can infer that AODV- SB-RREQ, as an aggressive strategy, performs better where there are a high percentage of AODV nodes in the net-work.


dis determined according to the att f type: ij if the type of att f is binary or nominal: { d( f )= 0 if xif = xjf ij 1 if xi f= xjf if the type of att f is interval, a normalized distance such as Euclidean distance and Manhattan distance can be used.

figure 4: Message exchanges among agents for fault-tolerant embedding ( f ) dis used to express the priority coef.cients of the NF at ij tribute att f for nodes i and j. multi-level pri ority is assigned to the NF attributes of each virtual node.


Our experimental results have further shown that other VoIP phones (e.g., Wengophone) also have exploitable implementation bugs.

many existing deployed VoIP phones could be vulnerable to the newly identi.ed remote MITM attack.


However, when the size of the regression table is large or the calibration interval is long (e.g., > 15 minutes), the frequency ratio variances become the dominating factor while the nondeterministic errors can be ignored as discussed in Section 7.1.

it is su.cient to estimate the frequency ratio using only the last two entries in the table.


Similarly, Chord nodes and DNS servers are co-located with routers for fair comparison.

we use routers and servers interchangeably in this section.


As end to end connections in wireless mesh networks may use different numbers of multiple hops, the competing connections may experience different network conditions.

for simplicity, in this section we evaluate the fairness of a particular connection by only observing the end to end bandwidth obtained by that connection.


We also found that, with the exception of a single path, the variation of E across di.erent traces of the same path is not signi.cantly di.erent.

the time-of-day , which di.erentiates traces of the same path, does not seem to be a major factor in determining the FB prediction error.


The channel state space is SS = {Bk, k = 0,1, ,N}, where Bk is the state where k nodes send data simultaneously in the current slot; and N is the number of nodes.

b0 indicates that the current slot is in an idle state; B1 indicates that the current slot is in a successful data transmission state; {B2, ,BN} indicate that the current slots are in collisional states.


By the second part of Lemma 4.5, for each link .. .


By the fourth step of the iteration above, the new path assignment is isomorphic to the initial con.guration: now node ik is using the path ikQkik+1Pk+10, and every other pivot node ij is using path ij Pj 0.

as this iteration repeats, the dynamics will ultimately reach node ik once again with the original path assignment.


From Table 3, we observe that a tremendous amount of reductionin the number ofpeering sessions arisesby switchingfrom the mesh to a single plane route-re.ector setup, with only a modest change in the number of templatesfrom one to two.

mesh is clearlyinferior to using route-re.ectors.


As shown in the equation (5), the gains of estimated symbols include interference terms.

in amplify-and-forward, the relay ampli.es the combined data with interference terms.


It soon turned out that Waledac was not the only spambot family whose members paid close attention to the greeting banners returned by the SMTP servers.

we upgraded our SMTP sink to support banner grabbing for select connections: SMTP requests to a hitherto unseen host now caused the sink to actually connect out to the target SMTP server and obtain the greeting message, relaying it back to the spambot.


It is well known that knowing such a multiple of f(n), Alice s RSA modulus n can be easily factored.

the TTP can get Alice s private key d by the extended Euclidean algorithm.


The other three models included are based on probabilistic distributions that do not use information about the speci.c scenario.

situations where two vehicles are in line-of-sight are handled exactly in the same way as situations where there are obstacles between them, which cannot be considered realistic.


Some of the cluster member nodes in that group will join other groups, and some of the cluster member nodes will select a new cluster head node and construct a new group.

the cluster head change number increases.


u=iu=i However, the cost for retransmitting ci,k and ck+1,j separately is kk-1jj-1 bgb g C2(ci,j )=4log s+ .u + .u + .u + .u u=iu=iu=k+1 u=k+1 Hence, we get C1(ci,j ) - C2(ci,j )= .gk - 2log s= 0.

c1(ci,j ) is not the minimal cost for the retransmission, which contradicts with the supposition.


(v) The reception of messages at a given location is more robust than the SS measurement at that location.

the Secure Localization Algorithm (SLA) is 1.


While our smart precoding also helps CAS improve its median capacity by 12% (11.5 to 13 bits/s/Hz), the improvement is much greater for DAS (about 30%).

the bene.ts of the power-balanced precoding are more pronounced for DAS than for CAS.


At that point, Alice detects the beginning of Bob s packet.

the pilot sequence helps Alice align her own sent signal with respect to the received signal.


At that scale, a strongly-consistent replication algorithm as described in [2] is infeasible, but it is still fairly cheap to store complete group membership information at every node.

it was straightforward for the Clearinghouse system to select gossip partners uniformly at random from the entire group membership, using gossip to keep the entire membership data current at all nodes.


The attenuated bloom .lter of a node records the information about the data stored at all nodes up to D hops away in the underlying network.For each request, a Tapestry node .rst searches every node within D physical hops (i.e., checks the information recorded in the attenuated bloom .lter) before forwarding the request over the overlay network.

unnecessary overlay forwarding is avoided when the requested data is physically nearby.


INTRODUCTION The rapid growth in wireless networks allows a higher diversity of services provided to users.

broadcasting, mobile television, or video-on-demand are expected to develop widely in the near future.


Directly applying protocols from ad-hocnetworks does not meet the speci.c requirements of mobile wireless sensor networks.

new techniques are needed for the caseof mobile wireless sensor networks, where disconnected components are the norm rather than the exception.


Figure 1´An example of sensors coverage According to the above, we can find Formula 4 as an objective function about N. m Formula 4: LiAx= NrA .

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


In contrast to MAC messages, NWK messages might travel over several hops before reaching the destination.

the NWK header is not encrypted, such as to enable intermediate nodes along a multihop route to access routing information in the NWK header without the need to perform cryptographic operations or to have access to keying material.


The results are actually quite similar for the relative difference of RTT means.

at least in relative error terms, Poisson and Periodic probing result in practically the same RTT estimate.


As there are no geographic restrictions considered, the nodes move randomly over the simulation area.

the number of equal paths and within these the number of contacts and contact durations are smaller.


If K is randomly generated by an STA, then attackers have .rst to cryptanalyse RK to decrypt {K}However, the RK.

only values that attackers observe encrypted with RK are random K values, thus only exhaustive search seams usable to .nd RK or K. choosing large enough RK and (random) K values, with at least 128 bits, should be enough for preventing successful exhaustive key search attacks.


INTRODUCTION Inter-cell optimization in GSM and UMTS networks is usually delivered at the stage of network planning, and often done manually.

when the networks environments are changed, it will not be optimal.


We enrich this set with a push .ag indicator that indicates whether a data packet has its PUSH .ag set or not.

for each data packet we have 3 parameters; direction of the packets (1 for up and 0 for down), PUSH .ag indicator (1 if the .ag is present and 0 if not) an the size of the packet.


These tools need to update user or session dependant information in the protocol session.

they may e.ectively extract a partial session description.


If both nodes receive no other hearts throughout the process, which will occur with probability -2Mt * O(e ), they form a component of size 2.

with high probability a portion of the nodes in N0 will be contained in a component of size 2.


Future extensions of the framework should allow composing services in a distributed manner in order to reduce the number of calculations made by the requester.

this would imply giving more intelligence to the network.


To ensure limited in.uence, a database needs to summarize each user s reports on sj before computing a summary over these individual summaries.

for simplicity, it computes an individual user s summary as just the most recent report from that user that was taken in the same channel conditions (see §5.2).7 there is no need for an honest user to submit a new report on sj unless the last one it submitted expired or if sj sperformance substantially changed.


The bus is set to idle when no node is transmitting anymore.

the detector checks the header and trailer for a decoded channel idle recognition point (CHIRP).


As might be expected, most of the data points come fromthe world s most populated cities.

later sections focus oncontext-based propagation characteristics and user mobility patterns from these cities.


5.2 Delay Analysis In LEACH, 5% of the total nodes act as cluster-heads.

for a 300-node network there are about 15 long-distance transmissions from 15 cluster-heads to the base station.


Downlink channel of the 3GPP LTE system uses Orthogonal Frequency Division Multiple Access (OFDMA).

resources are divided into time and frequency axis.


Informally, Iterated Dominance means that, as time advances, nodes feasible choices of routes gradually become more and more limited, until eventually every node s route is .xed.

iterated Dominance provides us the means to present a constructive,and general, proof for NS-BGP safety.


The receiver-side energy is determined by their prede.ned working schedules, which are not changed by .ooding designs.

we use only the sendersideenergy astheperformance metricwhenwecomparedifferent .oodingdesigns under the sameduty-cycled schedules.


This may cause excessive signaling tra.c and a high tra.c load on the LMA.

a new mobility management scheme in PMIPv6 networks with dynamic paging support is proposed.


In an extended version of [13], the authors model a speci.c topology, called Large-EIFS problem, where all the emitters are in communication range.

in all the theoretical studies of the DCF, the mobiles are synchronized on the contention phase: they begin to wait for a DIFS (or sometimes EIFS) at the same time.


For instance, Internet/Grid environments exhibit extreme heterogeneity of con.guration, performance, and reliability.

software must be .exible and adaptive to achieve either robust or even occasionally good performance.


among all MBS region sizes is often to be 1 (video frame).

the MS must be periodically awake with the period of a video frame, i.e.


Recall the cyclic characteristics of AWGR, the signal from one input port must use different wavelengths to go to different output ports, meanwhile signals from different input ports go to the same output port by using different wavelengths.

if we want to use identical optical DEMUXs at each OCA for each AWGR output port, we need to keep an identical partition on the wavelength domain for each output port.


If it is not associated with AP a then xa,u = 0 and it does not contribute to AP load.

the load of user u on AP a and the total load of AP a can be de.ned as follows: X u.U .u .


The power received by a node z from the pair (x, y) is 111 1 ++ da da da zx zy zx (dzx + dxy)a f(dzx,a) (15) by the triangular inequality, and since dxy : 1.

if dzx : g(a), then the power received at z is greater than 1, and the pair (x, y) can cooperate to connect with z.


5.1.4 Summary  The analysis above indicates that media caching under the stretched exponential model is far less e.ective than Web caching under the Zipf model, especially when only a small portion of accessed objects can be cached.

in many previous studies advocating media caching where the Zipf model is assumed, it is highly likely that the bene.t of media caching has been overestimated.


Maintaining a low transmit power and keeping the acoustic beacon unnoticeable are the two prerequisites in the anchor network design.

improving the detection sensitivity in the smartphone by using advanced signal processing technique is the feasible solution to ensure su.cient coverage.


The overall drop probability will realize the calculated drop probability on the whole neighborhood queue.

the NRED scheme is basically a distributed RED suitable for ad hoc wireless networks.


Since only the coordinators participant in packet forwarding, we can derive G(c) from G by omitting all the incoming edges of non-coordinators.

we can define G(c) = (V, E, wc) where  (1)  We choose ETX to model the end-to-end network performance from all the sensor nodes to the sink.


r1 Moreover, if we use the Bloom .lter based LPM technique label f 1 f 2 match r1 1* * r1 r2 1* 00* r2, r1 r3 101* 100* r3, r1  label f 1 f 2 match p1 1* 100* r1 p2 101* 00* r2, r1 p3 101* * r1 Original rules Additional pseudo-rules described in [4], we need approximately one memory access per LPM.

the entire classi.cation process takes .ve memory accesses with very high probability to classify a packet.


Old frames would be useful for lag peers, while at the same time they consume spare bu.er space.

when there is large phase-skew among peers, retaining old frames is useful for some lag peers to .nd a proper parent peer, providing those relatively old frames are needed during reconnection.


Therefore each set is able to use the other set as its landmark in order to update itself.

we color our nodes with two colors Red and Black.


Network bandwidth is also limited; the amount of bytes that can be transmitted during a contact is .nite and proportional to the duration of the contact.

protocols must wisely transmit important data .rst.


The packet is then forwarded through the existing section of the circuit to the last onion router, which extends the circuit by one hop.

cells traveling away from the end host are onion-encrypted with the negotiated symmetric keys of the onion routers, and these layers of encryption are peeled away at every hop.


The jam-and-replay attack requires the adversary to intercept the entire legitimate transmission before the real receiver does.

(1) the adversary s physical presence is between the pair of one-hop sender and recipient.


4.3 Synchronization Queue 4.3.1 Synchronization using OpenMP critical section As you can see in Figure 4, a set of steps is processed in a pipelined fashion.

data transmission between adjacent code sections is required.


The delivery probability of each sensor will be equal to its composed utility function.

more formally, the delivery probability of a sensor si is de.ned as P (si) = U(si) (3) Two devices are co-located if they are in the same transmission range (i.e, one hop distance).this utility function is computed considering its relative mobility (calculated by evaluating its change degree of connectivity history), its colocation with sinks, and its survivability (calculated by considering its battery level history)1 .


Also it is not likely that more thanevent types are needed.

it is suggested that the length of the two .elds be aligned in 16/32 bit boundary in the process of standardization.


Besides, r is r = rs v (4) an increasing function of eh (technical proof is omitted).

when a row of sensors are horizontally misaligned, the designed distance between sensors should be decreased and it should be 47 in the worst case.


timer down to zero even for the largest possible value (which in our setting is 15).


It is assumed that interfaces are indexed from 0 to NI .

a station iterates through all of its interfaces and assigns a new random channel that does not overlap with other interfaces; in such a way, the newly selected random channel is di.erent from the random channels that have been assigned to the previous interfaces.


)e d. (16) t where the second equality follows from integration by parts.

following the discussion after (13), ui(T ) =0 for all i, and therefore from (8), H(T ) simpli.es to B B at a time at which .i = 0, we have: '-ß0E(T ) H(T )= g (T )e + .E (T ) B Ii(T ).


If there is such a path in this graph, the upper bound is adjusted to the current k. Otherwise, the lower bound is adjusted to k. The binary search is repeated until the vector is reduced to two elements.

k is chosen as the element in the upper bound, and Djikstra is used again to verify the delay constraint.


Second, the abrupt throughput drop is related to the beacon delivery ratio.

we can use the beacon delivery information to e.ectively determine the location to switch between direct access and using relay.


This gap between the well-known capacity results and the impractical assumption on link scheduling potentially undermines our understanding of the achievable network capacity.

the following question remains open: can localized scheduling algorithms achieve the same order of capacity as their global counterpart?


At last, the beacon is broadcast further with probability ..  Algorithm 3 Receive Beacon at NPP 1: if Hop count equals 1 then 2: Use beacon solely for neighbor localization as in Algorithm 2 3: else 4: if Beacon source is predicted to be a future neighbor2 then 5: Calculate time t predicted to vehicles to be neigh bors 6: Store this information on Predicted Neighbors Ta ble 7: end if 8: end if 9: if Hop count <H then 10: With probability ., forwards beacon 11: end if The performance of NPP depends on three mentioned parameters: gossiping broadcast probability ., vicinity coef.cient .

and maximum number of hops H. an instance of NPP is de.ned by the triple (., ., H).


On the other hand, in the case of basic MPLS, multicast packets are not sent through Label Switch Paths (LSP), contrary to unicast packets.

although traceroute may infer a false link between the two endpoints of an LSP, mrinfo will correctly provide the direct IP neighbor.


In query localization, the propagation of a RREQ is limited to the area around the previously known route to the destination node.

the RREQ is not .ooded through the entire network.


We have shown in Figure 17 that 80 users in a 144m x 144m area is enough to keep the average localization accuracy of Social-Loc below 3m.

83 users in 72m x 72m would not decrease the performance of Social-Loc.


At most, there is a 9.8% increase in LOC11, most of which is state serialization code that could be automatically generated [3].

the NF changes required to support OpenNF are minimal.


Note that FARA transmits four packets in every frame and hence has less medium sensing overhead.

to ensure that the differences between the two MACs are due only to frequency diversity, and not medium access overhead, we allow the sender to transmit its packets without waiting for an idle medium.


The route corresponding to a .ow is not derived based on a given topology, but is chosen randomly to re.ect the network topology at a given point in time.

the e.ect of a dynamically changing network topology is captured in the simulation.


This multiband mechanism allows applications to operate without any disruption, since it is transparent to upper layers and makes the MAC layer the responsibility to ensure session continuity.

in this paper we introduce the MAC and PHY layers of the current IEEE 802.11ad draft standard, with special emphasis on those features that enable multi-Gbps data rates and robust operation in 60GHz.


In the same network setting, having the lifetime set to 1 second allows lower drop rates compared to the case of packets with 200 millisecond lifetime.

if shorter lifetimes are desirable, it is useful for the application to limit its data request rate to reduce the likelihood of packet losses.


This is clearly undesirable in a wireless resource allocation environment where the gateway should provide some level of QoS guarantees in terms of fairness.

in the following section, we propose another new auction approach.


In cellular networks, we show that spurious timeout is caused by the fact that TCP stays with its original estimate for the RTT and a tight retransmission timeout (RTO) estimate derived over multiple round-trips during the active period of a TCP connection is not only invalid, but has signi.cant performance impact.

we suggest using a more conservative way to manage the RTO estimate.


The whole message exchange may be not completed because the nodes are mobile and they may leave the radio range of the other participant before exchanging all the required messages.

according to the system model, the nodes are not able to obtain as many messages as they want but at maximum one for each participant per time step.


Since we focus on the QoS guarantee of the main flow, this performance degradation experienced by disturbing flows is actually paid off.

reservation effectively avoids serious degradation of the main flow.


The actual bandwidth Bm from the AP to H2 is measured to be 4.06 Mbps, which agrees with the potential bandwidth estimate of 3.74 Mbps, obtained by H2 prior to af.liation with the AP.

the experimental results suggest that our approach is promising.


From Figure 16(a), the CapProbe scheme still estimates the right capacity for di.erent crosstra.c values.

even when the strongest mode is the ADR, CapProbe is able to estimate the correct capacity.


Key distribution schemes which facilitate source authentication permit a source A to compute an authentication token TA,M for a message M, which can be veri.ed by any receiver.

source authentication schemes cater for unlimited number of veri.ers, whose identities may not be known to the message source a priori.


However it is necessary to consider the unfavorable channel environment to investigate the lower bound of system performance.

the performance analysis will also consider multipath fading channel environment.


The total transfer payment of all FAPs with Um equals zero.

the total transfer payment of the whole network also equals zero, which can be expressed as MN LL E Tn m =0.


In many cases, episodes can be delivered minutes or even hours after being published without affecting the user s experience.

the wireless podcasting may utilize intermittent connectivity provided by an ad-hoc network of users who carry podcast devices with dual radios (cellular and shortrange).


This gives us an estimate (probability) of whether the node meets its deadline.

if, packets carry their deadlines with them a comparison can be made and the packet accepted or rejected based on this estimate.


This per-station fairness does not translate to .ow-level or end-to-end fairness in WMNs where nodes higher in the routing tree relay an increasing amount of aggregate tra.c.

these nodes experience high queue drops; this results in capacity loss when the dropped packets originated from other nodes and have already consumed a portion of the shared spectrum.


Finally, the online recon.guration procedure is independent of the order in which the failed links are detected.


decide to choose a more distant yet a more stable one.

kADER is able to lower nodes power assignment by preferring close-by neighbors, which increases transmission concurrency and improves nodes lifespan.


On the other hand, some researches have proposed adding the location information of peers to solve the topology mismatching problem [6, 7].

this study proposes a location-aware wireless mobile (LAWM) P2P architecture which adds the locality support for peers in order to alleviate the topology mismatching problem.


WMNs covering shopping malls, a campus or a city, usually consist of a number of nodes, and each node must deal with site-speci.c link conditions.

wMNs require a clear picture of local link conditions for network troubleshooting.


In the current 802.11 standard, a receiver does not provide explicit feedback information on the best rate or perceived SNR to the sender.

most practical rate adaptation algorithms [1, 2, 12, 8, 6, 10] make decisions solely based on the ACK, which is sent upon successful delivery of aDATA packet2 .


In order to limit the search and discovery of acceptable resources and components of the application, it will be invaluable to be able to identify the set of regions (one or more) to be used.

for example, if the catalyst is building a home alarm application, it will be valuable to limit the catalysis to the homeowner s home, the neighborhood (for notifying neighbors perhaps) and the appropriate municipality (for notifying the policy or fire department).


On the other hand, according to Corollary 2, in each iteration Sub-CABS can produce a schedule within at most O(a2)time slots.

the total number of time slots consumed by CABS is O(a2)R, which gives a constant approximation ratio.


As a result, STAs that are nearer to the AP will have to wait longer time before receiving the broadcast data.

a STA closer to the AP consumes more power in receiving a broadcast data.


However, in opportunistic networks, contacts are typically caused by node mobility, which is non-deterministic.

rather than calculating a .xed number of switches per contact, a good role switching heuristic should continuously re-evaluate the remaining lifetime of the contact, and produce a switching decision based on this and the above reference consumption readings.


The unit disk graph model is a weak approximation of the propertiesofthe wireless radio.

the moregeneral d-quasi unitdiskgraph model[12] ispreferable.


However, if requests are allowed to be rejected, then it is possible to guarantee a high quality of service for every individual request stream.

the typical practice of rejecting requests in case of overload is a necessary condition to ensure ef.cient service under game theoretic measures.


Hermes removes the PCIe transfer overhead and amortizes the packet-waiting time among computation.

the average throughput of Hermes can still outperform CPU/GPU by a factor of 5 in the best case, although the adaptive issuing mechanism violates the throughput-oriented design philosophy of GPU.


We define the time slot length to be long enough to receive one message.

only the contention winner can transmit a message to the destination node.


Our analysis in Section 3.1.2 shows that in presence of several competing nodes, turning on the repeater functionality brings little bene.t to either the client or the repeater.

when the Max-Min Fairness objective is used, the repeater functionality is generally not turned on in presence of competing nodes, as con.rmed in Table 2.


Provider mobility, however, is far harder as naming in CCNx is based on organisation names, which often map to relatively static locations.

to ensure routing aggregation, it is better for organisations to move as one, rather than having individual items of content move independently.


On the other hand, the TCP .ow (due to its greedy nature) completely .lls the channel.


Similarly, the forward path will be activated by the RREQ message.

when the RREP reaches the source node, a route is already available unlike MAODV which requires exclusive Multicast Activation (MACT) message to be sent to activate the route.


Thus, when the size of the cache is larger, keeping a record of videos that are popular over a longer time scale, like Video B, allows the cache to keep such videos in the cache as well, which further increases the hit ratio over time.

longer time windows are more bene.cial for large cache sizes, while small caches needs to be dynamic and focus on content that is popular on shorter time scales, making a shorter time window preferential.


Whenadatarequestarrivesatthenetworkfora .leblock(which can be delivered in one data packet, e.g., /movies/diehard/1 ··· /movies/diehard/1000 ), the controller computes the forwarding path label for each of such requests by using one of the three producersasthedestination regardlessofthelength oftheannounced pre.xes inordertoachievemulti-pathroutingandloadbalancing.

the overall movie .le can be transferred to the consumer from all three servers along different paths, improving the response time and network utilization.


Periodically, Pdensity will go through the list of ids and remove those neighbors whose counter has reached zero.

the Pdensity table only needs O(di) entries, where di .


As mentioned earlier, an extreme example of this is one in which operations become increasingly unreliable with replication or partitioning.

in considering distribution and partitioning not only the clients distribution but also the isolation or integration of a region may have an impact on whether and how a region s infrastructure is distributed.


Thus, by Pigeonhole  v  principle, there is one cell such that its load (the number of .ows using its base-station) is at least ns/4.

we have the Then,min(m, k)/2 = E( ki) =min(m, 2k).


In the standard version of the problem, the correct players are also required to decide on one of the co:r- rect players' input values, but only when they all start with the same value (the so-called Validity condition); otherwise, they can decide on a default (say, 0).

in the case of binary decisions, both problems -- strong consensus and standard consensus -- coincide.


In contrast to previous studies that painted wireless communication as unreliable, this study shows that a wellplanned deployment of wireless technology is able to provide reliable connectivity.

when needed, wireless backbones are an attractive and cost-ef.cient alternative to wired links.


The scheduler observes the following rules: Initially the scheduler allocates an equal rate to each path, which may be incorrect.

as soon as the scheduler has enough information6 about the path characteristics, it should recalculate the fraction distribution for each path.


In case that the pico-cells are deployed in macro-cell, a user equipment (UE) measures the received signal strength (RSS) from BSs in macro-cell and in pico-cell and selects the BS with the highest RSS as its serving BS.

interference scenario of pico-cell considers cross-and co-tier interference from non-serving macro-and pico-cells, respectively.


Note that the increase in end-toend round trip latency of 3 ms to a base end-to-end latency of up to 25-40 ms is acceptable.

the end-to-end performance results show that the VBS pool prototype can meet the basic requirements of Radio Access Networks.


Since ßn s remain approximatelyconstant for movements of the order of a wavelength, average gain G also remains roughlyconstant.

with short-term channel variations, although the average gain mayremain constant, the instantaneous gain can change rapidlywith time.


Many of the node failures do not affect the path between an ingress node and a best egress node for a pre.x.

we omit all values that had a delay ratio of one.


In addition, wealth variation among a group of users may discourage rich nodes from participating in a cooperative relay service, as the rewards for relay support will have negligible value to these users.

some rebalancing principles to enable the pricing approach to work properly are needed whenever there is a large wealth disparity between rich and poor users.


There have been several studies about WLAN deployments [11] in a large area and this is still an attractive research .eld; however, there are insu.cient studies of real use-cases for large areas such as airports and container terminals.

our motivation was to analyze a freight container terminal, which is a large area with multiple APs using di.erent channels.


When the control channel saturates at a load of roughly 1 /12 e 7 or 21.46%, the throughput is (0.2146 × 6 Mbps/channel ×12 channels) or 15.45 Mbps.

at a load under 15.45 Mbps, the delay is very low because both stages are under-utilized.


The performance of both set cover techniques degrades over time, with ISC degrading faster to 7% interfaces missing relative to ground-truth after 11 cycles.

while set cover techniques can provide a signi.cant savings in probe tra.c, they alone do not su.ce, as the topology changes over time.


Otherwise, we apply thesame procedureto l1, moving to the edge before last on l1 s most preferred feasible path, called l2 (which we regard as a new candidate to be e2).

wecreatea sequence of edges l1,l2,.... We show that this procedure eventually reaches an edge that .ts the description of e2 (thus concluding the proof), because otherwise the No customer-provider cycle will be violated (a contradiction).


Processing can be parallelized using standard Apache configuration techniques; there are no table-wide database locks involved that would cause blocking in a parallel setup.

ad Server request processing time is not the first bottleneck if the system is scaled up.


Although mesh routers and mesh gateways are static nodes in the typical WMNs, mesh clients have the mobility in intra-network domain or inter-network domains.

the latency happens when mesh clients move in or out.


A node character factor [9] s The relative atomicity [8] tic networks due to long delays and frequent network partitions.

the evaluation of reputation in terms of adir and ßdir an approach proposed in [9] to tackle the uncertainties of evaluating the reputation.


If the QoS requirements are not satisfied then step 1, 2, 3 and 4 are repeated.

enabling an optimum selection of system parameters satisfying QoS requirements and accounting for an instantaneously changing wireless channel conditions.


We compare ElasticSwitch with two other approaches: (i) No-Protection: sending traf.c directly, with no bandwidth protection, and (ii) Oktopus-like Reservation: a non-work-conserving reservation system, with rates statically set to be optimal for the given workload in order to achieve the hose model.

oktopus-like Reservation is an idealized version of Oktopus; in practice, Oktopus is likely to perform worse than this idealized version.


The expected number of jammed slots is at most sc lnn -4o ' )2(b/2+1)i E[ Zj]=· (1-e = c lnn.

1 )2(b/2+1)i (1-e-4o ' thetotalexpected number of noisy slotsthatAlicehears is at most 2c lnn.


In a MRC RAKE receiver, the output s decision variable is identical to the decision variable which corresponds to the output of a M-branch space diversity MRC technique, with M=Mss, [16].

the MRC reception of spread signal, achieved by the considered RAKE receiver, is equivalent to a Mss-branch space diversity MRC technique.


As for the time complexity, the information generated at each node has to spread for h hops in order to reach all its destinations.

the expected time complexity is O(1) steps once an h is chosen.


Flow control is also nontrivial to get right: likely-mistaken .ow control limits have been observed to lower peak transfer rates [1, 48].

we decided that DCCP should not impose any .ow control limitation separate from congestion control.


Note that d(u,a)r.Let vbe the point on ithat is closest to a.Then, d(a,v):s/(2e).From triangle inequality, 's d(u,v):d(u,a)d(a,v)rr.

2e vis covered by uand so is line i.Since there are at least ksuch sensors u, iis k-covered using a sensing radius of r. Thisprovesthe lemma.


Let the area occupied by the forbidden zone be 1 times of the total area covered by a node if it a were equipped with an omni-directional antenna.

the area covered by the transmissions is 1 schemes discussed above.


We highlight the ampli.cation issue with regards to customer availability since CENIC s primary value as an ISP is in providing connectivity to its customers.

reliability is best gauged not from statics about individual network failures, but instead through customer availability.


When discussing affinitization, it becomes obvious that despite these changes, distance and locality still matter, whether the network is large or small .

in the future, the most efficient solution may be not only to integrate a NIC onto the processor die [4], but perhaps even integrate the functionality with existing I/O structures, such as the north bridge.


In each experiment, appropriately marked requests would cause one of four server failure scenarios: pre-/post-send true/virtual failues; the following describes the activities involved in measuring latencies with request numbered Rx from client Cy being marked as: i. Pre-send true failure -the server designated to be request manager fails after request Rx from client Cy has been processed by the server group (i.e., Cy receives reply for Rx).

when Cy makes next request Rx.l, say at time T, it will encounter a (true) failure.


In systems powered by energy scavenging, the power source typically has a low power output.

even if the energy supply is abundant, the power consumption is constrained.


gave the detailed proof to show that for unit disk graph the number of independent nodes in 2-hops neighborhood (not including the 1-hop neighbors) is at most 13 while the number of independent nodes in 1-hop neighborhood is at most 5.

there are at most 18 independent nodes inside the disk centered at a node v with radius 2, i.e., a[2](UDG)=18.


Node F receives the data packet with path information field and node F updates the number of hops field and forwards the data packet so the sink can still schedule the path A-F-E-D.

the meta-schedule advertisement allows seamless interoperation between TDMA inside the intensity region, and CSMA operating outside of that region.


It can also exploits the dynamic Time Division Multiple Access (dTDMA) bus [3] with a centralized arbiter for the vertical communication link.

moving from one layer to any of the other layers takes only one hop and, contention issues in the bus limit the attainable performance gains [1].


Nevertheless, e can still transmit unicast datagrams to f. Clearly, broadcast .ows are associated with nodes and not links.

we need to express addition constraints based on con.icting nodes.


There are ns multicast sources chosen randomly from the n nodes, and each of these sources is associated with nd destination nodes also chosen randomly.

the total number source-destination pairs is nsnd.


erably higher number of messages than before launching the attack.

the performed .ooding attack can be detected not only by analyzing the energy slope of the malicious node itself, but also by monitoring other nodes in the WSN which have abnormal energy consumptions.


Then, with the transmission range r(n), each hop can jump over at least (log n - 1) cells.

any cluster head within the distance of log n-1 kr(n) log n is reachable in k hops with high probability.


The probability of discovering a node, given by equation 5, is too close to zero.

these powers are not adapted to our needs.


As new push multimedia services have been introduced into 3G networks, the same services may be extended into ad hoc networks.

this paper considers effective multi-path ways to stream video within a MANET.


2.2 Ranging with 802.11 link layer measurements As introduced in Section 1, the distance estimation approach presented in [1] is based on RTT measurements obtained by counting the time elapsed between the link layer data frame and the corresponding link layer acknowledgement (ACK) frame of the IEEE 802.11 standard (other link layer frames would be also suitable [15]).

the RTT is measured from the last segment of the data frame sent to the first segment of the ACK frame received (see Fig.


For example, say that, in the absence of nulling or alignment,theinterferer achieves a25dBSNR at aparticular re-ceiver.Thenif nulling or alignment reduces theinterferencepower by over 25 dB, the interference will be below the noise, and its impactis relatively negligible.

in n+ we make a transmitterjoin an ongoing transmission only if it can reduce its interference power below the noise power.


However, while the video player is downloading fragments of l2 , it continues playing the bu.ered video at the original quality.

we can use the bu.ered video playback period, from t2 to t4 , to download the video fragments at 0 102030405060708090 Time /s the intermediate level.


In [17], Raiciu, et al show that MP-TCP enables smooth handovers between WiFi and 3G.

mP-TCP is promising in providing more reliable and faster connections for mobile devices by leveraging connection diversities under dynamic environments.


For comparability with previous tests, we chose values of N ranging from 158 ~ to 1581.

when N = 158 we have N2 = 104 and the component has 1 million gates and 0.5 million lookup tables.


This is because MPAP uses only a single wide-band RF front-end, which can only transmit or receive at a time.

in MPAP, if a VNIC is transmitting/receiving, all other VNICs should transmit/receive as well.


In the case of the sounding balloon, all sensor data is however sent at once.

a single frame sent by the balloon either via HAM radio or via an SMS message contains several sensor readings and a tag scan (actually being the GUID of the balloon) at once.


In other words, it may disturb D s detection instead when the selected R has bad channel quality.

the adaptive algorithm is required to attain the ultimate purpose of the cooperation.


SLNP negotiation process The negotiated QoS attributes can be additive (Delay, Jitter), multiplicative (Loss Ratio) or concave (Bandwidth).

security impact on QoS parameters such as delay resulting from cryptographic operations at communication ends and extra bandwidth needed for the added headers will be estimated and taken into account when negotiating SLS.


Another problem is that PRR based metrics assume that the current link quality remains the same as the last estimation, but this assumption of stable link quality is often invalid due to the notoriously frequent variations of wireless links.

accurate quality estimation of intermediate links remains a dif.cult task due the convergence time of ETX and the dynamic nature of wireless channels.


In the IEEE 802.15.4 MAC protocol, it operates slotted CSMA/CA without prioritybased channel access policy.

as shown in the figure, the average delay of the IEEE 802.15.4 MAC protocol has the largest delay.


(9) p k Notice that by (A.6), B(k) is irreducible for each k .

k. the Perron-Frobenius theory [48, 37, 35] implies that the matrix has positive left and right eigenvectors (denoted by y and x, respectively) associated with the spectral radius .


For the sake of discussion, suppose that the destination is N hops from the source.

the destination broadcast the JBC packet to the members of the (N - 1)th relay-set receives this JBC packet.


Then the SAP s pro.t is ( ) Ge-(1+p) R(p, a, Wl,p)= p min ,Wl + alnpJW -alnpJWCc - WlCl.

(1) in Stage III, SAP announces the optimal price p* =arg maxp=0 = R(p, a, Wl,p), and in Stage * II, SAP determines the optimal leasing amount W = l arg maxWl R(p, a, Wl,p*).


the same power level for all nodes), increases the overall throughput of the network up to a factor of 2.

there is the need for the protocol stack to be aware of the nature and capabilities of the lower layers.


Typically, in these connection-oriented networks, paths for connections are constantly re-balanced so that they eventually settle onto the new SPRT (unless the connections are explicitly routed).

in these networks the goal of traf.c engineering is to determine the minimal set of Layer 2 tunnels that can be used to alleviate congestion for management .ows.


Using only the selection without any other operation will result in a local optima.

two operators, crossover and mutation, are used to create new individuals, called progenies.


At high load scenario (Figure 5(a) bottom), requests to some data units might have shorter IRTs.

the plot shows more than one line other than a single smooth line in the moderate load scenario (Figure 5(a) middle).


Here, the heuristic adds the result of all previous iterations along with the number of rules in the temporary nodes used, consequently Sm converges faster to Smpf.

for HiCuts, the number of iterations is reduced, which implies that the number of cuts is also reduced and so is the data set size.


Weusetheterm marginal utility todenotetheadditional utility attained over each slot of the user s service session.

these utility functions can accurately quantify the time-varying user-perceived quality.


This result demonstrates that by keeping the generic packet forwarding path simple, relatively low-performance RISC processors, 323MHz processors in our case, can produce adequate packet forwarding performance.

instead of designing customized processors with special-purpose instruction, a more promising optimization strategy is to increase the clock rate of generic RISC engines.


Taking into account results obtained in test problem 1, its worth to pay more in processing capacity to find better solutions.

we can conclude that M-MMA not only finds more solutions than MMA2, but it also finds better solutions.


We .rst address the issue of whether the application-layer graph maintains the application-layer degree equal to k. Given the assumptions of the previous lemma, notice that the application-layer graph in ODRI is a scaled-down version of the underlying de Bruijn graph.

the diameter of the peer-to-peer graph under these conditions must remain optimal as we show in the next lemma.


Now, under NE,primary1 spricedistributionbeinghisbest response to those of others, he must attain the same expected utility for the entire range of prices he is randomly choosing his price from, moretechnically,intheentiresupportset 5 ofhisprice distribution; thisisbecausehisbest responsepricedistribution will neverselectfromthelesspro.table ones which will notthereforebeinits support set.

(x -c)(1-F (x)) is the same (i.e., a constant) for all x in the support set for his NE price distribution.


This is to make the experiments feasible from a logistic standpoint.

we use software topology control to de.ne the neighbor relations between the nodes.


5.2 Wi-Fi Duplication Check Our automatic Wi-Fi collection mechanism is passive and highly dependent on user motion patterns.

we may collect a lot of redundant Wi-Fi data at places that a user visits often, such as home and of.ce.


However, up conversion has not received much attention (if any).

for the remainder of this paper we will focus on up transcaling.


But it is not practicable for context providers to broadcast contextual information constantly.

we will discuss two dimensions which are hop and distance, respectively, to control contextual information dispatch.


3.1 Analyzing EEG Data EEG signals are usually contaminated by eye movements, eye blinks, and muscular activities.

before analyzing EEG signals, we need to remove these artifacts from samples collected by electrodes.


In this scheme, based on the number of ACs supported, a suitable admission ratio is assigned to each AC.

a request of ACi will be admitted by CBQ-based ACU if the following inequality is satisfied: (5) Where represents all the requests of type ACi and aACi is the configurable admission ratio, 0 = a = 1 for ACi type, which determines the ratio of resources allocated to it.


V and the hub node is .x a.. Recall that LP2 with some minor modi.cations may be used to .nd the optimal activation thresholds of the ports for the design shown in Figure 4.

meeting the temporal tra.c demands with minimal number of components also for a(t) .


In that case new nodes on the path do not maintain LETED schedules yet and cannot guarantee end-to-end delays.

a node that discovers a new path creates a new schedule on the following nodes, similarly to schedule setup in section 5.2.


The second series uses non-preemptive generalized processor sharing (NP-GPS).

the arbitration penalty reduces to the service length of only a single task/packet of maximum size.


For .ve of the possible orderings, D becomes unreachable during a short period of time and a transient loop between R1 and R2 appears for two of the possible orderings.

two different problems must be solved to allow a pe router to remove a pe-se protection tunnel without causing packets losses : All the destinations that are currently reached via the protection tunnel must remain reachable during the entire routing convergence (the convergence preserves reachability)  No transient packet forwarding loops are caused by the update of the FIBs of the routers inside the AS (the convergence does not cause transient loops)  To preserve reachability and avoid transient loops, we need to consider how packets are forwarded inside an autonomous system.


Our main conclusion is that optimality is obtained at a high computational cost, with a performance gain very similar to that of much simpler but non optimal algorithms.

we conclude that fast and simple OR candidate selection algorithms may be preferable in dynamic networks, where the candidate sets are likely to be updated frequently.


we have ar(XX)lE[(NXN)2]lE[(N E2E2 pX)2].


The capacity degradation can be reduced by increasing the size of a neighborhood, thereby ensuring the number of interfaces in a neighborhood is equal to the number of channels.

the lower bound construction requires the cell size to be chosen such that the number of interfaces (or nodes, when each node has a single interface) in each neighborhood is greater than or equal to the number 7The neighborhood of a node consists of all other nodes that may interfere with it.


Unlike other network regimes such as tethered networks or multi-hop, unpartitioned MANETs routing performance in DTNs is primarily affected by the frequency and duration of opportunities for data transfer between nodes.

when studying the performance of routing protocols and applications in DTNs, it is important to have models that accurately characterize these transfer opportunities.


In fact, TCP-based connections rely on packet retransmission in case of detected channel errors [4].

the connection throughput inversely depends on the FER, as shown in [5].


It must contain the receiver ID of the node the RTS came from, as well as a NAV period, which depends on the NAV period received in the RTS.

the CTS needs to be calculated on the fly and we introduce at least twice the bus system latency.


It will always use the network carrier to send the message.

we can use SMS to test our own network status.


As the bottleneck link bandwidth reduces from Canopy (1.75 Mbps) to the DSL (700 Kbps) network, the time to transmit the packet through the bottleneck link dominates the duration between packets.

the distribution of the packet sizes decides the distribution of the duration between packets, irrespective of how they were sent by the placeshifting server.


Indeed, great pains are taken to ensure that .ows areloadbalancedontomultiplepathssothatthey mayfully utilize network bandwidth [16, 1, 12].

it is hard to obtain the bene.t of statistical multiplexing in the data center environment and it appears that large bu.ers will be required.


We generate these randomly, so that each time we synthesize a new network we generate di.erent PoP locations and tra.c matrices.

the generated networks are guaranteed to be di.erent.


However, since our traf.c traces are captured in each of the 22 different subnets (i.e., broadcast domains), the traf.c patterns among the hosts preserve the broadcast domain boundaries.

our simulation network is equivalent to a VLAN-based network where a VLAN corresponds to an IP subnet, and all non-leaf Ethernet bridges are trunked with all VLANs to enhance mobility.


Piggy-backed on the neighborhood broadcasts, TCs include their list of active TGWs.

a node can easily determine whether it is similar to its neighbors.


It is clear that the identi.cation of a person carrying several tags will be possible with a very high accuracy9.

our TIE-based technique allows, infact, people pro.ling and clandestine tracking: an attacker only needs to pro.le the target once, i.e., to extract and store for each of the tags in the target s set the corresponding timing feature .TIE , and then track it by following the set of tags.


Meanwhile, 2,125,845 pre.xes with 2 components are the longest pre.xes (leaf pre.xes1).

if we .rst search the pre.x with 2 components of the name, the probability of returning the longest pre.x is 83.54%.


It is not surprising to see that mobility has such a fundamental in.uence on the behavior of mobile systems.

a clear knowledge about mobility used in the system is not only helpful but also essential for the understanding and interpretation of the system behavior under study.


Also, to justify hopcount distribution, note that the network diameter is between 3 and 4 hops.

4in the best case, the minimum total hopcount to a destination is 3 (i.e.


Since Medium Access Control (MAC) layer rules the sharing of the medium and all other upper-layer protocols are bound to that, it has the ability to severely a.ect the overall performance of the WMSNs.

mAC layer becomes a proper choice to implement QoS support.


N(c) cannot be the cause of the change at c because it cannot change the relative preference between the (unchanged) paths c receives from its downstream neighbors On(c) and Nn(c).

either c changed its route preference and is the root cause, or one of its downstream neighbors changed their export policy and are the root cause (local change).


After some post-processing we can obtain a good approximation of the distribution of that event without collecting all those events.

these statistics are normally related with distributions or density function of some parameter [6][7][8].


Finally, we assume that data packet sources can determine the locations of packet destinations, and mark packets with their destination s location.

a location registration and lookup service that maps node ID to location [6] is required.


However, the mobility of vehicles is not only a.ected by the vehicle itself, but also by some external means, such as the signal operations of tra.c lights.

the tra.c lights can a.ect the data delivery in VANETs.


The number of members that occur in layer Liand no other higher layer is bounded by O(Ntki).

the amortized control overhead at an average member is logN X 1 N logN1 k:iO(k)+O()+O( )!O(k) i NkNN i 0 with asymptotically increasing N. Thus, the control overhead is O(k)for the average member, and O(klogN)in the worst case.


Moreover, the algorithm is based on the multinomial logit model from discrete choice theory [5], [42].

the model parameters can be calibrated to fit real-world observations [1], [27].


The generic objective function is concave in the optimization interval de.ned by the above selections of the optimization variables, and the search of the optimal solution is constrained in a closed interval de.ned by linear constraints.

the optimal value will lie on the boundary region of the corresponding search space.


However, this approach may become impractical, as the number of substates quickly becomes very large.

it was decided to study the evolution of the system at the state level as a birth-death process, and to approximate the sub-state probabilities s(r1, r2,.


When there are many signal misses due to other causes, such as the capturing e.ect, its assumption fails.

the Alg-TH can perform reasonably well in the area where each BS is assigned a unique frequency band, such as in the MAXWell network.


At the end, we could see that the resulted intervals are all on the left side of FjL+t/2, which is or is at left side of FjL+L.

the resulted intervals will not cross with the right side of R. By repeatedly checking the legality of horizontal highways(vertical highways similarly), .nally, we could build a highway network system where all highways are legal.


To avoid the modulation downgrade, the 3G RRC can decouplePS and CS services by assigning different channels.

pS and CS services can be transmitted with different modulation schemes (e.g., 64QAM for PS and 16QAM for CS).


If we assume a simplistic scenario where both the APs start contending for the medium at the same time, and are successful in transmitting their .rst packet at the exact same time, then the transmission concurrency on these ET links isdoubled.

afterthe .rstpackettransmission,both theAPswill sensethecarriertobefreeforaperiodof dw ,andthentransmittheir secondpacket atthesametime.allpackettransmissionsafter the .rstpacketaresynchronized achieving theeffectofdisabling the carriersense3.Inreality,however,the .rstpackettransmissions are highly unlikely to be synchronized due to wired jitter.


Note that we use various levels of an SINR threshold for grouping MSs in a BF-NC based retransmission scheme.

the optimal solution of a BF-NC based retransmission scheme for each value of total transmit power is to select an SINR threshold which minimizes the number of transmissions.


According to the proposed protocol, .r equals the maximum tolerable error at the most congested node in the network.

minimizing .v locally at the congested node simply minimizes the total estimation error bounded by .r.


The behavior we observe with this logic is that usually all the replies reach the base station and even if one doesn t, it is not always the same mote that did not manage to reply.

by periodically broadcasting management messages we ensure that we maintain the necessary information in our database for all motes.


As tblk is by nature more random and is difficult to obtain directly hence we use the expectation E(tblk ) or the predicted value of it.

for a1 and a2 the expected utility degradations can be formulated as: ..U = P ·.U(S ) + P ·.U(S ) .a111 112 2 .


Therefore the overall policyisaconvexcombinationofEXHAUSTpolicies.

thereexists an optimum policywhichisEXHAUST(S, i).


These two considerations imply that, on average, all the cells have the same probability of being selected as goals for external movements.

in HCMM, there is no preferential selection of short paths (closer cells) over long paths (distant cells), and, as a consequence, no truncated power law jump size can appear.


Then, the maximum pollution scope of polluted packets in this time interval is d - h. Upon receiving the .rst checksum, all the direct neighbors of the attacker will detect veri.cation failures, and increment their Cv by a(1 - hd ).

they will stay in the verify mode for at least a(1- hd ) time intervals.


For instance, 2-stride XFA on Bro3 requires 2121.95Mb, while 2-stride CFA requires only 3.1Mb.

2-stride CFA achieves significant improvements in matching throughput and power consumption.


5 implies that, for any d2 = 0, we have v « -d22n|B| 3p(1 + d2) n Pr nB =v = 2e 3 2 m -d22log(n) 2 3c3 = 2e = .

(21) d2 2 3c3 n if we choose d2 = 3c3,then as n .8 w.h.p we have vv 3p(1 + d2) n 5pn C(A) =v + v 2 m 2.1 m v p(3(1 + d2).1 +5) n = v (22) 2.1 m In the previous section, we have already shown that that w.h.p the demand across square shaped cut with area O( 1 ) m is of the order of T(n).


From each of these Byzantine vertices there is a path to b that has no other Byzantine vertices on it, and therefore IBll > t -J- 1.

there are at most another 2t -(t + 1) = t ~ 1 sets Bj for which Bj ¢ 0, and the depth of G* is as asserted.


Although performance adaptation solutions have been proposed [1, 2, 5, 7, 34, 40, 48], they are ine.ective for RTC applications, where the end-to-end delay between content generation and content consumption is on the order of network latencies.

techniques such as packet retransmissions or use of large client-side de-jitter bu.ers to absorb jitter variations, e.ective for web browsing and video playback, will lead to intolerable delays in RTC applications.


In contrast, WARP speculatively routes packets to the destination while updating its routing state and does not accumulate many data packets for later delivery.

hyper s reliability decreases with higher speeds while WARP maintains high reliability.


This hierarchy is formed statically and independent of the proxy affinity for web pages.

it is likely that the cache providers are far apart (in the hierar- chy) from the requester.


The layered (end-to-end) encryption of mix-net systems stops a non-terminal malicious relay from determining the content of a message.

it also protects a message s recipient from exposure, which otherwise would be identi.ed through addressing information in the message clear-text.


Our implementation does not perform failure detection, since we believe that in general the endpoint will be able to do a better job of determining whether its traf.c is actually arriving at the server.

failover is an endpoint-driven process in this case.


Thus also in this case the network is disconnected with strictly positive probability as long as RT (n)= v log(n) o(n ).

node mobility plays no signi.cant role, and the system behaves as if nodes were .xed.


On the other hand, the subsets selected by the greedy selection can yield a total weight that is at least (1 -1/e)times the optimal value [8].

the total utility of the selected photos is also lower bounded by (1 -1/e)times the maximum total utility.


Channelbondingandinterference: TheuseofCBprojectsinterferenceoveralargerspectralbandwidth(40MHzasopposed to 20 MHz).

the wider channels will have to becarefully assigned to cells in an enterprise WLAN.


access protected content, and hence should be considered as security weakness.

we take the viewpoint, that it is desirable to from a security point-of-view to sacri.ce some area between the boundary of the STAC region and the actual approximation region so long as we do not have any key information being leaked outside the desired access control region.


Moreover, pre-distribution of secret keys is non-trivial due to the resource constraints in sensors and dynamicity/variation in the mesh networks.

this implies a clear need for research on development of new approaches for intrusion detection scheme, in the mesh networks comprised of smart meters with wireless devices.


The node will not transmit the packet immediately because one of its downstream nodes may have received the packet or some blocks of the packet correctly.

it will wait for a feedback of the packet for up to a timeout, which is set to be 20 ms in our current implementation, before sending any block of the packet.


In HCMM, for all external trips the home cell is either the source or the destination of the movement.

thepossible distances travelledby each node depend on the distance between their home cell and the other cells of teh scenario.


In the .rst approach, each node measures the channel busy time locally using carrier sensing.

in this way each node measures the aggregate busy time of the channel, and populates the data structure by this aggregate value.


Based on the fundamental limit [32], however, the information capacity estimate of a .ber link with spectral e.ciency of 3 b/s/Hz is even much higher at about 150 Tb/s.

the capacity of TWIN can be expected to grow much further with continued improvement in transmission technology.


Hence the primary network s utility depends on the channel usage behavior of the secondary network on the channel.

the actual utility of a primary or secondary network depends on which network it shares a channel with.


The threshold for our outlier detection can be mathematically derived as in [40, 37], assuming a multivariate Gaussian distribution for the metrics vector.

the contours of equal probability of this distribution create a 2-dimensional ellipse and the outlier threshold re.ects the probability of a vector being within the ellipse whose semi-axes are determined by k. The probability that a random vector lies within the ellipse increases with the size of k. for a given value of k the probability that a probed tuple lies within the ellipse can be computed as: 2 -k P =1 - e 2 (6)  We initially analytically selected a k of 1.5, in theory creating a threshold through which 53% of the coordinate updates would successfully pass.


Since FM UWB is another candidate for medical BAN [10], it is likely that FM UWB BANs will be co located with UWB IR BANs.

it is important to evaluate the impact of FM UWB systems to UWB IR.


The SD server requires symbols from all antennas before it can .nalize the output.

even if one TCP connection slows down, the entire MU-MIMO frame, as well as a few subsequent frames, is delayed.


When each node se-the control channel to another channel when incumbent sig lects one (channel, seed)-pair, the resulting sequence period is (N + 1) timeslots, and each pair of sequences rendezvous exactly once within a period.


For uniformly-distributed TTLs, each spoofed source IP address has the probability 1/H of having the matching TTL value, where H is the number of possible hop-counts.

for each possible hop-count h, only ah/H fraction of IP addresses have correct TTL values.


Thus, for each transmission from either node N1, N2, or N3, N0 can forward a packet to a destination.

the aggregate network throughput is equal to the single link capacity.


For such a tree, every clause node must receive a transmission from some variable node.

the assignment corresponding to that tree is valid and satis.es .. We note that we have reduced the satis.ability problem to an instance of Problem MLB which consists of only two trees and each node has a single transmission power level, all transmission power levels are equal, and the initial energies of all nodes except one are equal.


By default, the set of receiving antennas is extended to all antennas of the network.

by default, WSNet operates in a full interference mode.


For example, although the algorithm allows the relocation of 154 items to second best predictions, a lesser number of items existed in the original cache and were eventually relocated.

the utilization factor of the relocation scheme dropped.


This is effectively the recon.guration in (10).

after e1 fails, the protec '' 2 tion routing for e2 becomes pe2 (e1)=0, pe2 (e2)=0.2+0.1 · 9 , ' 3 ' 4 p (e3)=0.3+0.1 · , and p (e4)=0.4+0.1 · e2 9 e2 9 .


From an optimization point of view, in this paper we focus on the Data fusion phase (and the related Belief propagation and Channel detection and sensing phases), the RSU window-time allocation and client scheduling phase, and the ACK/NACK phase, while the other phases of the protocol are implemented in the simulation result scenario.

we do not tackle here in detail the way each VC autonomously computes own desired access rate (in the following, we call it the query access rate).


() vNT s can be used as the objective function of the optimization problem.

the original problem P2 is formulated as an equivalent minimization problem as follows.


However, those results only applied to a network with a certain degree of regularity, for instance a node that followed a known schedule.

a network with signi.cant randomness in node mobility requires different mechanisms to save energy while delivering messages.


AIJgradientâA..I through the network is present so that nodes closer to the destination have a higher DP.

messages destined for node A would .ow in the correct direction in the network.


In this case, the scale of the problem is so large that the joint optimization of the schedule and the capacity parameters becomes numerically di.cult.

we only consider the approximate methods of Section 4, i.e., the LP approximation (LP), the .xed schedule approach (FS) and the .xed capacity approach (FC).


The aggregate data rate of each channel group is Wm/c = W/c (since c = mc ).

a channel group in the (m, c)-network can support the same data rate as a channel in the (1, c )-network.


Getting the time of flight isn t easy but it is quite small and it can be compensated for by the available guard time.

a node can be synchronised to the current time T current using the following equation: T = T + T + T +(1.6ms *(H + P)) current transmission preamble switching Where H is the length of the packet header and P is the payload.


Moreover, ac-cording to Claim 4.10 each decrease sub-phase reduces the cumulative excess window by a factor of ¢.

after Iog~(B/CF) phases the total excess window will fall below Cp.


The server s packet trace contains no outgoing RST packets before a FIN or RST packet was received.


This contradicts the optimality of the E XHAUST(T,i).

si  T = f. Si = T. Hence,EXHAUST(Si,i) policyis optimal.


While neither the down-stream nodes nor the destination will be credited if the acknowledgement does not make it to the base station, the source will still be debited the same amount (at the receipt of the packet by the base station).

it is not rational for the source to collude with the destination or any down-stream nodes to drop the acknowledgement.


This is achieved by sending a path update to the old MA.

the old MA is the BUnode for uplink and downlink traffic.


under the channel model, if c1 6cj , .c1 - cj .= = j=2 j=2 P P 1 n n .

if c1 > ci, ri from (10), if c1 > ci,P [s1 = m i=2 i=2 P 1 n 1 1] > and if c1 < ci, P [s1 = 1] < , which implies 2 P i=2 2 P that r1k(c1)= n rik(ci)and r1k(c1).


This paper propose a new way to model the city environment, but the results obtained from the simulation may be very different if a different layout of the city area is given.

the study on impact of the mobility factors and the theoretical analysis of City-IVC system will be the key works in the future research.


On the other hand small bu.er time may imply insu.cient node coverage.

arriving at an optimal bu.er time is crucial for the system to maintain a balance between performance and load.


That is, some nodes stay passive for a longer time compared to ASCENT and GAF.

increasing the initial energy decreases the fraction of energy used by passive nodes since the number of topology changes is more or less constant due to a .xed cluster timeout factor.


After that, the mobile nodes which have the least aggregate mobility value are selected as the cluster head nodes.

using MOBIC we can construct clustersinwhich the maximumdistancebetweenthecluster head nodes and other cluster members nodes is one hop.


On such windows, our algorithm will run in a space-e.cient manner, but we did not consider these windows since there would not be enough data for a fair comparison.

to simplify the presentation, we focus on 11 speci.c query windows: [1, 100], [26, 125], [51, 150],..., [251, 350].


It has been shown that the cost function users minimize over each TCP connection is approximately linear [20].

in this case, the price of anarchy is less than 33% and, in practice, one can expect losses to be small.


CONCLUSIONS 768 It is expected that vehicular networks will experience a 512 quick and widespread deployment in a near future.

256 developing and optimizing all types of services for such en 0 0 50 100 150 200 250 300 350 400 450 500 Distance (m) Figure 6: Optimum packet size at di.erent distances for the Nakagami-3 fading model for static and mobile receivers.


Since we implement Fathom in JavaScript, its execution will only block the single-threaded JavaScript interpreter, while the rest of the browser can continue loading the page.

fathom s overhead gets masked in part by network latency and the browser s parallelism during the document loading process.


A repeated use of such an argument shows that any two edges that are at a distance of K or more hops, must be at a Euclidean distance of at least HK/2Jfrom 1 each other.

disks of radius HK/2Jcentered at their 2 mid-points must be disjoint.


the maximum network lifetime in this paper means that the network has not only the maximum last node dying time but also the minimum time difference between the last node dying and the first node dying.


Given the number of sectors, we should choose the minimum beamwidththathasgood coverage(e.g.,forfour sectors, 35. antennas should be used) since this o.ers the stronger angular separation.

we propose that directional clients that are primarily used in indoor environments should be equipped with multiple narrow beam antennas: 35. or 65. patch antennas, along with an omni-directional antenna to handle the sce 100 80 60 40 20 0 Coverage (%) Coverage (%) Beamwidth (a)Indoor 100 80 60 40 20 0  20 40 60 80 100 120 Beamwidth (b)Outdoor Figure 3: Coverage of Directional Antennas nariowherenoneof thedirectional sectorscanprovidestrong signal strength.


Since both MN and FA are in the foreign network, the distance between MN and FA can be considered short.

the mobile routing advertisement procedure consumes little time.


Unfortunately, wireless networks are characterized by large number of packet losses because of fading communication channels.

loss recovery mechanisms must be added to prevent video degradation.


We observe that the estimated median number of packets lost during failures is 59K (Figure 13) but the estimated median number of bytes lost is only 25MB (Figure 14).

the average size of lost packets is 423 bytes.


There are at most n·d2s·|G(Ti)| such trees in |G(Ti)| (es)|G(Ti)| d2s·|G(Ti)| = the graph.

there are at most n·· n ·d3s·|G(Ti)| compact sets with |G(Ti)|boundary nodes.


For example, in figure 5, the capacity of an OFDM frame, ., is 4 packets and the average packet generation rate, t, is 1.5 packets per OFDM frame.

the minimum positive integer of Tc that satisfies e quation (3.2) is 3.


In mobile wireless networks, communication failures and limited resources cause additional challenges [22].

replication techniques for mobile wireless networks must lay emphasis on tolerating disconnections, network partitioning which frequently occurs due to node mobility and depleted node s resources [15].


However, retransmissions result in a decrease in packet loss rate.

a retransmission scheme can be devised which, instead of minimizing packet losses, can allow a certain fraction of packets to be lost (based on the application) thereby leading to a higher throughput.


Some values in .n is very small, thus thepower of the correspondent transmitted pilots are badly scaled and decrease to nearly 0 at the receiver.

the pilot placement should also consider the e.ect of .n and put pilots at the place for which the pilot power .atness is achieved.


Then, the routine Boolean transforms the real-valued assignment into one-zero assigment.

the output of this step is a set of L-Cost (L)= X...´ ` '' - e J x,x |L D(x, x ) ... x,x1 .X×X is minimized and for every x .


As shown in Figure 2(a), WCS of R1 and R2 is 0.6 and 0.7 respectively.

fTM s mean WCS of the tenants is  Athens-cumulative.


SIMULATION EXPERIMENTS To evaluate the performance of our protocol, we created a new application using Java platform.

we developed a highway mobility model with three lanes in the same direction (cf.Figure 8).


(2),the probability ofpacket receptionisalwaysnon-negative albeit small overlongdistance.

iftheredoes not exist any relay nodein a cell, adirect transmission to thedestination nodeis made.


The PRA problem has almost the same set of linear constraints as the MRA and MMRA problems and its objective is to maximize a concave utility function.

we can formulate and solve a CP ( : ) to approximate optimal solutions.


This Möbius transform is conformal and maps circles to circles.

ci becomes the outer boundary of the re.ected network with all the nodes mapped inside it.


NetFlow, the de facto passive measurement solution, already supports .ow-level collection of basic statistics such as number of packets, bytes, etc.

extending YAF automatically provided us with the .ow creation, .ow update, and .ow expiry mechanisms in regular NetFlow.


To achieve forwarding e.ciency for push based information dissemination, we try to reduce the time required for name resolution and complex protocol exchange at every hop in the overlay.

we prefer that the COPSS forwarding engines be present only at critical positions (i.e., edge of a domain and local rendezvous points (RPs)) and leave intermediate routers to only focus on forwarding.


When a femtocell is deployed indoors, its coverage area is much smaller in radius (usually measured in meters) than a outdoor cell.

the di.erence in the relative channel qualities of the users is not as high, lowering the signi.cance of the notion fairness.


Such performance metrics are usually referred to as quality of service (QoS) of the communication network.

collecting sensed real time data requires both energy and QoS aware MAC protocol in order to ensure efficient use of the energy resources of the sensor node and effective delivery of the gathered measurements.


However, we do not know which IPs are trackers in the normal-tra.c trace.

our timer for the later trace is started when the .rst handshaking message is transferred to a particular host.


Our algorithm generates a connected graph that does not have any self-loops and any multiple links between nodes.

we can use the output of our algorithm as an input for the 2K - preserving rewiring.


This produced problems of congestion and, even though OLSR computed shorter routing paths (less number of hops), the packets took longer times to reach the destination nodes.

dE-OLSR also outperformed OLSR in terms of routing QoS.


The main problem of our strawman implementation is that events assigned to different threads are not independent different threads may end up processing events related to the same source.

access to the state of the detector must be mediated by locks ( lock_element() in the example) to avoid data races.


In our example, Appreroute is not local, i.e., it may install .ow-entires on any switch in the network.

the root controller is the only controller able to run Appreroute.


Since the protocol detects faulty paths and removes them, we will encounter less faults when the next message is sent.

to send a message of length g, we send the g bits of the mes- sage individually.


In this paper, the naive approach we use as baseline downloads video stream at full-throttle rate.

energy savings achieved by EnVi are over the best possible download protocol for video streams proposed by previous studies.


Sensor nodes are ideal for deployment in extreme environmental conditions, such as on major highways or bridges, on naval vessels, under water, and in .re-prone wilderness [12, 21, 28, 32].

key setup must take place over the wireless communication interface.


This increases the probability to .nd the channel busy for 5 attempts.

failures of the adaptive slotted CSMA/CA increase as time passes.


Note that Tf (i) is an increasing function of i, since the lower-priority forwarding candidate always needs to wait and con.rm that no higher-priority candidates have relayed the packet before it takes its turn to relay the packet.

the total medium time needed for a packet delivered from the sender to the ith forwarding candidate is ti = Ts + Tf (i) (4) In the following subsections, we will give examples to illustrate how the candidate prioritization, selection and coordination will a.ect the expected packet advancement, reliability and medium time cost, which in turn a.ect the one-hop throughput.


For 802.11b, we use the speci. cations for the OrinocoTM wireless NIC which can be found at http://www.orinocowireless.com better-than-average channels) are typically at least multiple packet transmission times.

when a mobile user is granted channel access while encountering a highquality channel, OAR grants the user a channel access time that allows multiple packet transmissions.


Each bit of this array corresponds to a block on the CS.

a vehicle on a block is assigned a time slots if and only if its corresponding bit in RSV vector is set to 1 (see Figure 5).


This can be seen from the near .at capacity curve in the second region of the plot in .gure 2.

any interface rate allocation that ensures that noise at none of the wireless-optical interfaces is quantizer distortion dominated, is optimal.


Switch spoofing: Some of network engineers in the surveyed networks neglected to disable trunk negotiation, and also neglected to ensure that ports not meant to be trunks are explicitly configured as access ports.

an attacking host can imitate a trunking switch by speaking a trunking protocol like IEEE 802.1Q and therefore is able to access traffic from all VLANs.


As in a typical deployment, not every node would be in range of the central authority.

packets would need to be routed by nodes along the way and nodes would consume overhead air time for the relaying of packets.


Access control systems involve two main components: the security policy, which is a statement of who is allowed to access which service; and security mechanisms, which are the methods by which the security policies are enforced.

in this paper, we will explore both of these aspects in the context of using sensor networks for spatio-temporal access control (STAC).


Yet the standard IP interface masks these di.erences; every network appears to provide the same basic dial-tone service.

clients that desire certain network properties must resort to ad hoc techniques to detect these di.erences or must target the lowest common denominator service.


In particular, the widespread adoption of .rewalling has made some ports far easier to use than others (i.e., the commonly open ports such as TCP port 80, used for HTTP traf.c, TCP port 25, used for SMTP, and UDP port 53, used for DNS).

to ensure connectivity, there is an increasing incentive to simply use these ports for arbitrary applications, either directly or using the native protocol as a tunneling transport layer.


This maps the IBR to suitable network locations and encodings.

it can integrate third-parties; e.g., an iPhone-friendly service, and it allows users to choose suitable locations (e.g., nearby caches).


Pattern-Based emulation requires a long environment setting time, such as compilation time and pattern dump time, but offers improved performance over other emulation techniques.

we propose an efficient Pattern-Based emulation approach that combines normal Pattern-Based emulation with cycle-based simulation, an input pattern reduction method based on coverage result, and an automatic pattern comparing scheme.