The easiest way to overcome this problem is to use only the FACH for the delivery of the MBMS service (DCHs will never be deployed); however, since Node B will have high losses of power (specifically when the number of users is small), this way is immediately rejected.

the determination of the appropriate switching points seems to be a one way road.


The proposed method inserts pilot bits into the coded bits before constellation mapping and signal rotation.

the rotated pilot symbols, which shall be referred to as a SSD-pilot, can be considered as a superimposed training sequence.


Whenever CAC accepts an arrival call (new or handoff), the system attempts to allocate maximum bandwidth (bn) for this call.

if the available bandwidth is larger than or equal to brequested, the arrival call will be assigned a bandwidth between brequested and bn.


The rtPS connections do not experience packet drops during a simulation run.

the scheduler at the BS allocates the su.cient number of slots based on the QoS requirements and the request sizes.


E the set of links incident on the radio we attempt to turn o. and formulate an LP (TurnOffRadio-LP, .g.

3) to minimize the sum of the .ows on the links in L. if the value of the objective of the obtained solution is zero, we can actually turn o. the radio.


(t(ei)= ' d(ei)) holds, the weights of these edges ei in H are the same as their weights w(ei)in H (by givingin.nite weights to edge not in H).

for every node u in H ' , the following two facts hold: (1) the distance d ' (u) from u to s in H ' is the same as the distance d(u) from u to s in H, and(2) the time t ' (u)at which node u receives the message from s inthe.oodingprotocol restricted totheedgesof H ' is the same as the time t ' (u) at which node u receives the message from s in S. As a consequence, t ' (u)= d ' (u) for every node in H ' .


In this case the MSE criterion is given by E = EVp u + HTc u - Qf u 2(18) where Qf contains the phase-corrected correlation elements.

f [Q ]m,r = .m,r fm,r (19) The precoding matrix at CBS is then given by Tc,IRLP = HH (HHH )-1(Qf - Vp) (20) the received signals vector at primary and cognitive users is given by Qf u y = v + n (21) ßIRLP The average transmitted power normalization factor ßIRLP is given by HH ßIRLP = tr(Tc,IRLP Tc,IRLP ) + tr(Tp Tp ) (22)  5.


Also, the target environments where the devices are placed could be so complicated that changing the batteries for the devices becomes di.cult or impossible.

how to e.ciently consume the energy of the devices with a small power supply is critical to the Zigbee applications.


digital libraries will in.uence CSCW infrastructures in a larger way.

mobile infrastructures will have to take the usage and provision of external (also web-based) services into consideration.


That is, once it .nds some coordinates that bring its queries to the current home node (even though they may not be exactly the same coordinates produced using the parameter s in the hash function), the attacker already knows a quite close position to the exact coordinates.

when the home node runs out of battery and the next closest node to the hash output coordinates becomes the home node, the attacker will need very few queries to .nd the new home node.


As our results show, the number of initial seeds is of little importance, as the performance is relatively stable across a wide range of initial seeds.

we do not require an extensive network of well-placed content servers as in a CDN, although such a network could be used.


From a privacy perspective, this is much more problematic than sending reports on single traversed road segments to varying peers.

special care should be taken to protect the privacy of users in such a system.


Sensors are generally battery-powered; and the batteries are either irreplaceable, or their charging rate is limited.

to extend the operational time of sensor networks, providing reliable data delivery must come at the minimal possible energy consumption.


As discussed above, we chose to cast a wider net by setting these timeouts to the relatively high value of 5 seconds.

we discovered more APs than we would have with a lower timeout, at the cost of increased time per scan.


This selection depends on the envisaged reliability degree of the monitored area.

nodes that are for a long time in the sensoronly state will be selected to switch to sleep state, and vice versa.


The goal of each node v is to obtain good estimates ni(v)of these sizes, while the initial information a node has is only the number of nodes n, and the budget K allowed for covering.


We have also included C r * = Smin/dj-1,j which estimates reverse capacity using Smin (insteadof Smax).

c r * sCDF isjusta leftshiftof C r s, and it actually measures Cf .


How many companies are going to want to pay for Windows Mobile when they can get Linux, Android, or Symbian for free?

if Microsoft maintains its strategy, the probability that Windows Mobile statistically falls in the background of Android or iPhone OS is high.


For example, it outperforms those under Ground Truth and Disco with maximal gains of 25.6% and 13.2%, respectively, but has a worse performance than Oracle.

we conclude that with Acc-Disco, a navigation scheme can more quickly guide the taxi to a direction with a high density of served passengers.


Speci.cally, since wireless signals are electromagnetic waves that propagate at the speed of light (c m/sec), a human moving at aspeed of v m/sec, results in a maximum Doppler shift of 2c f v,where f is the frequency of the wireless transmission [3].

a 0.5 m/sec gesture results in a 17 Hz Doppler shift on a 5 GHz Wi-Fi transmission.


Due to inter-dependence of all BS decisions, this information cannot be made available to all BSs at the same time.

in our formulation, the next likely con.guration of each base station is computed and propagated to its neighbors.


This starts a new line segment at tk-1 + 1, where .+ (.t) is dominated by .+ (.t).

wG LG tk-1 + 1 is a candidate for this linear segment.


Note that due to the high gain, the beamwidth for this antenna on the vertical plane is relatively small (about 9.).

assuming that the APs are deployed at the height of poletops, this antenna is likely to connect better to a distant AP relative to a very close AP.


Average Residual Energy (Re): RACC considers node energy before caching decision making.

the probability of having a dead node in the network during the simulation time is small.


ability to support various business models, the authentication and veri.cation of rights expressions, extensibility, con.guration permissions that allow content to be added or removed from repositories, just to name a few.

the range of functionality is extensive.


We can account for it in two different ways ns updates the queue at every packet arrival.

we can choose Ævto be 1/bv, where bvis the instantaneous arrival rate at a queue measured in packets.


The scenario can be modeled as a system with one queue and two servers where one of the servers is faster than the other.

in a parallel search of the two tables, the result of PIT search will be available earlier than the result of FIB search.


The main goal of graph partitioning is to divide a graph into a set of sub-graphs such that each sub-graph has roughly the same number of nodes and the sum of all edges that connect di.erent sub-graphs is minimized.

graph partitioning is useful to distribute the problem into a set of partially independent sub-problems especially when dealing with large problems.


Also, the number ofseedsin the systemis typically a(small) fraction of the system population.

for most scenarios ofinterest,(x+2y)U « (x+y)4D, which makes .


However, to resist against time varying misbehaviors, intermittent link availability, network congestion and most importantly misbehaving nodes when they comprise a considerable percentage of the network members and compromise most of the paths, a closed loop feedback system is proposed to react to these behaviors based on Path State Information (PSI) concept.

our proposed mechanism is able to tune itself for the best performance in each situation.


The reason is that, in rare cases, the traf.c envelope is not monotonically increasing.

the chance is slim when switching off some BSes that are already on for a short time and again turning them on later.


its route collectors obtain only the routes announced by the customers of its BGP feeders.

it is likely that almost every connection found byPCH representsap2c(c2p) economicagreement.


the received complex sample y[n] is the sum of two complex numbers u and v.The length of the .rst complex number is A and the length of second is B.There are exactly two pairs of such complex numbers (u, v) that sum up to y[n].


More importantly, the fact that the interception signature used here can also result from valid scenarios in the Internet implies that we have to rely on the pre.x owners for conclusive evidence of interception.

for the remaining anomalies, we conducted an e-mail survey asking the pre.x owner if they had a peering relation with the next-hop AS suspected of interception.


TCP s use of cumulative acknowledgements de.nes the message ACK-N to indicate that all segments 1, · · · , N have been received.

receipt of duplicate ACKs is used to infer loss.


Overall, our results indicate two key observations: (1) Channel hopping de-correlates packet losses both across time and frequency domain, thus reducing the number of consecutive packet losses compared to the corresponding individual channels.

in single-hop communication, or on .xed topologies where adaptive routing is not an option (such as preplanned WirelessHART deployments) frequency diversity can yield signi.cant reliability improvements.


A problem that may arise here is that two packets from di.erent WANETs destined to other WANETs may well collide in this downlink at some or all repeater nodes.

we need to run an appropriate MAC protocol between the repeater nodes as well.


Brie.y, in our proposed system, peers who contribute more upload capacity view fewer advertisements than peers who contribute less upload resources.

unlike in layered coding/MDC based schemes, low capacity peers can still enjoy good video quality but with more advertisements than higher capacity peers.


The performance of fOFDM compares with FBMC only in the case of 10 nodes, as in this case, the amount of tra.c is relatively low and as a consequence, the e.ect of mutual interference among di.erent nodes is minimum even with fOFDM.

when there are more nodes, FBMC will enable upper layer applications to exchange data at a very high rate.


The trustworthiness associated with a pair (t, c) is de.ned as q (t-1)2 (c-1)2 + 2 2 xy T (t, c) 6 1 - q , (3) 1 1 + 2 2 xy where x and y are parameters that determine the relative importance of the trust value t vs. the con.dence value c. The default value of trustworthiness is de.ned as Tdef 6 T (0.5, 0), which represents the trustworthiness value assigned to a node when its assigned trust and con.dence values are t = 0.5and c = 0, respectively.

the value Tdef represents ignorance about the trustworthiness of a node.


Ai = f Bl Bi i=1 l=1 K N v Ai pi × li i=1 i=1 =.

f = v = v K K l=1 Bl l=1 Bl MCAED is minimized when J v v N j=1 pj × lj Ai = Bi × f = Bi × v K Bll=1 and N v * K i=1 pi × li 2 MCAED = × ( K v ) 2 l=1 Bl D  According to Theorem 1, MCAED is optimized only when vAi the instances of each item are equally spaced and is a Bi constant f. Obviously, these two conditions cannot always be satis.ed.


This is not astonishing because the microcontroller of the Mica2 has to do a lot of the processing itself since the radio chip is byte oriented.

the microcontroller has to search for the start of the message itself and has to spend a considerable amount of processing power, which in turn results in a higher round trip time.


Obviously,it wouldbe veryexpensiveforthe carriertoprovisioninlieu of allpossible usage scenarios.

they need toforecastdemand and carefully managethepool ofGRIPhoN resources.


To simplify the analysis, we consider the spirit of the mean-.eld approximation [4] -the aggregate behavior of the network as seen by a single user is replaced by the mean behavior.

we use the conditional expectation of the System Time given the Backo.


In order to use an ID-based asymmetric cryptography such as a public key infrastructure (PKI) certi.cate, a host should know the destination in advance, which isincontradiction tohost-obliviouscontent-basednetworks.

this paper focuses on the method of using common security materials.


By studying the properties of the K1,k-matching, the outage probability of each user is given by () dk dk pout = ps + O ps , (7) lJ L+1 where dk = L - k +1 for k =1,...,M+1 ,and dk = M(L- kM + 1) otherwise.

the optimal DMT is a piece-wised linear function by connecting (1 - r/k) dk.


In essence, if the clique is large enough, then it is worthy for type-B players to establish a direct link to the clique, compensating a type-A player, and follow this move by disconnecting from the star.

monetary transfers increase the .uidity of the system, enabling players to escape from an unfortunate position.


Our interest was in differences in performance between the two calculations, such as in the IR.

we were interested in how the prediction contributes to performance improvement by calculating the best longcut route.


We disable retries so that every packet is transmitted exactly once.

there is no exponentially increasing backoff delays between transmissions.


Detecting and blacklisting the bots that send spam is di.cult since they lack the following three characteristics: (1) invariant spamming features, (2) signi.cant bot activity features, and (3) .xed sources and contents.

it is di.cult to characterize spamming botnet behavior in a straightforward way.


The sender precomputes group keys and then generates their components in real time.

adopting DELTA does not require from a protocol to change its transmission pattern.


(the packet s turn may end up even further in the future if higher priority packets arrive while it is waiting in the queue.)

apacket can safely bedropped as long as the ratecontrol is aggressive and ensures that it retransmits the packet (or sends a different packet from that .ow) before all the existing packets depart the switch.


Each ongoing transmission passes a token to another host who will then have a higher priority to transmit after the ongoing transmission completes.

the token-passing mechanism schedules transmissions without having to perform random access.


v) can be c active at the same time as u .


Where autonomous system boundaries are crossed, Service Nodes from the other autonomous system provide the IP address of their Service Con  troller.

connectivity between neighboring autonomous systems can be established in the control plane.


iterator) over the .ows set, which is physically represented by giant two-dimensional arrays1, with one row per each .ow2 .

when the agents iterate over the Flows, they actually use a single Flow instance for all .ows in the set, greatly reducing the object creation/destruction overhead, while maintaining the same programmatic interface as with individual object instances.


Running the net.ow dataset on the model will be impractical.

afasterversionofthe POWER modelwas developedto handlethelarge wireless dataina timelyfashion[2].


In the Sleep state, the Wi-Fi interface of the SoftAP is turned to sleep to save power.

the SoftAP cannot receive any packets over Wi-Fi.


Instead of removing and adding a vehicle during a transition from one tra.c simulator to another, the transition is communicated as a movement update to the non-tra.c simulator federates.

as introduced in Section 3.1, no vehicle change is noticeable for the non-tra.c simulators.


Each sub-scheduler has to .nd the eligible entry for the processed packet in each microslot, which is a non-trivial task.

we present a simple combinatorial circuit design for the processing component (COMP), and show that it only  Fig.


Yet, if its current share exceeds z, it will be detected with high probability .

if zf <z,then E[Nv ] <dk.with high probability, Nv <dk.


The second type of applications helps drivers and passengers to localize services, get accurate weather or road condition information, get entertainment access, or even interact with surrounding services.

a secure service discovery and communication protocol is mandatory in order to prevent from many attacks and malicious processes in the vehicular system.


We start by assuming that pm = 0 and establish The .rst derivative test can be used to establish that a contradiction to the equilibrium requirement xi = when sm = 1, the objective is monotonically decreas i 1-xi 1 ing in x1 over the range listed in the case assumption.

.sm nxi the objective is minimized when x1 = 1 , If pm =0, xi = 1.


The eavesdropper will experience a SNR of SN Rmin - I C .

as see from Figure 2 in Section 3, I C > 5dB will ensure that the eavesdropper cannot receive the packet since message success rate will drop to almost 0%.


Looking at results such as power, CPU utilization, and bus transactions in isolation without considering how much performance is achieved with them does not give us an accurate picture of how e.cient the di.erent communication protocols are.

we have calculated the BPE (bytes per unit energy) numbers for the tests and shown them in Figures 9 and 10.


This increasing collision rate is very harmful for system performance and may yield low throughput and large packet delays.

in order to avoid the severe performance degradation under high traffic load, flow reservation and admission control become critical.


Some of the different IP addresses could actually be related and represent the same Storm bot, due to dynamic IP block aliasing and DHCP changes.

counting the total number of IP addresses as the total number of bots in Storm is a gross overestimate.


However, a mapping with a very large uncertainty level is not useful for making forwarding decisions.

we use a limit on the radius of the GeoRegion portion of the mapping.


Then in order to .nd the interface where the packet should leave the node, the node performs lookup from the top layer down, encapsulating the packet along the way.

the data plane in the infrastructure node should provide hierarchical forwarding tables and packet lookup, as well as packet encapsulation and decapsulation.


In this section, wewill study thepotentials for load balancing when the level of asymmetry is even higher.

in addition to the topology set in Section 5.1, we generated two even more asymmetric topology sets, utilizing the same procedure.


Meanwhile, the singular values a.ect the capacity through the SINR in the sub-channel.

the combined channel matrix not only facilitates esti 5In general, customization also includes the ability of a virtual network to adjust itself to meet the need for multi-class tra.c as well as adaptation to a variant environment with multiple SPs.


Therefore, the assertion that a new message is computed according to the protocol is an NP-statement (and the party sending the message knows an adequate NP-witness to it).

the parties can use zero-knowledge proofs to show that their steps are indeed according to the protocol speci.cation.


Algorithm 2 Sending rate adaptation mechanisms OpenConnection(flowi) if flowi.Rate == 0 and flowi.T ype == deadline then CloseConnection(flowi) end if while IsOpenConnection(flowj ) do if flowi.T ype == elastic then if NeedtoincreaseTCP CWND then if Bytes sent within T < flowi.Rate then T CWND ++ end if end if else if Bytes sent within T = flowi.Rate then T Queue packet else Send P acket end if end if end while  4.3 Evaluation In reality, given the high network loads and as a result the number of .ows each forwarder must handle per unit time, .ow allocation must be ef.ciently computed.

we have evaluated the performance (duration in microseconds) of Algorithm 1 (for a single switch) on an old 700MHz computer.


For example, Deluge can notify the isolation layer of the collision vulnerable period of data bursts, and the isolation layer can suppress MintRoute s control packets accordingly, avoiding loss of the control packets.

the goal of this mechanism is to: Minimize the effect of concurrently running protocols on the packet delivery ratio observed by any given protocol.


2.1 Deferred Malicious URLs We measured whether shortening services retroactively analyze malicious URLs, that is, we determined if these services perform any repeated veri.cation of the safety of the long URLs to which their existing short URLs point to.

we set up a web page that served benign HTML content for a period of three days; this page s URL contained 32 random characters to ensure that no legitimate users accidentally stumbled upon the URL.


Message passing times for the best performing run are all small, even for communicators with large hop counts.

there doesn t seem to be a consistent correlation between hop counts and messaging performance.


Thus, the network cannot achieve overall connectivity and messages may not be able to reach the destination if it resides in the different component with the source.

we need to introduce mobility of nodes into the network as mobile nodes which have been informed the information may meet the source even if they are within different componentsinitially.


Each trie node reference requires at least a memory access which may decrease the lookup performance.

most of the software IP-address lookup algorithms use a modi.ed trie data structure.


This total transmit power is inferior or equal to Pmax as Nb d N. The point is to allocate the residual power to users who still didn t achieve their data rates while avoiding an increase of the CCI level.

the residual power is only allocated to far users, whereas power transmitted to near users is kept at the same level.


We establish a correspondencebetween thetwo networks N and N ' as follows: Let Aj(t) denote the number of arrivals of .ow j, j=1,2,...,J, occurring at node sj in time slot t. Let .j(t) denote the number of packets departing from the external bu.er for .ow j, in time slot t. By construction, .j(t) =0 for t =.ks, for some integer k and Ps .j(t)= i=1 Aj((k-1)s+i)fort = ks.The arrival process to N ' is denoted by A ' j(t)and is de.ned as A ' j(t)=.j(st).

the arrival rate to network N ' is ss1 .


Secondly, due to intermittent links and multi-path routing, the congested node may not have all of the data from a source.

summarization may be inaccurate or impossible.


Typical wireless transmissions have orders of magnitude higher bandwidth (20 MHz for Wi-Fi).

for gesture recognition, we need to detect Doppler shifts of a few Hertz from the 20 MHz Wi-Fi signal.


For multicast .ows, TransCom s integrated .ssion+fusion allows multi-tree distribution wherein fusion creates individual trees and .ssion .sses trees into multiple trees.

even though we speak of .ssion and fusion as the two primitive transformations, in practical terms, the transfor- Figure 2: Program view and network view of fusion Table 2: ILP formulation for fusion+.ssion Constraints C1 .i, .j, .v = si,v /.


By dividing {rj } into sample groups of size ., we ensure that a stage arrives only at the boundaries of each sample group.


This port is picked at random at the installation of the client, and remains the same in subsequent utilizations.

we can associate each IP/port pair to a single BitTorrent user [19].


The time-interval reserved by device i may not exactly overlap with the time-interval as seen by device j due to clock skew between device i and device j.

device j may see some portion of the time-interval scheduled by device i as unscheduled.


-0.64 -0.52 -0.62 -0.87  -0.94 -0.47 -0.79 -0.75 (c) IM in a medium-congested environment -0.80 -0.97   (d) IM in a low-congested environment Figure 3: Dynamic Interference Map mand depends largely on F3 and vice versa.

only the throughputs of theirs appear to have the interference patterns that VOID looks for.


In today s hardware, the ratiobetweenidleand maximumpowerishigh(e.g., 0.8 [3]).

a vast majority of the achieved percentage of sleeping links would materialize as real energy savings.


Their CTB messages will collide so that the sender cannot decode the CTB messages.

the sender should retransmit the RTB message in order to select only one relay vehicle.


We note that state promotion delay decreases for larger DCH.FACH RRC timeouts.

mobile network operators can increase the values of RRC inactivity timeouts at cell sectors with with dominant web browsing tra.c to improve users web browsing experience.


This contradicts the assumption that C1 and C2 are minimal.

figure 6: Minimal cycle we propose a distributed algorithm that determines, .rst, all minimum polygonal cycles for the sensor .eld using the irregular graph and then, detects only the internal holes from the polygonal cycles found above taking into account the radio irregularity in WSN.


In addition, to get a more accurate delay estimation of forwarding packets along each road, we let the static nodes measure the packet forwarding delay in real time.

the routing decision in each static node can adapt to changing vehicle densities on the roads.


Dij - y j=1 where k is the number of neighbors used.

our measure for strangeness is the ratio of the sum of the k nearest distances from the same class to the sum of the k nearest distances from all other classes.


Moreover, after the rate reduction, the link usage should not decay too much.

f2(BO) is aimed to adjust the tid while Counter decreases.


Another signi.cant characteristic of Geosphere is that since it and all leading practical sphere decoders (including ETH-SD) use the Schnorr-Euchner enumeration (§6), the number of visited nodes is the same for all of them.

geosphere maintains the processing throughput of hardware architectures that process one node per clock cycle [10].


Wireless nodes, especially sensors, tend to use small batteries for energy supply that are in many instances non-replenishable.

energy conservation is a vital factor in prolonging network lifetime.


De.nition 4 (Path assignment) A path assignment for the routing system (N, .1 ,..., .N , F1 ,..., FN ) is a vector of paths P = (P1 ,...,PN ) such that, for all i, Pi EFi.

a path assignment is an assignment of a feasible path to each node i, where feasibility is determined by the set of paths Fi.


Further, let and p be the steady-state probabilities of states pSPCF wPCF succeed and wait respectively during the PCF-based operation of a channel.


Due to the spatial reuse constraint of the wireless channel in IEEE 802.11 multihop wireless networks, neighboring nodes cannot transmit simultaneously.

packet bursts result in increased contention on the wireless channel.


This pipeline would close if no valid data is returned during PIT entry s lifetime.

resources can be recycled, which potentially defends the attack to routers by sending massive amounts of Set.


Desync-TDMA, however, allows for variable-sized slots.

larger-sized slots can be given to nodes in less-dense areas of the graph.


[2] The Service domain concentrates on the most crucial aspect of a service: the customer value of the service.

the domain analyzes the value proposition of the service and compares the service to existing similar services or previous versions of the service.


Their performance may be in.uenced by the power-law decay of inter contact times between mobile nodes [15], [4] or the distance e.ect [5].

the long-run trends inherited in the mobility, such as spatial features, are di.cult to capture from a short-scale temporal view.


Hence an increase in the exclusion radius improves the second term of Csum,out (or Cout ) while decreasing the .rst term of Csum,out .

there exists an optimum exclusion radius that maximizes the sum outage-capacity of the network.


Compared to handheld devices, laptops are less affected by the ping-pong effect.

the long lag is partly due to laptops being less affected by the ping-pong effect.


To maximize this payment, node i has incentives to keep the loss probability as low as possible.

node i does not have incentives to carry out the .rst type of cheating.


Thus, receivers could not decide which key to use for decrypting the payload since they cannot read either the contained command frame identi.er or short address.

when using broadcast encryption, this data is put within the Key Identi.er .eld, which remains unencrypted.


After this, further received packets are non-innovative, but have no impact on delay.

decoding delay is only marginally above 100, the minimum number of time units each node needs to receive the 100 packets.


After cluster formation, the base station is aware of clustering decisions.

whenever a packet is destined to a cluster member, the base station simply sends it to the cluster head, which maximizes the throughput at that epoch.


[11] obtained similar results with an asymptotic approach.

even if we take into account protocol details, the result keeps on holding: using a larger number of interfaces is always bene.cial.


each node now has two FEV values and one can form a system of equations based on Equation 23 to solve: 0 Var(d k/ j)= f 2 · s2 k + .


Since each bit of the key can be 1 or 0 with the same probability, the probability for correctly guessing the key in one attempt is 21 L , and the computational complexity for .nd ing out the key is O(2L).

as long as the size of a key is large enough (e.g., 80 bits), the time complexity is prohibitively high.


Malicious users can create many identities but few trust relationships.

there is a disproportionatelysmall ¸T in the graph between the Sybil nodes and the Scut.honest nodes, which obviously bounds the number of vertexdisjoint paths.


The GSM voice channel already provides excellent voice compression algorithms.

if we connect the Talking Book headset port to the phone headset port, we can directly record the audio from the GSM channel.


Whenever a data .ow is initiated with the phone, the traf.c volume is recorded at the CN when data traverse the CN to reach the phone/server.

the CN performs accounting operations based on its observed traf.c volume.


Observe that, if x located in a ball of radius 2/3 concentric with B satis.es (1) and (2), then (3) is satis.ed for x as well.

the idea of our proof is to start looking for x satisfying (1) (3) in B, as de.ned above (see Fig.


is a control parameter that captures the desired separation from the in.uence of dense measurement noise sD.


According to Observation 3.6, if vI is the parent of vJ then l(pI ) = l(pJ )/r.

the depth of T ' is at most logr L and the size of T ' is at 1 r(L) most 2log= Llog(r) .


Also, within an IP Di.serv-based network, the QoS o.ered is per packet-class.

qoS provisioning for IP networks remains a challenge.


The latter is neglected in many network visualisators since the TCP/IP protocol suite is assumed to be the standard.

we have designed the ANA Browser to provide a functional visualisation of the network.


It is also well known that .nding a maximum weighted independent set in Error rate 0.5 0.4 0.3 chordal graph is linear [12].

our later algorithm .nds its estimation of the number of birds in linear time given G2+.


have reported that most available wireless links exhibit signi.cant link layer loss rates.

besides de.ning a minimum number of XOR packets (to be transmitted by the relay), another effective way to improve network throughput is to reduce packet loss rate and hence the number of packet retransmissions.


The MAP receives packets from end stations and then forwards these packets to other MPs through a wireless medium [15].

the packets sent by the end stations are transferred to the wired network through the MPP.


* scales approximately as M v 0 0.5 1 1.5 2 2.5 3 4( M - 1)2 .

even if the cells are subject to more Distance interference in 2D, the maximal tra.c density scales as four times the number of used frequency channels.


=8 Figure 5: Throughput comparison for different positions and user terminal density in the grid topology Following the analysis above, the degree of performance improvement is position dependent.

we .rst investigate throughput improvement in different positions.


It is only updated when there is change in channel coe.cients.

the received symbol vector at primary and cognitive users is expressed as u y = v + n (10) ßZF  4.


Examples of such applications are probabilistic reliable dissemination of data and events [5, 11, 21], peer sampling services [20], location services and uniform quorums [19], random overlay constructions [25], DHTs [29], etc.

it makes sense to offer an optimized membership service that indeed only provides nodes with partial random views.


The di.culty with variablelength .elds is that protocols can use di.erent elements to mark the .eldboundary such as1) direction .elds, that store information about the location of another target .eld in the message,forexamplelength .eldsandpointer .elds,and2) separators, i.e., constant values that mark the boundary of the .eld.

we .rst need to locate those elements to identify the .eld boundaries.


The next step in the bootstrap process is to discover and interact with other NetS core peers reachable via the available networks.

for everyFB x providingnetworkingfunctionality, the coreNetSfunctionalblock will execute the two following commands : resolve(x, "*", "net share", r) : where x is tobe subsequently replaced by the IDP labels of the previously discovered FBs.


We assume that each new nodejoins withdegree m, hence the mean number of nodes ofdegree k thatgains an edgefrom theincoming node and moves to degree k +1 can be expressed as djo = k.(k+1) m × Ak = mkpk .

the net change in the number zf of k degree nodesduetojoining of a new node jo jo jo m((k - 1)pk-1 - kpk) d= d- d= (3) k (k-1).kk.


In contrast, a node in public key cryptography requires just one pair of public/private keys for itself and one public key for each node with which it wants to communicate, making key distribution relatively simple.

we .nd it more appropriate to use public key cryptography in a MANET environment.


A also establishes a shared secret with the sensor node by appending another new key KA,D, which it also encrypts using iKD.

after receiving A s answer, D shares a secret with its gateway access point B and the application A.


A node waits for a DIFS before transmitting an RTS, but waits for a SIFS before sending a CTS or an ACK.

an ACK packet will win the channel when contending with RTS or DATA packets because the SIFS duration is smaller than a DIFS.


Frequency Offset: To avoid inter-carrier interference, concurrent transmitters shouldhavethe same carrierfrequency offset(CFO) with respect to every receiver.

n+ s senders compensate for theirfrequency offsetin a manner similartothat usedin[28,30].


Each grey node must have at least one black neighbor, so if coloring any grey node black, B will not be disjoint anymore.


transmission in one link can interfere with the other), an edge will be created in the channel-s conflict graph between the two vertices representing those links.

the degree (number of edges) of a vertex in the conflict graph for channel-s represents the amount of interference, which the corresponding channel-s link in the network is expected to experience.


As the transmitter requires only beamforming vectors to operate, it is not necessary to transmit more feedback than that required to inform the transmitter of the beamforming vectors.

it is easier to consider the time-varying channel at the receiver side than at the transmitter side, as then it is possible to enjoy the stationary property of the channel at the receiver.


This is no clearly di.erent than the signature {P1,P3} which reveals a speci.c pair.

it naturally gives rise to second order non-strict preferences which concern collections of sets of paths.


It is well-known that a graph with maximum degree e can be vertex-colored6 with at most e + 1 colors [30].

the graph can be vertex-colored with some O (na(n)) colors, i.e., at most k1na(n) colors for some constant k1.


From (3) and (2), we have w,(e)- Z > 0 (4) e6p I eEp Based on (2) and (4), we know that the right-hand side and the left-hand side of the inequality (3) are positive.

it can be implied that e6Io I e6p e~p e6p t from which we conclude that  + w (e) > rw,(e) + w (e) eEp t eEp This, in turn, implies that p' will not be selected by the algorithm, which concludes the proof.


Clearly, 512port AWGR based optical switch is feasible based on those enabling technologies.

we assume a single stage DOS can scale to 512 ports in this paper and we also assume the number of wavelengths used for DOS is equal or larger than the fabric port count.


When RTTs over paths available to a user are di.erent, satisfying goals 1 and 2 of the RFC [10] can lead to sending tra.c on paths that are not the least congested but have a small round trip times.

using a TCP-compatible algorithm, it is not possible to avoid problems P1 and P2 in all possible settings.


Intuitively, to guarantee that the .nal decision aggregation at the sink node is legal, each decision arriving at the sink should have a weight smaller than or equal to W =ldWT J (where WT denotes the total weight of all the sensor nodes on the aggregation tree).

at any nonleaf node except the sink, the summation of the weights of all the input decisions involved in any aggregation must not exceed W .


INTRODUCTION Delay Tolerant Networks (DTN) are a type of challenged networks, wherein the contacts between the communicating devices are intermittent.

an end-to-end path between the source and destination rarely exists.


Obviously, the success probability of A in .nding such HPA depends on the size of W * .

this is precisely the point in our security analysis of BBMA where human skills to distinguish the authenticators become important.


If there are n network entities, and we want to be robust to up to k of them () k failing, FFC has to deal withn failure cases.

naive, j=1 j enumeration-based approaches are computationally intractable for large networks.


Each node broadcasts to its neighbors this estimate and its closeness value (but not its samples).

the communication cost drops signi.cantly.


For an underwater acoustic channel, its average path loss is given by A(d, f)=daß(f)d , (2) where d is the distance of the acoustic channel; a is the spreading factor (1= a = 2); and ß(f)is the absorption coef.cient which is determined by the frequency of the acoustic channel f. In this paper, we assume that all nodes work in the same frequency band.


* must be zero for paths with positive flow; paths i with no flow can be ignored as they clearly have zero delay.

replacing (10) in (11) results in the following relationship between the end-to-end delay on each path, and the source s utility at its optimal rate * ss *  ' .TR = wf ( x ) ß , s .


Once a user s message is successfully recovered, this user s impact on the relative colliding packets will be eliminated and the corresponding packets may become to be non-colliding packets which can be utilized to fasten the speed of recovering other user s messages.

rMA is e.cient and has the ability of automatic code-rate adaption.


SOFT s combining algorithm works the same whether the s-packets are the result of overhearing at multiple APs or retransmissions at a single wireless receiver.

we use the uplink experiments to explore the various aspects of SOFT and its combining strategy and revert to the downlink experiments to investigate retransmissions under SOFT.


success } =1 - PR(1,t)(8),t = h. Since the values of PR(h,t)(r) are already given at this stage of the analysis, (15) represents a homogeneous Markov chain.

standard techniques can be applied to compute its absorption probabilities.


It is relevant for network operators as JP will be deployed mainly in areas with high tra.c demand due to economical reasons.

di.erentarchitectures mightbebetter suited for certaindeployment scenariosdue totheshapeoftheircoveragearea, e.g.,becausethey matchtheshapeof acity center.


Those relays operate under guidance of the provider controlled Base Station (BS) in licensed spectrum.

iEEE 802.16j does not de.ne solution or extension of the baseline document for WMNs.


without guarantees on the quality of the connections.

there are also no guarantees for the quality of the so-called Over-The-Top (OTT) services that are delivered over the Internet connection.


Di.erent applications may require the fault detection to be conducted in a real-time mode with low latency or high throughput.

a localized and distributed generic algorithm for each node is highly preferred in wireless sensor networks.


It is time consuming, costlyandhard to exploretheCCparameter spaceinalarge scale cluster.


In Linux, the Linux kernel, the tra.c control (TC) subsystem is located exactly at this place.

it is appropriate for us to implement DFMS as a part of the TC subsystem.


This implies thatiftheroot does not receive a topology update from a particular node within timeout, the root removes that node from the tree and .ushes it s network state.

the usage of topology updates at the root is two-fold: (1) periodically refresh the routing state ofthenode(2)periodically refreshthe neighborhood information of the node for the network and the interference graph data structures.


The comparison is in fact to check if two numerical attributes are within a small interval [a, b].

using machine representable intervals to store network stream data is a natural choice.


Note that the partition is done on-line according to the lengths of P and Q, so each cell in the array must be able to read the data from the primary inputs directly, and be able to propagate the data to the primary outputs directly to .nish the .nial step of the modular multiplication.

we use some switches, MUXes, and a control signal to achieve the goals.


Networking them together raises new challenges in communication protocols because the current network protocol stack is neither de.ned for low capacity entities nor lossy links.

the network research community has de.ned new MAC and routing protocols that comply with the characteristics of WSN.


Considering the inhomogeneous walking pattern of pedestrians (different speeds, sudden velocity changes), the upper bound for step detection varies.

we used the Weinberg expression, which is described in the next subsection in greater detail, as dynamic threshold.


Therefore, if the bottleneck node is found before a route is selected, then the IR can be increased to make a better route choice.


In Figures 7(a) and 7(b) the line is drawn along the axis of the reader s triangle (line 1 in Figure 5).

only one of the readers can identify the tags during this type of movement.


However, a small d and a large a result in a larger packet delay: A small d causes valid packets to travel only a small number of hops before being delayed for veri.cation, and a large a causes a larger unnecessary delay in the presence of attacks (Property 4).

we need to balance between attack resiliency and packet delivery delay when selecting d and a.


IR+ is the threshold transmission-quality parameter.

if s correctly transmits within a given maximum distance r(s), called the range of s, the transmission power Ps of s is equal to ( · r(s)'.


Since certain links may be shared by several destinations, one potential bene.t of multicast is that it can reduce the total bandwidth required to communicate with all the destinations.

compared with multiple unicast capacity gain can be obtained by using multicast.


With the extremal nodes identi.ed, we also need to know their relative orderings to connect them to a consistent boundary.

this ordering can be derived from the ordering of the nodes on R. Speci.cally, for each node on R, we assign a label in [0,L] that indicates its position on R. A node uthat is k hops away from R may have multiple neighbors (k- 1) hops away from R. the label of u, J(u), is taken as the average of the labels of all of its neighbors that are (k- 1) hops away from R. Each node in the network records the distance to R as well as its label.


When traversing the inner face F2 the message will not .nd a closer intersection point, and will not return into greedy mode again.

the message is caught in the routing loop v1v3v2v1 ... .


To the best of our knowledge, this is the .rst paper that presents social ef.cient unicast routing systems with proved performance guarantee.

we call the proposed systems: Optimal Unicast Routing Systems (OURS).


(Note that we needed to round up the number of forwarding pointers because t did not update LPt i at T0.)

the lookup request needs to follow at most a total of ßT pointers until it reaches LPt i.


In [6], the authors illustrated that the p-persistent closely approximates the IEEE 802.11 protocol with the same average backoff window size.

it is reasonable to infer the behaviors of the IEEE 802.11 protocol from the analytical results based on the p-persistent protocol.


Potential link: In a multi-channel network, the availability of a link depends on the physical distance between end point nodes and the existence of common channel between them.

we call a link as potential, if the endpoint nodes are physically neighbors but they have no common channel.


data rate, 60 consecutive packets roughly correspond to 1second worth of streaming.

the .gure shows that on Cuatro channel, 20% of peers have their sub-streams completelyin-sync,while morethan90%havetheirsub-streams lagging each other by at most 5 seconds; on ARD channel, 1 30% arein-sync,and morethan90% arewithin1.5 seconds.


web, mail) of tra.c in order to discriminate them from P2P behavior.

false positives may originate from types of tra.c that are Figure 4: False positives vs correctly identi.ed P2P .ows and bytes.


The FON algorithm can be implemented as an added layer of intelligence at the MT, without disrupting any of its existing functionality or requiring any major changes to system architecture and protocols.

fON acts as an additional control knob which helps the MT in managing its limited memory resources e.ectively, while simultaneously ensuring low latency for computational tasks it executes.


This particularly bene.ts sender nodes, which are not required to establish and maintain a unicast DTLS session with each replying listener node in the group.

the group can become fully operative with no particular delays, and new joining nodes can instantly participate in multicast group communication.


Intuitively, as the multiplicating factor of the output clock increases, the intrinsic noise of the components of the PLL is exaggerated.

when the reference clock is at a frequency of 60 Hz, to generate a carrier frequency of 2.4 GHz, the multiplicative factor is 40 million.


5.5 TLS/SSL Speedups Although the TLS protocol has a resume handshake that signi.cantly reduces the handshake tra.c and latency, it requires the server to store the TLS session in its cache.

many servers store the TLS session only for a short period of time resulting in the full handshake being used instead.


By doing this, we are actually .nding the highest cost against the worst situation with worst possible estimation errors (similar to the idea in [9]).

we can make sure that this .nal cost is robust in a sense that it is the upper-bound in all cases of possible estimated range of parameters.


[0, 1] is a parameter that scales how far node i moves from its current phase towards the desired midpoint.

after hearing both neighbors .re, node i instantaneously jumps from fi(t)to f. i(t).


Aggregation for .ne-grained splitting: As we saw earlier, prior work requires each type of NIDS analysis to be self-contained.

analyses such as Scan detection are topologically constrained.


MRD computational cost is exponential in the number of blocks.

in order to be computationally feasible, MRD recommends using 6 blocks per packet [17], which is what we use in our experiments.


However, if the required distribution value of most right-hand bar is excessively small, gain value are more sensitive to instantaneous data burst and fluctuates seriously.

in this case, assignment of additional gain margin is necessary instead of searching for adequate distribution of the most right-hand bar.


(8) p p If L < .g/p, then the server is already inside the geocast destination region.


During the execution of script, the average WAP gateway s CPU usage is low, around 9%, and reached peaks of 14%, as illustrated in Figure 8a.


For instance, consider a news site in which articles change frequently throughout the day.

to achieve the semantics whereby the presence or absence of a cache does not a.ect the site, the cache server must set a short expiration time for the pages, or in the extreme, mark them as uncacheable.


As the users of this problem are software / script based, their interests are homogenous.

many users can use the same multicast group with no need for filtering.


The packet loss ratio is then estimated as n-1 .

the avail M-1 ablebandwidthofthe link mustbescaledwiththefollowing factor: 1- (n-1) M-n = ,n = M (M-1) M-1 K = (13) 0, n>M In Eq.


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

we simply use the ad 2The other extra factorturns out to be small compared with the total distortion and therefore can be ignored.


'max are now within .D of each other (note that .D is the maximum difference in decrements of any two advantage values).

there is a 20  Predictive Invader nonzero probability that the analogous advantage values .'


For this paper, we assume that .rewalls have the most restrictive semantics the same as symmetric NATs in they cannot communicate with other symmetric NATs or .rewalls.

links between two Resource Index 3 2.5 2 1.5 1 0.5 0 0 102030405060 Stream Figure 8: Resource Index for multiple trees.


Moreover, during system analysis, wireless channel corruption such as Path-Loss (PL) is always vital and critical.

being able to predict the PL behavior through the use of a Probability Density Function (PDF) becomes very useful.


f =0, the value for equally received power can be determined for each transmission rate.

the equal SIR allocation can be found and the corresponding plots are shown in Figure 1.


Hence, it would just keep reducing its access probability in our protocol, thereby reaching a dormant state, which is the best it can do in this case as there is no one else to communicate with.

it only makes sense to consider the case n = 2.


We have to assign the same channel as the neighboring nodes before getting connectivity to them.

routes, which mobile nodes search for, largely depends on channel assignments.


In ISMA, each of the multihomed host s AID is mapping to SRIDs which can aggregate into the provider s SRID blocks.

the scaling problem caused by multihoming is eliminated.


performance metric has a slope of ~13 % per year instead of 17 %, and thus will be a major topic of discussion for the major year 2009 ITRS.

an increase in 802.11 MAC hardware processing speed by a factor of the more conservative 13 % per annum is proposed for this analysis.


[Same Pre-master Secret] In this game the simulation aborts if during the interaction the simulator on behalf of the browser B chooses the same pre-master secret kp in two di.erent protocol sessions.


What we found was that for the leading candidates, the size of the packet and the number of VCs used had no meaningful impact on the response of the ODI to slow output ports.

we only present the histograms of throughputs for 1 and 16 slow ports with a packet size of 1 .it and using 1 VC.


Their obtained results have indicated that rebroadcasts could provide at best 61% additional coverage and, in the average case, only 41% over that already covered by previous transmissions.

the authors conclude that rebroadcasts are very costly and should be used with caution.


Second, we observe that in real update traces a large fraction of updates are actually route-flaps (i.e., a prefix is added back after being recently removed).

upon prefix removal we temporarily mark the prefix dirty and temporarily retain it in the Index Table, instead of immediately removing it.


Instead, we use the following intuition: programs store .elds in memory buffers and construct the messages to be sent by combining those buffers together.

the structure of the output buffer represents the inverse of the message .eld tree of the sent message.


Essentially, we want the gamma-correction function to yield gentle curves about the straight line of ..=1.

we propose capping d to be within a desired range (Section 4.1.1).


However, in a realistic WLAN environment, the data rate is variable by rate adaptation function, and the communication performance could be drastically degraded when the handover is carried out based upon some inappropriate threshold.

the following problems still remain when our previous scheme is used in the realistic WLAN environment.


VIPE s seamless transition between di.erent platforms enables an evaluation of communication protocols not only in terms of performance, but also in terms of functionality before being transferred to the operating system kernel or an embedded system.

the virtual platform ensures that the code is already extensively tested before being used in an OS kernel.


Similarly, the middleware can determine if a noti.cation for a certain street (given by name) or highway segment (given by name and km-range), or a noti.cation concerning the whole city, overlaps with its suggested route.

a large number of subscriptions can be matched by our middleware according to the location and the destination of the vehicle, in order to determine if a received noti.cation is relevant or not.


Each node i which is currently in phase jdiscards any message it receives from a neighbor which is in a phase k .j.


Building a complete working radio re  Figure 2: Innovation Cycle quires cross-disciplinary expertise in areas such as RF, hardware, software, networking, communication and so forth.

with CRKIT, users should concentrate more on the creative aspects of the wireless problem, less on the complex engineering problems associated with building a radio.


for D = 800 m that results P= 968 watt/km2 .

the area power consumption improvement by utilizing the optimal deployment strategy described above is 968.5 - 517.04 = 46.61%.


{1, · · · , m} to set the individual bits to 1.

a tag T for a path (id1, · · · , idl) is simply such that T (fj (idi)) = 1, for all i, j.


The complete MIH framework relies also on discovery mechanisms, which go beyond the MIH standard speci.cation.

the MIPSHOP working group [17] is specifying a Mobility Services Framework Design (MSFD) [18] to accomplish the mobility services discovery and the reliable transport of MIH messages.


For simplicity, we assume that the power costislinear: ci( p)= ci p. The terminal can .nd the optimal amount of power for SC n as * the solution x to the single-variable equation R ' i,n(x)= ci/ßi.

of course, the amount ordered by the terminal cannot exceed the total amount ofpowerthat remains atthetransmitter(considering any * amount allocated to previous winners), say P. with p := i,n * max(P, x * ), the terminal valuation of this SC equals ßiRi,n( pi,n) - * ci p , andfrom this, under the assumptions of sub-section3.3, the i,n bid follows directly.


Each node is the destination of at most D(n) .ows, which by Lemma 3 () log n is T .

step 1 of the .ow distribution log log n procedure assigns to each node at most 1 + D(n).ows.


For example, the packet sent by node B is delivered to all nodes in the transmission range of B in figure 1.

only one packet transmission is needed for node B to de-liver the multicast packet to A and C simultaneously.


When the o.set tof f is -20, -10, or 0 seconds, the vehicles departing from the upstream intersection cannot catch up to the vehicles waiting at the downstream intersection.

the data delivery delay is equal to the travel time on the road.


RILAnalyzer: a Comprehensive 3G Monitor On Your Phone Narseo * Vallina-Rodriguez ICSI narseo@icsi.berkeley.edu  Yan GrunenbergerTelefonica Research yan@tid.es Andrius Aucinas Mario Almeida Computer Laboratory Telefonica Research University of Cambridge 4knahs@gmail.com  andrius.aucinas@cl.cam.ac.uk Konstantina Jon Crowcroft PapagiannakiComputer Laboratory Telefonica Research University of Cambridge  dina@tid.es jon.crowcroft@cl.cam.ac.uk ABSTRACT The popularity of smartphones, cloud computing, and the app store model have led to cellular networks being used in a completely di.erent way than what they were designed for.

mobile applications impose new challenges in the design and e.cient con.guration of constrained networks to maximize application s performance.


However, attackers could exploit the relatively high energy consumption of ECDSA signature generations by repeatedly sending bogus key establishment requests.

attackers could deplete a node s battery.


If NINA is supported in the Nested NEMO then its routes can be relied upon and the CoA of each MR does not need to be recorded.

in a Nested NEMO where NINA is supported by all of the MRs that a packet traverses out to the Internet, the principal role of the RRH protocol is to record the actual CoA of the originating MR and the topologically correct CoA of the Gateway-MR and report it to the MR s HA.


The previous schemes, such as interleaving mesh, are not designed speci.cally to address such correlated node failures in the network.

we propose the use of spacial diversity to improve the reliability and coverage of the query process.


4.3 Methodology When dealing with real testbeds one of the main difficulties is that experiments cannot be repeated exactly in the same way since external conditions may vary from time to time -- sometimes during the same experiment -- and there is definitely no control on them.

successive experiments carried out under the same operating conditions may provide outcomes that differ significantly from each other.


HOW TO FIND THE OPTIMAL CLUSTER SIZE In the .rst time slot, all the nodes send their sensed data and their locations to the sink.

the sink has complete information about the network topology and the data values at the nodes.


N We also use Ri to denote the number of recurrences that occur at X 1{Tk/c 2 k}(1 - Xk) (16) state i. Ri is actually a geometric process.

hence, the expectation = E k=1 on Ri is  X + k=1 k=1 1 m X 1{N 2 k, Tk/c 2 k}(1 - Xk) k · p k i (17)= EE(Ri) = · (1 - pi) = = (26) 1 - pi m - i X the expectation on T2 under assumption A1, E(T2|A1), is E [1{N 2 k, Tk/c 2 k}(1 - Xk)] , (18)= k=1 E(T2|A1) = m(Trsp + Tinf + Tidle) + , (27) wherewhere we have used Fubini s Theorem to interchange the expectation m-1 and in.nite summation.


To the best of our knowledge, our work is the .rst one that designs the optimal unicast systems based on strategyproof or Nash Equilibrium solutions.

we call the proposed systems: Optimal Unicast Routing Systems (OURS).


The semi-dynamic reassignments to the .xed interfaces is based on the current number of nodes using the same .xed channel.

if a node notices that the number of nodes using the same .xed channel as itself is large, it can reassign its interface to a less used channel and inform its neighbors.


3.4 Discussion As discussed in preceding subsections, the e.ectiveness of FEC depends on how the server uses redundant packets based onpacket-lossdynamicsofnetworkpaths.

nonadaptive FEC schemes that use a .xed amount of overhead encounter signi.cant quality degradation if packet loss .uctuates as often observed in the Internet.


Unfortunately, fast ADCs are very dif.cult to build and very expensive.

we need some more hardware to .rst down-convert a band of adequate width from a higher frequency into an intermediate frequency where we then can sample it with our ADC.


., the angle around the z axis, experiences much faster rotation than the other two angles.

we will focus on the impact of rotation in .


However, in the worst case, n=1 results in around 30% samples be treated as out range.


Unlike in Tryst, no Shroud address will ever appear in two di.erent messages; thus no one can successfully record and replay them.

addri AB itself proves to B that A sent the message to B and that it was message transmission i, which B expects.


Fre quent depletion/recharge cycles can result in 20% decrease in battery lifespans.

sensor nodes must periodically have their batteries replaced, wasting time and effort.


The variation of average relative speed with Vmax is shown in .gure 11.

the Probability Density Function (PDF) of the path duration across most of the mobility models used in our study can be approximated as an exponential distribution4: -.0hV f(x)= e R (2) .0hV x R The Cumulative Density Function (CDF) of the path duration across the mobility models used in our study can be approximated as follows: -.0hV F (x)=1 - e R x (3) In the next section, we show the utility of average path 4We conducted the Kolmogorov Smirnov test on these PDFs.


For the video caching problem, there is an additional option of not serving a request if the .le is not popular enough to be cached at all.

a video cache based on two LRU queues can operate as follows (Figure 1).


6.3 Handover Latency Study Considering MIPv6, in our proposed scenario described in Figure 7, the latency will be 1) the time required to send the BU and receive the BA through the wireless medium, plus 2) the time required by the BU to reach the HA who forwards the packet to the MN, plus 3) the time required by the BA to reach the current nAR, plus 4) the time required by the forwarded packet to arrive at the current nAR and plus 5) the delay caused by the wireless part to send the packet to the mobile node.

the handover latency performing a handover from the AR to the nAR in MIPv6 can be computed through the following formula: dw + dw + dHA-nAR + dHA-nAR + dHA-nAR + dw (1) where dw denotes the delay introduced by the wireless part.


Using this optimization reduces the pruning time substantially from 1800 s to 110 s for AS3356-aug. 8.4 Accuracy of the DynHandler As discussed in §6, proxies create the most number of challenges in terms of dynamic behaviors they create/multiplex sessions and change packet contents.

we focus on the accuracy of the DynHandler in inferring correlations between responses from the web servers to a Squid proxy and from the Squid instance to the individual users.


Moreover, as described previously, this solution does not need routers in di.erent domains to know each other s IP multicast group mappings.

it becomes more practical than other solutions that depend on inter-domain multicast.


Flows in application 1 (sets A1 and B1) were assignedrates proportional to their demands, and .ows in application2 (sets A2 and B2) were assigned rates limited by their demands.

notice that even though .ows in A1 and A2 had the same demand, they each get different rate allocations because the applications use different capacity allocation policies.


In addition, if the spoofer sends more data to the client than the dummy host (i.e., the dummy host), the censor can detect the inconsistency of the sequence numbers as long as the dummy host sends any packet to the client2 .

the spoofer has to use the sequence numbers that have already been used by the dummy host (i.e., injecting packets as resent packets ).


Nevertheless, it is argued that newspapers could act as mediators, since they periodically publish news related to the most important universities.

the number of times a university appears on the newspapers could be a strong indicator that it has larger endowments than universities that do not or rarely appear on the media.


We con.rmed that it was Firefox by manual inspection.

the temporal causality of .ows is advantageous for pro.ling application programs, i.e., user agents of Web browsers.


At each round one set will sense the monitored area.

the sensors not belonging to it are in sleep mode.


The PN sequences (implemented using Gold codes [7]) can be correlated by the receiver even under high interference [15].

by correlating received samples, the receivers in Mozart identify the IDs of as many colliding transmitters as possible.


The model highlights that the duration of a round strictly depends on the amount of bits transmitted by the reader (in the inventory message) and by the tag (in the response message).

the duration of an idle round (that does not involve any tag response) is shorter than the time taken by an identi.cation or collision round, that involves the transmission of tag s ID.


In this paper, we present mechanisms and design of a prototype that allows game-context based VoIP communication between players.

in addition to allowing players to talk to each other to coordinate teammates and activities (through a static team-based audio conference) as in some of the current systems, it supports communication among players based on shared contexts like the same physical location or room within the gaming environment.


Instead, when data rategoes up and overcomes its mean value, the accorded transmission time is not suf.cient to dispatch the incoming streams and to absorb bursts of traf.c.

transmission queues length increases,jeopardizing the assuredQoS and real-time networkperformance, expressed in terms of end-to-end delay, is worse.


This ensures that it is more di.cult to inject fake information in the DHT.

when designing new protocols, care should be taken to restrict the amount of freedom that nodes have when choosing identi.ers or embedding data in messages.


This is not acceptable for a number of applications such as VoIP.

recently a number of efforts have resulted in improvements in handover delays.


Third, the network equipments and applications are mostly as blackboxes to the operators, making it impossible to instrument and reason.

the fault recovery process is still error-prone and notoriously hard in today s networks.


Unlike in the case of minimal routing, where it has been proved that two VCs are adequate to break deadlock cycles [16], there is no such property in unrestricted (potentially non-minimal) routing.

we formulate the deadlock-free VC assignment problem as an integer linear programming (ILP) problem which takes the number of VCs as one of its inputs and answers the question Can we avoid deadlocks using the given number of VCs?


We observe that this is indeed possible since all the loops that occur, in both Rocketfuel and real-world topologies, arise between routers in the same zone or between backbone routers and routers in a peripheral zone.

it is often possible to compute per-zone orderings.


The challenge is that the wireless channels may constantly .uctuate such that it is often not possible learn the actual optimal rates during the experiments.

we design emulated channel experiments in which the nodes are very closely located such that real packet losses are rare; arti.cial packet losses and partial packets are introduced by inserting errors to certain packets according to the emulated channel conditions.


That is, the wireless part of the network has a lower amount of resources compared to high-bandwidth wireline networks.

the routing protocol deployed within the wireless mesh must be really ef.cient in terms of low control overhead, and high bandwidth ef.ciency.


However, if the cached data is not there, the data may be retrieved from a faraway source.

limitedduration storage fits caching applications naturally.


By the de.nition of Sub-Step 1(b), the unassigned value of ' '' ' either p or p will be assigned to p (or maybe to another packet that preempts p ' ).

p can be assigned by Sub-Step 1(b) only Figure 8: The assignment routine for variable length packets.


In this case, the network has two anycast servers.

node S sends data packets via node A to the anycast server, because the node A has higher pheromone intensity than node B. node S can connect to a nearby anycast server.


Eef f can be derived from the delivery rate r and the total number of transmissions t.Let psrc be the number of packets sent by the source, etx and erx the amount of energy required by a node to transmit and receive a packet, and ere the energy used to read only the header of the packet (for early rejection).

given that we are assuming a random distributed topology, the expected number of neighbors can be considered as a constant n. the total amount of energy consumed by the network for each transmitted packet is given by: etotal = etx + erx +(n- 1)ere (2) Subsequently, Eef f is given by: Eef f = psrc r kt (3)  Where k is a constant which includes etotal and a conversion factor for energy units.


Finally, note that the SIP signaling path may follow an overlay and thus a different path than the media stream.

the (non-)availability of the signaling path does not allow inferring the status of the media path.


At the same time, each end-user i maintains a local variable seqi, which records the largest value of seq observed by the user so far.

for each incoming ACK with sequence seq, the user responds to it if and only if seq > seqi.


In SecondNet, we re-interpret MPLS label as port.

the MPLS label table is interpreted as our virtual-port table.


Moreover, in ad hoc networks, the battery life of the devices is a constraint.

in this paper we are studying the performance of EDB, an energy aware distance based broadcasting algorithm that was presented in [29, 30].


In contrast, D2TCP s deadline-aware congestion avoidance allows the near deadline flows to take a larger share of the available bandwidth, and the far-deadline flows commensurately relinquish bandwidth.

the flow completion times for flow #0 and #1 under D2TCP are significantly shorter than those under DCTCP.


A synthetic inter-cluster trace consists of a sequence of cluster IDs.

the number of synthetic traces corresponding to a particular cluster (intra-cluster traces) is equal to the number of times that cluster ID occurs in the intercluster trace.


The sup optimal configurations (with six and eight cores), where we have three and four couples of Rx and Tx gigabit interfaces, show a performance decay; with six cores we achieve a maximum 99% 68% 40% throughput equal to about 4.4 MPkts/s, while the SR forwards up to 5.9 MPkts/s in the setup with eight cores, which corresponds to about the 70% of the maximum theoretical throughput.

while optimal SR configurations can achieve the full rate speeds, 600 400 200 even the sub-optimal configurations guarantee a high performance UP SMP 1CPU SMP 2CPUs level.


N0is the white noise power spectral density, and .fis the sub-carrier spacing.

the achievable capacity from (1) and [1] is equal to mk f log (1 DSINR , ) (2) C '.


is a minimum requirement on the SINR for successful reception and T is the iteration number.

the routing and scheduling portions of the algorithm are search-based.


2) of a cell to mitigate interference with sectors of adjacent cells.

while the band used by cell-interior clients is reused in each cell, the reuse of the other three bands are subject to the spatial reuse possible.


However, if a loss occurs in the ascending part of the ConcaveU or Up curve, it is difficult to tell if this loss is due to the wireless channel or the network congestion based on its trend.

we need to take its loss density into consideration.


Each node in such a network has a limited energy resource (battery), and each node operates unattended.

energy e.ciency is an important design consideration for these networks [23, 26].


{R1}= .v2 1 , (Because {R1}< {T2T3R3,T2R2} and {R1}< {T2T3R3,T2R2,R1}) v2 This is a contradiction.

there is no solution in the second order bad triangle.


Station D forwards .ow1 to station C and .ow2 to station A.

in this example, the link rate of (D, C) is larger than the one of (C, B) and C can not forward the packets to B asfast as it receives them from D. C sbuffer level is soon above the critical threshold and it sends a congestion control message to D and B.


On the other hand, the distributed protocol starts from the maximum knowledge range.

it takes longer time to converge for larger values of .ow aggregation ratio.


C, it will compare its own distance discriminator to the destination node F with the DDbits, thus determining that the packet must not be forwarded using conventional routing tables, but cycle following tables.

b will forward the packet over IBA following c3, which will bring it to C after being forwarded by A.When C tries to forward the packet though ICB, the termination condition will be triggered, and C will compare its own distance to F with the DDbits, thus determining that cycle following must continue.


This trendisalsoobservedinour simulation resultspresented in Section 7.

sHARP s proactive routing component presents a predictable routing overhead, which is mostly independent of the mobility rate.


As a major supervised learning algorithm, given a set of training sample, Naïve Bayes is able to analyze the training data and infer the correct output for any valid input data.

when the algorithm of Naïve Bayes is supplied with a node s trust value, we expect it can predict the validity of the corresponding output.


When an attacker sends polluted packets with hv = h in some time interval, for the next a(1 - hd ) time intervals its pollution attacks will be ineffective (polluted packets will be veri.ed and dropped by its .rst-hop neighbors).

its pollution success frequency is at most 1/(a(1 - hd )+1).


The utility function for a user is de.ned as the ratio of the user s goodput to its transmit power, i.e., Tk uk = , (10) pk where the goodput Tk is the number of bits that are transmitted successfully per second and is given by Tk = Rkf(.k).

(11) the utility function for user k is given by f(.k) uk = Rk .


if 1 + .dlk.=m =M + .dlk., fR lk(m)= 0 otherwise.

in time slot t, if the m-th position on link l carries a symbol payload, then the fL lk(m)-th positions lk(m)-th and fR on interfering link k cannot carry a symbol payload.


In GPCR, however, it is stated that streets, in general, form a natural planar graph.

there is no need for graph planarization.


Even with a very small bu.er of 5 packets (0.5 BDP), Ack Regulator is able to maintain a throughput of over 80% of the maximum throughput of 200Kb/s.

ack Regulator delivers robust throughput performance across di.erent bu.er sizes.


By using SWIG, an interface compiler that allows easy integration of C/C++ into scripting languages, GNU Radio provides a simple interface to the signal processing blocks from within Python, a dynamic object-oriented scripting language.

the Python code simply connects the signal processing blocks and allows them to run at native speed without any interpretation.


Note that both, a PIP as well as the VNP, deliver a virtualized network.


4 compares the scenario in which both C1 and C2 have one copy of the searched content with the scenario in which C1 has two copies, i.e., m1 =2 and m2 =0.For µx/µi < 1,which is the expected operating region according to the notion of community, intra-community meetings are more dominant.

the search takes shorter when C1 holds both copies.


As RTTest increases, we graduallyslowdown theincrement rate of rwnd to stopTCP from overshooting.

dRWA makes bidirectional adjustment of the advertisedwindow and controls the RTTest to stay around .


We see similar increases in average play times when Age 3 and Age 4 were released on November 17, 2009 (day 380) and October 31st, 2010 (day 728) respectively.

as the game becomes more popular and usable (more features and bug .xes, better UI and gameplay), it increases the average time users spend playing the game.


In other words, it is possible that all paths traversing a good link are bad.

we need to consider an algorithm that can infer lossy links, even when the conditions of Lemma-2 are not met.


Resources such as .ow table, tra.c, bandwidth and topology can be sliced as what FlowVisor [4] does.

the controller can slice VMs, tra.c and even physical links into a tenant s virtual network.


Within the remaining three patterns, T-shaped array appears to have slightly better performance than the others, for the reason that have been studied in Section 3.3.

1 Linear Array Circular Array 0.8 Cross Array T-shape Array 0.6 the angle spectrum measured by iLocScan at given point in time corresponds only to one AP; this enables iLocScan to obtain three separated angle spectra shown in Fig.


The goal of the Vegas congestion avoidance algorithm is to keep this number within a .xed range de.ned by two thresholds, a and ß.

once every RTT when not in slow-start mode, TCP Vegas adjusts the window size as follows: {W +1 , diff ß Alternatively, diff can be divided by baseRT T [6], in which case the thresholds a and ß are de.ned in a standard unit of throughput (e.g., packets/second); however, this results in unequal treatment of connections with different baseRT T [16].


Throughput is selected as the optimization criteria for channel assignment.

the result of a throughput estimation model is used as an input for an optimization algorithm.


Here, it is assumed that the path between any two nodes is predetermined.

routing design reduces to cache node selection [5].


This in turn increases the control packet overhead and wastes network bandwidth.

hello packets broadcasting is modi.ed using a grouping method, where the entries in the Direct Table are subdivided into groups based on ChID.


For a third party such as an adversary or an intermediate forwarding sensor node, it is not possible to determine this without knowing the secret key being used.

the anonymity of the original senders of messages is also protected.


Only road units that are inside FZone SReq can forward the SSReq msg messages.

the number NbSSReq of messages forwarded between the service requester and the RI is equal to the number of road units inside FZone SReq and is computed as follow:              NbSSReq = FZone SReq × .


In a network with a high arrival rate of new .ows, such as in a data center, the control tra.c between the switch and controller can become very high.


The DAIM agents can provide a distributed environment where the network information is the property (values) of software agents residing in virtual machines that are distributed throughout the network elements.

the DAIM agents have the ingredients to implement autonomic behaviours.


Although the IGP topology within an AS is typically a single connected component, failures of links, routers, or interfaces may occasionally create partitions.

contains one or more connected components; i.e., s v t n t a n s e ee a n n. The RCS only computes routes for partitions .


Switches receive these requests, compute a decision, and place the decisions into the packet header.

the senders learn how much data to transmit in the next RTT.


First, routing is to a data center, not to an individual host.

the system can use anycast addresses rather than unicast addresses.


This will form a resilient sensing and communication infrastructure because WSNs are typically ad hoc, wireless, and self powered.

in a disaster scenario where traditional communication infrastructures like cell phone towers are unavailable, WSNs will likely continue to work.


That is, the data structure would be collision-free, since two .ows would not hashtothe sameposition.

to obtain the(exact) average delay of .ow with identi.er f, one would simply divide the s and n values of cell(0,h0 (f)).


When a is increased above 1, the number of flows that compete on the same channel in the same slot starts increasing.

the collision factor a serves as a network tunable parameter which can be adjusted based on network load, to achieve high throughput.


However, to the best of our knowledge, there lacks a comprehensive empirical study evaluating the characteristics of the IEEE 802.11p standard with respect to PDR.

we aim to answer the following questionsinthispaper: 1.


Although the later outperforms the former in terms of blocking probability, it usually implies a higher computational complexity.

developing an efficient way to integrate physical impairments into RWA scheme is still an important issue of all-optical networks.


Multiple-ray Model of propagation inside tunnels 2.3 Characteristics from the point of statistics   In tunnel environments, the received signal is presented as the sum of the direct signal and the signal scattered by the wall, ceiling and ground.

the statistical distribution of the received signal can be described as the Ricean distribution as:  ,, (6) where is the probability density function,is the random variable, is standard deviation,is the amplitude of the LOS component, and is a first order zero degree Bessel function.


However, WDM switches without wavelength conversion ability cannot exploit the wavelength domain when there is contention for channels, while the technology to implement full-range wavelength conversion is not yet mature [2].

we adopt limited-range wavelength conversion in the switch we consider.


After 13s, a fault happens at link 2 that triggers the SM to generate a new 8000 set of routing tables that causes both .ow 1-5 and .ow 2-4 to sharethesame upstreamlink.

withoutthe 6000 dFtreealgorithmthethroughputof .ow2-4dropsto3Gbps due to the HOL blocking caused by the congested .ow 1-5.


However, naive broadcasting causes severe redundant transmissions, congestions of the wireless media, and collisions in networks, which are usually referred to as broadcast storm problems [12].

the priority work in an e.cient broadcasting scheme design involves the minimization of the control message overhead based on additional knowledge [15].


The problem in a wireless ad hoc network is at least as hard as its counterpart in the wired network.

.nding a minimumenergy multicast tree in a wireless network is a di.cult problem.


As illustrated in Figure 12, spherical graphs are quite complicated; their practical deployment for large N would be quite dif.cult without a scalable tiling strategy.

in a manner analogous to that used in §3.1 and §3.2, we now transform these graphs to discover local patterns and identify selfsimilar tilings that make such constructions tractable and scalable.


For each point p in the region, we divide the disk D(p, r) centered at point p with radius r into 6 equal sized sectors.

any pair of nodes falling into the same sector will be within distance of r of each other, and thus connected in the original communication graph.


Even in real-time systems, which might be implemented in FPGAs or silicon, processing time in the physical layer still scales with the datarate and length of packets.

mAC protocols should still be aware of the processing time required by PHY algorithms.


Even though these datasets use di.erent relationship-inference algorithms, the trends we observed across datasets were remarkably consistent.

all the results we present are from CAIDA s November 20, 2009 dataset (with slight modi.cations to the sibling relationships, see the full version); counterparts of these graphs, computed from Cyclops and IXP data [12, 13] are in the full version [1].


In HCMM pro1, the accumulation of the whole history performed by Greedy makes it able to di.erentiate the communities, although mixed, as it emergesbyboth the utilities reported in Fig.13(a) (they are not uniform, as instead it happens in RWP) and the behavior of the ecdf over utilities (which shows more encounters with a subset of nodes) (Fig.13(b)).

greedy is able to discover the communities (although with a long learning phase: roughly (a)(b) Figure 14: HCMM pro1 (a) Fresh: ecdf(utilities) for a node.


Another concern is the security of the stored information: engineering a highly-replicated solution without leaks of information is a challenging endeavor.

a different approach is needed in protecting the communications of parties involved in a critical task from the effects of DoS attacks.


We also conducted VoIP calls to other desti nations (China and NewYork), and the results were comparable.Anexaminationofthe distributionof interframegaps (also omitted for brevity) which takes both the uplink and downlink traf.c into account shows that 70% of the frames have an interframe gap of a few hundred µ s and 90% are within 10 ms.

it is clear that the tail of the distribution contributes to the large exploitable idle time, and this tail likely arises from silence suppression as well as delay variability over the wide area network.


Instead, they are implemented in the device driver.

the main functions of LOHAS are implemented on the device driver.


Further, a video codec encodes video at di.erent qualities by changing the quantization level [9], that is by discarding the least signi.cant bits.

to scale video quality with the wireless channel s quality, all we need to do is to map the least signi.cant bits in the video to the least signi.cant bits in the transmitted samples.


The gap between the two rules varies form 15% to 25%.

even a moderate QD=90 % and QF=10% can never be met using the fixed threshold.


We found that starting time t does not have a signi.cant effect on the distribution of time distance.


The Mesh network architecture not only extends the BS s coverage but also enable the routing path to be dynamic updated or repaired under unpredicted situations such as path breakdown or poor radio qualities for some relay SSs.

mesh framework supports higher reliability and better availability compared to PMP framework.


In cellular networks, mobile users may easily crossover the cell boundary that generates handoff calls.

call requests to a cellular system are usually composed of two types of calls, new calls and handoff calls.


For example, theorists believe that users constantly seek out new forms of visual stimulation [31].

some less populated categories would be suitable for targeted content injections as their demand outstrips supply.


MDC have considerable coding overheads because each divided .les should include suf.cient information about the original video.

the entire .le size is much larger than video data encoded by other codings [6].


M ST (d), then it still gets utility 0; else the M ST will keep unchanged which implies that ek is still not in P M ST .

ek also don t have the incentive to lie in this case.


Thus, each Scap instance running on each core will receive a different subset of network streams, as shown in Figure 1.

the stream reassembly process is distributed across all the available cores.


By hiding the protected data in the lowest layer, the remaining layers of code stream remain unchanged.

the resulting code stream has the same structure as the one in the JPEG 2000 core coding system standard.


Our proposed architecture aims to achieve these goals, and some aspects are similar to TrustStream, however we use only peers in our system with a node as server instead of a CDN network.

our proposal proves to be more economical than TrustStream.


This means the likelihood function has a unique stationary point which provides the maximum likelihood estimators (MLEs) of the noise terms.

the IPF algorithm, which converges to a stationary point of the likelihood function, will guarantee to return the MLEs.


In de.ning OFSS our aim is to select pf to maximise the total amount of information captured by FSS, or equivalently, to minimise the CRLB when using all A counters.

for each a > 0, we seek to minimise the diagonal elements of I+ I+ (a) (a) 1 FSS FSS I+ ' IT (pf )= = = Sk(a ) (15) Nf Aa Aa' over pf .


This is because that RSS changes (in dB) are more dynamic in a close proximity of the AP than the areas far away from it.

the grid size for the complete monitoring should be carefully selected, depending on the physical site and distance to an AP.


This results in the inventory .ag of the tag not being toggled by the next QueryRepeat, and the tag will be active during the next round.

we can calculate error rates by determining how often ACKs are followed by a NAK instead of a QueryRepeat.


NumOfPath(i)×NumOfPath(j) return the pair (i,j) with maximum d 3.1 Ef.cient dependency discovery Since the joint table is a combination of forwarding table of each switch, it is essentially driven by the routing policies of the network.

we can take advantage of commonly used policies (e.g., routing schemes) to guide the selection of the inputs.


However, such an IP is quite complex concerning its processing time.

we just refer to the LP relaxation achieved by LP 1.


This request is delivered to node M (recall that node A s routing table entry for address a leads the packet along the route A-P-F-M to node M).

the request is not delivered to node R that actually provides service Foo.In this case, node A would not receive the requested service.


Moreover, it is common to have middleboxes such as .rewalls, intrusion detection systems (IDS) set up along the path.

the Re-ECN framework also requires that these middleboxes do not clear ECN marks or the Re-ECN information.


However, longcut routes can avoid such bottleneck nodes and can take an alternate route that has a larger gain than the route that has bottleneck nodes, with the same cost constraint.

if the bottleneck node is found before a route is selected, then the IR can be increased to make a better route choice.


Unfortunately, as mentioned above, the frequency response of this channel is not .at, thus CSI estimation and precoding computation has to be repeated at regular intervals across the band.

the number of inverses and amount of data transport required scale linearly with the bandwidth.


Specif 1E(k-1) n ically, we simulated a large number of random duty cycling v 2 2 n` vk, n 2p(k-1) n 2p(k-1) n 22 = v cos + i sin = ´ `´ instances on each graph with di.erent p and then measured (7) the average end-to-end latency.

n  nn  (k-1) (-1) v = v First, we simulated duty cycling random walks on small cos((k-1)p)+ i sin((k-1)p) = n n networks for a 10 node random geometric graph with wake up probability, p =0.1, we found that the simulated value of vk, n is always a real number.


PROGRAMMING AND CONTROLLING THE ESB NODES The base .rmware and our protocol modules are written in C. The respective cross-compiler and debugging tools are freely available for several platforms [10].

no deeper assembler programming skills are required, and various protocols can be implemented really straightforward.


{u1, u2, , ui}, {u2, , ui, ui+1}, {uk, u1, , ui-1}, and cover all k neighbors by exactly one way.

we derive the number of possible beam configurations to be at most k(k-1)+1, or in the order of O(k2).


The .rst is point-to-multipoint demand; that is, there can be multiple equally-good egress points to a given external (i.e., interdomain) destination pre.x in the BGP decision process [17].

cOPE needs to break the tie and assign the egress point of each external destination.


Moreover, a physical node that has leftover memory capacity would be simplistically selected as a candidate for the next allocation.

characteristics such as the average processor load and the bandwidth usage of the network interface of the physical node could not be regarded.


The 802.11 backoff mechanism preferentially treats links which experience fewer losses.

802.11 exacerbates the already disproportionate bandwidth allocation to stronger links.


This is because although the individual data frame transmission rate is increased, the additional channel probing (RTS/CTS handshakes) actually result in longer time for transmitting a data frame.

there is not much improvement in the aggregate system throughput.


One problem we found was that since the amplitude of the preamble is much larger than that of the OFDM transmission (due to low PAPR), a 3ms cyclic pre.x proved insuf.cient for shielding from ISI the training symbols that immediately followed the preamble.

we padded each preamble with a silence period of roughly 4ms that allowed ringing of the preamble to subside signi.cantly and reduced channel estimation errors.


However, as proximate devices detect each other and abort, farther devices will become amenable for detection.

as time progresses, more and more devices will abort their transmissions in a chain reaction like manner, expanding in geographical extent.


2 i  Using x = Q(t ), y = Q(t +1) and d(t )= Q(t +1) - Q(t ), we have L i di(t )Qai (t ) Q(t +1) = Q(t)+ a Q(t ) L a i(Qi(t )+ .di(t))a-1di 2(t)+ 2 Q(t )+ .d(t) a (L n2 a (Qi(t)+ .di(t ))adi(t) - i.

(9) 2 Q(t )+ .d(t ) 1+2a using the fact that di(t) .


However, anover.ttedmodel cannot distinguish the systematic e.ects of the process from its random e.ects, thus, su.ers from a low predictive accuracy.

wienerpredictors areusually notused in practice.


Recall that a sensor u enters a sleep mode only after all the intersection points Pu in its sensing range are already k-covered.

according to Theorem 1, during the lifetime of the network (i.e., while there is no coverage hole) the subset of sensors activated at the end of the activation phase in each slot j, S(j), induces a sensor cover for the network.


When a burst transmission granted by a given destination is blocked due to a source con.ict, the source can simply refrain from transmitting on its assigned time slot.

the destination can learn about a source con.ict if it detects that an assigned time slot does not contain a burst after a round-trip propagation delay5 .


Each source X generates a message, mX , whose word size in bits is equal to w = 100 bits if not di.erently speci.ed.

for each event, the number of messages generated is in the order of p· r 2 · ., i.e.


This is due to the fact that as we increase the number of relay nodes, it not only reduces the number of transmission opportunities that the traditional nodes can use for their own transmissions, but also results in increasing channel contention every time a node attempts to transmit [10].

the throughput in the network decreases while the end-to-end delay increases.


As with many other security properties, a privacy-preserving system is only as strong as its weakest link, since an attacker that cannot identify a node with wireless .ngerprinting could simply use MAC or network addresses instead.

we propose to only shift identities at the physical layer when there is a shift in higher-layer identities, as previously proposed by D¨ otzer[2].


To use a standard formula to .nd the balance point and minimize the failure, we try minimize the area in the center.

the iteration will repeated until a certain threshold is reached.


Additionally, the lack of memory of previous events indicates that the limiting probabilities of finding the system in any given state will converge to a certain value once it has been operating for a long time.

our performance improvement objective can be maximized on a time average basis if a suitable policy is employed to dynamically relocate MDs in accordance to the users combined mobility and service querying patterns.


For example the configuration of filter lists is complex in the sense that in reality few people understand the reasoning behind all the rules.

it is often not entirely predictable what the outcome of a rule change will be.


An edge's weight represents the most likely worst-case signal-tonoise ratio between two APs, scaled by the predicted signal strength, which decreases proportionally to the square of their distance between the APs (i.e., the length of the edge).

the edge weighting allows channel interference to be taken into account, while also decreasing it realistically with distance.


9 (c) and (d), we see that the fractional window scheme works well for ADTCP, too.

the preventive approach using the proposed fractional window scheme is e.ective and suitable for a wide range of window-based transport protocols.


The arrows re.ect that in the dd mode the useful signal is interfered by the signal from the other base station.

given an uplink .ow at distance Z from the base station, the service time of the .ow is given by Su uu = Y /cuu(Z), where c uu(z) represents the mean transmission rate of the .ow at distance z in the uu mode.


There is no packet reordering in the trace.

we adjust packet reordering rate from 0.0004 to 0.04 for the evaluation.


The results show that, the timer function in eq(8) is unable to di.erentiate between the candidate nodes having the same XForward values, but, are at di.erent angles or deviation from the route.

we suggest the function in eq(11) to be used as delay timer function in the forwarder selection.


That happens because if the aggregation level equals 23 the cost equals k. On the other hand, if the aggregation level equals 24 or 25 the cost will be 2k and 4k respectively.

if r > 3k2-8 or k2-8 < r < 2k2-8, both transit providers have the incentive to deaggregate.


Shaperthrottlestra.cbased onwheretheaccesspoints are and what throughput they have achieved.

the information about physical AP position, association lists, and in and out throughputs of each AP is a must.


However, to achieve high packet throughput, multiple packets must be able to lookup different trees at the same time.

we cannot map multiple root nodes of different trees to the same TCAM subarray.


However, real network delays are not Euclidean and violate the triangle inequality.

in general, it is not possible to predict all the network delays accurately.


The Current Node Position is the position of the node about to broadcast this packet.

(each intermediate node updates the Current Node Position header field before rebroadcasting the packet.)


3.3 Application of the entropy-based .ltering to Skype detection As we know from various sources, almost all Skype tra.c is encrypted.

our approach should not degrade the performance of Skype detection engines.


For that reason, we deploy models of the routes deployed by the nodes to send the sensed value to the sink using n-grams, where each n-gram consists of a predefined number of successive hops used in routing information coming from the node.

the features are the n-grams and the feature values are the number of occurrences or the frequency of the corresponding n-gram during a certain period of time.


Measured Delay and Loss from VMScope Experiments and MVPNs.

)we performed a second set of experiments to assess the scalability of the monitor.


Note that our sampling method captures only about 10% of the traffic seen on the 11 channels in the 2.4GHz spectrum.

in order to obtain the absolute total number of packets, we need to extrapolate the sampled total packets shown in Figure 12.