Information about regions is summarized and propagated in a manner similar to areas in OSPF.

each switch in a region knows the identi.er of the region s border switch, because the border switch advertises its role through the link-state protocol.


Our simulationgoalis toinvestigate where ourMarkovbased algorithm falls in this performance spectrum compared to these algorithms with di.erent values of alpha.

if the class of a-epidemic algorithmshas a totalperformance curve in the form of delay = f(energy), the Markov based algorithmis more energy e.cientifitsperformance curveliesbeneath the class of a-epidemic s, meaning delay <f(energy).


Again, the adaptive staggered scheme achieves higher delivery ratios i.e., 94% and 95% against 87% and 88% for the balanced and the unbalanced topology, respectively.

the adaptive scheme halves the collisions experienced by the fixed staggered scheme again.


Due to the growing importance of this type of services, we have decided to focus on IPTV.

we target broadcast IPTV, rather than Video on Demand.


Ideally, the resultant routing structure will be optimum for any sensor node.

the routing cost Cost(nv, B(v)) is minimum among all possible routing paths.


This experiment shows that while the be-Figure 2: 802.11 throughput in the presence of heterogeneous data rate senders havior is fair as nodes see equal performance irrespective of their sending rate, it hurts the overall system throughput.

as the sending rate of Node 2 decreases from 54 Mbps to 6 Mbps, the total system throughput decreases from 24 Mbps to 7.2 Mbps.


This means QoS difference should be consistent and independent of load variations.

the high priority services always get better (or at least no worse) QoS than low ones no matter the network load is light or not; (ii) controllability.


It uses NFC, which has fast setup time but low bandwidth, to exchange both network settings and the media URI, then programmatically configures wireless interfaces to securely connect and transfer the media.

we propose NFC+Hotspot, which combines NFC with secure Wi-Fi Hotspot mode.


* s that are greater than any def other segments.

we can de.ne Tso = {ts : (j * ,low)(j * ,high) To tains the optimal tso .


Other nodes only have to record the Static Local Information used to .nd the routing path to their Routing Agents.

the sink information should only be .ooded to the Routing Agents instead of all sensor nodes.


Moreover, the expected connection time as a function of speed is symmetric about the mean speed.

the expected connection time is the same when the observer node has a speed of v0 or vb + va - v0.


As shown in Figure 1, MF uses .at globally unique identi.ers (GUIDs) to name all network-attached ob jects at the network level .

content GUID is derived through a cryptographic hash of the associated content, thus enabling selfcertifying communication when passed in packet headers.


(iii) If A is active, it becomes leader if hop = n, and otherwise it becomes idle, purging the message in both cases.

messages travel along the ring and knock out all idle nodes on their way.


However, receivers can easily be compromised.

any cryptographic information stored on them can be read out by a determined attacker.


As expected, simulation results are similar to those for the chain topology (see Figures 10and 11).

in Figure 12(a), the aggregate throughput for BASIC becomes relatively low, once the load becomes moderately high.


In addition, there is often no way to control the Q values set by a reader since modern RFID readers are designed for ease of use and hide low-level protocol parameters from the operator.

the Impinj Speedway reader we use in this paper o.ers no visbility into the chosen Q value; the resulting window size is completely decided by the reader s proprietary algorithm.


In the State Dependent case, the traffic control algorithms responds immediately to state variations in the network.

it adapts changes in a short time range.


We have implemented PRC in ns-2 (Ver.2.28).

we have modi.ed ns-2 such that 1) the interference perceived at a receiver is the collective aggregate interference from all the concurrent transmissions, and 2) each node uses physical carrier sense to determine if the medium is free.


Instead of comparing the performance of the algorithm on single con.gurations of problem parameters, we compare the entire achievable tradeoff boundaries for these algorithms.

we run the algorithm with different values of the parameters and plot the BW and FT achieved (see Figure 10).


Application level multicast approaches using overlay networks [4, 5, 6, 11, 15, 22, 30] have been recently proposed as a viable alternative to IP multicast.

end System Multicast (ESM) [5, 6] has gained considerable attention due to Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


While most of the existing research deals with the problem of e.ciently and accurately distinguishing spam from ham, in this paper we focus on the thin line that separates the two categories.

we limit our study to the often overlooked area of gray emails [31], i.e., those ambiguous messages that cannot be clearly categorized one way or the other by automated spam .lters.


However, both the KAAP and the BaoPAKE have to increase at least two messages for sending to the servers if both of them want to support lawful interception.

their total number of messages will be 8 and 7, respectively.


It is the objective of the present paper to give simple, tight approximations of these performance metrics for large systems.

the complexity is independent of the number of classes.


5.2 Network of Two Cells Motivated by the .ndings from the illustrate example, we next analyze the channel knowledge requirement of the beamforming weight optimization for a two-cell MU-MIMO network with arbitrary con.guration.

we prove three key theorems regarding such requirement that can be summarized as follows: to calculate the optimal beamforming weights based on the optimal antenna usage, an AP or a client only needs the channel knowledge owned by a particular set of clients in the network.


That is, we focus onthe subsetthatdo not require(near) non-blocking all-to-all communication at data center scale.

we focus on high-throughput, beamforming wireless links in the 60 GHz band.


One of the driving forces behind such data sharing has been its untapped potential for rapidly identifying malware domains.

domain registrations and DNS access patterns could be an effective means for tracking cybercriminal behavior and several recent studies have explored the application of machine-learning techniques to automatically identify malicious domains [8, 11, 39].


The distance between two nodes is .xed to r = f · rt where 0 < f = 1.

dME algorithm uses a .xed, shortened distance when building a multicast mesh instead of using di.erent routing strategies for branching nodes and merging nodes.


We exploit unique physical layer characteristics within a BAN environment, namely, the distinct received signal strength (RSS) variation behaviors between an on-body and an o.-body communication channel.

when two legitimate devices are placed on the same user s body, the RSS variation of the channel between them is much more stable than the case when one of the devices is o.-the-body, especially when the body as a whole is in motion.


This passive approach also has the advantage of measuring only active connections.

it watches the paths that applications are effectively using in contrast to probing all the paths.


Leveraging open FemtoAPI for incremental deployment: We have designed SoftRAN in such a way that requires minimal changes to both existing base stations and the LTE standard itself.

we have taken great care to ensure that our architecture is incrementally deployable with the current infrastructure and standards.


It is similar to the output from Figure 2c under Barabasi model.

network size does not seem to compromise the performance of our approach.


The simplest explanation comes with the territory of DLAHI systems.

the use of a small, or more accurately, a su.cient relevant area size will naturally tie the information to the right location.


It is a real working environment with offices and labs.

there are several WiFi Access Points in the proximity.


To ensure that the characteristics we present throughout the paper are not affected by server overloads, 8 we have analyzed the logs and indeed established that periods of server overloads are ex- tremely rare.

we took all CPU load measurements, as reported in the server logs, and averaged them in one-second bins.


After deploying our code in the TinyOS environment, we evaluate the energy and computation overhead by means of the Avrora Simulation Framework.This tool is a set of simulation and analysis tools for programs written for the AVR microcontroller produced by Atmel and the Mica2 sensor nodes.

we test our code on the Mica2dot motes, which are smaller than Mica2 ones and better suited for commercial deployment.We remark that we evaluate only the FAIR inference module, not the entire framework aggregation architecture.


We compute the throughput via a renewal argument in which 1 time alternates between periods of successful transmission and periods of thwarted transmissions and assume that such durations are 0.8 independent and identically distributed.

we denote E(TL) as the expected lifetime of a route as determined by factors such as the node velocity and node density.


In the synchronous approach, cache invalidation messages are broadcasted periodically.

the server gathers updates for a period of time and broadcasts these updates with the time when they were updated.


where [.. s]is the stationary distribution of Markov process {s(t)} induced by the U-CSMA algorithm.


[n]is [m], that is, a pure strategy maps every stream to exactly one server and hence can be described by an integral assignment matrix X .A mixed strategy is de.ned to be a probability distribution over pure strategies.

the probability that agent i maps its stream to server j is denoted by pij .


In the .rst case, both buckets are empty which means that the connection has been scheduled at its maximum sustained tra.c rate Ri When only the .rst bucket is empty, this max.

means that the connection has been scheduled at a rate Ri; Ri <= Ri <Ri the scheduler min max.


In fact, since the 498 sensors all take values between 10 to 30 degrees centigrade, we have elegantly re-organized di into an apparently sparse signal.

we sort di in ascending order according to their sensing values at a particular moment t0.


In this case, it can be observed that not all packets can be sni.ed using a single RSS queue (a single core).

only 12.1 Mpps are sni.ed out of the 14.2 Mpps sent: notice that the CPU usage of the sni.ng module is 100% which pinpoints a processing bottleneck.


Note that each party has an equivalent part to play in computing y.

we discard the solution where the input set {xi | i = 1, .


Note that it does not make sense to strictly partition the bu.er across .ows since the number of active .ows may be large and not all .ows bene.t equally from vFlood.

we note that high RTT connections and low bottleneck bandwidth connections bene.t less from vFlood, and also consume more bu.er space since the discrepancy between the rates at which the sender VM produces and network drains is the most for such .ows.


The Boolean interference model assumes that interference may restrict which links can be active simultaneously, but does not a.ect the active link capacities.

all active links have the same constant capacity.


Although our model proved accurate in translating loss statistics into video quality estimates, it still requires evaluating several application parameters.

it relies on an accurate estimate of the distortion caused by losing certain frames or slices (independently decodable portions of a frame).


Such semantics might be useful when the sink intends to perform scoped sensing.

the 6.2.1 Latency sink can at the outset decide to sense only 25% of the .eld, with the intent of increasing the sensed region only upon some triggers The latency involved in receiving a single packet reliably with detected during the preliminary sensing.


An auctioneer gathers bids from the bidders and selects the lowest bidding agent(s) as the winner and the winner is paid second-lowest bidding price.


Then, we study the problem of establishing a communication sub-network between two selected nodes s,t .V of minimum cost in terms of energy consumption, while guaranteeing a minimum communication bandwidth B.

we look for the minimum cost set of active interfaces among the input network, in such a way that s is guaranteed to exchange data with t at least with some bandwidth B.


3.2.2 Solution 2: Adjusting utility function weights to guarantee the delay bounds (3) Motivated by the fact that the feasibility of a required bandwidth in (15) (and thus the required delay bound) depends on the choice of utility function weights, in this approach instead of adding lower bound constraints on source rates, the utility function weights are dynamically adjusted based on (14) so that the end-toend delay is bounded at optimality conditions.

the end-to-end delay constraints (3) are incorporated in the sources utility functions.


Zq , there exists an algorithm M * which outputs x.

the only way for M to output a pair of elements y, z that have the same discrete log x with respect to two di.erent basis g, h is to know x.


Let Nt denote the set of all game tree nodes referring to time t = 0.

nt is the family of all (0 - 1matrices specifying) content distributions over peers that may be reached along some game course up to t, when the abovemainconstraintRu1-3applies:in any roundeachpeer can forward at most one unit and can also submit at most one request for receiving.


A widely employed mobility model of interest is a random mobility model where node movements are blind and memoryless.

a node moves independently of others and is unaware of the environment.


However, they produce a unique environment of rapidly changing channel rates and transmission times that current implementations of transport layer protocols do not speci.cally cater to.

tCP protocols developed in the past for wireless links [7, 18] assumed channel errors as the primary source of performance degradation.


ByRemark 4, the throughput of this algorithm is at least Rc/24.

this algorithm is 24-approximation algorithm for this realistic setting of ad hoc networks.


Secondly, a nontransparent relay with the distributed scheduling mode works in exactly the same way as a base station or a low power node from the viewpoint of all the key internal radio resource management algorithms.

it makes scheduler implementation simpler and allows for reusing an existent macro base station software at relays without implementing a complicated centralized scheduling, and also allows for faster scheduling as both macro and relay schedulers work as independent entities.


CONCLUSIONS In this paper we have evaluated the feasibility of using the centrality metrics from social network analysis to create a topology control mechanism based on a connected dominating set.

for a dynamic wireless mesh network formed by user hand-held devices, we have proposed and evaluated some mechanisms to select which of those devices must act as routers, forwarding the packets received from other hand-helds to their destination.


To get a sense for this, we performed small scale experiments.

we checked links posted on forums; also, we did a port-scan against randomly chosen servers from various server lists available on the web.


Formally speaking, the most regular quadrilateral formed by triangle ti = DT (Z) and its adjacent triangles (at most three) for which Voronoi edge is a minimum.

||v(ti) - v(tj )||, i =j is min = imum, where v(ti) and v(tj ) are the Voronoi vertices correspond to Delaunay triangles ti and tj , respectively.


The 802.11 DCF [1] is designed to offer equal transmission opportunities (or long-term equal medium access probabilities) to all contending stations, and each station is only allowed to attempt a single frame transmission for each medium access.


When a message with a correct MAC arrives, the receiver knows that it must have been sent by the sender.

mAC is used to provide the authentication.


If the angle ranges become heavily fragmented, or if the VPCS becomes inconsistent, the a.ected subtree can simply reboot itself.

the parent-child relationships can be deleted, and the angles and levels assigned to each node forgotten.


With medication consumption information, the system can process how doses are consumed by the patient.

it can look at the number of doses taken at a time and the inter-dose time between doses and how many times the minimum and maximum limits have been crossed.


We de.ne as link occurrence ratio the number of appearances of a candidate node in the neighborhood table of a reference node divided by the total number of tables for that reference node.

it represents the percentage of the cases where a link between two nodes was detected and quali.ed with an RSSI value.


Although MAODV is a reactive routing protocol, improved MAODV implemented for ns-2 is based on proactive approach.

the routing tables are updated frequently even if there is no route required.


In the symmetric protocol, however, M multicasts m in the group; for any member (including M) to deliver m, every other member M' must perform a multicast in that group.

one full message exchange (FME for short) between members must happen for m to be delivered.


When the state table size M is greater than or equal to M3, both the 3-level aggregation scheme and pure L3-aggregation avoid state table exhaustion.

if M = M3, an arriving .ow will never be rejected due to lack of available space in the state table under these aggregation policies.


To solve this problem, we observe that .rewalls are in some sense the dual of routing mechanisms.

the purpose of a .rewall is to block certain traf.c from .owing.


However, they fail in a di.erent way than the proactive protocols.

they will simply fail to return a successful route (from a lack of response), whereas the proactive protocols can potentially fail more quickly (by determining that the requested destination is not presently reachable).


They are nice, which means that they cooperate as long as the opponents do.


Our pipelined-lookup approach improves throughput by using one TCAM chip for each .eld.

we will use .ve TCAM chips where, for 1 = i = 5, chip i stores table ti which is the merger of all tables of Fi nodes.


.LLyi (b,:) if xi(b, :) = 2 and xi(b, :) + 2 = 3 Constraints: The same resource block can t be assigned to two di.erent operators or at two di.erent power levels.

n N L L xi(b, r) + yi(b, r)= 1, .1 = r = R, 1 = b = B i=1 i=1 The isolation constraint: A network operator should not experience signi.cant interference from another network operator.


Both [4] and [16] focus on having more accurate information at the topology (network) level and how it affects the routing protocol performance.

they study the effect of tuning the OLSR protocol parameters on accuracy in terms of network status (existing nodes and links) and not in terms of state information available at nodes and links.


They advocate discarding channelization and allowing all nodes to access the entire 802.11 spectrum based on demand [19, 37].

this push towards wider bands is further enabled by the constantly lowering prices of high-speed ADC and DAC hardware [38, 31].1 today, wireless cards that spanover100MHzof spectrum canbebuilt using off-the-shelf hardware components [35].


The more heterogeneous the players are, the more unlikely Eqn.

(13) is to hold for largevalues of K. the more heterogeneous a system is, the more likely it is to be resilient to perturbations due to a single individual changing strategies.


combining RFID and sensing technology for reader-activated sensing makes this vision more likely.


In this work we aim at understanding if Pythia performs better than the other techniques on this speci.c set of routers.

we compared Pythia to Palmtree 7 and Motu a publicly available tool developed by CAIDA8 that implements the technique proposed by Sherry et al.


VMNs and virtual devices are executed in the kernel space, while two control programs, VMN control program and virtual device control program, are executed in user space such that one can conveniently modify the configurations of VMNs and virtual devices.

the VMN control program is responsible for generating all the VMNs based on the target network information in a configuration file.


Only few constructions for pure additive spanners, i.e., for which the stretch is of the form (1,ß), are known, even in the sequential setting.

sequential algorithms 3/2 that construct a (1, 2)-spanner with O(n )edges anda (1, 6)-spanner with O(n 4/3) edges were given respectively in [17] and [6].


Simulation results show that our protocols are more energy ef.cient than the corresponding residual energy based protocols and geographic routing protocols without considering the property of the energy renewal.

given the same network, energy, and traf.c models, GREESs maintain higher mean residual energy of nodes and achieve better load balancing in terms of having a smaller standard deviation of residual energy among nodes.


We formulate in passing a closely related interesting question of how to divide the memory available to a CIOQ switch between the input ports and output ports.

given the total amount of memory and the speedup of the switch, how much memory should be placed at the inputs and how much at the outputs.


As we expect, the Markov property overestimates the average degree of a wedge-based sample node.

wedges in the AS-level topologies have smaller degree nodes at their ends than the expectation by the Markov property.


(1) Assume that nodes can choose which links they maintain, but do not have any control over the items they hold, and honor all routing requests.

nodes are sel.sh when it comes to link establishment, but are obedient once links are established.


In our measurement, we observe that ICMP messages come from 726 routers belonging to 68 ASes, and about 53% of those routers belong to 10 tier-1 ASes.

70 routers within ISP1 (i.e., 52% of ISP1 s routers visible in our measurement) generate ICMP messages.


This strategy also chooses the minimum FSWB and FSWE from those related values of all power saving classes in order to keep the final sleep window as small as possible.

a smaller value of the FSWE would minimize the maximum latency of connections.


To solve this problem, we formulate the pre-cross-connection based on flows instead of vectors.

if there is a flow on an on-trail vector (u, v) and v is not the sink, then (u, v) must be pre-crossconnected to another vector (v, w) at node v, and the flow must be forwarded to (v, w).


In this case, theb+1-k remaining vectorpositions have to be .lled with at most Li,1+...+Li,n-1 < b+1 -k packets.

there are more positions in the vector than elements to .ll the vector with, so we de.ne, for all n and for all b = Li,1 + ... + Li,n, Ci(b,(Li,1,...,Li,n))=0, Finally, the behaviour on the boundary n =1 follows from the de.nition of Ci(·,·)(Eq.


The results identify several performance groups.

we are able to identify which configurations will lead to unfairness problem.


DOS: A TEAM GAME VIEW In this section, we treat distributed opportunistic scheduling, namely, joint channel probing and distributed scheduling, as a team game in which all links collaborate to maximize the overall network throughput.

building on optimal stopping theory, we cast the problem as maximizing the rate of return, where the rate of return refers to the average throughput [12].


While this may seem like a simple problem to .x since there are multiple algorithms for group formation, an ideal solution should only introduce a small overhead to the existing WiFi-Direct protocol, and attempt to be backwards compatible with devices running the original WiFi-Direct protocol.

the improved group formation should still work even if one of devices in the group do not implement the new proto col.  4.


However, the needs of small establishments differ from those of larger firms.


It is important to control boundary conditions in this work.

spherical boundaries are desired to support greedy routing.


this work is focused on secure routing algorithms and their security analysis.


The optimal node persistence probability Pi * is the sum of the optimal link persistence probabilities of all its outgoing links.


As with routing, route-based packet .ltering occurs at two time scales packet forwarding/discard based on table look-up (fast) and .lter table update (slow) and thus its forwarding/discard function can be performed close to line speed subject to generic processing overhead.

the core .ltering function itself is not subject to DoS attack1 .


Since an update request happens at time z to .nd the queue of size K full, Xy,z, the total number of arrivals during time [y, z]isatleast K+1+Lµ(z-y)J=K+µ(z-y).


They also assume a cellular model for the wireless network.

the geographic area is divided into many cells and each cell has a base station (BS) through which the mobile hosts (MHs) in the cell communicate.


4.4 Security analysis of the T -time SCU mechanism Recall that a secure code update mechanism must provide the following security properties: Authenticity: The adversary must not be able to forge the authenticity on a code image of its own choice.

no sensor node accepts a code image CI as authentic and writes it into memory unless CI was initially sent by the BS;  Integrity: Any modi.cation made by the adversary on the CI must surely be detected by the receiving sensor nodes;  DoS resilience: Considered the DoS attacks exploiting the expensive signature veri.cations and the online packet modi.cations, the SCU mechanism must limit the e.ect of the adversary aiming at exhausting sensor nodes resources (i.e., storage and power)6 .


nC stations, even though the most distant ones cannot correctly decode the transmitted information.

nC stations can correcty receive A s signals; other nI - nC stations cannot correctly receive 1 Some stations are out of the range of a given one as to a correct information decoding, yet they disturb the given station in a non-negligible way.


While the goal of each user is to maximize its own energy e.ciency, a more sophisticated admission control can be performed to maximize the total network utility.

out of the K users, the access point can choose those users for which the total network utility is the largest, i.e., X max u£ (26) L.{1,··· ,K} £.L P under the constraint that £.L F£*<1.


The relationship is that rules with longer prefixes tend to have higher priorities than rules with shorter prefixes.

rules located in lower levels of AQT trie tend to have relatively higher priorities than rules located in higher levels.


Transferring state data between stateful detection engines permits a great improvement of the analysis accuracy.

this kind of cooperation allows a detection engine to discover an intrusion by importing external state data that are generated by other detection engines, thus detecting activities that could not be discovered otherwise.


We consider the widely used CSMA/CA type of MAC as the basis of our MAC protocol design.

we are interested in the 802.11 standard MAC with the request to send (RTS) and clear to send (CTS) option, to reduce frame collision introduced by the hidden terminal problem and exposed terminal problem.


We consider a linear WSN to be a sensor network having, roughly, a linear topology.

though the sensors nodes are not deployed exactly on a straight line, they can be considered as such.


Except for con.guring ad-hoc mode and .xing the frequency band and channel number, we used the default con.guration for the radios.

the cards all perform autorate selection and have RTS/CTS disabled.


The idea is to force each node to either overdeclare, or underdeclare, or correctly declare the cost of all the edges incident into it.

we want to avoid that a node u can, say, correctly declare the cost of a certain edge (u, v), while at the same time overdeclaring the cost of another edge (u, w).


The effect of a change on the residual is expected to decrease with time as the Kalman filter slowly adapts to the new state.

the magnitude of the residuals becomes smaller for every filter iteration, which increases the impact of process noise and measurement noise on the residual credibility.


The download .ows (regardless of the number nd of download .ows) gain transmission opportunities at the roughly same rate as a single TCP upload .ow.

roughly 1/(nu +1) of the channel bandwidth is allocated to the download .ows and nu/(nu + 1) allocated to the uploads.


In turn, such gain can be used to increase the density of deployed listener devices.

it becomes cost-effective to deploy a higher number of receive-only listeners to cover a given area of interest.


A set of applications have been enabled in ANs, and these applications have high real-time and reliability requirements.

a longer end-to-end delay may render surveillance information meaningless and loss of messages, e.g.


1.1 Our Results As our main result, we show that the Hirt-Zikas impossibility result does not apply in the synchronous model with atomic message delivery.

we show a construction of an adaptively secure broadcast protocol tolerating an arbitrary number of corruptions in this communication model.


If we reduce the uplink bandwidth (i.e., Cu = 1Mbps), the downlink ACK burst will decrease rapidly while on the uplink it remains steady.

the ACK Compression will not appear in most cases except a perfectly symmetric single-.ow case shown in [5].


Finally, we check the provider degree (i.e., the number of provider ASes of an AS) of each of the 686 ASes, and .nd that 98% of the ASes have only one provider AS.

an AS with a small provider degree is more likely to be hidden behind their provider ASes [7, 9].


The other class is from conference scenario where most individuals are stranger to each other and community structures are di.cult to identify.

it has many communities with small membership; sometimes even with single member.


TNAPI drivers, when used with PF RING completely avoid socket bu.ers allocations.

packets are copied directly from the RX queue to the associated PF RING ring bu.er for user space delivery.


As shown in Figure 7(b), this step reduced the number of regular expressions by 4 to 19 times.

for the month of July 2007, this grouping merged 717 regular expressions to 39.


Bound by this constraint, mobile network operators control the traffic by restricting the users' communication demands (calls) uniformly so as to prevent too high a load on the network equipment from occurring and stopping services, and to give priority to emergency calls to police, ambulance or fire stations.

when an event such as a football match is scheduled in advance, a restriction rate is set on the network equipment in the relevant area based on the place and time of the event and the forecast number of people attending.


However, in the wireless environment considered in this work, there exists a strong correlation between the scheduler and TCP sending rate.

the channel capacity C,which a.ects RTT, as well as packet loss probability p are functions of the TCP sending rate.


To improve the accuracy of the large deviations asymptotic we used a refine- ment that introduces a constaaat in front of the exponential.

the refined large deviations asymptotic is P[L~ _> U] ,-~ pLD ~ o~e-U0*(p), (17) where a = E[Lt]0* (p).


Since WiMAX networks typically operate over 10-20 MHz or wider bandwidth, there is a signi.cant amount of frequency selectivity over all the links [20].

if the operating spectrum is subdivided into narrow sub-channels (as is done in OFDMA), there is substantial variation in the rates that can be supported over each sub-channel of a given link.


We therefore believe the interesting region should be selected based on domain knowledge from the network operator, P2P developer, or the end-user.

applying DBScan to each metric, two possible cases are obtained: (i) metrics exhibiting a single cluster and a noise region; and (ii) metrics exhibiting multiple clusters and one or more noise regions.


As a result, we can de.ne a .nite-element set  based on these sets  and show that it meets the   -mapping criterion.

the second step in the above approach can be further divided into the following two sub-steps.


we believe it excessively couples the .rst two features: central control and central visibility.


3.1 The Grid Transmission Range Inequality As elaborated below, our aim is to allow nodes to transmit messages such that no other concurrent transmission will interfere with these messages at the intended recipients.

our scheme is based on having a node from one cell transmitting a message to another node in a level neighboring cell.


Performance multicast on Mobile-IP systems, then we describe the issues and aspects such as multicast datagram delay, delivery cost and limitations associated with applying those approaches to localrobustness are analyzed, then simulation results are used to registration Mobile-lP systems utilizing hierarchical organization.

describe the performance of the different approaches under various three mechanisms that support multicast in this conditions.


These experiments were structured differently from the earlier ones for IPv4.

we used a completely separate instance of the I3 application to handle the ping traffic (for both GPE and NPE), in order to isolate the ping traffic from the background traffic as much as possible.


It has been extensively studied that mobility increases the sensing coverage area [6, 7].

the work in [6] showed that mobility of sensor nodes increases sensing coverage.


DeploymentIncentives Beyond the algorithmic andprotocol-relateddeployment concerns, various incentive issues arise.

we must demonstrate that all involvedpartiesbene.tfromparticipatingin the market.


The fundamental question we address here is: are these new congestion control algorithms safe to deploy in the current Internet?

even though they were developed with the static equivalence in mind, are they still TCP-compatible under more dynamic conditions?


Further, our experiments show that different tools can disagree on the capacity of a particular path, but can all be correct.

pathrate repeatedly reports capacities of 1 Mb/s for paths going to cybermesa, while Nettimer and multiQestimate them as 10 Mb/s.


Once the normal operation of the network has been gleaned from the tra.c traces, one may assume that what is left is either statistical anomalies or mere noise.

when the normal subspace has been removed, one is left with a(n- k)-subspace that can then either be treated as wholly anomalous or be further split into a e-subspace that is anomalous and a (n - k - e)-subspace of noise.


A very interesting aspect of static-cache stability is in the manner in which the universal swarm becomes unstable when (11) is violated.

recall by (9) that ni,· (t) is the demand for item i, i.e., the size of the swarm of peers requesting item i (in the .uid limit).


(5) sPS A policy that decides which schedule to choose at each time slot t P Z` is called a scheduling policy.In this paper, we will be interested in online scheduling policies.

the scheduling decision at time t will be based on historical information, i.e., the cumulative arrival process Ap¨q till time t .


The sink can recover the original n data units by solving any n from the n + 1 linear combinations.

the sink will be able to recover the original n data units even if one of the combinations is lost due to a link (or path) failure.


This would have subsumed Theorem 2 had it not had an additional term which tends to 0 as N tends to in.nity.

for asymmetric games the price of anarchy is exactly 5/2 for every N = 3, but for symmetric games it is somewhat less: (5N -2)/(2N +1).


In a probing based approach, the network provider deploys multiple monitoring nodes across the network and measures the performance metrics of the probing packets.


1 (8) n l l nn P =.d ( f - fi ) i -i n=0 .-1 .-1 -q= .-1 3.3 Gradual Any breach of cooperation in TFT or GT results in either all packets being dropped or some fraction of packets being dropped.

fully cooperative is not the Nash equilibrium point with TFT or GT.


In addition, as shown in Figure 18 (b), increasing the number of ISPs also helps to reduce maximum link utilization.

we observe a 12% reduction when user 1 changes from subscribing (a) User latency (b) Maximum link utilization Figure 18: Performance bene.t of smart routing when the latency is a function of traf.c load.


Weaknesses: Comparable to commercial != advancing the state of the art.

the technique seems sensitive to overlap in signals, whether from >1 non-wifi devices or between wifi and non-wifi interferer as would happen during a busy wifi period.


As mentioned in [8], several other groups of researchers have either formulated connections between symbolic logic and feasible probabilistic computation, or developed relationships between symbolic and computational models.

abadi and Rogaway [1] propose a logical characterization of indistinguishability by passive eavesdroppers that has been studied by a number of others (e.g., [2]), and Kapron and Impagliazzo suggest a formal logic for reasoning about probabilistic polynomial-time indistinguishability [19].


3.1 System Model NDN architecture is featured with the availability of builtin network storage and receiver-driven chunk level transport.

each router on the Internet is equipped with a cache and can replicate passing contents to serve the subsequent requests without the need of forwarding them to their source servers.


However, from the end users point of view, short term fairness is sacrificed and more importantly, the duration of unfair periods are totally driven by the channel state.

as long as a flow observes a bad channel state it has to give up its share of bandwidth to other good channel- state flows.


The baseline algo- rithm enforces numerical error lazily.

it does not push writes until required to maintain a given level of consis- tency, typically resulting in the lowest communication costs.


EEE speci.cations and state transition schemes are di.erent for 100Base-T, 1000Base-T and 10GBase-T links.

since we focus on commonly deployed 1 Gbps links, in the following subsection we describe in detail how EEE 1000Base-T links behave, since they represent the only case in which the EEE standard accounts for the bidirectional behavior of tra.c.


Together, these findings solidly support modeling loss episodes as homogeneous Poisson processes within change-free regions.

correlations in loss processes are due to the presence of consecutive losses, rather than nearby losses.


Figure 33 shows that in the 2-hop scenario TPA outperforms TCP with clamped window both in terms of throughput and retransmission index.

tPA-2 provides approximately the same throughput as TCP-2 but retransmits about 79% less segments.


Second, multi-hop reprogramming protocols like Deluge [4], Freshet [5] and Stream [9] spatially pipeline the code transfer (also called spatial multiplexing) and thus reduce the time to reprogram the network.

a node does not need to completely download the code image before starting to send the code to its neighbors.


Regardless of precise SDN definitions, while the worthy goal is to address ossification of the Internet, the S for software in SDN perhaps unintentionally ossifies views of the respective roles of hardware and software.

it introduces an inbuilt assumption that there is relatively dumb switching hardware for high-speed packet forwarding, and relatively intelligent software running on processors for lesser-speed packet forwarding and networking control.


The desirability of max-min fairness as a bandwidth sharing objective has been called into question [4].

if users gain di.erent utilities from a given bandwidth allocation, there are sound economic reasons to realize shares that re.ect these di.erences.


Interference-Constrained Wireless Coverage in a Protocol Model * Prateek R. Kapadia Om P. Damani Indian Institute of Technology, Bombay, India Indian Institute of Technology, Bombay, India prateek@it.iitb.ac.in damani@it.iitb.ac.in ABSTRACT We present an O(n log n) algorithm to compute the coverage map of a given set of transmitters under interference constraints.

we compute the set of points that lie within the transmission range of one transmitter and lie outside the interference range of every other transmitter.


We next study a symmetric problem: Minimum Cost Initial Set Problem.

given a predictable DTN, each node is associated with certain cost, we aim to select a set of initial source nodes with minimum total cost such that all the nodes can receive the information at last.


Also from (13), it can be seen that performance improvement by performing precoding at the relays depends on the instantaneous harmonic means of the uplink and downlink channel gains.

if |hl| << |glk|, the improvement is more pronounced.


Inspired by the aforementioned applications, this work is (to the best of our knowledge) the .rst studying the energy balance property in wireless networks where the nodes are highly and dynamically mobile.

in this paper we propose a new diverse mobility model which is easily parameterized and we also present a new protocol which tries to adaptively exploit the inherent node mobility in order to achieve energy balance in the network in an e.cient way.


We will implement a cognitive scenario formed by a legacy base station (modeling the primary system) and several point-to-point MIMO cognitive links (secondary system), trying to establish their point to point connections by exploiting the holes in the time-frequency and space domain.

as far as exploiting the antenna domain is concerned, we aim at demonstrating our recently proposed Reverse TDD scheme [2] showing that, when the secondary nodes have multiple antennas, they can sustain high transmission rates without signi.cantly impacting the primary system performance.


We call it centralized scheduling mode if the UEs in RS domain are scheduled by BS, or distributed scheduling mode if they are scheduled by RS.

in centralized mode, the BS takes charge of scheduling all the UEs in the cell (including the UEs in BS domain and RS domain), and the RS is just a node for receiving and retransmitting data; in distributed mode, after allocated a part of the radio resources by the BS, the RS can schedule the UEs in RS domain using these resources, and the BS is only take charge of scheduling the rest.


The former provides more .ne-grained rating of each proposal, but is still a relative comparison.

we do not assume parity, and one module s numeric range can differ from another s. The cumulative voting mechanism implicitly normalizes the ranges.


4.3 Applicability to Prefetching While iProxy operates as a cache, it is also applicable to prefetching which is becoming popular in the mobile video context.

the cellular provider can prefetch high quality versions of videos that users are likely to access and store the corresponding frequency domain representations in iProxy, just as above.


For example, the performance of a routing algorithm in MANET is heavily depended on the mobility of the nodes involved in the network.

mobility can heavily in.uence the communication delay, message delivery rate, etc.


As we can see, by increasing the number of beacons, we can reduce the synchronization error.

when we increase the number of beacons from 5% to 10%, the synchronization error decreases greatly (nearly 50%), and it continues decreasing (more smoothly) with the increasing number of beacon nodes.


We call a Hit, the event of detecting a new neighbor at a time within 60 seconds of the neighborhood predicted time.

a hit occurs when a vehicle receives a message (data or beacon) for the .rst time from a speci.c node which is on the Predicted Neighbors Table and its predicted time t is within 60 seconds of the current time.


With the wider beam antennas,Transit performs considerablyworse and is on par with Straggler+NB.

the bene.ts from allowing transit traf.c are lost with wider antennas.


Note that links or nodes with small weights tend to attract traffic.

a cluster that advertises small transit weights relative to others will encourage traffic to go through it, consuming its available bandwidth.


2.2 Calculation on the number of unchanged nodes for optimum energy efficiency To efficiently consume energy using Table 1 in the setup phase of the traditional method and the proposed method, it is attempted to improve energy efficiency using the changed distance among cluster heads ( CHold and CH new ) and the number of unchanged nodes independent on the changed distance.

it is the case in which the total energy dissipation in the setup phase of the 4 proposed method ( .Setupprop(step) ) is as much as that of in the step=1 3 setup phase of the traditional method ( .Setuptrad (step) ), or step=1 34 smaller than that (namely, .Setuptrad(step) =.Setupprop(step) ).


times if we repeat the above and required reliability a.


That is, it is as unlikely as a random hash function with similar output size for C(MX )= C(MY ) for two di.erent router messages MX and MY .

in addition, C should be unpredictable, so that it is di.cult for the adversary to compute C(MX ) prior to its transmission to V.we want C(MX ) to be unpredictable to an adversary who knows only the value of X (we assume the adversary does not know all of MX ).


For bidder i, the market price at quantity q equals the sum of the prices at quantity q o.ered by the opponents at the auctions of the various links that form bidder s i path.

the market staircase of bidder iequals the sum of the staircases of each link in his path: for each quantity prices are added.


Other counter-strategies yield little bene.t (or penalty).

reputation systems show little impact unless they operate with near perfection.


Our analysis relies on protocol logs generated using Bro [6].

we deal with connection, HTTP and DNS logs.


The selected neighbors of a node i are surely its logical neighbors.

there exist nodes in its maximum assigned transmission range that are not selected in its neighbor list.


On the other hand, this database must update or renew the information at night by o.-line update.

our proposed SSFD system does not query on the internet frequently in the detection.


Score does not impose any limitations and is not involved in deciding which nodes are included in the neighbor set.

score only provides the mechanism and not the policy.


A .nal observation is that in all scenarios, except with the highest rate of interfering tra.c, the throughput obtained with CHARM and SampleRate is higher without RTS/CTS than with RTS/CTS.

the loss in e.ciency caused by(occasional) poor rate selection is lower than the extra overhead of using RTS/CTS.


Our design consists of a replicated control plane connected to a single data plane, as shown in Figure 1.

we create multiple diverse, functionally equivalent copies of control-plane software running in parallel.


There are a number of applications developed integrated with GSM networks and sent notifications through SMS or Multimedia Message Services (MMS).

most information system integrated with SMS technologies implemented in educational area.


Measurement-based, model-free admission control has re-ceived some attention recently [8, 9, 3].

the authors in [8, 9] consider measurement-based admission con- trol schemes in bufferless multiplexers.


To this end, a new link metric was introduced to quantify the expected number of transmissions and retransmissions that are required to deliver a packet over a particular link.

if ps is the probability of a successful transmission over a link, the expected number of transmissions, ETX, to deliver a packet over that link is computed as [5]: X j ETX = 8 j(1 - ps)ps =1 (1) ps j=1 The end-to-end cost of a path is then de.ned as the sum of the ETX values of the links on the path; the routing layer simply computes routes that minimize this cost.


Our results for NS-BGP suggest another, more .exible, solution allow route re.ectors to announce di.erent routes to di.erent iBGP neighbors.

a route re.ector could disseminate any client-learned route (such as the client-learned route with the closest egress point) to its route-re.ector peers, and any route (such as the route with the closest egress point) to its route-re.ector clients.


If nodes j and k are two relay candidates, then the fact that k is a better candidate than j (.j =.k)guarantees that k is elected over j.

pr[Xk =Xj |.j =.k]= 1 Note that absolute priority can be obtained with a function g(·) which is deterministic and monotonically decreasing with respect to ..


One important challenge in designing Friendly CryptoJam is how to change the bogus tra.c on a per-frame basis (to prevent a dictionary attack).

relying on a single (long) PN sequence to generate the bogus tra.c is prone to synchronization errors due to ACK packet losses, for example.


It can quantitatively adjust the QoS of each priority class to be proportional to its di.erentiational parameter.

it controls so that relative QoS ratio between di.erent priority classes is always constant for an arbitrary period even if the absolute QoS of each priority class is changed by various network conditions.


The results con.rm the proof in Theorem 4.2.

setting the maximum cache allowance in every CCN router cannot yield the maximum pro.t of AS#1, while slightly decreasing the cache allowance in the N1-level node causes the system to obtain a higher pro.t than the pro.t for that setting.


As each pixel can be independently rendered, we take the approach of the pixel selection which provides a .ne-granularity content adaptation.

we evenly select pixels according to the ratio of Ai/f s as we scan through the array of pixels.


Each user domain is assumed to enjoy a fair share of its total backhaul point s capacity to ensure a uniform blanket deployment of wireless broadband services.

the access to the wireless medium is assumed to be fairly shared across some fixed timeslots between the user domains and mesh nodes attached to the same backhaul point.


In this work, we formally characterize the stability region of universal swarms and show that they indeed exhibit excellent stability properties.

bundling allows a single seed with limited upload capacity to serve an arbitrary number of disjoint swarms if the arrival rate of peers in each swarm is lower than the seed upload capacity.


Theaddedfeatureoftherouter model(Figure3) isthat the TAP device is now bridged to the entire network.

the TAP device virtualizes a bridge to other physicalnetworks.


Additionally each packet sent to this function will be augmented by a selector pointing to the resolved loose source route.

the front-most selector identi.es a resolved path to the routing function which, instead of doing label switching, will pop the front-most selector from the selector stack.


The association parameters .s and µs are instead obtained directly from the traces.

at 5 minutes intervals, the AP records the number of associated users.


To minimize the number of generated events the upload queue of a peer is handled before the unchoking algorithm is run.

a peer computes the amount of data which it transmits between two consecutive runs of the peer selection algorithm, denoted as unchoking interval in the following, and dequeues the number of allowed messages from the upload queue.


Our algorithm requires new node additions to be serialized across the network.

nodes are added se quentially, not in parallel.


Figure 1: Wireless Network of IEEE802.11 BSS mode 2.1 Different Link Models The link model that some protocols designed for IP subnets assume to links is a .xed Ethernet like model(the classic model) [3].

links must be bi-directional, transitive and stable.


If there is no boundary, intuitively, it is more likely that they are moving toward di.erent directions, hence chances are that they will not meet for the next several hours and the intermeeting time is prolonged.

the inter-meeting time has very strong memory and may result in a power-law type distribution.


The first inequality in (2) expresses the need to have a unique code-word for every node in the network, and the second inequality ensures that a node will have at least some successful transmissions (greater than zero) in a frame.

a node should be assigned a number of opportunities to transmit per frame greater than the maximum number of collisions possible (i.e., n > (n - d I ) if one wishes to have a lower bound min ) max performance greater than zero.


If a sensor cannot detect an event of interest taking place in its cell, no other sensors can.

each sensor only needs to check its own cell to examine any coverage holes, as shown in Fig.


The self-healing communities en route are recon.gured by monitoring the hop count .eld.

a node who forwards the PROBE or PROBE REP message sets its membership .ag to 2 (i.e., the forwarding member), and any node overhearing three consecutive ACKs should set its membership .ag to 1 (i.e., the non-forwarding member).


These assumptions may not always hold in the Internet, which will cause systematic inference errors with non-zero expected value.

such errors cannot converge to zero even with in.nite amount of measurements.


Our concern in this paper is with the design of a fast forwarding function for a content-based network.

we focus on the predicate-matching algorithm, since this is the novel aspect of the forwarding function in a contentbased network.


0.6 The question as to which .ows su.er drops must be consistent (on the average) with the drop rates speci.ed by (4).

the selection of the .ow f * where a drop oc-0.4 curs is made by drawing the .ow randomly from the set F, according to the distribution 0.2 ef s ef d e , .f .F .


= The MCP decision problem is known to be NP-complete [16, 23].

there is no efficient (polynomial- time) algorithm that can surely find a feasible path which si- multaneously satisfies both constraints.


Although our algorithm will be effective in a wide variety of scenarios, we primarily focus on dense deployments where only a small fraction of the nodes are awake each epoch; in such scenarios, nearly all the nodes have du » k. Second, the algorithm will minimize the average number of awake nodes per epoch.

all the nodes will have roughly the same number of awake neighbors (the distribution will be sharply concentrated just above k), a desirable property not ensured by existing algorithms.


Given the stream set, its utilization U and the T T RT , this result can be used to check the schedulability.

the following test can be exploited when U > WCAU .


The Steiner nodes correspond to wireless nodes that have no direct bene.t from taking part in the multicast tree but whose resources are used to forward messages towards the multicast receivers.

these are nodes that are not the intended receivers of a message but only serve as intermediate nodes in transmitting the message to the actual receivers.


Moreover, sinceMi knowsthelocation ofallofits own neighbors andthetransmissionrange,itcandetermine whichofitsneighbors is also a neighbor ofMk.

itknowsthe set ofjoint neighbors Nk nNi.


These programs represent various classes of operations that IDSs commonly perform; our goal is to evaluate how our technique works on detectors of varying complexity and heterogeneous scopes.

flowbytes and Httpvol model measurement scripts that  (a) Full trace (b) Filtered trace Figure 6: Thread load for full and .ltered trace compute common traf.c statistics.


It was advertised by at least one host that was (or is) vulnerable to Heartbleed.

these certi.cates are vulnerable because their associated private keys could have been stolen by attackers.


5.2 Routers The main challenge for transforming the analytical insights of Section 4 into speci.c algorithms for RD router operation lies in the dynamic nature of Internet tra.c.

while Equations 5, 7, and 8 depend on nR and nD, the numbers of R and D .ows change over time.


r.X l.L Among them, D1(µ a ,µ ß ) denotes the rate allocation problem, while D2(µ a) is the scheduling problem.

the rate allocation problem aims at .nding the rate of each source node that maximizes the aggregate utilities of all sources, subject to the constraint that the system is stable under some scheduling policy, while the scheduling problem focuses on .nding a scheduling policy that stabilizes the system, for any rate vector of sources picked by the rate allocation problem.


Routing in the presence of unidirectional links Although DSR is claimed ([2] and [10]) to be able to han- dle unidirectional links, its ability is limited to only computing routes which avoid such links.

dSR routing will fail if such links appear for short periods of time after the routes are computed.


ASK-BAN: Authenticated Secret Key Extraction Utilizing Channel Characteristics for Body Area Networks  Lu Shi, Jiawei Yuan, Shucheng Yu Department of Computer Science University of Arkansas at Little Rock Little Rock, AR 72204 {lxshi, jxyuan, sxyu1}@ualr.edu ABSTRACT Recently there has been an increasing interest on bootstrapping security for wireless networks merely using physical layer characteristics.

the focus has been on two fundamental security issues -device authentication and secret key extraction.


However, since we are aggregating samples, it is fairer to compare the actual sample loss rates of the di.erent schemes.

when considering L1 aggregation, for example, a packet loss rate of x% corresponds to an e.ective sample loss rate of 2x%.


4.2 Space correlation Our purpose now is to understand how strong is the space correlation of the demand.

if a sector is highly loaded, how likely is it that its neighboring sectors will also be highly loaded?


Note that we do not change the actual code of algorithm A in any way.

the restricted algorithm still uses the value of |.| for the size of the system, even though the real size of D might be much smaller.


The schedule needs to decide, at each time, the resource share allocated to each backlogged .ow.

let Bt be the set of .ows that are backlogged at time t. Let ai,r t be the fraction (share) of resource r allocated to .ow i at time t. The .uid schedule determines, at each time t, the resource allocation ai,r t for each backlogged .ow i and each resource r. Two constraints must be satis.ed when making resource allocation decisions.


We use 0 = ß(u, v) = 1 to denote the reliability of the link (u, v).

node v will receive the data correctly with probability ß(u, v) after node u sends data to node v. In wireless networks, whether node v received the data packets correctly or not is only known to node v itself.


This optimal K value varies fordifferentper-.ow traf.c rate, ..


In this paper, we have concisely presented the key results of our work in progress, which pertain to the evaluation of self-organization algorithm for multi-radio mesh networks.

the study focuses on the impact of initialization process on the selforganization algorithm performance as it involves mesh node selection for channel assignment.


We envision minProbe to be deployed in an architecture where a separate control plane manages a rich set of middlebox functionalities with event trigger support(e.g [9]).

we believe the separation of measurement hardware and production hardware enables high-.delity measurement in high-speed networks (and in real-time) that is di.cult to achieve otherwise.


We build a simulation framework that re.ects operations in the 60 GHz band and validate our analysis through extensive simulations.

our simulation framework accounts for the presence of obstacles (such as exterior and interior walls) in an indoor wireless network.


For every node X in the shaded area, which is a neighbor Figure 1: I sends a packet to J, but J drops it.

of both I and J, X will detect the dropping and will reduce their reputation value of J by a, RX (J) = RX (J) - a, X n N(J) n N(I) Here a = f(i, j), where i is the number of hops the packet has traveled, j is the number of packets dropping by J observed by X (j applies to source routing protocols, such as Dynamic Source Routing (DSR) [1], and does not apply to reactive routing algorithms, such as AODV [3]).


Similarto[15], we use arti.cial noise generation to ensure secrecy of packets.

for each packet hop, we select nearby nodes to generate noise that ensures maximal ambiguity at the eavesdroppers, while allowing the packet to be decoded by alegitimate receiver.


We can therefore distinguish interaction events through the average angular shift between gravity and the current orientation over a window in time corresponding to typical interaction event durations.

interaction events involving the collared animals begin with an initial jerk where the animal is agitated and nearly changes orientation before engaging in repetitive short-term angular shifts.


From the preceding we can see that, this selection depends on the total weight w, of all applications of user u that we associate with the technology.

for technology l, the best base station would be given by j * l(w) = arg max ln( sj ) , (6) Wj +w j.Jl where we have explicitly shown that dependence of jl * (w) on w, the total weight of all applications of user u that is associated with technology l. To this end, for each technology l, we de.ne the function Gl(w) as sj Gl(w) = maxln( ) .


However, though in a simpli.ed form, the considered MAC scheme captures the fundamental aspects of location-dependent contention inherent to multi-hop environments, which is due to di.erences in the number of contending nodes at both endpoints of each communication link.

in this study we are more concerned on modeling the link capacity degradation due to location-dependent contention, rather than precisely incorporating in the analysis all the features of the IEEE 802.11 MAC protocol.


For this purpose, any set of parties that engage in a protocol execution are assumed to have access to an authenticated,synchronous broadcast channel among them.

each message carries a round number and all messages of round iare delivered before any message of round j>i.


Nevertheless, the ACTP is complementary to FIPA in a way, containing features that are not included in the FIPA platform.

the ACTP is very reliable in the data and message transfers, due to the fact that it uses a number of alternative protocols in the case of failures.


Applying [](-o2 n ) Theorem3.1,Prg(t)< -o= exp 2.

lemma 3.2 states that, assuring a su.ciently high replication rate, it is unlikely that statistical .uctuations can force the system to lose the datum.


We use the same proof structure (and much of the proof argument) from our lower bound for the online adaptive model in Section 3.

we reduce the ß-hitting game to solving local broadcast in a particular type of dual graph network, by showing how solve ß-hitting by simulating a local broadcast algorithm in this network.


We assume that for a given topology, the capacity is .xed for any given channel across a link.

ci(e) does not change over time 3.A .ow on data link e using channel i is denoted by fi(e).


In the rest of this paper the .rst (leftmost) PoI belonging to set Gi referred to as si, while the last (rightmost) PoI is referred as ei.

sensor isweeps the portion of line between PoI si and ei.


RushNet implements a two-tier cache hierarchy, in which memory sits on top of the .ash and caches outgoing packets that might be lost during the current block transmission session 4.

packet transmissions that are likely to have been lost should be cached in memory to speed up the recovery later.


The opinion metric can be applied in a various network settings to improve packet delivery performance.

the opinion metric can be incorporated into ad hoc routing protocols to route packets on more trusted paths.


Using the distribution, we can calculate that P4P results in an average completion time of 2481 seconds, while Native results in 4164.

the average completion time of Native is 68% higher than P4P for FTTP clients.


Moreover, Figure 13 demonstrates the TCP trace in which 4 TCP messages are transmitted through MAG 1 and after the interface hando., 6 TCP messages are transmitted through MAG 2.


Prior studies [4, 11] also consider the geographical distance between the client hosts and their DNS resolvers and report different results.

[11] observes shorter distances between FDNSes and RDNSes, with 60% of clients to be within 17 miles from their resolvers, while [4] reports fewer client-resolver pairs at the low distance range, with only 25% of pairs being within 500 miles from each other, and also fewer extremely distant pairs, with just 5% of pairs more than 2000 miles apart.


Additionally, the one factor that seems to bear the most responsibility for IPv6 performance lagging behind that of IPv4, i.e., the use of less e.cient paths (hypothesis H2), is one that can hopefully be remedied through focused but relatively standard measures, namely, peering parity between IPv6 and IPv4.

the single most e.ective way to put IPv6 and IPv4 on an equal footing may well be to ensure peering parity.


Network operators thus have a substantial interest in monitoring the performance of IP data traf.c on their 3G data networks.

operators would like to continuously monitor which geographical regions in their 3G networks are performing well and which ones are performing poorly.


However, the authors assume that these probabilities can be derived from past encounters and that node mobility is not entirely random.

for this protocol to work well, the nodes encounter probabilities should not be homogeneous (as would be the case for the random-waypoint or random-walk mobility models).


In order to describe the network topology, we can either choose between a node-link formulation or a path-link formulation [7].

in the node-link formulation each node computes the .ow conservation law, while in the path-link formulation the .ow conservation is done on the entirepath.


With the above modi.cation we consider in our proof attacks against users that do not properly verify the validity of server s certi.cate.

the protocol proceeds in a natural way even if the user accepts some forged or invalid certi.cate.


Then the first multi- communication method with uni-direction is always faster than the second multi-communication method with uni-direction and the method with dual direc- tions for p > 2.


In this section we have examined the close coupling of congestion and point-to-point link reliability with the behavior of a wireless network.

we have investigated the behavior of frame retransmissions, frame sizes and data rates during wireless network congestion.


Let ira_import(l, v)[R] denote the set of updates after applying the implicit import policy of v on edge l. Every edge has an implicit import policy that discards a routing update when the receiving BGP speaker's AS already ap- pears in the AS path; this is essential to avoid introducing a cycle in the AS path.

if a(v) E r.as_path, then ira_import(l, v)[{r}] = {}; otherwise im_import(l, v)[{r}] = {r}.


Though their techniques can be applied to a variety of signature schemes, the overheads of computation and communication are usually expensive.

the schemes in [2, 3, 6] are ine.cient, since expensive cut-and-choose techniques [21] are used to prove the correctness of the encrypted signature.


We demonstrate our current prototyping for home security applications.

each mobile sensor has a mini-computer,which is connected to a data collector,a WebCam,and an 802.11 WLAN card,and is mobilized by a Lego car.


Each endpoint uses an adaptive send bu.er scheme in which bu.er size, B, is continually updated using the expression B = 1.5 * (N et.bw * N et.rtt).

the send bu.er size is set to constantly be 1.5 times the bandwidth delay product.


The ExtInterface module [16] cmtSendAllVariant Parameter Functionality allowCMT Enable/Disable CMT cmtUseSFR Enable/Disable SFR cmtUseDAC Enable/Disable DAC cmtCUCVariant Congestion Window Update Strategy Path Selection Policy smallestLastTransmission Default Setting false true true pseudoCumAckV2 Table 1: CMT Parameters for the SCTP Module allows for connecting simulated IP nodes to real network interfaces.

simulated applications on IP nodes can communicate with real applications on real IP endpoints in the Internet.


For a unicast transmission, data transmission phase is implemented with Algorithm 1, without considering the process in step 4 and G(p(i)) in step 5.

we use a BF technique and strictly use one transmitted signal beam for one MS.


We are now interested in validating that this scheme introduces a linkability threat where the identity of a person can be associated to his Internet usage.

we focus in this section on .nding the identity of .le-sharing users.


let Ns be the point process resulting from applying a shift operator to the process N. if {Bi s} with i .


We expect the societal discontinuity we face from growth to contraction to eventually cause a decrease in the overall use of computing to meet societal needs.

lowenergy or low-complexity alternatives may come to replace current technology [13, 18, 26, 29], though this process may take decades to even begin.


We assume that at most one packet can be transmitted along any edge in each direction and require that no two schedules con.ict with each other.

no edge is used by two schedules at the same time.


In the comparison, we analyze the overheads of computation and communication in the signature exchange protocol needed by both Alice and Bob in normal case.

the operations of the dispute resolution protocol are not discussed here.


Reduced State Fair Queuing for Edge and Core Routers Ramana Rao Kompella and George Varghese University of California, San Diego {ramana,varghese}@cs.ucsd.edu ABSTRACT Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers.

in spite of proposals such as DiffServ, the state needs for even simple schedulers are still large for heavily channelized core routers and for edge routers.


Then,we extend the rounding method of Shmoys and Tardos [27] to obtain an e.cient solution where each user can only associate with one AP.

we provide a 2-approximation algorithm for unweighted greedy users and a 3-approximation algorithm for weighted and bounded-demand users.


Trading locations during one week) Music News Dating a majority (69%) of them are grouped as inter-session sta-0.5 tionary with a d of 6 hours.

after a weather query, users are not inclined to movement.


Tango inference engine is highly accurate.

our inference accuracy of .ow table size is with 5% of actual value.


We de.ne the interval as above in order tobe agile to user mobility, and at the same time receive enough packets to reliably estimate channel conditions.

vOIP calls generate 10 packets in the 200ms interval, which is a reasonable number of samples.


Thus, in the next step, they are likely to choose their destinations in each other s side and cross each other s path.

the farther node C is away from site 0, the stronger tendency it has to visit site 0.


We note that after Step 1, if the Cell2Notify server does not .nd a cell phone number corresponding to the client s extension, it simply proceeds to handle it as a regular SIP server.

it attempts to set up the call if the client has previously registered, and otherwise it will send back a busy tone.


sult, we envision ScrambleSuit to be used by, amongst other protocols, Tor and VPN to tackle the GFW s most recent censorship upgrades.

scrambleSuit exhibits the following four features: Pseudo-random payload: To an observer, ScrambleSuit s entire tra.c is computationally indistinguishable from randomness.


In this paper, our focus is on routing scalability.

we investigate the support for quality of service (QoS) in connectionoriented packetswitching networks with hierarchical routing.


2.2 QoS Routing In [6], the author proposes to optimize network lifetime by tra.c .ow augmentation and .ow redirection to balance the energy consumption rates among the nodes in proportion to their energy reserves.

they show that delay-constrained routing is NP-complete.


Based on the near-optimal solution to the idealized problem OPT-ub, we return to the original problem TPP by incorporating non-zero traveling time for the WCV.

we determine the traveling path in TPP by .nding the shortest Hamiltonian cycle to connect all the logical points that have  1A simpler version of bundling WPT and MBS problem was studied in [11], where the traveling path for the WCV was assumed to be given apriori.


Our analysis starts by examining the best-response strategy of each mobile.

we demonstrate that classic water-.lling properties for optimal power control carry over to the noncooperative-game framework.


We believe that a joint hardware-software approach is both required and ideal to address the problem of post-deployment node monitoring and control.

we advocate a rethinking of the hardware architecture of sensor nodes to include an additional (low-cost and low-power) component that we call the reliability coprocessor, which is responsible for monitoring the operation of the sensor node.


4.2 Performance Metrics The metrics used in our performance evaluation are described below.

the BS uplink throughput and end-to-end delay are used for Scenario 1 while all the metrics are used for Scenario 2.


Thesecondtechniqueismorecomplex andis motivatedby our observationthatthe rule-graph consists of highly clustered components that are connected by weak edges, i.e., rules withlow statisticalsignificance.

hence, we apply spectral partitioning[..]to the rule-graph,to remove such weak edgesbetween strongly connectedcomponents.if Aisthe adjacency matrix of the rule-graph, where each matrix entryis the significance score of the corresponding rule, we recursivelypartition 0.09% 100s HotSpot-2  0.02% 57s HotSpot-1  2.29% Enterprise 399s 1.61% LabEnterprise 368s 23.8% LabAccess 1556s -0.3 -0.2 -0.1 0 0 500 1000 1500 2000 Fraction of Trace Duration Time to Mine for Rules (s) Figure .


The servers are connected to the ToRs via 10Gbps links, and the ToRs are interconnected via 4 aggregation switches with one 10Gbps link to each of the 4 switches.

each server has 4 distinct paths to reach any other server on the other ToR.


SDX takes advantage of recent advances in programming languages for SDNs that allow operators to express policies at a higher level of abstraction than .ow rules [6, 12, 20].

pyretic provides both topology ab straction and composition operators that we take advantage of when implementing the SDX policy compiler.


The constructed tree T(G)embeds the connectivity of the network and ensures that sampling a node according to a given distributioncanbedonewith alogarithmicnumberofhops.

supple requiresabootstrapphasewhere T(G)is constructed using a cost metric propagated in 1-hop ..... messages.


On the other hand, for the edges corresponding to the segment types with larger than 3 segments, we can run coarse-grain maze routing (with large step sizes).

umax can be kept small to allow larger m values.


In this topology, node 4 is a hidden terminal for the transmission from node 1 to node 2.

node 4 can neither receive the RTS/CTS handshake between node 1 and node 2 nor sense the data transmission from node 1 to node 2, since node 1 is out of the sensing range of node 4.


Different structures lead to different solutions.

simple cycles can be regarded as a special case of non-simple cycles, and both simple  (a) Simple p-cycle solution.


The reasoning must go in both directions.

the manager must be able to derive low-level settings given high-level goals, priorities and constraints, and it must be able to look at existing low-level settings and describe the resulting behavior in the high-level terms.


The accuracy quickly improves to within a fraction of a centimeter as the algorithm overlays the partitions obtained from consecutive moves of the robot.

since outliers are more likely to occur when the pair of distances being compared have a small difference, RF-Compass sets a prede.ned threshold eand decides that tag Tk P is closer to tag Ti R than to Tj R only if mTP ,TR = (1-e) · mTP ,TR, where mTP ,TR is the ki kj ki DTW distances measured between tags Tk P and Ti R [49].


For each server S, if it receives data from a client C, the data is forwarded to all the other clients and other servers connected to itself (server S).

if server S receives data from other servers, the data is forwarded only to the clients directly connected to S. a client connected to S transmits a packet to another client connected to S in two hops via S, and transmits a packet to another client connected to another server S' in three hops via S and S'.


This assignment may satisfy service requirement of SSs (service fairness) but wastes the resources of the network and causes effort unfairness.

a signi.cant amount of network effort may be spent to satisfy the SSs with poor channel condition.


Our results show that wavelet filters are quite effective at exposing the details of both ambient and anomalous traffic.

we show that a pseudo-spline filter tuned at specific aggregation levels will expose distinct characteristics of each class of anomaly.


SOLUTION OF DOWNLINK POWER ALLOCATION We consider N = 2 in this section.

we decompose the power allocation into a two-step operation.


MI C RO B E N C H M A R K We start with a microbenchmark experiment to provide insights into the working of the system.

to better understand the capabilities and properties of RF-IDraw s trajectory tracing, we let a user write the word "clear" using the RFID on his hand, in the 5×6 m 2 VICON room.


In this algorithm, e is a small value representing the tolerable error in achieving the throughput fairness among the BSSs.

aP istops adjusting its NAV duration if  si-s ave,i <e.


We argue that this is not possible in this particular instance much more so than other challenging future scenarios, because the challenge itself constrains the resources available to deploy new devices, systems, and infrastructure.

to build new infrastructure takes up-front energy the energy to manufacture, deploy, operate, and maintain the devices, and as well as the .nancial resources to do so [22].


Suppose that the ranging measurements for all the k(k - 1) links are accurate, and that all k nodes have been correctly localized without anyerror.

all the k(k - 1) links have zero residuals.


Our general strategy in pursuing these goals is understand the big things .rst.

for each of the dimensions listed above, we pick the most salient contributors to that dimension and delve into them enough to understand their next degree of structure, and then repeat the process, perhaps delving further if the given contributor remains dominant even when broken down into components, or perhaps turning to a different high-level contributor at this point.


Network technology agnosticism: Network virtualization should not rely or depend on any specific network technology.

multidomain scenarios across dissimilar infrastructure domains should be possible.


From the handover interruption time point of view, it is important to define which process is accomplished first.

is the signaling over the wireless link faster than the signaling in the wired part between oAR and nAR or not?


We pose the question: Can in-network features be outsourced ?

can we add functionality to a network by placing the function outside the network?


PRELIMINARIES To simplify the presentation, we do not distinguish between publishers and subscribers.

in order to publish data on a topic t, a node has .rst to subscribe to t. We model the nodes subscriptions formally as follows: Given a set of nodes V and a set of topics T, we de.ne an interest function over V ×T to be a Boolean-valued function over domain V × T. Subsequently, given an interest function Int ,we say that a node v is interested in a topic t i. Int (v, t)= true.


In a global view however, the neighboring node j should be able to forward received packets to the desired destination.

node j should be on a valid path to the destination.


Note that the fairness constraints introduced in sections 4.2 and 4.3 do not rule out any (malicious) behavior of the intruder as a protocol principal.

the intruder can prematurely abort the protocol as a principal, while being forced to play the role of the network.


This experiment shows that limiters rely upon up-to-date summaries of global information, and these summaries may become stale when delayed or dropped by the network.

our concern lies with stale under-estimates that cause the system to overshoot the global rate; a completely disconnected system due to either congestion, failure, or attack could over-subscribe the global limit by a factor of N. We can avoid these scenarios by initializing limiters with the number of peers, N, and running a lightweight membership protocol [24] to monitor the current number of connected peers.


We accomplished significant advance on the library website by ensuring that the format is fluid to small screens.

the format changes in response to the device that accesses the web site.


7.1 How can we do better The results above are bad.

they suggest that a measurement system designed to rapidly detect link performance problems would have great dif.culties, however, such systems are critical to high reliability networks, where problems must be rapidly detected and diagnosed.


Students had to understand the internal behaviours of the framework to write correctly working code.

previous versions have exposed internal data structures for inter-layer communication.


Consequently, communication cost between the server and third-party anonymizer will become higher, as will the result re.nement cost on the anonymizer.

k-anonymity faces problems in offering region-based location privacy.


In this paper, we show that because of the unique characteristics of rich scattering in indoors environments, these outdoor solutions do not perform well indoors.

past schemes largely orient antennas by maximizing the signal strength (SNR), which does not apply indoors.


In RBAR, the system state duringcontention is exactly the same as that in base-rate IEEE 802.11.

when nodes are contendingto gain access to the channel, the system undergoes the same states as baserate IEEE 802.11.


Node degree constraint: One of the basic requirements for resiliency that all ISPs require is that every node in the network has at least two independent paths to route traf.c originating at the node.

the degree of all the nodes added into the network should be at least 2.  n+g X M ' i,j =2.ki .i = n +1,n +2, ..., n + g j=1 SD time constraint: For an ISP it is important to ensure that the network performance experienced by customers connected to the nodes in the original network does not deteriorate.


To support multimedia services [9] in such wired-cum-wireless environment, there is a need to develop an efficient differential scheme for the congestion control protocol such that the protocol is able to correctly tell the packet loss caused by the wireless channel from that caused by the network congestion.

a proper differential scheme can help the congestion protocol to avoid blindly reducing the sending rate in the present of packet loss which not relative to the network congestion.


In the present work, we remove such requirement.

we present and analyze two protocols, both of interest, that we call one-fail adaptive (OFA) and exponential back-o./backon (EBOBO) for k-selection in Radio Networks.


Similar to the TCP analysis in single cell WLAN [7, 8, 18], to cope with the problem complexity, we adopt the following assumptions: A1) The last hop wireless link is the bottleneck link of a TCP downlink .ow; A2) The wireless channel is error-free; A3) The RTT between all APs and remote .le servers are the same.

tCP RTT bias does not occur between the tra.c sources and APs.


In this section, we make some re- alistic assumptions about peering agreements so as to relax the guideline.

we allow peer routes to have the same local-pref as customer routes, to give ISPs greater flexibility in balancing network load.


Furthermore, CoSaMP can tolerate certain noises mixed in Y , and the path vector can be recovered even some misclassi.ed packets are included.

coSaMP could recover s if the number of correctly classi.ed packets is greater than Ml = ck log( N k ) when c = 1.5 according to recent study [5].


If the round is sparse: the player guesses the ids in X, one by one, subtracting ß from the ids in X n XB to transform them into values in [ß].

the player s guesses are a combination of the expected and actual broadcast behavior in the simulated round.


In the BS approach, each data item is mapped to one bit of an N-bit sequence, where N is the total number of data items in the database.

the nth bit in the sequence corresponds to the nth data item in the database.


Note that not all the movements are emulated since some of them may not have any impact on the neighbors of the mobile host.

eMWIN only emulate the movement of a mobile host that will result in changes of its accessible neighbors or the transmission quality to its neighbors.


As such, it enables further investigation and can be refined to answer specific questions.

it will allow us to investigate the interplay of content infrastructures with the Internet topology.


In order to get deeper insight, we analyze the TCP packet drop rate on link layer in the wireless domain.

we compute the number of TCP packets (data and ACKs) dropped at each wireless link in order to get insight on the state of the wireless link at each node.


Each transmission becomes an event and can be processed in non-real-time while still allowing for interactivity.

our framework schedules these events in a virtual timeline and processes them sequentially.


(3) The scheme with no cross-layer optimization: The time slots are equally assigned to the three users.

each user is assigned 1/3 time slots and the transmission mode 3 (as shown in the Table II) is employed.


This variant is parametrized by the range from which the source chooses the two random angles aand ß that determine the intermediate point (xr,yr).

we analyze the scheme when a and ß are chosen uniformly in the ranges [0,p/3], [0,p/4], and [0,p/6].


Finally, through extensive simulations with real tra.c traces and major attacks, we showed that our load-balancer with the BLB distribution algorithm could achieve high performance and provide enhanced security.

it has low overhead and can keep the load variances below the desired levels of load balancing.


Along with semantic stream correlation is the feature of stream differentiation.

a given view should favor some of the streams over others.


In this paper we demonstrate that this problem does not require any complex solutions.

we present the design of a simple, yet e.cient, mechanism to handle session disruptions due to endpoint changes.


There is always a probability that b does not belong to A.


Second, we do not interpret E as a fee per bid.

a bidder submits his next bid if he thus improves his net bene.t by any positive amount.


It has also been suggested [13] that the nodes may police themselves.

if a node can listen-in on the neighbor it is currently routing to, it can determine that the node has failed and choose a new neighbor to route to.


We analyze the refresh-LSA traffic to base- line the protocol dynamics, arising from soft state refresh.

we predict the rate of refresh-LSA traffic from information obtained from the router configuration files, and then carry out a time-series analysis of finer time scale characteristics.


SecureArray makes no assumptions about the type of antenna that the attacker uses.

the system is designed to be effective in the presence of an attacker equipped with omnidirectional antenna, directional antenna (such as the Pringles can antennas famously used in past high-pro.le WiFi security breaches [19]), or even a phased array of antennas capable of selectively beamforming and nulling transmissions to arbitrary sets of 802.11 receivers on a per-packet basis.


Therefore, given GKi and c2,to break the PKjjfor obtaining m,the adversary should .nd x such that t+ x· GKi =loggc2 (mod p), where m = g t (mod p) is unknown.

the equation has a unique solution for t. any possible value x .


However, there is still room for improvement in the location bouncing problem because most smoothing techniques focus not on the improvement of obtained input signals to be used for localization but on the improvement of estimated locations after localization is made.

little attention is paid to the completeness of .ngerprints captured in the on-line stage of localization.


As an example, using the results in Fig.2 and Fig.4 it is possible to obtain an indication on the pair (CB/N, CF /N) to be selected for planning accounting for both UL-UL and DL-DL interference scenarios.

.xing an outage target of 1%, from graph in Fig.2 we obtain CB/N =8.5 dB and CF /N = 12 dB as an acceptable pair for the UL-UL situation.


Can the proposed full duplex also provide any gain over the half duplex in terms of the PHY-layer throughput?

balun cancellation requires two antennas and can double the throughput.


We de.ne .k as the set of all nodes that hear transmissions after ksuccessive broadcasts.

we call node 1the starting node and call the set of nodes in its broadcast domain, including itself, .1.


If we assume that in this speci.c case the user is not charged for using the WiFi connection, and therefore the overall due fee is proportional to the amount of time that he spends in the GPRS network, a suitable handover policy can be chosen according to his willingness to pay.

for a given communication session, let us de.ne the following cost function: .n C = TN i · cN i (h) (1) i=1 where TN i is the sum of the permanence intervals spent by the user in the i-th access network and cN i (h) is the fee per unit of time (second) that the operator of the i-th access network charges to the user.


Our work provides new insights into the implementation of the 802.11 standard in commodity hardware.

we present a new method to measure clock skew, rather, a more precise clock to measure it against;  an attack that spoofs the clock skew of a fake AP to mimic that of a real one, thereby rendering the two indistinguishableby the methodsproposedpreviously;  additional parameters to measure authenticity of the skew, enabling detection and mitigation of spoo.ng;   clock skewarithmetic,that enablesanetworkprovider topublish skews ofAPsinthe networkindependent of client stations.


More speci.cally, it is noted that wireless users belong to a larger social environment and as such, their movement behavior is subject to several location dependent sociological constraints (in addition to speed limits and speci.c walkways, as described in [1]).

on any given day, each user may visit a list of places of some social importance (which we referred to as hubs in [8]) in some probabilistic manner, creating what we refer to in this paper as a mobility pro.le .


PixNet takes this work a step further; it shows for the .rst time that wireless transmission algorithms can naturally address the problem of perspective distortion.

pixNet exploits OFDM that operates in the frequency domain to detect and correct such distortions.


Moreover, PlusPay also provides payee anonymity.

even when the payer and the bank collaborate, they are unable to link deposited payments to the payee.


We say that the transfer is level if for any pair of outputs j1 and j2, B( j1) + x(+, j1) < B( j2) + x(+, j2) - 1 implies that x(+, j1) = min{ST, B(+, j1)}.

whenever the output queue level at some output j1 is more than one less than that of another (following a transfer phase), it s implies there is no way to increase the level at j1.


For depreferencing, we assume that websites that are incorrectly classi.ed as compromised recover at the same rate, ., as compromised websites.

the process of recovery is the same whether a website is actually infected or not.


What we now have asked instead is: how can we measure how this vertical handover will in.uence the behavior of running applications?

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


Third, there are more indoor white spaces than the outdoor white space, which is mainly due to the signal attenuation because of the blocking effects of walls.

in indoor scenarios, there are on average 72% of the 42 TV channels are white spaces, 18.4% higher than that in outdoors.


if the local champion disappears from or dictates the project for any reason whatsoever, there will always be a back up.


For nodes selection we adopted a heuristic mechanism that permits to identify, online, what nodes are more useful to spread contents.

exploiting some additional information contained in the ACK messages, the controller tracks what nodes contributed the most to the content di.usion forming a priority list to be used for future nodes selection.


Mobile wireless users have become a common sight across the world, and have motivated the need for further evolving the Internet protocols and infrastructures, originally intended for .xed users, into new realizations capable of supporting portable and even mobile users at various speeds and across many geographical areas [10].

with mobile users comes the need for user tracking protocols that work seamlessly for all roaming needs and application characteristics.


7.1.1 Dependence on distance When developing the model of the transition process from one AP to another, we tested the hypothesis that inter-AP distance plays a major role in determining this process.

the likelihood of transition from an AP to another increases with decreasing inter-AP distance.


Our process uses asampling step toconstruct arelevant approximation of the network structure.

our scheme .rst constructs a random tree-shaped overlay network Twhich encodes e.ciently a good approximation of G s metric.


If the reliable Ethernet transport is provided at CNA on each ENode, legacy Ethernet switches can be used instead of DCB switches.

the large-scale FCoE system is realized by using CNAs with the functions of reliable Ethernet transport and U/C separation, legacy low-cost Ethernet switches, and a server for C-plane processing.


These considerations indicate that the popularity of the APs in a cluster is a salient feature of the data, and that this feature can be used as one of the model parameters.

during trace synthesis, the number of popular APs in a cluster can be used to determine how the transition Figure 7: Fraction of popular APs for intra-cluster transitions vs. cluster size.


Since in a HMM each state is hidden and associated with an observation probability density function (PDF), we can exploit these observation PDFs to bridge the gap mentioned above.

each Markov state is associated with a speci.c value range of mobility observations, called a mobility stage, via the associated observation PDF of that state.


Yet these are sensible heuristics and we now provide some formal justi.cation.

we analyze the effectiveness of the union heuristic in the simpli.ed model of BGP that is realized by our simulator.


Aformal speci.cation of ourheuristic canbefoundinFigure3 where we assume that theSRSes are represented usingACLs.3 Intuitively, we can extract policy units from the SRS matrix obtainedabovebyidentifyinggroups of source addressesforwhichthe subnet-level reachability sets are equivalent.

we decomposethe subnet-level reachability setscorrespondingto a source subnet(i.e.


In [29], Roughan and Zhang propose privacy preserving mechanisms for joint network performance computation.

the work focuses on tra.c summation and Internet anomaly detection.


Notethatthe mappingdoesnothaveany special structure.


L indicates that this probe has a loss mark.

we further de.ne Fk to be the set of the virtual probes experiencing the maximum queuing delay, Qk, at link k.Fk = {t | Dtk = Qk}.We assume that the queuing delay for a probe taking the last available position at router k is Qk.


To show the theorem, we take into consideration that it is very unlikely for We achieve the best competitive ratios when dealing with a linear power assignment.

p(f) is proportional to d(f)a for each link f and thus the received signal strength is the same for any link.


From Lemma 1 and Figure 1, we know that both µ0(t)and µc(t) are monotonic continuous functions of t. (µ0(t)is increasing in t and µc(t)is decreasing in t.) Since they are monotonic and continuous, both these functions have unique inverses, denoted by g0() and gc() respectively.

g0 (µ0(t)) = t and gc (µc(t)) = t. Theorem 2.


For instance, with k = 2 the BCCs shrink to around 50% of the nodes, whereas with k = 3 they shrink to about the 25%.

the similarity measure based on the size of the intersection of the PNLs generates an all-or-nothing effect that makes it hard to gain any insight on the social structure that underlies our datasets.


However, it is possible that UDP .ows initiated from the external Internet are permitted.

once a host behind a full-cone NAT (for instance, host h3) sends a UDP packet to the external Internet, it can receive UDP packets on the port from any arbitrary external host, (for instance, h6).


By similarly decomposing region O2 into smaller regions O21, O22, O23 and O24, we may now describe a more re.ned STAC policy, where M v1 is accessible at location O21 but not O22, and thus the user must move its physical location with an appropriate time period to O22 in order to access M v2, and hence resume access to M v.  3.2.2 Complex access policies and their representations by FA The example of object M v just described gives insight into the power of STAC.

a STAC system can perform complex access control by decomposing objects into object atoms and suitably associating smaller region atoms with these ob jects.