4.1 Average Transmission Rate: No-RelayNetwork (OT ) For networks with no relay, the average transmission rate (OT ) can be computed as follows L L.8 LT k=1 Figure 3: Relaying Region of a Relay ui.UT NN 1 1 (a) OT = lim .ui (k)C(duiB) N L = lim C(duiB ) .ui (k) L.8 TL to the main cell.

the relays partition the cell ui.UT k=1 N 1 1 into Nr sectors with the central angle of 2p each.


While increased signaling is required, the primary impact results from a possible tension between optimal responsibility delegation and custodian privacy.

to increase the privacy of its custodian a sensor may choose a responsibility it is ill-equipped to ful.ll while forgoing another that is may be uniquely positioned to ful.ll.


Therefore, we can concatenate both to form a layered spatial-temporal code.

each frame of the barcode video can follow the design of the spatial code, with the frames arranged at non-uniform intervals according to the temporal code.


Though our routing algorithm is clearly sub-optimal in a static-node environment (wherein signi.cant routing overhead for a type of distance-vector algorithm may be justi.ed), in simulation studies it rapidly responded to network volatility maintaining good delay and throughput performance with a comparable amount of (ANT) overhead, that itself required little in the way of computation and no specialized hardware.

for additional overhead, the algorithm showed good minimum energy performance which is an important factor of maximizing network lifetime.


The resource sharing is completely transparent to the users and does not impose any limitations in their own experience through the use of priorities.

when a consumer is not utilising resources of his/her own disposal, only then are they lent to other users.


On the contrary, a DIFS idle time, two SIFS time, and ACK is unavoidable for one frame transmission for the legacy DCF.

only stations which belong to head group need to wait a DIFS idle time and the AP could send a block ACK frame to acknowledge all the previous transmissions of all group slots at the end of grouping cycle for our GB-DCF+ , instead of transmitting one ACK frame per transmission for the legacy DCF.


In terms of usage, we assume that most of the road users follow a repetitive mobility pattern (in [4] authors have claimed that about 70% of collected traces from di.erent drivers include repeated trips).

it is very likely that a user follows a mobility pattern based on his/her schedules and activities related to the time.


Then, 1/Sk is a good estimate of the sum of weights along the cycle, which we wanted to compute.

we state the following result which is a direct implication of Lemmas 4 and 5.


Finally, we say that protocol P can emulate Q if for every con.guration c2 of Q, there is a con.guration c1 of P such that c1 covers c2.

if P can emulate Q, then P can match every possible outcome of Q in terms of allowed paths, prohibited paths, and forwarding table size.


However, there is a significant difference between the behaviors of SCFQ and DFS.

dFS can yield packet transmissions in an order that cannot possi- bly be obtained in the centralized implementation of SCFQ.


This results in a distribution uniform on distinct values, not uniform on nodes.

different nodes with the same measured value will report the same hash values, and by the properties of the hash function, each measured value will be equally likely to be the minimum.


The daemon is the fundamental building block of PINL, implementing all the functionality that we have described so far in the previous sections and exposing the NELO interface to the entities.

we have used libpcap to bypass the IP layemr both when sending and receiving PI packets; libpcap listens on all the interfaces that are con.gured and captures all inbound frames that are either PI packets, Discovery packets or ARP packets by inspecting the MAC type .eld within a frame.


It tells who owns and originally announces the pre.x (origin AS) and who provides transit service for the pre.x (transit AS).

by examining AS-PATH attributes of a BGP table, we can list origin pre.xes that belong to an AS and transit pre.xes that use transit service provided by this AS.


Our goal is to provide a network that supports energy proportional communication.

the amount of energy consumed is proportional to the traf.c intensity (offered load) in the network.


For example, there can be many stations associated with one AP, which in turn reduces the user-perceived throughput performance.


gNU Radio package [26] is used as the software-de.ned radio system frontend on sender and receiver nodes in our platform.


We seek to articulate these challenges and build an ef.cient framework towards making such a platform viable.

the biggest obstacles to harnessing smartphones for computing are the phone s battery-life and bandwidth.


OC uses the optimal subsets of all the available compression options to obtain the longest lifetime, while AC strategies always compress data without considering the energy dissipation of the process.

they always compress without questioning the bene.ts of compressing process on the lifetime.


Further, it is desirable to research novel power-scavenging strategies to extend the life of mobile cattle nodes given nodes currently only last 4 days.

.nding optimal ways to power down the GPS chip when each animal is exhibiting little movement would save signi.cant amounts of power.


Moreover, as already explained in Related work, thedi.usedgaincan alleviatetheconcentrating tra.cproblemasDCARinherits it from COPE.

dODE gains a better performance by taking the advantages form the previous and resolving their problems.


To this extend, this paper, which reports measurements from a .xed WiMAX testbed in Oulu, Finland, adds to our knowledge about real-world WiMAX performance using o.-the-shelf hardware.

we evaluate voice over IP (VoIP) performance over .xed WiMAX using synthetic tra.c generation.


In case of Poisson process, since message arrivals are spread along the Beacon Interval, not all nodes have to contend at the beginning of the Active Period.

the number of contending nodes is significantly lower than the maximum when the Beacon Interval is comparable with the Active Period.


Speci.cally, the measured noise levels with the jammer exhibit a much lower variation (the time series curve is almost .at) in Figure 5(c) compared to noise levels when the jammer is not present in Figures 5(a) and (b).

the baseline scenario with no communicator, Figure 5(a), has a much higher variation.


The design of a client-side system-wide caching service such as CK is different from implementing a cache in an individual app.

when compared with app-based client cache, there are two challenges: The .rst challenge is the ability to handle a large volume of concurrent HTTP transactions while incurring low overhead.


Scout further leverages some unique opportunities that arise in vehicular systems.

it sends a front radio to lookahead and identify the best channel parameters when the rear radio eventually reaches the forward post.


Because a router can only announce its best path, PE1 has to send a withdrawal to RR1 to withdraw the backup path.

the backup path is visible only to PE1, and is invisible to the rest of AS 7675.


Specifically, extra bandwidth (due to idle flows) will not be allocated to backlogged flows that are waiting to be served in the basic channel; instead, we will give spatial reuse higher priority.

the slot allocated to an idle flow in the basic channel will not be allocated to another backlogged flow in the basic channel; it will be shared among multiple concurrent trans- mitting nodes (that belong to a flow-dependent maximum independent set).


This shared packet loss could result in more synchronized behavior of window control among receivers and thereby reduce over-head.

the expected value is considered as the worst case bounds of overhead without synchronization.


Now we turn to the previously ignored problem of whether an expansion should be allowed or not.Our solution is very simple.

we temporarily insert the expanded new rule r before the rule rule id that is currently in processing, and then compute the core region of this new rule.


Although the idea of building the interconnect of a multiprocessor computer system in the form of a honeycomb spherical graph is still in its infancy, people have known about and used such graphs to discretize the sphere in the numerical weather prediction community for many years; see, e.g., [3], [8], and [10].

the model developed by the Deutscher Wetterdienst (DWD) is an example of an operational meteorological code that implements the dual of a honeycomb graph with icosahedral symmetry (see [7]).


U a set of S which is possible to be placed in N dimensional space of given substrate network without overlapping each other.

u is equivalent to subset of power set of S. Then, objective function for efficient virtual network embedding will be written as follows.


As a result, it is necessary to make sure that intermediate nodes only relay messages with continuous sequence numbers.

node A in Figure 3 should not relay message #4 until it successfully recovers message #3.


i sends to j i. ui(q(r),c(r)) =0, r = M(i,j).


Hence this bionomial spatial distribution is translated into a spatial Poisson point process [7] to model the random presence of the network nodes.

suppose that L events occur in area A (here an event is an ad hoc node s physical presence).


The downside to our two key design decisions using general-purpose servers and parallelizing router functionality is that they make it dif.cult for our router to offer the strict performance guarantees that hardware routers have traditionally offered.

packet reordering (considered undesirable due to its potential impact on TCP throughput) and latency are two fronts on which a software router may fundamentally have to offer more relaxed performance guarantees.


Figure 4: This .gure illustrates the di.erent phases of SeDyA.

it shows the aggregate-and-verify steps in the .rst and second phase.


We use a compromise that is more e.cient, but that lets the service provider learn some information about a user s location.

we require the Trusted Module to cloak a user s location before accessing the Places Database.


In itself this proves nothing about Bob having knowingly communicated with Charlie: g x could have been sent by David, a party with whom Bob was willing to talk.

david could have been collaborating with Charlie in framing Bob (or maybe Charlie just broke into David s computer).


Instead of focusing on energy e.cient networking protocols that aim to maximize the lifetime of each sensor, the main objective in EH-WSN is to maximize the performance of the network given the rate of energy that is available to be harvested from the environment.

the surplus of harvested energy can be used to improve the performance of the network.


In this paper we assume that the underlying infrastructure used by both adversaries and benign users is honest.

a common router that holds traf.c of the adversary and the honest user cannot collude to perform an attack against the benign user (e.g., r2 in Figure 1).


For each, we give an example in which removing the constraint results in an unbounded price of anarchy, meaning that the result of nodes acting rationally but sel.shly is arbitrarily worse than the result of a centralized, optimal computation.

local decisions us ing a BGP-compatible protocol may not .nd a welfare-maximizing i j. route allocation if one or more of the constraints are not satis.ed.


Corner detection is a widely studied problem [33].

the literature on 2D barcodes has a variety of corner detection algorithms.


Also transitivity is an important concept coming from social network analysis [14].

in a social system there is a strong probability that a friend of your friend is also your friend.


If the s sensing field is effectively covered by sensors of sensing radius rsagainst a disk of radius robj = 0 , a disk of radius robj at any point will intersect with one or more sensing disks.

there is at least one sensor within the distance r+ robj of any s point in the field.


Entropy metrics are more resistant to truncation than unique counts and the detection quality of anomalies degrades much faster in internal addresses than in external addresses.

the usefulness of internal address counts is lost even for truncation of only 4 bits whereas utility of external address entropy is virtually unchanged even for truncation of 20 bits.


Taking the path in Lemma 1 {n~,..., nl} that obeys the ordering criteria, we show that if some node n~ changes its successor to ni to some other node mj along the path {mj,..., ml, ni ), which is in order, that the ordering criteria is obeyed.

ni c rnj it c ~ nl c , n. tc Snnl (tnl ) < snnl , n, , or Snnl (tni ) = Snnm~ (t~.


We therefore have an operation 8 that can reconstruct a label from adjacent con.gurations, and we insist on consistency: the equation (lI 8 lE ) I s = lI II (lE IE s) must be valid for all label and metric values.

we can reconstruct a label l = lI 8 lE from bits of con.guration data ' at each end of a link, and the metric s= l I s will always be the ' same as .rst computing w = lE IE s and then s= lI II w. The type of w is W , which corresponds to the data type that is shared over the wire by the vectoring protocol; this may not be equal to the algebra s metric type S. In this paper we will not concern ourselves with algebraic properties of routing algebras that are associated with correct usage of various algorithms.


This is a single pass process works using pre-adjusted threshold values.

no threshold value adjustment takes place during fast processing.


* * In this game, the strategies (s1, ..., s )are a Nash equilibrium n * if, for each player i, si is (at least tied for) player i s best re * sponse to the strategies speci.ed for the n-1 other players, (s1, **** * ..., s s ..., s ).


When proving the deniability property of protocol .E ,the PA-1 notion is therefore too weak to represent the common situation in which multiple copies of the protocol are run concurrently since in this case the attacker does have access to valid ciphertexts created by other parties.

in the case of protocol .E the attacker may replay such ciphertexts in a communication with the owner of pk without knowing the encrypted plaintext.


To support implicit state management, we extended Bro s table and set data structures to support per-element timeouts of three different .avors: creation, write, and read.

for a given table (or set), the user can specify in the policy script a timeout associated with each element which expires T seconds after any of: the element s creation; the last time the element was updated; or the last time the element was accessed.


Client-side overhead can diminish the performance improvement due to redundancy.

the threshold load can go below 25% if redundancy adds a clientside processing overhead that is signi.cant compared to the server-side service time.


Referring back to Figure 1, imagine a set of sources S = {s1 ,s2 ,...} that have similar behavior with respect to the observer.

paths from sources S to an arbitrary destination d all either go through the observer, or not.


Wk is a k-stage Erlang random variable with mean E[W]=2.ke and a is given by: 4.ne 2n a == > 1 E[Wk] k It is easy to see that P(Wk > 4.ne) .

0 for large n. all n nodes are discovered by the .log2 n.-th phase w.h.p.


Failing to detect predictability with time series analysis, we explored other approaches.

we investigated if information theoretic measures such as entropy would be useful in identifying bandwidth predictability.


However, with the increasing deployment of mesh and ad-hoc networks and new paradigms such as smart environments [1] for both professional and consumer applications, network mobility (as opposed to terminal mobility) will soon become commonplace.

such a scenario will be an intrinsic feature of Body Area Networks (BANs) where the whole network is attached to the body which is in constant movement and interaction with the environment.


Our heuristic for choosing a buffer holding time is that a packet should be buffered for at least one retransmission interval before it can be replaced.

the buffer holding time should be at least one re-transmission interval (as defined in Section 4).


We run TeXCP in the simulation environment reported in [12].

we use the same topology, simulate traf.c demands similarly using Poisson sources, use the same cross-traf.c, and split traf.c using the hashing method described in [12].


First, we show that this large IXP exhibits a surprisingly rich peering fabric in support of the many business objectives of its members.

in terms of AS links of the peer-peer type that are typically established among member AS pairs we show that this IXP has close to 400 members which have established some 67 % (or more than 50,000) of all possible such peerings and use them for exchanging some 10 PB of IP traf.c daily.


We consider a simpli.ed propagation model in which r is the radio range of a station.1 Let s denote the physical area (size) of the network and T(·)represent a region of the plane satisfying certain geometric conditions.

t(A)indicates the region ¯ within radio range of station Aand T(AnB)represents the region within radio range of Bbut outside that of A.


Nonetheless, WSNs are naturallydependentonhow nodes aredistributed in the sensor .eld, since several tasks are a.ected by nodes location, such as clustering [10, 17], data routing [11], localization algorithms[16,24],informationfusion[15],data agregation[7,21,25,26], and tasksthatdepends on spatial data correlation [9, 14, 22].

in this paper, we will explore the impact of nodes distribution on data aggregation performed by clustering algorithms.


In our evaluation, we de.ne a stability function f = |a n ß|/|ß|, where a and  6.2 Dirty data In order to evaluate our scheme in identifying and removing dirty data, we synthetically inject some dirty data into both the SNMP link loads and the sampled NetFlow measurement.

we introduce two types of dirty data in SNMP link loads.


One of the major directions in exploiting energy harvesting is adaptive duty cycling in sensor networks.

[8, 11, 12] describe adaptation of the duty cycle to the characteristics of a periodic energy source and [37] develops a battery-centric (not requiring an energy source model) duty-cycle adaptation algorithm.


As far as PNC demodulation is concerned, only the relative synchronization errors of the two adjacent nodes are important.

any synchronization error within a particular BG is always enclosed within the BG, and is transparent to any nodes outside the BG.


While adopting a crude metric for location would often suffice, we aim to identify a contact zone of each transient resource.

if we can communicate with it and identify it within a given region, then its resourcefulness would be tied to that region, until it leaves it.


The horizontal line corresponds (BER Block)/(BER Gray) 100 10-1 10-2 -30 -35 -40 -45 -50 -55 -60 -65 -70 RSSI Figure 8: Variation in BER gains at different bit-positions with Block relative to Gray with varying RSSI, and with PHY con speci.c constellation maps to improve the performance of media applications in a natural way.

we focus on video streams in which content is partitioned into multiple classes, and each class has a different levels of importance in correct decoding of the stream.


However, an increase in mobility speed causes A-AODV to yield a longer routing path due to the same reason that A-AODV does not proactively search for better routes.

aRPSI can find closer anycast servers than A-AODV through the use of QUERY and EXPLORE packets.


In addition, the radio system has to cope with Doppler frequency shifts caused by the mobility of the radio system.

within highway environments high relative velocities of up to 400km/h may occur.


To achieve this, the following rule is used: Rule 3: xy - Down turns are not allowed in an odd xy-plane and Up -xy turns are not allowed in an even xy-plane.

packets travelling upward cannot enter and even xy-plane (turn North, East, South or West) and packets travelling within an odd xy-plane cannot leave this plane through the downward direction.


For instance, our experiments in the testbedreveal thatthecurrent versionof theprotocol limits the number of chunks to be transferred to at most 100 per transaction.

if more than 100 chunks need to be exchanged, the operation is split into several batches, each of at most 100 chunks.


An important factor was the ease of handling of timestamps in both hard- and software.

this criterion would rule out the use of floating point numbers to represent timestamps.


Intuitively, the ideal partitioning matches the region size with the region s load (which should re.ect the matcher s capacity).

the region size should change in such a way that the average client density per square area roughly equals the handling ability of the matcher per square area.


If the jumping slave adapts to the master s schedule, both jumping nodes will, on average, be present simultaneously 75% of the time that they spend in the same piconet.

the throughput has been increased with 50% on that link.


For example, the routing table information used by DQS queue can be directly acquired from the routing a) VBR-TCP b) CBR-UDP 300 70 250 65 200 60 150Goodput(Kbps) 55 100 50 50 45 0 2 4 6 8 10 40 2 4 6 8 10 Path length(n) Path length(n) Figure 1: Goodput for static chain topology layer.

the routing layer provides an interface to the DQS queue, which belongs to di.erent layers.


In this paper, we show that much faster packet classi.ers are attainable with a careful design aimed at GPU hardware architectures.

our design incorporates several GPU-speci.c features, including (1) memory accesses are always coalesced to signi.cantly reduce latency to off-chip memory; (2) on-chip SRAM memory is heavily utilized and shared among threads to speed up rule matching; and (3) all available GPU cores are exploited to their full extent, i.e., 100% occupancy is guaranteed.


Towards this end, each sensor maintains a bu.er of size 2b,where b is an integer.

sensor j maintains a bu.er of cla+1,...,cla+2b capsules, where cla is the highest implicitly acknowledged capsule.


Simulating peerto-peer protocols is hard and requires many simpli.cations.

all the simulations of BitTorrent we are aware of consider that each peer only knows few other peers, i.e., each peer has a small peer set [5, 11].


The results of [7] deal with an adaptive multimedia networking framework where the bandwidth of an ongoing multimedia connection can by dynamically adjusted several times during the connection s lifetime.

the assigned data rates can be decreased (when overload conditions arise), or increased (when some connections terminate) dynamically.


Roughly speaking, a physical object such as a .ber span or an optical ampli.er represents a shared risk for a group of logical entities (such as IP links) at the IP layer.

if the optical device fails or degrades, all of the IP components that had relied upon that object fail or degrade.


It is observed that SSD-pilot also performs better than the conventional PSAM with under this faster fade rate.

a gain of 1.25 dB can be observed at BER = 10-4 .


Again, not all these metrics are reported here for the lack of space.

deceleration pro.les and distributions are missing, though theycon.rm all other results and show the additional ben 1: list KnownP ackets 2: list SendQueue 3: 4: on InitProgram(): 5: KnownP ackets .Ø 6: SendQueue .Ø 7: ScheduleEvent(SendPackets, 100ms) 8: 9: on ReceiveAggregatedEEBLPacket(aggregatedeebl): 10: for alleebl in aggregatedeebl do 11: ReceiveEEBLPacket(eebl) 12: endfor 13: 14: ReceiveEEBLPacket(eebl): 15: if KnownP ackets.Contains(eebl)then 16: if SendQueue.Contains(eebl)then 17: SendQueue.Remove(eebl) 18: end if 19: return 20: else 21: KnownP ackets.Insert(eebl) 22: ProcessPacket(eebl) 23: if eebl.ttl .=0 then 24: p .


However, APKES .xes this problem by adding bidirectional authentication to LEAP, as was also proposed in [11].

when running LEAP in conjunction with APKES, LEAP is inoculated and opaque, as long as the master key remains secret.


commitment.EvenifVisdishonest,anyexeution ofthesharingphasedeterminesauniquevalues * whih willbereonstrutedatthereonstrutionphase.thesamevalues * willbereonstrutedregardlessof theviewsVi* providedbytheadversaryasinputstoRe.


The paper states that the minimum possible energy spent for a web page download is obtained by assuming that the transfer from the access point to the mobile host is performed in a single phase.

the wireless interface is turned on, all data are transferred at the maximum throughput allowed by the wireless link, and then the wireless interface remains off until the next download.


It should be noted here that all of the scheduling rules that have been described so far have been user-based.

the goal has been to equitably, fairly divide the system resources amongst users via a scheduler so that system throughput is as high as possible and, for some schedulers, user-speci.c QoS constraints are taken into account.


The third choice, which we used in our system, uses the already .ltered location values of thecurrentparticle .ltertoperformtheinertial estimate.

the velocity estimate will be based on the output of the particle .lter and will be computed using the following formula. '


Measure and Parameter The goal of this experiment is to make objective function F in Formula 5 get the biggest, using GA and iterative computation.

we try to get the optimality combination of sleeping ratio Q and coverage ratio P (in the paper, coverage ratio equals value of QoCS), and achieve the most optimal coverage performance.


The tool provides mechanisms for collecting runtime trace data from an application and presenting .ne-grained views of its behavior.

their tool displays the interactions between classes and objects to aid in understanding application structure and behavior.


For the pipeline to be stable, then, each stage must be able to complete its processing of data chunks in less than t time, on average (Figure 2).

t1 < t, Ts < t, Tw < t, and Tc < t. In the analysis that follows we work with these steady-state assumptions; as future work, we would like to explore the use of a queueing model to bet- ter understand the dynamic properties of this system, such as the buffer requirements (queue lengths).


For distributed algorithms, that to date have appeared to necessarily depend on the planarity, we introduce a fading parameter of the decay space and indicate they can be adapted to arbitrary decay spaces at a cost in time complexity that depend on a fading parameter of the decay space.

for decay spaces that are doubling, the parameter is constant-bounded.


The greedy choice is to sample the point closest 0, call that point u.Let gi denote the event that the closest neighbor of u to 0 is at distance i.Now Pr[Fd = k]= Pr[fi] · Pr[Fi = k- 1] i Since u is closer to0than v we know that for every i, i Pr[gj] = i Pr[fj ].

now since Pr[Fd = k] is mono j=0 j=0 tonically decreasing we have: Pr[gi]Pr[Fi = k- 1] = Pr[fi]Pr[Fi = k- 1] i i the best thing Acan do is sample the greedy point, which implies that the greedy algorithm dominates any other 1-local algorithm.


INTRODUCTION  Providing broadband access to citizens, communities, public institutions and developing businesses has become a strategic objective for governments and international organizations worldwide.

serious problems related to the digital divide have been widely recognized by public administrations.


(a) Infected Nodes (b) Query Delay Figure 1: Numerical Results for the In.nite Buffer Scenario We use Pi and Pu to denote the probabilities of interested nodes and uninterested nodes to initiate the query.

then for one speci.c data, its expected query delay at time t, EQ(t), can be estimated as EQ(t)=E(query delay of interested node) · Pi (2) + E(query delay of uninterested node) · Pu if the query is initiated by one interested node, this node can get the data either from its friends (interested nodes) or from its strangers (uninterested nodes).


They can all be calculated as the workload divided by the speed of the component on which the task is executed.

tp=-~; Tr=~; Ts=W~SFs (2) (2) is reasonable for processors executing data-dominated pro-grams, where the total cycles Wp can be analyzed and bounded statically.


), we need to .rst consider system states where sender i can start its transmission.

all its neighbors in the synchronization graph are not transmitting.


6.2 Scheduling Scenario 2 (SC2) In SC2, a comparison study among our proposed NSA scheme and RSS, SDiff, CDMA_Only and WLAN_Only algorithms in terms of overall normalized integrated network utility performance is presented.

considering new users that sequentially enter the system requesting both NRT and RT services in a random manner, Fig.4 illustrates the overall normalized integrated network s utility achieved under NSA, RSS, SDiff, CDMA_Only and WLAN_Only network selection schemes, as a function of the number of users in the network (i.e.


The following assertions characterize the attacker.

the .fth assertion states that there exists a host attacker that is di.erent from victim and that doesn t have the trusted IP address.


Although these tools can be quite useful, for example, it has been noted that the con.guration analysis tool NetDB provides AT&T signi.cant cost savings [47], these tools are inherently limited in the problems that they can detect.

since con.guration .les alone do not determine the behaviors of a network, analyzing only the con.guration .les based on an abstract model of the network and equipment behaviors may leave many problems undetected.


For unimodal worms and worms that use all IV s it has indiscriminately, there will be a pair of matching ingress and egress data .ow links.


To this end, the users of our framework need supporting tools to customize its behavior, and explore the trade-off between system coverage and resource consumption.

they need a way to evaluate the credits to be assigned to a logical neighborhood, based on the desired quality of service.


In the SoA model, using centrality metrics decreases the di.usion time, for the same portion of covered nodes, with respect to using a simple random walk.

choosing the most central nodes accelerates the di.usion process, considering the total time for spreading some information over a portion of nodes.


By tuning the A-C clustering thresholds [7], cluster sizes and cluster granularity can be balanced, by favoring inter-cluster communications, while obtaining the benefits of locallydeployed and stable virtual infrastructures.

the exploitation of nodes heterogeneity to assign leading roles to spine nodes having more resources, and better operative conditions than others (e.g.


In this paper, we perform a comprehensive study of content-agnostic characteristics of spam campaigns, e.g., duration and source-network distribution of spammers, in order to ascertain whether and how they can assist the simple label-based clustering methods in identifying campaigns and generating campaign signatures.

from a .ve-month trace collected by a relay sinkhole, we manually identi.ed and then analyzed seven URL-based botnet spam campaigns consisting of 52 million spam messages sent over 2.09 million SMTP connections originated from over 150,000 non-proxy spamming hosts and destined to about 200,000 end domains.


= 3 is valid for a wide-range of ISP network sizes and SRLG failure probabilities.

for typical ISPs with up to 10, 000 SRLGs, and realistic SRLG failure probabilities of about 10-5 [11], the probability of Shrink being worse than the brute force algorithm is always less than 10-4 and often less than 10-8 .


Main Results We .rst derive an upper bound on the multicast capacity of a wireless ad hoc network along the lines of [14].

in the Gupta-Kumar model, the number of source-destination pairs is n. To compare and contrast our result with theirs, we too assume that the number of S-D pairs in our network with multicast .ows is n. we assume that the E number of multicast sources is nfor some E> 0, and the 1-E number of receivers per multicast .ow is n .We express our results in the order sense.


Although we study in this paper one particular form of the constituent boxes, the same principle can be applied with boxes of various forms.

other assump- tions than the Markov modeling assumption can be stud- ied, leading to another form for the second box.


Among the existing MU precoding techniques, nonlinear multiuser precoding has been developed to improve the performance of linear precoding.

tomlinson-Harashima (TH) precoding is widely studied because of its simplicity and good performance.


We also present in this paper an analysis of the gaps among these performance .gures speci.cally when given the symmetric system which indicates the identical parameters and collision constraints.

we prove that, when the collision constraint is tight, the optimal access policy performs identical to the policy that assumes the full observation of all channels.


route data as fast as possible, and utilize the full remaining budget (F - DDDmin)toslowdowndataacquisition.

we refer to this basic approach as Rapid Delivery.Rapid Delivery aimstoreducetherateoftraf.cinformation generation as much as possible.


In the case of heterogeneous qualities, an important question is whether the kernels tend to also have the highest quality factor.

can we expect that the best nodes (i.e.,highestqualityfactor)are also the strongest nodesin terms of value?


However, HA does not keep both e and user password PWMU in the storage.

whatever the number of users is, HA only keeps its secret key N and its identity IDHA.


the AP d,i log2(PMAX/Ki) j=1 c transmits with the maximal power.


This is because of its better reuse of source routes already cached and not yet evicted.

dSR-NCache (and similarly DSR-Link) bene.ts from local reuse (using routes discovered for one destination for another destination) and improved remote reuse (using routes cached by other nodes) as compared to DSR-Path and AODV-LL.


4.2 The Inequality Problem with DSR Route Cache To achieve a fair comparison under the same ad-hoc network scenario, the route lengths/delays should be similar at the same time for di.erent TCP variants.

if the route from S to R at time t is three hops under TCP-DOOR but four hops under base TCP, the performance results would be incomparable.


We also assume that the aggregation operation is not reversible.

once two or more reports are aggregated, they can no longer be split.


The capacity ci,t is weakly increasing with bid value because of spq routing.

if buyer i > 1 gets a higher priority i ' < i then her capacity in period t will be the capacity unused by all buyers i '' < i ' , whereas previously its capacity was that unused by all buyers i '' < i.


In this paper, we study the performance of epidemic routing in network environments where the bandwidth and node bu.ers are limited.

to simplify the analysis but still capture the essence of protocol details, when node i and node j meet, we assume that the bandwidth is only su.cient to transmit one packet from one node to the other and vice versa.


Px,e(t), have updated their shortest paths in response to the LSP, to point to the observation node, x,but the observation node is yet to record this change.

the time of update for node x is t+d>t+E, and the time of update for a node l .


If the physical network does not support VLANs, there are some features that need to be addressed such as isolation and preventing interruption of normal network behavior.

dHCP does not naturally support multiple servers supportingheterogeneous networkcon.gurations on the samelayer2 network.


The probe is used to monitor WLAN resource utilisation in terms of its MAC bandwidth components.

we monitor the load bandwidth (BWLOAD) component that is associated with the transport of data packets and is related to the throughput of the station.


Our ongoing work is centered on extending the feature-based diagnosis methodology.

we are studying online extensions to the clustering methods, devising methods to expose the raw .ow records involved in the anomaly, and investigating additional information that can aid in better classifying anomalies by their root-cause.


Moreover, DODEX needs to store, forward nativepackets,createandforward codedpacketswhencoding  (a) (b) (c) Figure 1: Opportunistic network coding scenarios chances exist.

each nodes also change their behaviors to also intercept the coded tra.c.


Similarly, for the symmetric case, we can introduce x1, ..., xn 1sic2 y meaning that y can be derived from x1, ..., xn with the help of decryption oracles and encryption oracles.

the algorithm trying to compute y from the x1, ..., xn is allowed to submit strings to the oracles for encryption and also for decryption.


This paper describes a demo of an experience sharing application for mobile phones built on an ICN platform designed for devices with intermittent connectivity.

we detail how this application will be showcased in an indoor exhibition where experience is shared with media content that is geo-tagged using Bluetooth beacons and spread opportunistically to other users.


The identifiers are authenticated during neighbor discovery; (2) nodes that are not within each other s radio range are not able to run the neighbor discovery protocol successfully.

the Sybil attack [14] and wormhole attack [15] will occur in ENDAIRA unless the above two assumptions are actually achieved.


6(a) we show the average node residual energy over the simulation time.

we compare the routing performance when three different link metrics are used.


It involves essentially the design of auto-adaptative protocols and architectures based on real time traffic and QoS monitoring.

it has been demonstrated that the most difficult cases for guaranteeing as well as optimizing QoS are related to the presence of traffic anomalies which then have to be detected and classified in real time.


In CrossROAD, assuming a proactive routing protocol for the network topology management, every node knows all the others taking part to the network, and becomes aware of topology changes with minimum delays, depending on the frequency with which control messages are sent on the network.

through the de.nition of a cross-layer architecture for MANET [9], all protocols of the stack can bene.t from the knowledge of status information shared by other layers.


In this paper, we explain that there exist alternatives to cellular networks for the provision of SMS.

we present the Self-Organizing Wireless messaging nEtwoRk (SOWER), an all-wireless network operable in cities.


To estimate the likelihood that FEC will succeed at some point in the future, we maintain information about the amount of time it took FEC to correct errors in previously transmitted blocks.

for each previously received block we record the time when it reached its decision point, Td, and the time when FEC was able to .nally reconstruct the block, Tr.


0, let Zn(a, -x, b, y) denote the zone that is an extension of Zn(a, b) by a length of x in the left direction and a length of y in the right direction.

if l1 and l2 are the left and right boundaries of Zn(a, -x, b, y), then Vl1 = Vll(a) - x and Vl2 = Vrl(b) + y (Figure 3 shows an example.)


This makes our .nding that signi.cant consolidation is possible, again, more conservative.

the incomplete discovery does not undermine our .ndings regarding the consolidation of the locations that we did discover.


APPENDIX In this section, we formally show that the forwarding rules due to pseudo-random duty cycling do not alter the resultant transition probabilities, which are the same as those for simple random walk on .nite graphs.

a duty cycling random walk amounts to .rst selecting a neighbor with equal probability and then waiting (while sleeping) for the number of slots until that neighbor wakes up.


If we want to provide reliable transmission we have to allow multiple retransmissions.

the number of retransmission is infinite.


Search cost and route quality Before considering how mobility a.ects search cost, it is instructive to observe that route quality and search cost do not necessarily go hand in hand.

the same route can be obtained at low search cost, if the encounter tables of the nodes are such that route discovery is done over many small searches, or it could be obtained at high search cost, if route discovery makes few large searches.


The AP popularity metric M1 calculates, for each cluster |Pop(C)| C, the fraction of popular APs, , and averages it |C| over all clusters of size |C|;an AP is in Pop(C) if the total number of incoming intra-cluster transitions to the AP in the trace exceeds the average number for all APs in that cluster.

if we denote the average popularity of an AP in a cluster C as AvP op(C)= avgu.C( N(i, u)) (4) i then M 1(c)= avg|C|=c|{u .


This simpli.es interface implementation and makes interfaces agnostic of application messages.

interfaces don t understand user or application generated messages, they provide a physical communication medium for applications based on PDU sized messages.


Although 95% of PLC devices follow the HomePlug speci.cation [3], the MAC layer of this speci.cation has received little attention so far in the research community, in contrast to the PHY layer.

no work has investigated how far from optimality this MAC protocol is.


The de.nition of the perception function is quite general, and allows to model several message routing strategies and MA interdependencies.

the receiving agent can be aware of the state in which the agent that issued the message was, and use this information to take an appropriate action.


Intuitively when K< 1, the demand of bandwidth exceeds the supply of bandwidth.

the total amount of entitled bandwidth exceeds their contributing bandwidth (discounting the source).


One naive decision rule is to perform hypothesis testing on the aggregated pick counts in the past few seconds, that is, to compute the ratio of likelihood for the two hypothesis: 1) that there is an event (p = p1), and 2) that there is no event (p = p0).

the naive decision rule performs the test Binomial(k; n, p1) = r Binomial(k; n, p0) where n is the total number of sensors in the system, k is the number of picks observed in the past few seconds and r is the decision threshold chosen to satisfy a constraint on the system false positive rate.


This observation leads to the question whether the truncation-induced reduction of risk and utility is asymmetric with respect to internal and external addresses.

wehypothesizethat anomaliesdetectablein external address distributions are more resistant to truncation than those of internal distributions because the characteristics of external /32 pre.xes are less impaired by truncation of the .rst 8 bits(seeFig.2).


Compiler analysis for data filtering and our algorithm We define our problem as a computation-mapping problem; that is, for each sensor node in the wireless network, given a fixed amount computation to be performed (whose result needs to be communicated to the base station), we divide the computation between the sensor node and the base station.

we decide what parts of the computation should be mapped to the base station and what parts of it to the sensor node.


We lack of a large data set, and the fact that these are truncated can suggest a simple reason why one might see such gaps: (by only using data sets for which the total time is roughly Cisco s implementation of the MinRouteAdverTimer is not less than one hour), means that one can model the tail almost per pre.x , but rather per peer .

the router will as accurately using a power-law distribution.


For example, if each REQUEST includes in the node list location information and time information for each forwarding node, a node can keep a database of previous location information, and .nd two location claims that signi.cantly exceed the maximum speed achievable by legitimate nodes.

if location information is accurate to d, and time information is consistent to ., and maximum speed is ., then two locations claimed t time apart is maliciously claimed if the distance between the two locations is greater than 2d + .


The goal is to achieve the desired performance in as little time as possible.

if it takes le slots to compute t , the estimate of t tags with a certain accuracy, and li slots to uniquely identify t tags, then, we need sele .


Let ....be the normalized weight vector and .. be the original information signal; thus, transmitting .... can be expressed as ....... For maximum ratio transmission (MRT) algorithm, the weight vector is [9] ....=....* ....          (4) where · represents the Euclidean norm, and * represents conjugate transpose.

the weight vector for AST is all zero but only one entry equal to 1 [6].


The goal is that distances between items in Euclidean space should closely approximate the given set of input distances {dij }.

mDS seeks to minimize: X min (||xi - xj || - dij )2 .


This scenario has a strong and a weak re.ection in the backscatter at delays of t1, t2 respectively and the corresponding strengths of the re.ected signals are a1, a2.

if we transmitted signal x(t), the backscatter is given by a1x(t - t1) + a2x(t - t2).


While the test-bed itself carried only the data and control traf.c involved in each experiment, interference of various kinds was inevitably present.

each .oor of the building has four 802.11b access points, on various different channels.


We are currently making further progress toward the goals of this research by looking at a wider range of network parameters and topologies.

study of large scale failures in scarce North American networks is underway.


The transition technologies include DS-Lite, 464XLAT, MAP-E and MAP-T.

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


For all multi-user beamforming techniques using linear precoding, it is su.cient for beamforming antennas to have a relatively accurate estimation.

as long as each base station antenna s CSI estimation deviates from the real CSI by the same multiplicative factor, multiuser beamforming will still result in the same beam pattern.


Coordination: Unlike wireless sensor networks where the central entity (i.e., sink) performs the functions of data collection and coordination, in SANETs, new networking phenomena called sensor-actuator and actuator-actuator coordination may occur.

sensor-actuator coordination provides the transmission of event features from sensors to actuators.


These .ooding actions are in addition to the regular grid construction actions described above for Dissemination Nodes.

grid construction does not end when a region of interest has been reached because there may be more than one region of interest de.ned in a TASK message.


Unfortunately, the prevailing data center network architecture falls short of realizing the full bene.ts of these components.

in today s cloud services data centers, network and server capacity is fragmented, and bisection bandwidth is one to two orders of magnitude below aggregate server bandwidth.


RELATED WORK Prior works have examined speci.c facets of the availability issues imposed by SDN.

recent studies have considered how to leverage redundancy to improve the reliability of controller-switch communication [19].


, in analog channel feedback, we leverage the property that channel noise n is typically additive white Gaussian noise (AWGN), which follows a zero-mean normal distribution.

a channel noti.er, e.g., Bob in the above example, can announce the same analog CSI multiple times.


Itrequiresonly staticinformationonthenetwork that can be spread at the time of deployment.

the number of network nodes, the clock synchronization and the power assignment can be seen as such static information.


In some replay applications, this information may not be available.

it would be useful to replay an input obtained from a logged network trace.


particular environments and disseminate them to central gathering points, called sinks or base stations.

sensor networking technology faces a critical problem due to the limited energy, storage, communication and computational capabilities of sensors.


Note that the service we are considering inserts either live or pre-recorded content into a live stream.

the primary content is being received in real-time and is not locally available.


1/4 nodes in the networks do not broadcast its information to its neighbors.


As nodes only provide the overall radio uptime, a worst-case approximation is made.

it is assumed that they are always in transmit mode if their radio is active.


Nevertheless, Poc and Poid adopt different power assignment schemes.

poid, works in sparse networks, assigns diverse responding power for each neighbor and ensures that the received power from any two neighbors or any two combinations of neighbors are suf.ciently different.


Figure 22 also shows that TCP with an unclamped congestion window slightly outperform both TPA and TCP with clamped window.

tCP-uc throughput is about 2% higher that TPA-3 throughput.


The exceptionis easy to state but harder to de.ne: ...network administrators can monitor a service asanecessary incident ...totheprotectionof the rights or property of the provider of that service.

monitoring packets to look for an intruder, sni.


For about 25% of the cost of the original system (using typical current PC component costs of 10% for a new processor, 10% for a new disk drive and 5% for added memory), the user can substantially improve the system performance.

progress in storage and processing technologies during the two years (i.e., Moore's law) doubles processing power per dollar and triples storage per dollar.


The agent-proxy model has been shown to improve the performance of HTTP over a wireless network.

efforts have been directed toward applying specific services to alleviate the poor performance of Web applications in a wireless environment.


Accordingly, not just that FIB space reduction does not ruin lookup performance, but it even improves it.


Here the ACK message plays two roles, one is for acknowledgement to the sender, the other is for suppressing lower-priority candidates.

whenever a lower-priority candidate hears an ACK sent from a higherpriority candidate, it will suppress itself from relaying the packet.


A hypothesis is a candidate set of circuit failures that could explain the observation.

a hypothesis is a set of risk groups that contain the set of links seen to fail in a given observation.


We next explore what these spam sources do once they are done with sending spam for one campaign.

do they immediately start sending spam for the other campaign?


Since there are many AQM schemes in the literature,we will compare the AVQ scheme with a representative few.


The maximum NVA value is 3, because at NVA=3 all sensor nodes can reach the base station directly, hence, position dependent maximum transmission range constraint is effectively lifted for NVA= 3.

any value of NVA larger than three will be meaningless since transmitting over a distance larger than RS is unnecessary for a disk shaped network, where the base is located at the center.


To avoid this, we add some random perturbation to the timeout value each time.

a node delays (bumps) its SynTx by a random amount.


INTRODUCTION Emerging information-centric networking (ICN) architectures are currently changing the landscape of network research.

named data networking (NDN) [1], or content-centric networking (CCN)[2], is a proposed network architecture for the Internet that replaces the traditional client-server model of communications with one based on the identity of data or content.


Note that for the case of 1 neighbor, there is no alternative next hops.

the reachabilityguaranteeisprovidedeitherby covering pre.xesorotherwiseunstablepre.xesundamped,andallthe overheadreductionisduetodampingnoisypre.xeswiththe existence of coveringpre.xes.


is the extension of the natural local expectation to unconstrained collaborative sur.ng.

the causal ordering relation de.nes formally one aspect of what is required.


()H <1( We use ( )to denote the time for checking this property, where n is pn the number of the links in the H matrix), and we say the power vector P* =(I -H )-1·.is optimal in the sense that each transmission power in this P* vector is the minimum power that must be used to satisfy all the Q simultaneous transmissions.

in order to successfully schedule all these Q links, each transmitter must use power larger than or equal to the corresponding power in P*.


Suppose now that we have m<l/n, and a network that is not fully connected.

consider that a node i can decide whether to create a link to another node i4 = i.


Figure 2: A gossip algorithm for information spreading.

when node i contacts node u at time t, node u sends information to node i, but i does not send information to u.


Since a correct parameter setting requires macMinBE<macMaxBE, we considered three different set of values for macMinBE, corresponding to three different macMaxBE values (i.e., 5, 8 and 10).

we fixed macMaxBE and varied macMinBE in the range [1, macMaxBE-1].


As in NTP, we distinguish between the number of bits available in the format of the timestamp and the actual resolution of the clock.

some of the least significant bits may be set to zero.


Sector-Based: Prior literature has extended the basic lognormal model to capture the fact that many low-power radios have non-isotropic radiation patterns [24].

even when nodes are positioned at equal distances from the sender, they may observe signi.cantly di.erent receive signal strengths.


We also extend our design so that it embraces open network architectures.

we are robust to router devices that can install alternative routing software, for example to change prioritization schemes, or otherwise tamper with methods to compute payments.


bmin is equal to the amount of f spare bandwidth the aggregation and core nodes can handle without decreasing agility.


That implies if the frame demand is higher, it is supposed to wait for a longer period of time to win a contention.

the higher the frame demand, the greater the contention failure rate.


The measurement results demonstrate that the asymmetric QoS is a feasible and robust solution for WLANs with asymmetric traffic.

supporting QoS only on the AP can provide effective WLAN QoS for high priority traffic.


The network resource is categorized into three types the access server, the node server and the link server, based on the fact that the network resource performs the different function for the traffic packets.

server is an object of a network that provides a specific service for the network traffic.


In summary, the proposed algorithms can achieve nearly optimal performance in small-scale networks.

the performance of AsympOpt is very close to the bounds obtained from the optimization solutions.


Our main concern is to determine if one injection rate performs relatively better (in terms of number of packets received) than the other for different speed levels.

is there interaction between injection rate and the speed of nodes.


[12] When k = .1 · ar2 , the area covered by the transmitting disks of a multicast tree is almost surely at least (2 ·a 2 , thus, T(a 2).

v t kra, when k = .1a 2/r2 | Area(T )|= c0 (8) (2a 2 , when k = .1a 2/r2 v Notice that when k = O(a 2/r2), kra = O(a 2); when k = v O(a 2/r2), kra = O(a 2).


Observe that as the delay constraint becomes strict the power consumption increases.

the reliability constraint of Smode is less critical than delay constraint, see more results in [21].


In order to obtain a polynomial time algorithm, we relax the domination condition so as to obtain a smaller number of candidate schedules.

we de.ne a pseudo-domination relation among schedules, according to which a schedule S1 pseudo-dominates schedule S2 ,if T1 R2 ,and |P1 |> |P2 |, where Ti, Ri, |Pi |are the total transmission power, the residual energy of the broadcast nodes and the cardinality of the set of nodes covered by schedule Si, i =1, 2, respectively.


Then we may ask what is the probability, accounting for both the random locations {Xk} and medium access states {ek} of all other nodes, that (2) holds in a random time slot?

if a random con.guration {Xk} is observed in a random time slot, what is the probability that (2) holds, given the distance d = ||xj - xi||?


We can observe that the Pactual of them increases with m, but PDGRS outperforms GKMPAN.

the Pc for PDGRS is much higher than that of GKMPAN with m. From the above analysis, however, we see that the actual local connectivity depends on the amount of space available on a node for storing keys, therefore, when the node resource is limited, we will improve the Pc by directly increasing the node degree d. PDGRS uses the following two ways to increase d. The first is that a node u can use its neighbors which have shared keys with u, to establish a secure channel with other nodes in u s one-hop communication range.


In other words, the answerer MAY channge formats in the middle of the session, making use of any of thhe formats listed, without sending a new offer .

after establishing an initial sess sion between two peers A and B engaged in a multimedia (video or voice or both) session, then when one node moves, it is allowedd by RFC 3264 to modify the data stream and piggyback the neww session settings with the new stream.


A .rst contribution of this paper was then to provide better insights into the nature of these approximations and to highlight the relationships between the di.erent methods.

we provided a theoretical justi.cation for the (binomial) weighted geometric mean, a heavy-tailed data mapping initially proposed in [22] in a ad-hoc manner.


when node jis transmitting to any node l, the link capacity on node ito jis effectively shut down to 0.


From the point of view of the authors, the reason of this disgregation of protocols is prompted by the intrinsic characteristics of the DTN networks and its applications.

there is a strong dependency between the routing protocols and the applications.


INVARIANCE PROPERTY: NOT JUST FOR CONTACT-BASED METRICS Analytical and simulation results in [5, 7] have shown an invariance property of contact-based metrics, including contact time and inter-meeting time, under the class of correlated random walk (CRW) [1] as well as random walk (RW) mobility models [8].

the average contact and inter-meeting time are invariant with respect to the degrees of correlation in CRW mobility models and step length distributions in RW mobility models, under both Boolean and SINR interference models.


We investigate the feasibility of a di.erent method augmenting 3G using WiFi.

reduce the pressure on 3G spectrum by using WiFi connectivity when possible for transferring data.


In the following results we also evaluate the model with both dropping and marking congestion noti.cation mechanisms and show that it can work with and without AQMs.

we will also evaluate the model s performance on a network of Drop Tail queues.


But in high traffic load the performance of CIT is degraded considerably since the network bandwidth in CIT is lower than that of mesh-based structures.

the number of links in CIT is lower than that of mesh-based structures.


These results show that wireless networks can have a signi.cant impact on the achievable throughput.

11 Mbps wireless cards and wireless connections in areas with many other wireless senders, and/or with poor link quality, face signi.cant performance degradation.


The advantage of this starting point for intrusion detection is that it is rooted in a communitycentric essence of normality.

rather than de.ning intrusion in terms of locations in physical space (where normality is harder to characterize), this hypothesis de.nes intrusion in terms of locations in social space, where normality often has well-understood properties.


When the network is congested, D3 satis.es as many .ows as possible according to the .ow request rate in the order of their arrival.

each .ow will request a rate r = ds , where s is the .ow s size and d is the time until its deadline.


In these experiments the signal is attenuated by only 20 dB.

the receiver gets packets with good signal strength.


2(a) because it allows nodes N1 and N3 to transmit simultaneously and have their packets received correctly despite collisions.


Let Ih(v) denote the set of neighbors of vertex v including v,and let Ih(A) denote the set of neighbors of vertices in A, i.e., Ih(A):= .v.AIh(v).

let wv(t, h)denote a weight associated with vertex v. we de.ne the weight of vertex v as the product of queue length Qv(t)and transmission rate rv h.Let w * (t, h) denote the largest weight, i.e., w * (t, h):=maxv.V wv(t, h).


RELATED WORK There has been extensive prior research on fault-tolerant consensus in synchronous (see [27]), partially synchronous (e.g., [14]), asynchronous with failure detectors (e.g., [7, 24]) and fully asynchronous (e.g., [16]) message passing systems with reliable or eventually reliable point-to-point channels.

[14, 24] overcome message loss by assuming that eventually there is a connected majority component.


Many countries already censor Internet usage, and giving them a network architecture that provides far greater access to user requests would further tighten their grip on information .ow.

had content-oriented networks been in use, blocking information during the uprisings in the Middle East would have been much an easier task for governments.


To do so without modifying his code base he must be able to access multiple NICs on PlanetLab the same way he does on his ethernet testbed.

he has to be able to setup his own customized Layer 2 topologies1 on PlanetLab, which is currently impossible.


2 It is clear that this pruning reduces the number of visited nodes, but reducing the number of visited nodes does not necessarily reduce (l) (5) c(s )= y l - rljsj processing requirements.


0.15 -3 x 10 11 We then reduce the size of Di to the set of interfering BSSs 5 of BSS i.

d1 = {BSS1,BSS2,BSS3}, D2 = D3 = {BSS1,BSS2,BSS3,BSS4}, and D4 = {BSS2,BSS3,BSS4}.


Using the con.guration data, we investigated the traceroute AS paths where the last hop was mapped to AS 7018 and at least one other AS.

we inspected the IP pre.xes used to map these hops to multiple origin ASes to see if they actually corresponded to customers of AS 7018.


In essence, HEAP uses a modified HMAC-based algorithm [10] that utilizes two keys.

with the initial bootstrapping phase, every node (I) shares a pair-wise secret hash key, called okey, with each of its neighbors, and (II) generates one common secret hash key, called ikey, and securely distributes it to all of its one-hop neighbors.


CONCLUSION In this paper, we took a step towards a systematic study of the interactions of the mobile networks and TCP.

we studied the impacts of sudden load increase and handovers in mobile networks on TCP performance.


Finally, our design uses a different mechanism to maximize pipeline utilization and handle out of order lookup conditions.

we aim at having not more than one access per pipeline stage for any lookup.


In forward traf.c, on the other hand, the fraction of connection time increases with observer speed.

the network performance improves with node mobility, which is unique to the mobile infostation networking paradigm.


De.ning a minimum is useful to keep the chance of successful dissemination for regular Geocast messages even in high load situations.

high overall load may be caused arti.cially by an attacker, who then could inhibit forwarding of other messages if .


However, the standard ARP has not been discarded.

if a host of a LAN doesn t support the proposed secure extended version of the ARP protocol, it is still able to communicate.


It is clear that games G0 and G1 are identical until F occurs.


To make the calculation reasonable, we ignore all the inter-packet arrival intervals larger than 5 minutes.

for any inter-vals larger than 5 minutes, we treat it as if the user stopped using the phone and turned Wi-Fi tethering off.


We then use the sliding window technique to measure short-term fairness.

for a given window size we calculate the fairness index within that window.


We use the same topology as before, set cache sizes according to the formula: Ni × T SB (see Table 2) and observe the performance di.erence in case of heterogeneous caches.

if a core router caches one second worth of tra.c and we assume larger caches towards the edges of the network (which we denote as c(ore) .


Moreover, TS 25.346 does not support FACH dynamic power setting.

when FACH is employed, it has to cover the whole cell area that generally leads to unnecessary power wasting.


DISCUSSION In this section, we highlight some discussion points surrounding SDN traceroute.

we contrast our probing based solution against rule scraping for inferring routes.


However, an Internet Service Provider (ISP) might have different objectives and constraints that are considered during the design phase.

networks are designed to be resilient in case of failures, being able to guarantee connectivity even if some links in the topology fail.


However, the system model of [12] differs from ours; in [12] it is assumed the system is designed to support hyperlinks.

given a path between two nodes, u and v, a direct link between u and v may be established.


In particular, we use the lexicographically order.

we say that a vector y = (y1,...,yk )islexicographically less than a vector z = (z1,...,zk ), and write y <L z,if y1 <z1,or if y1 = z1 and y2 <z2,or if y1 = z1, y2 = z2 and y3 <z3,or ...,if y1 = z1,...,yk-1 = zk-1 and yk <zk .y <L z if in the .rst component in which y and z differs, that component of y is less than the corresponding component of z.We write y =L z if either y <L z or y = z.


As it is hard to maintain a central controller in a practical ad hoc network and a node can not be a transmitter and receiver at the same time, our distributed scheduling algorithm has two phases, namely transmitter nodes selection and stream allocation.

a set of nodes are .rst selected to be transmitter nodes based on their priority and the current network topology, then the streams with higher priority and/or better quality are allocated from the selected set of transmitter nodes.


is related to the relative density of the network (µ(R)).

when transmitting a search message (where the range is ßR) the corresponding density is µ(R) .


This preorder is used to compare types with the special type Un.

we allow messages having a type T that is a subtype of Un, denoted T<: Un, to be sent over the untrusted network, and we say that the type T is public in this case.


is used as a main driver for determining technology directions and trade-offs in improving high-performance logic.

the target set is an average 17 % per year increase in 1/., which matches the historic rate of improvement in device performance up until 2007 [6].


As a .rst step to understand the impact of mobility in CRNs, we study theperformance of spectrum sensing with mobile sensors via a theoretical study.

we show that, when sensing is scheduled multiple times, sensor mobility canyield asigni.cantperformancegainby exploitingspatio-temporaldiversityin receivedprimary signal strengths.


Observe that the de.nition of the RS-Clustering problem does not require the number of clusters to be part of the input.


3.5 Balance between Quality of Experience and Bandwidth Consumption: Using Playback Buffer as Receiver Window Most P2P file sharing systems achieve high downstream data rate by parallel content retrievals.

multiple segments are concurrently downloaded from different servers.


This is an extension of epidemic where a message copy is only forwarded from node i to node j if node j has a higher forwarding quality than node i.

in our simulation, we use a mean inter-meeting time Ik,d with the destination d as the forwarding quality of a node k. node j has a higher forwarding quality than node i if Ij,d <Ii,d.


Let the amount of data sent in a time interval be linearly propositional to the adopted bandwidth.

if a 3G module sends data at bandwidth Bi for time ti, then the amount of transmitted data is the multiplication of Bi and ti.


Rather than treating each switch as an independent entity as done by all prior work, perhaps given their starting point using fully decentralized control protocols like IGMP we leverage ideas from scale-out storage systems to partition the multicast address space and distribute address partitions across cooperating switches.

all core switches in the datacenter network act as one cooperating set, as well as each set of upper-layer switches in each datacenter network pod .


In this way sensing overhead is reduced and more opportunities are explored.

if the number of nodes is more than the number of available channels the random sensing is preferred instead of negotiated sensing because the probability of the channel availability is greater.


qMAC s performance degrades gracefully in the face of such deviation, as long as it is known in advance.

the throughput decreases and average delay increases, but no packet collisions occur due to the hidden transmitter or idle channel detection delay problem.


The basic approach for providing the QoS guarantees in the WiMAX network is that the BS does the scheduling for both the uplink and downlink directions.

an algorithm at the BS has to translate the QoS requirements of SSs into the appropriate number of slots.


Let us consider the symbolic execution of the .rst case (case of B): For the protocols B(a, b) and B(a ' , b), the .rst published message is {(pk, na)}ra (compared to Example 4, we switched a pkb here to a from a ' as it does not matter because of the symmetry of the problem), besides the public keys.

we let f0 = pk, pkl , pkb, {(pk, na)}ra .


5.1 Initialization In the PCSS algorithm there is no need for a separate initialization procedure to start communication, since the pseudo random generation of checkpoints is de.ned such that once a master slave node pair share the same master s clock and slave s MAC address information, it is guaranteed that the same pseudo random sequence will be produced at each node.

it is guaranteed that two nodes starting checkpoint generation at different time instants with different checking intensities will be able to communicate.


Not only are the table created in this fashion, but the data sets over which the vocabulary tables are created is also restricted to this pair-wise model.

if A is the sender and B is the receiver, A uses its earlier emails to B as the data set on which the A-B vocabulary table is created, and then uses this table for encoding.


To structure our tests, we charted all possible combinations of features derived from the .elds of the 802.11 MAC header, and marked non-standard or unusual combinations (the full chart can be found in our Technical Report [2]).

we singled out combinations of frame types, subtypes and Frame Control .ags either prohibited by the standard, not explicitly prohibited but of unclear utility for the standard protocols, or simply unlikely to occur in practice.


A single socket is utilized for each connection.

the socket handles multiple interfaces at the same time.


4.3.1 Predicting Traf.c and V0 First, as shown in Figure 5, we predict total and per-.ow traf.c using an exponentially weighted moving average (EWMA).

prediction = ß *currTra.c+(1-ß)*Prediction.


In fact, this problem is equivalent to the original problem in the sense that (1) any solution of the above problem can be converted to that of the original problem without utility degradation, and (2) both problems share the same objective function.

after solving the above problem, we immediately obtain a rate allocation for the original problem by setting the sensing rate of v to sv = fcv, and the amount of .ow on link uv to fuv.


BACKGROUND AND RELATED WORK Early signature matching techniques were string-based and built upon multi-pattern string matching algorithms [1,9,21] to e.ciently match multiple signatures against the payload.

the Aho-Corasick algorithm [1] constructs an automaton-like structure that simultaneously matches all strings in a single pass over the input.


When the master receives the LMP SCO link req message, it replies with a LMP SCO link req message with all the parameters speci.ed.

the master attempts (if possible) to use the same value of TSCO as speci.ed in the slave request.


Our approach to calculate the total system throughput is based on a band-by-band approach.

we .rst focus on the single given frequency band and calculate Np 1ch considering NCH and Pp.


Recent revelations by Edward Snowden have con.rmed that ASes pose a realistic threat: the NSA s Marina program stores vast amounts of metadata for up to a year [10], while the GCHQ s Tempora program buffers data for three days and metadata for 30 days [24].

tor has been speci.cally targeted by such adversaries in collusion with ASes [4, 6, 7].


5.3 Potential Winner Determination In this step, we determine the potential winners of the auction without considering the economic properties in problem (4).

the potential channel allocation is determined by the following relaxed optimization problem: max W, (5a) s.t.


As in [13,14], the network is assumed to be asynchronous.

edges can be activated (i.e., get assigned new paths) at di.erent times, and update messages can be delayed or even lost (as long as they are retransmitted eventually).


In the simulation experiments, we observe up to 20% of the whole period when the downlink is completely idle, which induces nearly 50% degradation of the total download goodput.

the TCP performance over LTE will be seriously in.uenced on the presence of the opponents in the opposite direction.


While our results are encouraging, there is still further investigation required.

some web sites will have jittery connections to the Internet or lossy routing paths, making predictions dif.cult.


Consider, for example, a departmental server host h. It listens on port 25 to receive mail from the rest of the company; it also listens on port 80 for a departmental Wiki.

wiki service is offered only within the department.


Conversely, MTurk allows a higher variety of users, spanning a wide age range, which shows the advantage of crowdsourcing for analysis in depth.

in the MTurk result, we observe that, for the 10-19 and 50-59 age groups, there exist a number of odd points.


The default transition is used to replace multiple transitions to the same destination state on the same input character.

for each transition with a priority 1, we produce a backward transition from its destination state to the start state.


The GPS receiver itself has some measurement errors that we needed to be cognizant of.

we have observed that in stationary conditions, the GPS receiver indicated an average speed of 0.3 mph with a variance of 1.3 mph (statistics of more than 15,000 samples).


Dependency Pro.ling: Macroscope s procedure of joining information creates rich data that enables the creation of pro.les for applications and their dependencies.

macroscope can label static dependencies by their usage frequency and traf.c volume (incoming/outgoing) but also .nd (temporal) relationships between static dependencies such as the causal ordering introduced in Section 2.


Furthermore, the network distances exhibit strong local non-Euclidean e.ect.

euclidean embedding is fairly good at estimating network distances between nodes that are far-away (in di.erent clusters), whereas it is rather poor at estimating local network distances (distance between nodes within a cluster).


In contrast, doubling the amount of sub.ows can signi.cantly increase the goodput of LIA (by more than 40%).

lIA can further improve throughput by establishing more sub.ows.


Thus, the packet energy/delay in such networks is dominated largely by contention at intermediate routers, resulting in a high router-to-link energy/delay ratio.

the gap between current state-of-the-art networks and the ideal interconnect, in which all nodes are connected by pair-wise dedicated wires, is quite large.


Since all devices remained connected to the same WiFi ad-hoc mode network during the whole experiment, there is no extra time spent on network association and IP acquisition.

data transfer can start with the start of the duration period.


The predominance of non-bursty links suggests that most of the links with intermediate loss rates in Figure 4 have more or less independent packet loss.

the links are not really alternating between up and down.


On short timescales, we advocate extremely extensible routing designs.

routing systems should support arbitrary (and possibly external) route computations, a .exible policy model, innovations in the kinds of services offered along paths (such as QoS, middlebox services, monitoring), multipath routing, and accommodate various peering technologies (i.e., not require a universal protocol is used to connect domains).


This work, in a way, represents the other side of the coin: the concept of anti-patterns [2] for visualization evaluation, where an anti-pattern is essentially a common and straightforward response to a recurring problem that is usually ine.cient, sometimes incorrect, and even at times highly counterproductive.

an anti-pattern is a good idea that turns out to not work.


shown that this scenario produces a traffic close to a real Intemet traffic.

the traffic is self similar at large and medium time scales and multifractal at small time scales (see [5] for details).


Previous algorithm selects particular sensors frequently more than others because the selection rule focuses only on the number of targets covered.

a sensor covering the maximum number of targets becomes responsible.


These results show that there is a strong relationshipbetween the distances to a particular .ow and the potential torecover the .ow.

the unknown .ows that an ob- CDF 0.4 server AS is most likely to recover are those that pass through 0.2 its direct neighbors.


All the .ve .elds are initialized at the source node.

sEQ and sArr keep unchanged after initialization, whereas pLen, bFlt and aMsr are updated at each intermediate hop.


CONCLUSIONS We considered randomly deployed sensor networks sampling a bandlimited .eld, and we analyzed their performance in terms of the MSE obtained on the reconstructed .eld.

by using asymptotic analysis, we studied the case of uniformly distributed sensors and then we focused on quasi-equally spaced sensor layouts.


6.5 Load-sensitive differentiation Given the strong evidence of traf.c differentiation performed by some large ISPs using packet content and routing information, we now investigate whether there exists other factors that may affect traf.c differentiation.

if ISPs intend to use differentiation to conserve limited resource in their networks, we should be able to observe a strong correlation between network load and traf.c differentiation.


A corresponding trend has also emerged in data center networks.

low-cost switches are common at the top of the rack, providing up to 48 ports at 1Gbps, at a price point under $2000 roughly the price of one data center server.


BH results seemed inconsistent and confusing.

the row 7 results seemed to provide a noticeable improvement in BH results for AAC 2.


In addition, Pt is a function of duty cycle t /T , and symmetric around the duty cycle of 50% at which the maximum Pt is obtained.

we have Pt(a) = Pt(1 - a) where a = t /T is the duty cycle of PWM.


However, we veri.ed our results across all traces and explicitly point out differences.

we use the 14 samples from WEEK to verify that there are no dominant day-of-week or other biases apparent in the 24 h traces (SEP, APR).


2 2 1.5 1.5 z (m) z (m)  ity of an RF-based virtual touch screen, which allows a user to input her commands to a desired computing device (e.g., an Android phone) by writing in the air.

we feed each reconstructed trajectory as a set of instructions to an Android phone and the instructions emulate a sequence of touch screen events.


This work presents and evaluates a pragmatic solution for providing high quality video conferencing over the existing best-e.ort Internet.

our aim is to reduce packet loss for long-distance video conferencing.


We now brie.y describe how we estimated the times taken by some of the tasks mentioned above.

we show how the processing and sending times for OSPF-TE packets were calculated.


However, this scalability doesn t come for free: our simulator does not model all the details of a realistic MAC protocol.

we consider (unless speci.ed otherwise) a simpli.ed MAC layer that models neither packet loss nor signal propagation.


Testbed results and simulation results using a validated simulation model are presented in Section 5 to illustrate the performance of the algorithms.

we evaluate the impact of di.erent sources of errors on the localization accuracy.


The bene.ts are the least ( 2.5×), when all users are mobile.

irrespective of mobility scenario, MOTA improves the spectral e.ciency of the collective spectrum pool of mobile operators.


Notice that as Cspawn increases, the shape of the tree, as captured by the unibit trie density, changes non-monotonically.

we see a peak in the number of unibit nodes per pre.x around Cspawn=0.1.


For example, taking into account that the increase of processor power is dominated by Moore s law, that is 2 times a 18 months, and the rate of traffic increase is about 2 or 3 times a year in these years , we can plot the graph that means the increase rate of processor power will not exceed the one of packets.

the ratio of the growth about processor and traffic will be more than several ten times.


In DTNs, the messages are disseminated according to the store-carry-and-forward principle.

the messages are stored and carried by the mobile devices and 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.


So, in general, we are not in a position to de.nitively establish which clients could have been a.ected by the server-side problem.

in view of this di.culty, we only look at how widespread the impact of server-side failure episodes is over the entire month-long period.3 for each server, S,we consider all the failures ascribed to it (i.e., to server-side failure episodes at S).


One immediate implication of this .nding is that one can not simply cluster all the spam from a large number of spamming sources that contain similar URLs and the delivery of which is .nished within a short period of time as a single spam campaign, as burstiness is not a de.nitive characteristic for many spam campaigns.

while burstiness plus distributedness may be a suf.cient condition for identifying a spam campaign, it is not a necessary condition.


We notice that when a high PDR link fails that the probability that other links also fail is low.

almost 85% of the other nodes are able to hear the packet.


In the .eld of cooperative localization however, most of the algorithmic investigations carried out so far still consider unrealistic and synthetic TOA-based ranging errors under pedestrian mobility [1], [8], [10], hence biasing somehow the performance assessment in practical operating conditions.

as far as we know, there does not exist any ranging-oriented parametric model that can really account for dynamic UWB intra-WBAN links.


Consider the problem of optimally edge coloring a bipartite multigraph [Ber73].

given a bipartite multigraph, the goal is to color the edges so that no two edges with a common endpoint share the same color.


In this case the APs must be interconnected not only among them but also to the server by means of a network switch with bandwidth greater than the aggregate throughput of the APs.

the switch port to which the server will be connected must not be a bottleneck for the packets it transmits.


(0,1), where 1 = i = K. Therefore as time goes to in.nity, for all the virtual probes with loss marks, the smallest queuing delay is mini.I Qi.

d =mini.I Qi by the de.nition of D in Theorem 1.


5.4 Effect of Different Hardware One of the hardware related questions is whether different hardware from different manufacturers are compatible.

how does using different APs, mobile devices, or wireless cards affect the accuracy?


To avoid this problem we should limit the number of unique tags, thus limiting the complexity at each node.

a budget of about 10, 000 CNFETs per node has been estimated in [13].


Note that in this cause, powering down the medium or large router for some time cannot alleviate these failures because up- stream routers or the advertisers will recreate the problem.

a downstream ISP cannot really eliminate the cascades by lo- cal actions such as power cycling equipment or installing filters (although installing filters can prevent the ca~scade from spread- ing downstream).


In this paper, we study the impact of concurrent downloads on the network.

we investigate the fairness between users who employ different downloading concurrency.


In networks with NC, a scheduling policy has to additionally decide whether and how NC should be used.

the policy imposes which nodes should use NC, and which packets should be encoded at these nodes.


Thus, the value for a transmission range r0 calculated with Equation (9) represents a lower bound for the radio transmission range that is needed to achieve a connected network.

the same statement can be made for networks with a certain minimum node degree, i.e., P (G is k connected) = P (dmin = k) (18) the implication (G is k connected) .


Secondly, when RT Swnd in the A-RTS algorithm exceeds a threshold (3 in our experiments), which indicates severe collisions, we disable the .rmware rate adaptation.

the .rmware is informed to .x the rate in the re-transmissions as speci.ed by the software rate adaptation module.


In addition, one may also think that a city where Wi-Fi AP density is adequately high does not need any such system devices can connect to the remote server through the AP and download packets directly from them.

the density needs to be such that the time taken to reach the next Wi-Fi AP must be less than the time over which the partially downloaded video can be played from the bu.er.


5(a) the message will as well be forwarded along the edge sv1 before it detects that the next traversed edge is intersecting with st in point p. At this edge, the message continues with exploration of the face which intersects with the remaining line segment pt.

in this example the message will continue with exploration of the outer face F1 by sending the message towards node v3 and keeping the right hand rule.


sIGF-1 uses mechanisms from SIGF-0, and likewise SIGF-2 uses some from SIGF-1.


The chosen forwarding topology should yield the maximum number of disjoint paths between the desired end points.

such topology should posses a maximum possible k-separation yielding the maximum number of disjoint paths between the two subsets of nodes connecting the cluster to the entire network according to Menger s theorem [25].


Second, the separation oracle that we will provide returns as violated constraint a constraint from this restricted set.

the size of the constraint is polynomial in n and rep(C) and does not depend on the input routing f.This implies that the size of the numbers (representation of the Ellipsoid produced in each iteration) remains polynomial.


The measured goodput is as large as 7.10Mbps, 65.12% higher than the goodput in the .rst scenario.

when an MF user downloads resources in IP networks, the reliable data transmission manner can help him experience good downloading e.ciency.


To this end, the hybrid node uses the best choice among the available technologies (Table 2) for every situation.

the rationale behind DRIVE s hybrid node is the well-known concept of Always Best Connected (ABC), i.e., always choose the best communication choice possible or available for the given service requirements and user preferences.


In particular, the mechanisms disenfranchise key stakeholders including end users and the mobile ISPs.

the current model unfairly imposes cost to these stakeholders without providing a .exible business model for them.


It can be considered as a special case of Differential Capacity Hando., where no AP-score weighting is performed(d = 0).

the smoothed link-quality estimator qi is usedjointly withhysteresis suchthathando.is invoked if qj(k)>qi(k)+ß.


Our goal is to quantify thee.ectiveness of such techniquesbased onthederivation of closed-form expressions.

we focus on the global delay taken for the random walk to deliver data packets from sensor to sink nodes and study its statistics through closed-form derivations.


Through prototypebased evaluation, we show that the RPB scheme is highly e.cient and practical for current generation of sensor nodes.

to support a sensor network with up to 216 nodes, establishing a pairwise key of 80 bits between any two 8-bit, 7.37-MHz MICA2 motes only requires about 0.13 second of CPU time, 0.33 KB RAM space, and 15 KB ROM space per node.


The bottom portion shows a box plot of the number of hours during which they must be active to be detected.

the thickline through the middle of each box indicates the median, the ends of each box demark the middle 50% of the distribution, and the whiskers indicate the minimum and maximum values.


Figure 6 shows the eigenvalue ratio at each measurement position for SP and DP, showing that the eigenvalue ratios of DP and SP peak at positions #1 and #5,  respectively.

eigenvalue ratios of DP are high at positions #1 #2 #7 and #14.


Table 2 illustrates a sample detector capability matrix for the different IDSes and vulnerability types.

each row in the table represents a speci.c intrusion detector type, and each column in the table addresses a speci.c vulnerability type.


average number of packets 8 10 6 10 4 10 2 10 0 10 -2 10 -4 10 flow ID Figure 2: Average Packets Per Flow Network Aggregation Flows Total FP Abilene Abilene Abilene Geant Geant ingress routers OD .ows input links ingress routers input links 11 132 187 23 77 955 749 937 421 491 557 382 398 110 172 Table 3: Classi.ed anomalies Finally, to give us further con.dence in our labeling of anomalies as true or false positives, we manually inspected the heavy-hitters for each of the four IP header features we studied.

we inspected the top-n source IP heavyhitters, destination IP heavy-hitters, etc.


At the same time, it acts as a cluster head for a number of sensors that are initially deployed on its partition.

the overall area is initially partitioned into p subareas.


Four of those 215 sensors are chosen as source nodes; however, we run nine di.erent simulations, each with a di.erent location for each source node.

every point drawn in the following graphs is based on observations of nine random source deployments.


The search of optimal MAC parameters uses an iterative procedure according to the component-based method [22].

the probabilities a, ß, and t are estimated periodically by each node.


Hence, the ENO-Max state is di.erent for nodes that belong to di.erent tiers.

sensor 1-B maximizes the performance (sensing rate) while maintaining an ENO state at a sensing period of 0.6.


Degree -The degree centrality dv of node v is de.ned as the ratio between the node degree, d(v), and the maximum node degree in the network: d(v) dv = · (1) max.v.V d(v) 2.

betweenness -The betweenness ßv of node v is the fraction of shortest paths connecting all pairs of nodes that pass through v.let s(j,k) represent the number of shortest paths between nodes j and k, and s(j,k)(v)the number of those paths that traverse node v.The betweenness of v is thus de.ned as: X s(j,k)(v) ßv = · (2) j s(j,k) =v=k.V 3.


If low stretch were not a goal, supporting .at names would be straightforward.

the routing system could resolve names into addresses using DNS, a consistent hashing database over a set of well-known nodes [14, 26, 34], or a DHT [15] and then route over addresses.


In order to simulate the mobility of the nodes, we work with the random waypoint mobility model and select an appropriate set of parameters for the mobility patterns of the hosts based on the semi speed (m/s) Figure 2: Stability for uniform speeds pause time (sec) Figure 3: Stability for mixed speeds nal work of [21] that study the behavior of the model and analyzes the problem of speed decay.

[21] shows that the model fails to provide a steady state in that the average nodal speed consistently decreases over time, providing unreliable and misleading results.


LIMITER DESIGN We are concerned with coordinating a set of topologically distributed limiters to enforce an aggregate traf.c limit while retaining the behavior of a centralized limiter.

a receiver should not be able to tell whether the rate limit is enforced at one or many locations simultaneously.


5.2 Protocol Speci.cation EBEAP needs to store additional data on each node u, as marked in bold in Figure 5.


They basically use both the information of mobile unit s (MU) physical position, which can be obtained by GPS (Global Positioning System) [8], and the information contained in a user pro.le to answer his needs at that moment.

different kinds of information services can be supplied, if we know where a person or object is at any time.


RELATED WORK We begin by noting that bit rate adaptation is a distinct problem from error recovery.

softRate operates with a variety of error recovery schemes, including advanced hybrid ARQ techniques that are more ef.cient than the retry entire frame method used in 802.11a/b/g today.


Most critically, observe that there are two nulls in the frequency response in which TCP throughput becomes zero.


3.1.2 Game Process In each slot t, player l chooses strategy sl,t according to the probability distribution pl,t(k),k 2 Sl.

the distribution pl,t(k) is calculated in each slot as follows: pl,t(k)= 1 ,t =1, (1) |Sl| 81 1 (1 -5) Ql,t-1(j, k)+ 5 6,k = j > pl,t(k)=  1 (2) >1 -P pl,t(h),k = j : h=6j,h2Sl  in the .rst slot (t =1), the probability of choosing any strategy k is uniformly distributed as in (1)4.


However, knowledge of fundamental properties of the underlying network can be helpful in making better forwarding decisions.

the aforementioned people-centric networks have been shown to follow power-law behavior [14, 4, 30].


Given this, we ensure that C is the same for all nodes that are part of a route.

we set PL to be equal to the maximum possible value of 20 dBm on all nodes of a route; for each run, CCAL is therefore set to be the same on all of the nodes on the route.


there are aN carriers in a system with N nodes.


In this figure radio range of every node is distinguished and the dotted line shows the relation between nodes.

the dotted lines between two special nodes show that they are located in each other radio range.


To craft search queries that request commands, Overbot makes use of a public-key model.

the botmaster owns a public-private key pair, and the public key of the botmaster is known to all compromised nodes.


The intuition behind our approach is as follows: since the total amount of available spectrum is limited, adapting to spatio-temporal variations in traf.c demand can be achieved by allocating wider channels to links with higher demand by taking spectrum away from links with less demand.

greater capacity is assigned to heavily utilized links, thereby bene.ting the .ows passing through them.


With the addition of the cache module, we can catch repeated updates to the same counter within a sliding window of C cycles.

if a new counter update request arrives for counter ci, we can lookup the cache to see if there is already a pending update request to this counter.


This paper clarifies the difference in MIMO propagation characteristics between dual and single polarized antennas using 18 fixed point field measurement data and continuous measurement data.

we show the relation between the MIMO capacity factor in terms of the ratio of the second eigenvalue of the channel matrix to the first and cross-polarization discrimination (XPD) for dual and single polarization.


N makes a valid request to receive from each node {C0,C1,...,Cn} = C .N such that Ci = CON.

equilibrium pro.les A surely yieldsomecongestion, andprovideastreaminglength which rangesfromtheoptimal(i.e.


To address the problem, we separate the optimization for the common (predicted) cases and the bound on the worst cases.

we propose a novel approach based on the notion of penalty envelope.


Here, DWiFi(t) is the number of packets that is completely transmitted through a WiFi network during time slot t,and DRenege(t) is the number of packets that renege during time slot t. Note that DWiFi(t) is given by 0, if Q(t)+ A(t)=0 or S(t)=0, DWiFi(t)= sup{k :k i=1 Li(t) = S(t)}, otherwise, where Li(t) (i =1, 2, ...,Q(t)+ A(t)) denotes the size of the ith packet in the WiFi queue at time t. Also, note that DRenege(t) = Q(t)+ A(t) - DWiFi(t).

reneging (if any) occurs among Q(t)+A(t)-DWiFi(t) number of packets in the WiFi queue.


To describe the dynamics of user subscription, we construct and analyze a dynamic model which speci.es how users form their beliefs and make decisions based on their beliefs.

we consider a discrete-time model with time periods indexed t =1, 2,.... At each period t, user k holds a belief or expectation on the QoS of NSP S2, denoted by g k(.2t ) where .t 2 is the fraction of subscribers at period t, and makes a subscription decision in a myopic way to maximize its expected utility in the current period.6 we specify that every user expects that the QoS in the current period is equal to that in the previous period.


The current implementation and developed test-beds provide a solid base for further research and development.

the logic for deciding when and where to migrate services to needs to be realized.