Optimal quantization depends on the s2 of the channel.

for a particular distribution of SVs, one needs to integrate the total area and divide into 2k bins where k is the number of bits used to express each SV.


Fortunately, the XE1205 includes some functionality which helps to o.oad the microcontroller.

it o.ers a MamaBoard only MamaBoard and SEB  Figure 3: SEB/MamaBoard block diagram.


For our detection mechanism, we consider that a negativetrend occurs wheneverthetrendfactor reaches a value lower than -0.5.

for a given detectionwindow,whenthenumberofnegativedi.erencesin amplitude is more than the half of the possible number of sign changes,thereisahighpotentialthatthesignalis undergoing a decrease as a consequence of an incipient congestion.


Thus, when f(n)= klnn, all cells are open w.h.p.

each node is located on a highway w.h.p.


1, is signi.cantly longer than higher data rate nodes (nodes A and B), when transmitting the same packet.

the channel is occupied for a longer period which reduces the e.ciency of the system.


We implement an unequal error protection (UEP) scheme that relies on forward error correction (FEC) channel coding supported by a proper unequal distribution of the transmission power (UPD) among JPWL coding units.

we show that an appropriate combination of Reed-Solomon (RS) coding and UPD on the image data, can greatly improve the average PSNR of the reconstructed frames, in case of transmission over wireless channels with both sparse and packet error statistics, such as those provided by satellite broadcasting and Wireless MAN standards as WiMAX..


Also, placing fragment storage locations in the FFI provides an important advantage: the fragment locations are not tied to the cluster responsible for their ids.

when the id range for which a CDRM is responsible changes, there is no need to move the fragments between clusters.


For instance, at time period t1 to t2 the moving UE is served by BS2.

at time t1, the moving UE enters the coverage area of the BS2, while at time t2 leaves this area.


Here, page i is not necessarily the most recent request prior to page j. Access- from graph has its merits.

all of the successors of a node are actually accessible from that node.


This allows us to compare the effectiveness and efficiency of conducting user studies on both platforms.

we encode the speech using SILK, the audio codec implemented in the latest version of Skype.


Therefore, this study focuses on the performance of the LTE physical-layer in high-velocity conditions (100 to 1http://en.wikipedia.org/wiki/List_of_LTE_networks   200 km/h).

there are two main questions: (1) how does the performance of LTE decrease with increasing velocity?


Although under the setting of mixed mobility rates, our experiments suggest that all three protocol are less e.cient than in the case of uniform speeds, we are happy to report than our mobility sensitive approach manages to select the best strategy among the available choices.

if we make sure that the mobile nodes are able to use routing protocols that are suitable to the actual mobility rates, then MSA will manage to pick the one that best suits the actual network conditions.


An important question arises that whether this iterative gateway selection process will reach a steady state eventually.

we are interested in whether the gateway selection game has a Nash Equilibrium3 , since an absence of equilibrium states indicates that the network will oscillate and a common agreement can never be expected.


ATTACKS / COUNTERMEASURES In this section, we discuss possible countermeasures and attacks against the Overbot protocol.

we observe that bot nodes and sensor nodes could be identi.ed based on behavioral di.erences that distinguish them from legitimate nodes when observed for a longer period of time.


The probability distribution of traf.c is close to long-tail by the above characteristics.

the marginal distribution of the traf.c is not Gaussian [22].


Thus, an appropriate choice of the pricing policy is key for the provider to obtain good system performance.

the pricing strategy should be able to regulate Mbps s -1 0.2 0.25 0.3 0.35 0.4 0.45 0.5 0.55 0.6 0.65 0.7 Instant revenue 1 0.5 0 Mean throughput achieved by satisfied users 1 0.5 0 a l Figure 7: Dynamics in high congestion situation  the users access in order to prevent users from achieving dissatisfactory service due to congestion.


Then, ~(n) nodes lie within distance r -1 of every node in the core of the graph.

for any node in the core, f~(n) nodes lie at a distance exactly r -1 from it.


In this article, Penrose proved that if n is high enough, then with high probability, if one starts with an empty graph (i.e., only isolated nodes) and adds the corresponding links as r0 increases, the resulting graph becomes k connected at the momentitachieves a minimumdegree dmin of k.So, for k = 1, the network becomes connected at the moment where r0 is large enough to achieve dmin(G) > 0 with high probability.

p (G is k connected) = P (dmin = k) (20) for P (dmin = k) almost one.


The simulation results show that when running 1-TCP connection, Bypass-AODV performs better than AODV.

this behavior is rapidly changed with increasing the physical distance between the TCP connection end nodes beyond 2 hops.


Satisfaction is a specifically introduced quantity that grows proportionally to the goodness of the results returned by each queried peer [15].

we compared the routing strategies presented in Section 3.4 together with the Global IP-based (GIP) policy, which is a variation of the Global (G) mechanism: A direct connection is established between the current peer and the peer chosen for the following step, avoiding the hops needed to reach it in the original network topology.


Rate-Caution: If the RA algorithm without Rate-Caution would increase the rate by amount V (there was no congestion in the network), with Rate-Caution that value is: RX.Y - BX.Y V' = V · max1 - C ,Cmin BX.Y where C and Cmin are two constants.

v' decreases as the .ow s current rate increases further above its guarantee.


2.2 A Security Model Using Digital Watermarking Techniques Digital watermarking provides an alternative approach to ensure the safety of multimedia data during transmission in openly accessible channels.

digital watermarks may be generated referring to information on originators, receivers, unique serial number, and time stamps.


We define four FTP flows and consider similar flow directions as for the previous topology.

in case (1), which is depicted in Figure 14, all FTP flows run from the wireless to the wired domain with the TCP source and destination entities (A1B1), (A2B2), .


Instead, HTTP caches are currently de.ned as storing response messages.

an HTTP cache entry does not store what a resource is; it stores what the resource says.


Therefore, the adjusting phase takes each BS s power and bandwidth limitations into consideration by removing some user devices if necessary.

we adopt the Shannon theorem [20] to check whether the overall demand from the user devices in a cell exceeds the maximum power and bandwidth supported by the BS.


Similar in principle to the main idea in [16], are the solutions proposed in [25] and [23].

in [25] authors propose to move the burden of storing and maintaining the binding cache list from the correspondent node to the border router of the correspondent node s network.


RELATED WORK Our work builds on WFQ [10, 24] as it, in similarity with many GPS approximations [18, 9, 17], uses the notion of virtual time.

we approximate virtual time using start times as in SFQ [18], as it helps us avoid knowing in advance what middlebox modules a packet will traverse.


Further, (d) for 1 = d = 3, the average correlation qt is exactly the probability that at time t, a randomly selected pair of nodes at distance d play C.Thus for 1 = d = 3 and * (d) t = t , the evolution of qt is similar to the evolution of the pairwise correlation in an in.nite k-regular tree.

using (15), (12), and (13), for 1 = d = 3 and t = t * ,wehave: (d) 2 (d) 2 (d-1) 2(k - 1) (d+1) q=(1 - )qq+ q, tt-1 + t-1 t-1 n nk nk (16) Since at time 0, a random pair of neighbors play C, (0) (1) (d) we have q=2/n, q=2/(nk),and q=0,for 00 0 d = 2.


In contrast, we argue that pervasive computing design should explicitly consider and minimize environmental impacts as a separate parameter from cost.

the costs of environmental impacts should be included in the design process, and methodologies developed so that the present value of these future costs can be compared on an apple-to-apples with other costs.


We further analyze the CPU consumption with oprofile and .nd that the bottleneck is in the Linux kernel, consuming 50 to 60% of the CPU cycles for TCP/IP processing.

tCP connection establishment handling in the kernel does not scale with the number of CPU cores.


CONTENT-BASED INCENTIVE SYSTEM We expect there are at least three kinds of .nancial incentives to DACON participants: (1) isolated marketing, (2) local networked marketing, and (3) distribution commission.

three kinds of pro.table contents can be delivered to DACON users from the standpoint of the DA-CON AP (or its owner).


video streaming from a server on the Internet).

traffic patterns are normally asymmetric, with little uplink traffic from the STAs, but a large amount of downlink traffic from the Access Point (AP).


In this work, we assume that the link from v1 to v2 only transmits the tra.c from v1 to v2.

wireless links are attached to the edges of the wireless transmission graph.


In addition, geographic forwarding suffers from the hole problem called local minimum phenomenon [2].

that is a node none of whose neighbors locates closer to destination than itself, e.g., node I in Fig.2.


Second, since projection is inherently erroneous, conclusions drawn from network roadmaps should be qualitative.

in using these projections, the designer should look for trends and changes in trends (in.ection points).


Moreover, recent work shows that even non-infrastructure events may also have an impact on BGP.

[2] ob-served that the Code-Red/Nimda worm attack was closely correlated in time with a large spike in the number of BGP routing updates from multi= ple ISPs received at a monitoring point.


We want to guarantee consistencyby construction.

we want the following theorem to hold: THEOREM 1.


The achievable rate of O(1/ log2 n) in worst-case sensor networks shows that in the physical model, the price of worst-case node placement is small, at most a logarithmic factor, whereas in the protocol model, it is signi.cantly higher.

by making use of speci.c physical SINR characteristics, the physical model allows for rates that exceed the rates achievable in the protocol model by an exponential factor.


By squarely focusing on the analysis of the Web server-related portion of the traf.c seen by our IXP and applying an original methodology for identifying server-based infrastructures, classifying them by ownership (e. g., company, organization), and associating traf.c with them, we show that many of the major commercial Internet players are actively contributing to a clearly discernible trend towards network heterogenization.

many of these players networks are undergoing major changes as a result of business decisions that either favor the hosting of servers from third-party networks within their own network infrastructures or the deployment of their own servers, often in massive numbers, in purposefully-selected third-party networks.


COMPACT ROUTING ARCHITECTURE FOR MOBILITY While the compact routing architecture described above has been de.ned only for use in static networks, the attractive features of the architecture merit to be extended to the mobile situation.

a key issue of supporting mobility is to update the routing tables after a mobility event has occurred.


Second, on average, over 70% of BGP .ags were seen in the previous days.

the .agged BGP announcements were relatively stable; the majority of them do not change frequently.


Using simulation, we present the performance of the proposed algorithm with various zoom-in-zoom-out techniques and show that it is simple yet e.ective in achieving its design goal.

we show that the performance of our algorithm is comparable to that of a greedy selection algorithm, which requires global information and excessive computation.


Indeed, one can choose one of the H rows at a time, order the columns in O(N log N ) time according to the just chosen row, consider all the H - 1 pairs of rows consisting of the just chosen row and every other row, and .nd in O(N) time the best border B1, for a total of O(H(N log N + NH)) time.

consider now the particular case when there is a way of indexing the columns of D that simultaneously sorts all the rows of D. arranged the columns of D in such a way that a given row is sorted in non-increasing order, all the rows of D are sorted in non-increasing order of their bandwidths.


These symbolic protocols are given an obvious computational interpretation, with, compared to other works, only very mild tagging requirements; basically, only pairs and keys are tagged.

we do not require ciphertexts to carry any auxiliary information.


[7], we also show that L2 devices at a hop i do not affect the capacity estimate of subsequent hops.

the underestimation effect of L2 devices is limited to only the L3 hop that includes those devices.


Note that we can run over all elements of the star by running the parameter .in (8).


Pre.x Length Memory Required Initialization (kB) Time (sec) 16 1024 0.029 12 16384 0.455 8 262144 7.285 4 4194304 (not feasible) 0 67108864 (not feasible)  4.5 Discussion Our results above show that our trie-based method for network address generation is a good .t for network simulation and emulation environments.

our approach produces addresses  Average time to generate one address (sec) 2e-06 4e-06 6e-06 8e-06 .


Then, we have the following fact: Observation I : For a link (i, j), if tij =-0.2272, Then Uij ( tij ) is a convex function.

if for a link (i, j), the success probability tij in a single time slot satis.es: t ij tij = e = 0.7968, then Uij ( tij ) is a convex function.


The packet payload uniquely determine which packet is being acknowledged.

route pseudonyms can be embedded in the ACK s payload to acknowledge an RREP/RERR packet or application data packet.


In a previous work of ours [24], we have shown how to embed a sensor network such that all the boundaries (both outer boundary and inner hole boundaries) are circular.

we .rst extract a triangulation of the sensor network.


We expect that the instantaneous changes of NVR(t) should not exceed a threshold e(.t).

given a network and nodes with certain characteristics (more/less mobility of nodes) we de.ne a maximum value for NVR(t).


The detailed investigation highlights the advantages and disadvantages of each approach and its suitability for a certain network and user pro.le.

we demonstrate that DSR and ZRP behave very well in networks of low mobility, as shown by the high message delivery rate and the small message delivery delays they achieve in this case, while the RUNNERS performance is less dependent on the mobility rate (actually, it seems to bene.t from high mobility rates).


We question the environments where EQSs are commonly assumed to be more appropriate than classical quorums, and vice-versa.

we argue that EQSs may not always be advantageous over CQSs in mobile networks, while EQSs can outperform CQSs in high-throughput agreement in strongly-connected environments.


One way to resolve this dilemma is to use a dedicated control channel for opportunistic spectrum accessing nodes.

the regulatory agencies would allot a channel specifically for this purpose.


The k-connectivity of wireless networks has been studied in [16], [17] and [18].

[16] investigated k-connectivity in the context of fault-tolerant networks.


We also observe, as expected, a severe bias in the rate allocation under the MaxCap approach.

t1oalone accounts for over 48% of the sum of total rates among all the AFNs.


Extra bytes over the minimum of 4 bytes are added by BMAC to take care of time uncertainty between the nodes.

addition of 1 byte allows a leverage of around 416µs.


In this paper, we advocate a model-based approach as an e.cient and scalable way to explore the energy-performance tradeo.s during the design.

we show that it is possible to de.ne systemlevel models to describe wide classes of WSNs, providing a quick and accurate network evaluation.


A.1 Detecting Replicas We detect replicas of the same packet crossing a link by de- termining whether two packets are replicas of a looping packet.

two packets a and b where b is observed after a are considered to be replicas of a single looped packet if their headers are identical except for the TrL and IP header checksum fields; their'YI'L values differ by at least two; and their payloads are identical.


We process the complete temporal graph during peak and o.-peak hours with directed links, using windows of .ve minutes.

we measure the average temporal correlation coe.cient C of the neighbour set of a station i between two successive graphs of Zt w by deriving the temporal correlation coe.cient of each bus station Ci: i Ci C =(1) N T -1 1 j aij (t) aij (t + 1)Ci =  (2) T - 1 t=1j aij (t)j aij (t + 1) C = 1 if all graphs in the sequence are equal.


We believe it is reasonable to assume that sensor networks can be tailored to the sensing task at hand.

this means that intermediate nodes can perform application-speci.c data aggregation and caching, or informed forwarding of requests for data.


Although providing strong con.dentiality, this method fails to support ef.cient query processing.

m need return to the network owner all the encrypted data it collected from {Si}N in the speci.ed epoch, as it cannot locate the en i=1 crypted data items exactly matching the query.


if (flight sizen == rcv bytesn) (5) targetn+1 = snd cwnd max if (targetn == snd cwnd max ||targetn  tmp targetn) (7) targetn+1 =(tmp targetn + targetn)/2 (5): flight sizen means FS and rcv bytesn means rcv bytes during the nth period.

all the pack ets in transit during the nth period5 are received and 5Each period is equal to rtt min.


=z ¯ In order to maximize ., we conclude that we should set i = 0 for i = z since pi - pz = 0.

all symbols should be allocated to the best path.


As depicted in Figure 3, a graph representation suitable for path brokering is obtained by having each edge represent one transit service instance offered by a given operator and each vertex represent a point of interconnection between operators.

by having vertices represent operator data exchange points (where data is handed from one operator to another), and edges represent transit services offered from one exchange point to another by a given operator.


sult, even if constructive interference happens between the two signals , it may not be decoded correctly at the reader 1 since S1 and S2 have di.erent information bits.

rSSI may be high due to constructive interference but packet loss would be high as well.


This paper .rst presents an empirical study that demonstrates the potential bene.ts and design guidelines for robust topology control in indoor environments.

we found that RSSI and LQI are not always robust indicators of link quality in indoor environments and that pro.ling links even for several hours is not su.cient for identifying links whose PRR is consistently high.


One of the main motivation of this interest is that the energy consumed by such huge number of access networks is largely wasted in the periods of time when the number of users served by the wireless access network is low.

these access networks are dimensioned based on the peak hour tra.c, so that when tra.c load decreases (e.g., during the night) they are over-dimensioned.


This can be explained by the fact that only some operations benefit from larger bus sizes while others, such as branch operations, do not.

the Atmega is a remarkably efficient RISC architecture that fares well considering its small bus width.


As pointed out, our algorithm does not employ a uniform (or near-uniform) power allocation scheme, because any such strategy is doomed to achieve a bad worst-case capacity.

in scenarios with widely di.erent link lengths (e.g.


Since hvx = I x where I is the identity matrix, each client only receives the data intended for itself.

the clients cross-talk interference is pre-cancelled by the dAPs.


Due to their unique characteristics, QoS in MANETs is possible only if supported by the underlying medium access technology [1].

the network-level QoS mechanisms cannot work in MANETs, unless the MAC ensures orderly access to the shared wireless medium, playing a Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


Here we consider a p-persistent CSMA protocol.

when node i decides to transmit data, it .rst chooses one of its outgoing links (i, j) with a probability qij , and then contend for channel access with persistence probability Pi after sensing the channel idle.


Indeed, as the number of interfaces of a switch increases beyond some value, we need to replace it with a di.erent chassis that can support more interfaces.

the true energy savings may be written as, E[overall energy savings] = C(c,m)+I(a(m+c)+(1-a)(K1+K2)) (4) C(c,m)+I(m+c) where C(c, m) is the cost of the switch chassis supporting c end-hosts and m inter-switch links and I is the per-interface energy cost.


Also, since the usage vector is schedulable, at any instance in this schedule, the links that are active are not in con.ict with each other.

the vertices corresponding to these links must form an independent set in the con.ict graph.


Due to the limitation of the hardware, we can not assume that the bu.er is in.nite.

we have to try to .nd the su.cient size of the bu.er while keeping it as small as possible.


For simplicity, delay is measured by the hop number from the source to the destination [8].

given a delay requirement of T hops, the task is to assign each node a transmission power or transmission distance, such that each node can construct a path to the sink node within T hops.


When enabled, this feature guarantees contiguous transmission and delivery of multi-.it packets.

this guarantees that once a packet starts being delivered it will .nish before any other packet is delivered.


In the peer-to-peer mode, end-segment bandwidths are measured by system nodes themselves in a cooperative fashion.

each system node chooses a subset of other system nodes as peers to conduct Pathneck measurements, so as to cover all its end-segments.


Li and Li in [20] have shown theoretically what can be the maximum throughput improvement with intra-session NC in undirected networks, compared with what can be obtained with integral, half-integer and fractional routing.

for the multicast problem, the throughput increase ratio is upper-bounded by two between NC and half-integer routing, or even less with fractional routing [20, 24].


We begin in Section 4.1 by considering the anonymity of a single connection.

we use trust to obtain an algorithm that improves the posterior probability that an adversary assigns to a given user as the source of a connection given trust levels and the adversary s observations.


All partitions are singleton partitions.

a replica is partitioned away from the rest of the network.


It is important to note there that, as the number of nodes in the network increases, the percentage of nodes that need to become relays in Spray and Wait to achieve the same performance relative to the optimal is actually decreasing.

although the performance of the optimal scheme also improves with M , the performance of Spray and Wait seems to improve faster.


(3) the resulting series is the di.erence between two observations of the original series, d time units apart.


Then the de.cit counters for all the chosen clients in MU-MIMO transmission are decremented by T, while those that had outstanding packets but did not get selected are incremented by nT each, where n m is the number of antennas participating in MU-MIMO transmission and m is the number of active clients not chosen for the transmission.

the current service (nT) is distributed equally among the non-scheduled clients to guide the schedule towards a fair allocation.


Implications can be utilized to save the total energy cost of query processing.

when we process a query involving multiple sensor networks, the data from previously queried sensor networks can be used to partially infer the data of the subsequently queried sensor networks.


The result of this work and the contribution of this paper is our solution to achieve subscription language independence for the DENS.

the DENS can be extended with an arbitrary subscription language and once a new subscription language is plugged into the DENS it is supported by the DENS side by side with all other subscription languages that have been plugged in earlier.


The outcome of this traversal can be a set of possible destinations, including none (black hole), or may result in a routing loop.

while traversing a forwarding graph, if VeriFlow encounters a node twice, then it concludes that insertion of the new rule will result in a routing loop.


The handoff is automatically initiated by the client when there is a drop in 802.11 connectivity or when an 802.11 network becomes available.

for scenarios 2 and 3, when user B has to move from the IP network to the cellular network, it performs the handoff by calling with its cellular interface the gateway.


(Two machines on the author's desk can communicate at that speed.)

fragmentation during high-speed transmission may be problematic.


Given the inherent hardness of general packet classi.cation as a theory problem, some researchers have proposed to reduce the number of rules in a given rule set in order to improve the e.ciency of packet classi.cation.

in his Ph.D. thesis [6], Gupta identi.es backward redundancy and forward redundancy.a rule ri in a rule set R = {r1,r2,··· ,rn} is backward redundant if and only if Rcontains some other rule rj such that (1) j<iand (2) the de.nition region of rj contains the de.nition region of ri.A rule ri is considered forward redundant if and only if Rcontains some other rule rj such that (1) j>i,(2) the de.nition region of rj contains the de.nition region of ri, (3) ri and rj have the same decision, and (4) for any ksuch that i<k<j, either the de.nition regions of ri and rk do not overlap or ri and rk have the same decision.


if the long-term average throughput of each client n is at least qn jobs per interval with probability 1.

k 1 lim inf K 1(a job for client n is accomplished in the K.8 K k=1 kth interval) = qn, with probability 1, for every client n, where 1(·) is the indicator function.


Using the available bandwidth as cost metric requires us to modify also the local objective function for computing BR wirings.

thebest response for vi may be based on a wiring si that maximizes the aggregate bandwidth out of a node given by max min(AvailBW (e(vi,w)),AvailBW(w,vj)) w.s vj .V-i The above objective calls for the maximization of the average of the bottleneck bandwidths to all destinations.


With these messages, it is possible to get, add and delete information about the interfaces.

the following messages are building blocks of the NLng protocol.


In each step of the binary search, given a minimal delay A[i]anda maximum delaydi.erence bound di, we use a greedy set cover algorithm to pick the M hubs.

we pick one hub at a time; the selected hub covers (connect clients and servers through the hub) the maximum number of uncovered client edge routers.


For simplicity, we slightly modify this order: we separate nodes by re-numbering all n leaves to negative indices (without changing their order), and the internal nodes to indices 1 to n - 1 (also without changing their order).

for internal nodes, we shrink the sequence that remains after having moved the leaves.


Recently, software-based channel hopping has received attention as a jamming countermeasure.

proactive, or periodic, channel hopping has been studied more extensively than reactive hopping.


In our work, we highlight the need for using and analyzing measurements from real networks in addition to testbed-based evaluation methods.

related work on alert correlation and aggregation can be classi.ed in three categories.


They are at the same time suitable for hybrid wireless sensor network thanks to their powerful computing and communicating capabilities.

we think mobile phone is the preferred alternative since it is not only much popularized but also with comprehensive support of cellular infrastructure.


The cell radius is R, and the distance from BS to FRS is R1.

we assume R1/R equal to 2/3 through this paper.


To avoid additional messages, all the management data needed by the adaptive distribution process are piggybacked into mobility beacons.

when a node sends its own beacon message, it piggybacks three parameters: i) a Local Query Load Factor (LQLF); ii) a Data Keys List (DKL); and iii) a Data Repositories Diversity Factor (DRDF).


Such links have significantly higher latencies than traditional land-based technologies.

they could easily have latencies higher than the timeout for detecting lost packets.


We use trust information to solve this problem.

we divide all ratings into several segments, separated by the peaks on the mean change indicator curve.


In this paper, however, we present what we believe to be the first ever set of experimental results that highlight the fact that WLAN devices from different vendors in the market can have heterogeneous MAC level behavior.

we demonstrate with examples and data that in certain cases, devices may not be conformant with the 802.11 standard while in other cases, they may differ in significant details that are not a part of mandatory specifications of the standard.


While the vision of a network-wide RE service is appealing, realizing it in practice is challenging.

extending singlevantage-point RE solutions designed for enterprise access links to the network-wide case is inef.cient and/or requires modifying routing policies.


[0,1] such that if p0 > p0; c, then a spectrum contention protocol induces a glocal cascade of spectrum contentions with probability 1.


We acknowledge that most mechanical and electromagnetic waves follow the power law decay in propagation.

in open space, inverse-square law(i.e., k =2)[9] appliestovariousphysical signalssuch as sound, light and radiation.


If the next hop is unavailable, the node uses a greedy moving (GM) scheme.

it moves in the direction towards the next-hop node which is geographically closet to itself and closer to the destination than itself.


It informs the controller that when a packet pkt is received, all new packets newp that match the rule body should be sent.

the new packet must be sent out the port dictated by the learned relation (line 6), on the same switch as received it (line 7).


m For a given client in the last cell, if an AP in the previous T -1 cells uses one spare antenna to cancel the interference to the client, the client can be considered to equivalently have Nt -Kt additional antennas for canceling this AP s interference.

one can transfer the interference cancellation capability from an AP to a client it interferes with by providing the client such equivalent antennas.


R simply creates another record for this speci.c connection and does not associate the two connections in any way.

it never tries to 12We secure in quotes here because we don t mean strong secu rity.


NODE Expected LOAD The above formula is used to decide whether a load change can be tolerated by a node, without requiring load redistribution in order to preserve the load balancing property of the K-D tree.

when the load change Dload is relatively small against the expected load of the node, new data points are added to the node without violating the requirement for an overall load-balanced tree.


Then we studied the impact of restoration using the concatenation of these basic paths, by randomly sampling failure cases.

for example, to study the impact of single link failures, we randomly chose source-destination pairs, SR and DR. Then we simulated a link failure for each link, L, in the basic LSP connecting SR and DR. we calculated a new shortest path from SR to DR, (the backup path) and determined the smallest number of basic LSP's whose concatenation is the backup path.


Keynote I: Ad Hoc Networks, IETF, and Convergence in Solution Space Charles Perkins Nokia Research Center Abstract Within the IETF, the working group for Mobile Ad Hoc Networking (MANET) has recently made new steps towards standardizing new routing protocols.

there is now a document specifying a new protocol called DYMO (for Dynamic Mobile Networks).


Similarly, .-outputs are treated as values provided by the appropriate copy of F.It is shown that p and p. have essentially the same input/output behavior.

if p securely realizes some ideal functionality I in the F-hybrid model then p. securely realizes I from scratch.


Both schemes require a conversion of binary requests R[s] into corresponding one-hot representations RFsd with RFsd=1 if R[s]=d, and RFsd=0 otherwise.

each input s presents a bit vector RFs=(RFsN,...,RFs1) to the FS.


Table 2: Manhattan vs. Mesh-of-Trees nel down to connecting each base channel domain only once.

we decided to connect each input or output with T × C switches, and to balance those switches over both sides and base channel domains (See Figure 11).


The varying color depths represent macroscopic canopy closure in different local areas.

figure 12 is an intuitive display of canopy distribution and does not represent the ground truth.


Analyzing our data reveals the fact that NTT America accommodates large subnets of mask /20, /21, /22 whereas other ISPs mostly host small subnets of mask /30 and /31.

small number of large sized subnets hosts more IP addresses than large number of small sized subnets in our .gures.


The architecture requires very few changes to existing protocol stacks.

no changes to nonmobile hosts is required.


A common approach to allow for uncertainty (say, because of prediction errors) is to include some engineering overhead, or over-dimensioning.

instead of designing a network to carry the predicted tra.c, the network is designed to carry this tra.c, multiplied by some safety factor.


5.5 Summary of Evaluation Our experiments have shown that our forwarding algorithm has good absolute performance and good cost amortization over a variety of loads.

we found that: the basic short-circuit evaluation of .lters greatly reduces processing time in the case where a single message may match a large number of .lters;  the use of the selectivity table improves the ability to short circuit the forwarding function, reducing the matching time up to 40% in the critical cases of routers with numerous interfaces and especially in the extreme case of centralized routers; and  the use of the selectivity table has no measurable costs over the basic algorithm.


Therefore, the cost of EC(DT ' ) is at least opt c(MST (KG)) since MST (KG) is the minimum cost tree spanning all dominators and the edge uiuj in MST (KG) corresponds to the path with the least cost between ui and uj .


Furthermore, we assume that u believes with certainty either that a observes all links from u to the routers and destinations or that a observes none of them.

u believes with probability either one or zero that {u, v} is compromised for all v .


Further investigation uncovered the main reason behind these observations: the predominant use of YouPorn s browsing options.

this is driven by the apparent .exibility that most users have when accessing adult media: they do not seek a speci.c video, rather, they search for any video that falls with certain (broad) interest constraints.


Then, checking whether the runs of A are such that the conditions of Theorem 1 are satis.ed will allow us to determine already at an early stage (i.e., before developing a detailed correctness analysis) whether it is worthwhile to explore A further.

if (dec-D) can be satis.ed in some runs, i.e., (A) holds, the algorithms is very likely .awed, as the remaining conditions are typically easy to construct in su.ciently asynchronous systems.


For example, the rate is 89.93% for bt that means our iterative method can automatically extract 89.93% from all unknown .ows in the unlabelled dataset.

we can successfully obtain the representative samples of unknown applications.


If we use p ' to denote the uniform detection probability, then Eq.

(9) is further simpli.ed as follows: p =1 - (1 - p ' )m (10) tw the value of m is equal to tc ,here tw is the duration in the e.ective scanning window, and tc is the average duration of a query cycle.


It is chosen such that when c = d, H2 = 32 H1.

when c = d, the second source generates half the .rst node s amount in terms of uncorrelated data.


In this way, the running time of the control plane is decoupled from the switch speed.

the control plane only needs to recompute schedules fast enough to keep up with shifts in the underlying traf.c patterns, rather than with the OCS switch speed.


Hence, for studying convergence properties, it is sufficient to define the state of the BGP system in terms of the route chosen by each BGP speaker.

we assume that each speaker remembers only its own best route, selected from the set of routes exported by its neighbors.


.rst avoidance method is to divide the entire simulation area into two disjunct zones (as in [18]): a border zone Ab with a width of at least r0 and an inner zone Aeff .Only nodes that are located in the inner zone are considered for the statistics of the simulations.

links connecting an inner node with a border node are only counted for the inner node.


In (1), Sj is the length of each segment in the propagation path, and D(·)is a function to model the dual-slope path loss behavior.

{ x x>xbr D(x)= xbr , (4) 1 x = xbr where xbr is de.ned as the breaking point for changing the slope in path loss model.


This process is performed by having each node periodically send out hello packets, which carry the node s identity, its current weight and status (either a clusterhead or an ordinary node; clearly at the start of the algorithm the status of a node is undecided).

the node with the bigger weight in its (one hop) neighborhood will declare itself a clusterhead.


Consider the collection of all connections with initiator node i and a responder node j.We use fij to denote the portion of the total bidirectional tra.c due to these connections that is in the forward direction.

fij denotes bytes contained in forward tra.c divided by bytes in forward plus reverse tra.c, so 0 = fij = 1, .i, j Next we consider the total tra.c due to connections initiated at node i, i =1, ..., n, which we denote Ai (for activity ).


STEP-2: Compare the distance dij with the Lmax,j of the corresponding RN sj .

sTEP-3: Vertices are prioritized based on the number of reachable RN s which satis.es dij = Lmax,j .the vertex that has less number of RN s will be considered in a higher order.


The concept of spatial mappings is too general for spatial networks.

not every spatial mapping represents a spatial network.


This design dramatically facilitates the extension of DBRP.

the integration of new features in DBRP can be made by creating new TLVs.


number of VIPs for ob ject k arriving to node n during slot After being forwarded through the network (in the virtu t may be less than P a2N µan al plane), the VIPs for object k are removed at the content k (t) if the neighboring nodes have little or no VIPs of object k to transmit.

source src(k), and at nodes that have cached ob ject k. the content source and the caching nodes are the sinks for the VIPs.


However, under IFR mobility patterns such as RWP model or MC3 in Section 3.3, we have Age(A,D) =Age(B,D) .

res(A,D) =st Res(B,D), (17) which implies that a mobile node that is closer to D in distance will now spend stochastically longer time to meet the destination.6 while indeed successively .nding better nodes (in terms of smaller residual lifetime with D) under DFR type mobility patterns, the same algorithm based on age information as above may choose worse set of nodes for IFR type mobility patterns.


(We omit results for SURBL because we lack suf.ciently long data from it to compute a comparable distribution.)

for all .com domains that appeared in either URIBL or our spam trap from March July 2012, we determine the domain s date of registration, and plot the difference between that time and the .rst such appearance.


This implies a payload size of 160 bytes when the encoder used is the G.711 and 20 bytes when the encoder used is the G.729.

the RTP sender agent must update the sequence number and timestamp of each outgoing packet depending on the codec used in order to allow the decoder to resynchronise the received stream and to detect packet losses.


(2) Quantitatively, the relative magnitudes of the rotations (ei) of the links are determined by the relative magnitudes of the Euclidean lengths (|li|) of the links.

the longer the link, the greater its rotation.


Obviously, a task often involves multiple things, i.e., UIDs.

those things need to work collaboratively to accomplish a task.


As derived earlier, a folded tree of 8 PEs will execute 15 AU s over 4 time periods or 3.75 on average.

the folded tree must be compared to the equivalent of 3.75 MCUs.


should only occur when the destination is disconnected.

if the destination is connected, the face-change rule must always .nd a face closer to D than the current face along line segment SD.


This results, between 0 and 30s, in allocating half of the available bandwidth between the two active users.

the HD TV runs at 4000kbps and the smartphone at 1000kbps.


over-estimates) the measured response time of the ERP system.

the estimate Rcpu obtained from the Dcpu parameterization suggests that the est CPU processing time and the DB data provisioning times are alone insu.cient to fully explain the service demand of the requests.


This basic cryptographic mechanism provides authentication, integrity and nonrepudiation services on the premise that binding of public keys to signing entities was properly performed.

in order to validate a signature, .rst of all, one should trust that there is an authentic link between the corresponding public key and its owner.


It is easy to verify that M. = M + aiai .

m. can be derived from M using a rank-1 matrix update.


However, very little research has been conducted on using network coding for delay-constrained traf.c.

schemes that require the basestation to obtain feedback information frequently [3,10,14] are not practical except for small-sized networks.


This paper proposes a new approach for the construction of the broadcast program.

it presents three new algorithms, which face the problems of the Broadcast Disk Technique.


On the other hand, the results for the downlink are di.erent.

there is a distance where the optimal rate drops abruptly to zero; this is the distance after which the net utility becomes negative for any positive rate, hence the user bene.ts most by not sending data.


This can be explained by the widely used no-valley routing policy.

when an AS obtains an alternate route from its peer, it cannot transit the route to another peer.


As we assume that every link in the networks would have the same TCP round trip time [5] to simplify our analysis, the effect of queuing delay and bu.er size in the routers is negligible.

t (n)= nT (1), where n is the node level.


The cost for correlating L o-1 with an operator graph is therefore l=0 .e(l) .c(l).

the following inequation must hold for our approach to be better in terms of bandwidth: L L o-1 o-1 n (l) .c(l) >q ((l) .c(l)+ .m )(1) l=0 .el=0 .eCv L .


WEAK-VALIDITY CONSENSUS If consensus is only required to satisfy weak validity, then it is possible to overcome some of the lower bounds discussed in Section 6.

in this section, we describe two algorithms that do not require collision freedom (Property 1).


And the key difference between our model and Bianchi s [7], Haitao Wu s [8] is that we consider the collision probability even when the back-off counter works.

the counter will be decremented by one with the probability P every time slot, and will freeze with the probability 1-P.


The operators validated that the network indeed implements two such units.

the network controls the 0.8 reachability to a speci.c collection of subnets(all of which were attached to a given router) by preventing route announcements to 0.6 the subnetsfrom reaching other routers(thisis achieved using the Fraction of subnets that arereachable from policy unit Fraction of hosts appropriateroute .lters).Thissmall collectionof subnets,however, were reachablefrom the rest of the subnets attached to the router.


tracescapturedat asingleNew ZealandISPbothbeforeand after the law came into e.ect.

the number of residential DSL subscribers that were using each application protocol as well as the volumes of tra.c downloaded and uploaded by those users were examined.


A message sent over a link (vi,vj ) is possible if there is no simultaneous transmitter vz such that vj is in vz s interference range Rzint .

two time-spectrum blocks Bk gh(te,.te,fe,.fe) are mutually ij (tk,.tk,fk,.fk)and Benon-interfering if one of the following conditions is satis.ed.


Performance of the other methods is much inferior to MCBR and MCBRF because of poor combination of link distance and remaining battery energy.

mWIS and MCDS have a lot of leaf nodes in broadcast trees but they do not consider the remaining battery energy.


We divide the time into discrete steps, where a step is the arrival time between packets at an input.

during each time step one packet can arrive on each input port, and one packet can be forwarded from each output port.


A reports µ ' = |S ' | to B,and B veri.es A s claim by checking that all the distinct elements from S are present in S ' .

the test checks that µ ' is an upper bound on µ.


DATA ANALYSIS Certain ISP behaviours affected the measurement data we could collect.

it appears that Sky blocks ICMP traffic to the first hop within their network for all the Sky ADSL based access links we examined, and so we could not easily determine latency related measurements for those links.


If RSS is above predefined threshold (RSS_Th), intermediate node forwards it, otherwise it gossips with probability p = 0.66.

an intermediate node certainly forwards RREQs only if they have been received along a good quality link, else it forwards it with a lower probability value using the gossiping approach.


When aggregating service information using Bloom filter, we have to consider every possible combination of service attributes as input w to the hash functions.

all descriptive attributes and their possible combinations must be encoded, in advance, into the filter for later retrievals using the same words as a query.


Yet, we see that there is a reasonable correlation between the signal strength with which each packet was received and the data rate it was sent at.

the wireless channel is somewhat (but not completely) symmetric.


PL = (1 -- pB)(1 --pv) + (1 --PB)PuPw +PBPw" (8) Proof: A direct transmission from host X to host Y succeeds in WAR if Y receives the packet either from X or from a wit- ness of X and then X is informed about the success.

the transmission succeeds if: 1. the link is not broken and it is bidirectional, or 2. the link is not broken, it is unidirectional and a witness delivers the packet, or 3. the link is broken but a witness delivers the packet.


They are updated regularly L time apart.

the decisions are made at times Tk, where Tk = kL, k .


More importantly, these heavy users exhibit strong temporal and spatial clustering.

they tend to concentrate in a few locations which are already crowded with a large subscriber population, e.g., large cities, and form many hotspots, where a signi.cant increase of traf.c volume is observed from these heavy users.


Degree of a node and average degree of its neighbors exhibit assortative mixing on average.

users with high number of contacts tend to connect to other users with high number of contacts.


SYSTEM Anticipating to the analyses in Section 3, this section presents background on the application, the system architecture and its implementation.

it describes the tiered network architecture typical of habitat monitoring applications and the design and implementation of its core components.


Can voice calls incur other negative performance impact beyond throughput degradation?

we will illustrate cases of application abort when voice calls are underway and identify their root causes (Section 6).


Table 2 reports the main .elds of such dictionaries along with their description.

the .eld end_index has di.erent meanings depending on the type of video stream: 1) in the case of live streaming (is_live is true) it is the index of the last chunk of the current playlist; in this case end_index increases when a new chunk is made available by the the HTTP server; 2) in the case of video on demand (is_live is false) it represents the index of the last chunk of the video.


Thus, existing MAC protocols using periodic sleep method for low power consumption have the latency due to the periodic sleep.

since existing MAC protocols are designed for sensor devices required low power consumption, the WBAN MAC protocol should be designed for both medical and CE applications .exibly.


IDRM has been designed to e.ectively address the two main challenges identi.ed above.

it employs a proactive routing for inter-domain gateway communication to readily detect any topology changes (within a domain and among domains), and adapt to those changes.


Nodes within a given subset Vi do not interfere with each other, but do interfere with all other nodes.

there is an edge {v,w}between two nodes v .


Handover scenario in heterogeneous wireless networks In bi-casting tunneling, the packets from HA/CN can be transmitted in parallel.

the same packets can be sent from the MN to both routers in WLAN and GGSN simultaneously and received in a similar way for a certain period of time.


Sustainable operation constitutes the primary goal, while application performance represents the secondary goal whenever the energy input allows it.

we aim at achieving max sustainable performance.


To do this, we setup a .ow from S12 to S01, thus passing up to 7 hops, depending on MeshDV version used.

using MeshDV-HC,the number of hops was continuously .uctuating between 5 and 7.


3.1.2 UserContactsandAccesstotheInfrastructure We will assume that users encounter each other according to independent Poisson processes.

we assume that each user m .Ci encounters users from class Cj according to a Poisson process with rate .i,j = 0.


Recent theoretical results suggest that in the worst case sel.sh routing can result in serious performance degradation due to lack of cooperation.

roughgarden and Tardos prove that the price of anarchy (i.e., the worst-case ratio between the total latency of selfish routing and that of the global optimal) for sel.sh routing can be unbounded for general latency functions [31].


We also considered the effect of the energy saving speci.cation as a parameter to the performance of the network.

we adjust Ts to different initial values while maintaning Tw .xed.


if k+ 10.5599p0 = 6.2588, a global cascade occurs.


After classifying the header fields, the main idea behind compres- sion is to send only the information that is needed to reconstruct the header.

only the delta and random fields need to be sent per packet in the common case.


2.3 Lack of Support for Network Functions To summarize, by focusing solely on the service model, PaaS o.erings do not provide network functions the support they need to function well.

the PaaS must allow network functions to: Move close to data streams.


In addition, for security reasons, the functional composition is sanity checked at kernel space to avoid possible kernel panics.

the signature of the various functions along with their argument types are veri.ed, and the presence of loops in the tree is avoided.


The .rst approach is Sequential rate adjustment, which means to increase (or decrease) the current rate by one level when the channel is good (or bad).

the rate is adjusted by at most one level at a time.


In this work, we take the stance that rather than eliminate middleboxes or completely rearchitect them, we should attempt to integrate them into the SDN fold in a minimally intrusive way.

to this end, we identify .ow tracking as a key capability for policy enforcement in the presence of dynamic traf.c transformations.1 we need to associate additional contextual information with a traf.c .ow (e.g., which user initiated it or whether the response was cached) as it traverses the network, even if packet headers and contents are modi.ed.


It can be shown that the FPL strategy has provably low regret.

if we de.ne constants D, R, and A such that, .O, O ' .O,D =|O - O ' |1 (i.e., maximumL1distance between anytwodecision vectors)  .O .O,S .S,R =|O.S| (i.e., maximum possible value ofthe costfunction)  .S .S,A =|S|1 (i.e., maximumpossibleL1-normof the state vector),  J D then,FPL withparameter o = gives, RA.


Goal 2 also leads us to another important design decision, namely individual optimization of VPNs.

in our Relaying model, a set of Relaying con.guration (i.e., the set of hubs) for a VPN does not depend on other VPNs.


What are the factors that contribute to the heavy-tailed nature of the load distribution?

how does the locality exhibited by the workload during intense bursts affect the tail of the distribution?


The cross correlation function captures the similarity between the two functions.

two signals that are similar should have a high cross-correlation near the origin and low crosscorrelation elsewhere.


The above results, with training and experimenting done by different people, tend to suggest that operator bias tends to be less signi.cant than sampling error and time dependent effects.

operator bias is not so signi.cant as to cause the results to be unstable.


Transfer Layer: Zooming in on session ON times, we charac- terize the bottom layer of our hierarchy, which focuses on indi- vidual unicast data transfers, each of which is the result of spe- cific actions performed by a client.

for live objects, a transfer is the result of a pair of requests to "start" and eventu- ally "stop" viewing a live object.


These techniques strive to (a) minimize the number of DNS requests made across the wireless links and (b) minimize the number of distinct TCP connections opened across the wireless links when web pages are downloaded.

most of the DNS lookups and short-lived TCP connections are pushed to the wireline part of the network, making the wireless part behave like an FTP session.


The results show again that OLIA balances congestion in the network and reduces the loss probability in bottlenecks much better than LIA.

we observe that by increasing N1 from 0 to 3N2, p2 increases by a factor of 2 using OLIA, whereas the increase is in the order of 4 to 6 times when using LIA.


What is important is the existence of such a distance within which reception performance should be optimized and that this distance depends on the driving context.

neighboring vehicles can have di.erent target distances.


3.4.2 Event Filtering The content routing optimization uses the covering (or containment) relation between the spatial representations of newly arrived and the existing advertisements/subscriptions to set up .ows between publishers and subscribers.

each .ow is associated with a sub-space and is identi.ed by the corresponding dz.


Such structures have important implications for subscription overlaps.

the componentized application development model will tend to confer structure on the underlying communication subsystem, because the components will often have identical patterns of replication.


the local reduction we propose must preserve the safety property for any con.guration Nrest.


R : (M3,SM3 ) Figure 3: Neighbor Detection between initiator S and responder R. as in Ariadne [16].

in Ariadne, each node maintains a hash chain, and uses elements of the hash chain to authenticate the .ooded REQUEST.


MPC is a set of cryptographic methods that enable multiple parties to jointly compute a function without revealing their inputs.

mPC enables a number of parties to jointly provide the functionality of a trusted third party, without having to trust anyone of the parties.


To evaluate the BA model, we extractthebirthand deatheventsoflinksandnodesfromBGPdata using 90% con.dence margins provided by our model.

we record a topological change only when we are at least 90% sure that it is a real topological change.


On the other hand, the rule sB .. = sB tells us that, to preserve M, we need .


In our study, we adopt the move-based iterative partitioning algorithms since they are simple yet efficient, and independent of the characteristics of network topology.

we apply the Fiduccia-Mattheyses (FM) algorithm [10], an improved version of the earlier Kernighan-Lin (KL) method [15].


The result shows that guidance to "Wait" or "Change media" both reduce user dissatisfaction from the case where "No influence" is given.

"Change media" remains effective even when the traffic volume is large.


As a step toward addressing this issue, we describe a cheap and dirty approach to extracting the requisite measurement data from lowest common denominator data sources commonly found in production networks today.

we demonstrate a methodology for reconstructing historical network failure events inside of an autonomous system using three near-universal, yet under-appreciated, data sources: router con.guration .les, syslog archives, and operational mailing list announcements.


PROPOSED SOLUTION The proposed solution, called PREemptive algorithm for DAta Transmission (PREDAT), aims to reduce the number of redundant transmissions over the network without compromising the coverage of the event being disseminated, independently of the road traf.c condition and the type of vehicular environment.

the protocol attempts to diminish the number of message collisions and manage the data transmission to reduce the data loss whenever network disconnections occur.


This result indicates that there is cache locality at the edge network since if there ware no locality, the reduction of trafc .owing into the edge network would be zero.

in-network cache Method E can reduce not only trafc .owing into the edge network but also trafc consumed inside the edge network by increasing upload trafc which less than size reduced inside trafc.


Without loss of generality, assume that the sensor values are integers.

consider the set .= {(i, j)|1 = i = n, 1 = j = aj} (if aj =0 then there will no j such that (i, j) .


D D For intuition, we note that pe and re correspond respectively to the de.nitions of precision and recall for a particular classi.er.

this classi.er is the one that declares that a path will disappear if the path passes through e on day k. maximizing p D e and re D with regard to e yields the network element that best classi.es the paths as changing versus unchanging.


To highlight the importance of safety metrics and their applicability, we extended our existing simulation framework Veins to visualize these metrics live while the road tra.c and network simulation are running in parallel.

we demonstrate the impact of communication on intersection assistance applications.


The limit distributions of these statistics, under the assumption that nodes are distributed uniformly and independently at random in [0,1]2, have been widely studied.

it has been shown that: the longest nearest neighbor edge and the longest edge of the MST have the same limit distribution, which is double exponential.


In addition, whereas JAVeLEN requires specialized hardware with two separate radios, one for sending a Hail to an intended receiver and the other for data packet transmission, EM-MAC operates with only a single commodity radio per node; although the specialized radio hardware of JAVeLEN allows it to operate very ef.ciently in terms of energy consumption, this design limits its use on simpler, more generally available hardware such as the MICAz motes we used in our implementation of EM-MAC.

to our knowledge, EM-MAC is the .rst multichannel MAC protocol to use the pseudorandom number sequence to predict both the receiver wake-up time and the receiver wake-up channel.Cao et al.


Moreover, for passing through packets there is only one option; to be forwarded toward the SOR that provides connectivity to the next satellite.

each SOR should maintain two entries for routing data; one for destinations within the IP subnet and one for the next IP subnet.


By doing this, we are making a greedy choice that ignores future pawn groups, but we expect to improve both message overhead and average path latency over Random Selection (which also ignores future pawn groups during pawn selection).

we expect that if the distance from the current sender to the closest member of the next pawn group is half that to the average pawn group member, then the overall cost of sending the message will be cut in half.


However, integrity is a genuine problem that needs to be addressed speci.cally in the proposed approach, in order for it to be a practical solution.

the issue is, when packets are being forwarded by other peer stations, how it can be ensured that the packets are not corrupted on the path to the destination.


Let Ei,t be the residual energy of the node si at time t, and Ei, .t be the energy dissipation for .t time long at node si.

ei,t0 is the initial or full energy of node si.


The central bene.ts of usingaVANET asa basis for this database result from thefact that the system is entirely user-driven and decentralized.

there is no central operator that may limit access to the information, the serviceis freeof charge and thereexists no single pointoffailure.


The data indicates that the worst 5% of links account for 45.8% of the missed detections.

the miss rate would be cut in almost half if these 5% of links had not participated in the location distinction algorithm.


For the above mentioned procedure, the whole superframe duration depends mainly on the network load and tra.c type handled by DEVs.

in the presence of asynchronous tra.c the superframe length corresponds to its maximum value (Fig.


MIDAS employs a methodology comprising three procedures: i) measurement collection, which gathers reports from each node consisting of a small set of passive time-aggregate measurements; ii) inference, which infers the coordination among the transmissions of di.erent sets of nodes using the reported measurements; iii) prediction, which utilizes the inferred information to predict the throughput gain of any target link, corresponding to rate-limiting di.erent con.icting nodes.


As a result, the increasing interest in evaluating the performance of energy harvesting wireless systems brought forth several contributions to .ll this gap.

greenCastalia, an energy harvesting framework for the Castalia simulator [11] that allows the simulation of networks of embedded devices with heterogeneous harvesting and energy source capabilities, has been presented in [12].


Finally, the additional overhead is quite small.

for each QoS metric, we add a step count, step division (log or linear) and authenticator, which is at most 12 bytes.


We use a non-parametric regression method to estimate the expected response-time distribution, instead of assigning a random value from the constrained empirical distribution as in the previous section, because the designers are interested in the expected values of the response time for each request.

we use a standard Kernel Regression (KR) method, with a radial basis Kernel function (see [24, 26] for details) to estimate the response time for each request in the dataset.


Since the throughput is higher than that of links with similar dis-8000 tance (TLabs-HHI) and longer than HHI-TC, we attribute the high 7000 throughput to the frequency choice.

the Dynamic 6000 Power Selection (DPS) of 802.11a dynamically adjusts the send ing power.


Different from the past work in energyef.cient real-time task scheduling, we explore strategies to maximize the amount of data transmitted by a 3G module under a given battery capacity.

we present algorithms under different workload con.gurations with and without timing constraint considerations.


Thus, when a particular message is sent by the algorithm, we cannot assume that all of the node IDs are still random.

there are three kinds of information that we learn about the node IDs as the algorithm proceeds.


We assume that the attacks are static: adversaries, as well as sensor nodes and base stations, stay in .xed locations throughout the attack.


Since broadcasts are de (k) (k) terministically successful, =i t= ri .

jrj the total number of D2D chunks received by device i is equal to the number of transmissions performed by all other devices.


With 100 Mbps, even 30 hops takes only about 600 us, which is comparable to a single hop floor acquisition in current 802.11 W-LANs where the time to acquire the channel is of the order of 650 usec (RTS-CTS roundtrip, ignoring processing time).

by virtue of physical layer relaying, elimination of headers, and dramatically reduced processing we can acquire a few tens of hops in about the same time than it takes to acquire a single hop today.


This topology is analogous to the Alice-Bob topology, but in contrast to Alice s node, which knows the interfering signal because she has generated it, the receivers in the X topology know the interfering signal because they happen to overhear it while snooping on the medium.

s1 and S2 are sending to D1 and D2, respectively.


6.2 Evaluation Based on the experiment results obtained above, we .rst evaluate the accuracy of our scheme without strategic attackers4 .

we will study the false positive rate (i.e., rate of failing to accept authentic on-body sensors) and the false negative rate (i.e., rate of failing to reject o.-body attackers.).


We computethe con.dencebycomparingthe signal strength pro.letoanidealizedpro.lederivedfromourabstractmodel on body blocking.

ideally, the measured signal strength pro.le should display a dip pattern, where the signal strength is signi.cantly lower for a range of angles.


To support dynamic spectrum access (DSA), capabilities must be built to support multiple transmission configurations (multiple channels at different frequencies, diverse transmission powers and rates), heterogeneous user classes (PUs, SUs, and jammers/adversaries), and signal-level interactions among users in terms of both spectrum sensing and data transmission.

the manner in which CR network protocols respond to realistic physical channel effects can be tested over RFnestTM with controlled RF transmissions.


Put di.erently, we have that for a typical use case, Computes(...) holds for both the thread who creates as well as the thread who receives.

this is also true for the protocols under consideration in [21].


Since each secondary user is equipped with only one SDR transceiver, which can operate on one channel at a time, it cannot accurately know the states of all the channels by itself.

the goal of the channel-state report process is to enable the secondary users to have a large picture of all the channels states through their cooperation s. the secondary users use SDR transceivers to sense one of n licensed channels, say i-th channel, (1 = i = n).


2(.+1) G The proof of the theorem is now concluded by deriving the ratio OP Tij (tcur, 3G)/Tij (tcur, 3G) and replacing ß/Gby k/.. Notice that the bound in Theorem 3.3 gets tighter as k increases.

the smaller the fairness interval, the looser the proportionally-fair throughput guarantee.


We .rst inspect the case when a packet is transmitted to a link, and characterize the number of other nodes that can hear the same packet.

we wish to know if a link with a certain average PDR succeeds or fails to hear a packet how many other nodes can hear the same packet.


In order to take advantage of these features of wireless sensor nodes, we need to account for certain constraints associated with them.

minimizing energy consumption is a key requirement in the design of sensor network protocols and algorithms.


Therefore, we are motivated to propose more ef.cient caching policy that can consider the above practice of popular objects and popular publishers.

we seek to cache objects faster that could be popular with the higher popularity.


Nevertheless, the matrix dimensions depend on a parameter that changes from one time step to another.

matrix dimensions change in each time step.


The results in this paper as well as in [7] show that the new AMVA-Deeomp technique, together with the proposed model and analysis of bursty arrivals at the downstream queueing centers, can be expected to be quite accurate in practice for these contexts.

the estimates of mean system residence time have less than 15% error over the entire parameter space considered in this paper, and less than 10% error over most of that parameter space.


The standard deviation of the localization error in REP is also much smaller.

while REP achieves stable localization errors for the 3 settings, the performance of DV-hop largely degrades as the network geometric complexity increases.


Our model for QoS differentiation is based on the notion of a service curve [18,19].

a service curve is using a non-decreasing function of time which for each time interval, characterizes the minimum number of bits a MH must transmit in that interval in order to meet its QoS requirements.


We can thus define estimators based on higher moments of the loss measure at hand.


For p _> 0.973, the above quantity is strictly greater than s. The above construction can be adapted to show in- stability for many protocols that aim to share band- width approximately in proportion to the injection rates Pi.

if WFQ is used instead of GPS in the above construction then the packet movement will be essentially identical.


To the best of our knowledge, this is the .rst comprehensive study on the three media delivery methods from both the client side and the server side.

we quantify the potential tra.c waste in downloading and pseudo streaming by using the amount of data transferred in streaming as a benchmark.


In query-based scoring, we take the number of queries sent by the same host into account.

while host-based scoring uses the number of links in Fig.


Therefore, we make use of concepts of queuing theory to solve our problem.

baccelli and Liu develop a theory in [2], which we will use extensively in Section 4 to analyze CSMA networks.


for every k,Pr[Fd = k] is monotonically decreasing in d.The algorithm A samples some point v.Let fi denote the event that the neighbor of v which is closest to 0 is at distance i.


is log-linear, and we therefore model it with a simple log-linear model, using an empirically-derived slope.

the effect of interference is a function of the load of the interfering source (represented by the value on the x-axis in Figure 3).


The permutation generated by any of our algorithms achieves the best oblivious approximation ratio for all three prob- lems.

our bounds for oblivious approximations are tight since they hold for the case of equal probabilities.


To avoid the obstacles related to the publickey management, in this paper, we show how to use the idea of stateful encryption in another important asymmetric setting: Identity-Based Encryption (IBE).

we .rst de.ne the model of security for stateful IBE scheme and then present a concrete stateful IBE scheme whose security meets the (strongest) de.nition in the model, while its encryption and decryption algorithms are also extremely e.cient.


Total effort security game: The global protection level of the network depends on the sum of contributions normalized over the P number of all participants.

we de.ne H(ei,e-i)= 1 ei, Ni so that Eqn.


Intuitively, we want the message about a node xR with a resource to quickly reach every node xsuch that xR is the closest resource to x.

we are interested in .lling in the Voronoi region of the node xR.


This introduces a new set of problems with respect to more ordinary applications.

the absence of a single controlling entity makes troublesome both management of software infrastructure and e.cient production of data.


We extended the method proposed in [17] so that we were able to precisely identify routing instances and their interconnections from a network s router con.guration .les.

we made the following major contributions in this paper: (1) We developed a complete model and associated tools for characterizing interconnections between routing instances based on analysis of router con.guration data.


Proof: The proof is by induction on the level of u.If levelp(u)0 then exitPoint(p)uand so p2MyExits(u).

then by de.nition, p2PossibleExits(uVt)MyExits(u)for all t. Suppose levelp(u)h+1.0and the claim holds for all w where levelp(w):h. there is some time t[h]such that for all tt[h], p2PossibleExits(wVt)for all wwith levelp(w):h. Since p2S[, it is clear that p2GoodExits(wVt)for all tt[h].


Each sensor device consists of embedded operating system (OS), processor, sensors, battery, transceiver and receiver.

battery capacity of sensor device is very limited due to its low cost and not easy to be recharged due Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


Infrastructure-COMBINE is the next to end, having completed 203 requests while the Cool-Tether system is able to serve 322 requests (3.4/1.6 times more requests than the ad hoc/infrastructure-COMBINE designs) before losing charge in its gateway phones.

cool-Tether delivers 38%-71% savings in energy for web access workloads as compared to the COMBINE tethering solution.


= a H is obtained by determining a new additive splitting for x H .


The proposed distributed routing solutions are tailored for the characteristics of the underwater environment, e.g., they take explicitly into account the very high propagation delay, which may vary in horizontal and vertical links, the different components of the transmission loss, the impairment of the physical channel, the extremely limited bandwidth, the high bit error rate, and the limited battery energy.

the proposed routing solutions allow achieving two apparently con.icting objectives, i.e., increasing the ef.ciency of the channel by transmitting a train of short packets back-to-back; and limiting the packet error rate by keeping the transmitted packets short.


Equation 9 yields the same epidemic threshold as the basic KW model.

user vigilance does not a.ect the epidemic threshold.


Although the exact SPSW value for a given processor is application-dependent, the relative trend among processors is uniform across applications with similar computational workload.

if processor P1 has a higher SPSW than processor P2 in application A1, it will also have a higher SPSW value for application A2 as long as A1 and A2 are similar in terms of processor workload.


crp c ccff r rrff label p pppp For example, c.r = f means that a peer path cannot be extended to become a customer path.

a node does not export to a provider a path that it learned from a peer.


&#169; ACM 2000 1-58113-195-X/00/09 ...$5.00 Rather, it focuses on quantitative attributes that are significant for the class of applications that operate in a geographically distributed environment, with heterogeneous (and possibly physically moving) locations.

we focus on interaction related performance indices (e.g.


2.2 Approach Overview The intuition of our approach is as follows: Since each NIDPS only receives a portion of the network tra.c, we want to make sure that this portion contains su.cient information for the NIDPS to detect and prevent intrusions.

we want to send attack-correlated .ows to the same NIDPS, so that no attack would be missed.


Here, we assume that the only latency incurred is in the queue between the switch s data-plane and control-plane; we ignore any latency added by communication with the controller.

the .gure shows the service rate needed for this queue, in order to maintain a waiting time of less than 2msinthe 95th and 99th percentiles.


The developed model enables us to quantify the impacts of channel parameters (e.g., fading rate) on TCP throughput and, more importantly, to determine the optimal SNR switching thresholds for different AMC transmission modes (at the physical layer) in order to maximize TCP throughput (at the transport layer) under different levels of persistence at the link layer (i.e., the maximum number of transmission attempts for a link-level packet).

the developed model provides a framework to determine the cross-layer system parameters for a target TCP performance, which is the ultimate quality of service (QoS) perceived by the application layer for many data services.


it provides a full adaptive video streaming player that is able to play video streams using both DASH and HLS standards.


The straightforwardness of the intercon nection primitives, however, also proves to be the main security chink of the Internet.

the Internet s original design principles do not provide any form of control for a server to dic tate how much traf.c it wants to receive and from whom.


We observe that WiFi links during day hours are more unstable than during night hours.

57 links during the night, and up to 69 lossy links with a higher degree of dynamics were observed during the day for the 15 replications.


RELATED WORK In recent years, a substantial amount of research has been devoted to object and data location in large scale P2P (peerto-peer) networks.

known works on DHTs, e.g., CAN [22], Pastry [23] and Chord [26] promise several important desirable properties such as decentralized operation, scalability, fault-tolerance, and load balancing.


since there are no defined semantics to the IP id field, and hence no reason to make it a counter, some operating systems running on "little-endian" hardware don't bother putting the counter into "network" (big-endian) byte order.


In this work we will gather several simulation proposals, analyzing their benefits and drawbacks in order to build a new complete and reliable simulation framework, that allows the design and performance evaluation of new underwater network protocols under a friendly user interface.

we are especially motivated to define detailed models about the underwater environment (temperature, bathymetry, surface activity, etc.)


Somewhat surprisingly, this appears to be a reasonable approximation.

we estimate that 88% of all Apple devices in our trace are iPhones.3 To estimate the population of iPhone devices, we observed that Apple products periodically check for software updates by polling a central server, wu.apple.com.


Instead of being fair to all participants, it prioritizes updates for those who are most left behind.

scuttle-depth prefers deltas of participants for which more deltas are available over deltas of participants with few available deltas.


The answer to these questions is the goal of this paper.

we consider the entire network design of an IP-over-WDM network, meaning that we look not only at the IP layer deciding which routers and line cards to install and how to route the traf.c over the set of IP links, but also at the realization of the IP links in the WDM layer and consider installation of .bers on the physical links.


gions that satisfy distance measurements.

when node i hears from node j, it extracts a positive constraint that their distance is within the communication range.


Most .ows are small: 90% of .ows have less than 2.9 KB uplink payload and 90% of .ows carry no more than 35.9 KB downlink payload.

11.3% (10.9%) of .ows do not have any downlink  Figure 2: Distribution of TCP .ow sizes.


In contrast to [5], we in this paper study failover mechanisms for software-de.ned networks.

the failover scheme in [5] is based on link-reversal algorithms [3], which has the limitation that it requires to maintain dynamic state in the routers and is not applicable to OpenFlow.


e=(u,v).T The pricing rules ensures that, for any given edge e in the .nal topology T , both endpoints of e receive a premium at least equal to the cost of the edge.


We .x a = 1 and the cache to catalog size ratio C/N to a conservative 0.1%, and let the cache C and catalog sizes N vary.

we instantiate a small-scale scenario with C/N = 102 /105 , a medium-scale with C/N = 103 /106 and a large-scale with C/N = 105 /108 .


That is because large NFRT prevents unnecessary multi-path transmissions.

the previous scheme with small NFRT causes frequent handovers.


Stochastic partitioning The new scheme of an optimal way of partitioning network nodes into Blocks in which a network having a specific number of nodes and specific degree of connectivity is partitioned, such that the amount of information across blocks is minimized.

reducing a number of operations required to find path between a specified source and destination.


However, that alone is not suf.cient to ensure good performance in mesh networks, where transport protocols like TCP can perform poorly because of complex interference among neighboring nodes.

tCP does not explicitly account for the fact that congestion in a mesh network is a neighborhood phenomenon.


In case (b), we use MIP-HA to replace SIP-FS2 and MIP-FA to replace SIP-FS1.

we make the original network as the serving area of MIP-HA.


A negative result indicates the opposite, i.e., path a has less delay than path b .

to assess which forward path would have the lowest delay, the same evaluation has to be carried out with the third and fourth rows yielding: aA cA = a + A (c + A) = a c (2) aA dA = a + A (d + A) = a d (3) it is possible to know the pairwise differences between single paths delays.


However, there is a fundamental spectrum e.ciency limit to existing cellular network architectures: they are single-user systems.

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


In this work, we propose an intelligent tra.c information system based on inter-vehicle multi-hop communication to minimize vehicle tra.c congestion by taking into account the aforementioned network challenges.

to overcome them, we use our e.cient and robust data dissemination protocol for highway environments with di.erent tra.c conditions (DRIFT) [13] to disseminate accident warnings on the road.


Because every Ethernet frame is encapsulated in a UDP datagram, one datagram is sent to each node.

traffic generated by one node is multiplied by the number of neighbors.


There however has been very little e.ort spent on designing algorithms to achieve su.ciently fast data aggregation under the physical interference model which is a more realistic model than traditional protocol interference model.

a distributed solution to the problem under the physical interference model is challenging because of the need for global-scale information to compute the cumulative interferences at any individual node.


Do player I has a strategic advantage to cheat by sending misleading information to player II?

how should be player II s reaction to the infor si and sj are computed as function of player I s belief, namely {{ 1, if b1 E [0, th1] and H1 = HG; 2, if b1 E [th1, 1] and H1 = HG.


A super state in the (Nc+1)-dimensional Markov chain is a sequence of size Nc + 1, in which the ith element represents the state (in the 1-dimensional Markov chain) that the ith distance headway belongs to.

a super state, (s0,s1,...,sNc ), means that the distance headway Xi is in state si .


For example, in order to estimate the delays accurately for a traf.c ratio of 3%, the load factor should be less than 0.6.

the bitmap size should be more than 1.6 times of the number of packets arriving during a interval.


The originating protocol module of a complete datagram sets the more-fragments flag to zero and the fragment offset to zero.

the IPid field is just a bit string used to make packets unique.


OmniVoice meets the QoS requirements for VoIP in all operating scenarios and is unaffected by interference from non-VoIP traf.c.

omniVoice provides 100% greater throughput and 130% greater uninterrupted connectivity time to mobile VoIP users as compared to an off-the-shelf 802.11 solution.


As observed previously, such an application requires additional axioms.

to prove authentication, we need to introduce an axiom that allows us to conclude the existence of a thread.


4.4.3 Distributed Collaborative Monitoring In order to improve the monitoring accuracy and withstand the blackmail attack, we use m out of N strategy to cross-validate the monitoring results of di.erent nodes in one neighborhood.

a node is considered as an attacker if and only if m nodes out of all its N neighbors have independently sent out SID packets against it.


In a virtual MIMO system, however, when signals from multiple sending stations superimpose together at one of the AP s receiving antenna, neither their symbol timings nor their frequency offsets will align together.

there may no longer exist ideal sampling points .


This standard, known as IEEE 802.11p [6], is an enhancement of the original IEEE 802.11 standard that ba sically combines the IEEE 802.11a (operation in the 5 GHz band) and the IEEE 802.11e (MAC-level QoS support) an nexes [7].

the band of frequencies reserved for the operation of IEEE 802.11p is de.ned at 5.9 GHz, although there is still not a worldwide consensus on the use of this band.


The .rst solution requires modi.cation to the packet format to include keys along with the source route, and the second solution is also di.cult to implement.

in DSR, data packets may be promiscuously received by all neighbors of the transmitter.


if the undesired events are uncommon and unexpected, and consumer psychology denies the likely occurrence of such an event (such as being at fault) to them, then our solution will still be rational to use if there are su.cient bene.ts of some type that can be anticipated and experienced.


Based on drop stage, video RTP packets are discarded as a unit of frame.

several consecutive RTP packets of the same frame are discarded completely.


Thus, for c = 3 theschemeensures (3 ·ln(n +1), 3/2)-approximation factor.

the calculated solution will be within a factor of 3·ln(n+1) from the optimal solution and the sizes and weights of its LAs are at most 1.5Kmax and 1.5Wmax, respectively.


Finally, we have suggested that BP-DDBA, which performs early bandwidth allocation for light loaded ONUs, will bring about better downstream throughput compared with some previous DBA algorithms.

it is suggested that the proposed burst-polling scheme provides higher downstream bandwidth utilization under light-load high frequency polling situation.


Particularly, PAQ prevents the idleness of downlink, which is about 20% of the whole simulation without PS.

the PAQ method e.ectively decouples the interacting two-way TCPs and supports full utilization simultaneously in both directions.


Clearly, for De.nition 1, E =0, and only the exact feature points are used.

the skeleton nodes identi.ed based on Proposition 2 is a subset of those identi.ed based on De.nition 1, while Proposition 2 can yield a more stable result in 3D sensor networks, which is validated by extensive simulations in Section 5.


We assume that bounds 0 < slow = shigh on the speed of the local clocks are known.

for every node A the following holds for the local clock CA:  slow · (t2 - t1) = |CA(t2) -CA(t1)|= shigh · (t2 - t1) .


A distinctive characteristic of this network is that the packet tra.c .ow starts from non-valuable nodes to valuable nodes.

packets need to be routed to a determined subset of nodes called the valuable nodes.


In this case, it is clear that w * is RBMw* (-b, P (ßl.la)2), P l.Lwhere its average total workload is simply l.L(ßl.la)2)/2b.

when the transmission duration is large and the vacation duration has a light tail, the delay performance is a.ected only by the heavy tra.c condition and the variability of the arrival process.


Therefore, although several advantages could be achieved by using NEMOBSP, such as reducing handoff overhead and power consuming, it still has several drawbacks.

nEMOBSP suffers the spiral routing problem when routing packets in a nested mobile network.


We see that compared to the 33 second propagation time for a HELLO interval of 10 seconds (i.e., a 40 second timeout period), a 500 ms HELLO interval yields a 2 second propagation time and a 250 ms HELLO interval yields a 1 second propagation time.

there are substantial improvements 4We did try running with TE extensions, but our simulator ran out of memory.


A fundamental problem is to minimize the number of nodes that remain active, while still achieving acceptable quality of service for applications.

maintaining sufficient sensing coverage and network connectivity with the active nodes are critical requirements in sensor networks.


For all nodes u, S(u)m is the node with rank 1.

these signature vectors de.ne the HST embedding of d. the leaves are nodes of P , the level-i ancestor of a node u is labeled S(u)i, and the weights of all edges between level i and level i -1 is 2i .


Multi-stage computation: We can extend the devicespeci.c approach to allow a triggered feature generation process.

we use lightweight feature generation algorithms by default and generate expensive features only on-demand.


However, so far, the impact of network virtualization on the underlying physical infrastructure has been relatively overlooked.

the feasibility of the network virtualization concept in large scale operator networks has not been adequately assessed.


The list of destinations contains all mesh points to which mesh point N has an active routing table entry and which now cannot be reached due to the link break.


An RCD is a safety device that switches o. the electricity whenever it detects that the current is not balanced between the return neutral conductor and the energized conductor.

it detects if there is a fault and electricity .ows down an unintended path, e.g., a person.


NTP synchronization scale factor (U-scale)  The scaling mechanism is based on the 16 seconds quantum which respects the overall TDMA sync scheme.

a scale factor is a multiplication coe.cient that can be set for each aspect and node individually.


We observed in our simulations that the value of this parameter is very crucial to its performance.

a system of n .ows needs at least a buffer size of 2na packets for it to converge well.


In the stage of pre-processing the measurement data, we identi.ed and removed a number of measurement artifacts.

we identi.ed artifacts associated with each source by correlating its measurement results.


At instant k a given node can be characterized by a pair (t, c).

node i characterizes its trust in node j by the pair (ti,j ,ci,j ).


The key idea in the subspace-based detection step is that, once Sand S have been constructed, this separation can be effectively performed by forming the projection of link traf.c onto these two subspaces.

we seek to decompose the set of link measurements at a given point in time y: y =y +y such that y corresponds to modeled and y to residual traf.c.


Moreover, we assume that all .ow datapoints are generated independently and identically distributed, according to this distribution.

the joint distribution over all datapoints and labels is !


The reason to have a separate NFSS based on NFST is to provide causal ordering among multicast packets.

if (1) host A sends multicast M1, (2) host B receives M1, and (3) host B subsequently sends multicast M2, then any host C that receives both M1 and M2 will receive M1 before M2.


Further, it tries to construct a spanning-tree of the CVG along which A could send data to other recipients.

this scheme could degenerate to naive unicast transmission as shown in Figure l(d).


This dissertation work focuses on new ways of discovering online social networks automatically.

the work introduces and evaluates an automated approach for social network discovery from threaded discussions.


3.1.1.3 Dummy It is a host which cannot actively take part in the collection of data.

dummies are those hosts that cannot probe the network (but they are used as traceroute destinations).


For example, if the available bandwidth is 2 Mbps and 4 Mbps on Wi-Fi and Cellular respectively, we should set the TBS ratio to 1:2.

for every three packets, we will send one over Wi-Fi and two over Cellular on average.


In the delay analysis of SR-ARQ, many researchers use simpli.cations or approximations to make problem tractable.

rosberg and Shacham [6]  d_r (ms) (a) Fmac = 1%  d_r (ms) (b) Fmac = 5% Figure 3: The average transmission delay Table 1: The parameters used for evaluation slot length ds dm Kmax M m 0.4 ms 1 ms 1 ms 2 20 10 slots made assumptions of i.i.d channel error process, heavy traf.c, and .xed round trip time (RTT).


In CALEA systems, ironically, the problem appears to be much worse: in-band C-tone signaling may be used not just at the link between the TSP and law enforcement (where the vulnerability can be more easily mitigated on the law enforcement side), but also internally within the TSP s delivery network.

if a surveillance subject applies C-tone on a link tapped by CALEA equipment designed in this way, the CCC between the TSP and the LEA simply closes (as if the call terminated normally) and no content is delivered at all.


By the top centile, we mean the lowest upper bound for 99% of the simulation duration.

a pair s stretch is at most the top centile value 99% of the time.


Therefore, our basic idea herein is to take the bene.ts of random linear combination 2 from RLNC and the bene.ts of BP decoding from LT code.

it is very desirable for the re-encoded packets at each relay node to look like independently coded LT packets.


Each .gure contains three curves, one for each considered required .ow.

for each instance, we consider three possible values of required .ow equally distributed in the interval {bmin,...,Fmax}.Namely, the curves refer to bmin + d, Fmax -d and Fmax, as for bmin we can compute the optimal value.


In this paper, we extend the idea of podcasts, making them available in mobile network environments.

hyCast does not rely on central podcast directories.


Recently, small-world graph was proposed to model various networks in the computer science society, including the Web graph, the Internet connectivity, peer-to-peer networks, and potentially wireless ad hoc networks.

helmy [2] showed if long-range connections are established in a spatial ad hoc network, then it is likely to become a small-world.


In front of these limitations, several concepts have been proposed, such as the ones introduced in the related work.

[12] [13] [14] study the architectural adaptability of QoS-oriented Transport-level protocols.


6.4 Run-time Scheduler We next evaluate the performance of our multicore scheduler.

if the programmer-provided function f has no locality, then all requests will be forwarded to the controller for centralized processing.


Second, the importance of weak ties can be attributed to their e.ect on the network s edge expansion.

we show that to capture the complex relationship between the social network formed by users and the performance of our distributed application it is su.cient to evaluate the edge expansion of the contact graph modelling user communication.


In this experiment, new connections are admitted in the net- work when a random number in the interval (0,1) generated for each new connection is above a threshold value (provided there was enough bandwidth in the cell to support the new connection).

for a threshold value equal to l, the base station tried to accept 100 x (1 - 1)% of all new connection requests to the network.


we .nd some RDNS servers that both (i)accept and resolve queries from arbitrary origin devices and (ii)act on behalf of a set of FDNS servers we detect in our survey.


Communication e.ciency is often measured in terms of transmission rate, which is the ratio of the total communication cost to the length of the message.

total number of .eld elements transmitted Transmission Rate = size of the secrets The message is either one element or a sequence of elements from an alphabet.


The remaining tasks are similar for both components developed.

the second task is related to key generation, which is achieved according to the strategy shown in .gure 5; obviously, this step is skipped if security is disabled.


ENERGY DETECTOR EXPERIMENTAL RESULTS The goal of our experimental study was to evaluate and verify the theoretical results on the performance and limitations of the energy detector.

we measured the achievable probabilities of detection as a function of sensing time, and the existence and position of the SNRwall.


.dj < 0, where di is the change in .ow i s allocation.

if an allocation is not max-min fair, there must exist .ows i and j where decreasing the .ow with larger allocation will increase the other .ow s allocation.


Assuming that the transfer has to reoccur every day, E2E-CBR would push up the 95-percentiles of the sending and receiving access ISPs by exactly B/T =2.5 Gbps costing them anything between $75K and $225K in additional monthly transit costs ($30K90K per Gbps according to recent prices).

since E2E-CBR is bound to increase the charged volume by exactly its mean rate, it provides no advantage compared to buying dedicated lines of the exact same rate.