sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Recall that a sensor u enters a sleep mode only after all the intersection points Pu in its sensing range are already k-covered.
Sentence 2: according to Theorem 1, during the life­time of the network (i.e., while there is no coverage hole) the subset of sensors activated at the end of the activation phase in each slot j, S(j), induces a sensor cover for the net­work.
Relationship: reasoning
Domain: Networks
Sentence 1: As with many other security properties, a privacy-preserving system is only as strong as its weak­est link, since an attacker that cannot identify a node with wireless .ngerprinting could simply use MAC or network addresses instead.
Sentence 2: we propose to only shift identities at the physical layer when there is a shift in higher-layer identities, as previously proposed by D¨ otzer[2].
Relationship: reasoning
Domain: Networks
Sentence 1: The arrows re.ect that in the dd mode the useful signal is interfered by the signal from the other base station.
Sentence 2: given an uplink .ow at distance Z from the base sta­tion, the service time of the .ow is given by Su uu = Y /cuu(Z), where c uu(z) represents the mean transmission rate of the .ow at distance z in the uu mode.
Relationship: reasoning
Domain: Networks
Sentence 1: That happens because if the aggregation level equals 23 the cost equals k. On the other hand, if the aggregation level equals 24 or 25 the cost will be 2k and 4k respectively.
Sentence 2: if r > 3k2-8 or k2-8 < r < 2k2-8, both transit providers have the incentive to deaggregate.
Relationship: reasoning
Domain: Networks
Sentence 1: For that reason, we deploy models of the routes deployed by the nodes to send the sensed value to the sink using n-grams, where each n-gram consists of a predefined number of successive hops used in routing information coming from the node.
Sentence 2: the features are the n-grams and the feature values are the number of occurrences or the frequency of the corresponding n-gram during a certain period of time.
Relationship: reasoning
Domain: Networks
Sentence 1: While we can compute it more precisely, since reproducing the PRNG se­quence lets us extract the exact size of each intervening packet sent, for convenience we will often use the average payload size (1070 bytes including UDP, IP and Ethernet headers).
Sentence 2: the transmission rate can be computed as  9000 9000 8000 8000 7000 7000 6000 6000  Rank 5000 5000 4000 4000 3000 2000 1000 0Estimated access bandwidth (bits per sec.)
Relationship: reasoning
Domain: Networks
Sentence 1: GATEWAY SELECTION GAME OF MUL-TIPLE AUTONOMOUS DOMAINS 3.1 Game Formulation Note that the cost of a single domain m, given by (2), depends on not only its own gateway selection, but also the decisions of other domains.
Sentence 2: coupled by the inter­domain communication cost, we formulate the interactions of gateway selections by multiple domains as a gateway se­lection game, where each autonomous domain is a player, with an objective function of (2), and the strategy space for domain m is Nm.
Relationship: reasoning
Domain: Networks
Sentence 1: In IEEE 802.15.4a such as wireless sensor network, using higher duty-cycle is di.cult since the power consumption is also signi.cantly high.
Sentence 2: when the LDC-UWB sig­nal power is .xed power per unit of time, the duty-cycle of LDC-UWB should be set to distinctly low values of less than 0.1 % and using PRF = 15.6 MHz is absolutely essential.
Relationship: reasoning
Domain: Networks
Sentence 1: O1, (1) |Lrn (x1,x2).Lrn (x2,x1)|= |L(x1,x2)|-o .
Sentence 2: n 2 n J e -n|Lrn (x1 ,x2 ).Lrn (x2 ,x1 )|dx1dx2 2 O1 2 n J -n|L(x1 ,x2 )|+o(1) = e dx1dx2 2 O1 2 n J -n|L(x1 ,x2 )| ~ e dx1dx2 2 O1 2 np.x1 x2 .2 n J ß0 = e - dx1dx2 2 O1 Rn 24np.2 2 J -J =4pne ß0 .d.
Relationship: reasoning
Domain: Networks
Sentence 1: Although, the concept of using a private storage for personal information, and the use of higher level information to obtain an array of relevant ads have been proposed, to the best of our knowledge they have not been used together with cloud based resources as pro­posed in CAARETA.
Sentence 2: we believe this is the .rst proposal which fully addresses three fundamental require­ments of a privacy preserving mobile advertisement delivery system.
Relationship: reasoning
Domain: Networks
Sentence 1: As the advanced mobile devices such as smart phones now have the capability of forming opportunistic networks in an ad-hoc manner through WiFi Direct or Bluetooth connectivity [8], and people normally carry with them in their vehicles every day.
Sentence 2: the users can use their mobile devices on board vehicles to establish a VANET independently of a fixed infrastructure in an inexpensively and conveniently way [9].
Relationship: reasoning
Domain: Networks
Sentence 1: The time complexity of .rst part is O(N(T2 - T1)), the time complexity of second part is divided into two as­pects: O(num 2 + num 2), and the time complexity of third part is O(num 2).
Sentence 2: the total time complexity of 2 22 whole algorithm is O(N(T2 - T1), num + num , num ) = 22 2 O(N(T2 -T1), 2num , num ) = max O(N(T2 -T1), 2num ).
Relationship: reasoning
Domain: Networks
Sentence 1: But it requires solving a computationally hard combinatorial optimization prob­lem in a centralized manner.
Sentence 2: in recent years, through a sequence of exciting results, entirely distributed and low­complexity medium access algorithms have been developed starting through two distinct independent approaches by Jiang-Walrand[4]andRajagopalan-Shah-Shin [5].Butthey resultinvery highdelay evenfor modestthroughput.wecanobtainhighthroughput andlowdelaybut withahigh complexity algorithm, or high throughput and low complex­ity but with high delay.
Relationship: reasoning
Domain: Networks
Sentence 1: The .rst one, and most straightfor­ward to specify, is the node density d(x, y), measured in nodes per m2 .
Sentence 2: in a location where d(x, y) > 0, there is a con­centration of nodes such that the number of nodes in any set of incremental area E centered at (x, y)is d(x, y)E. the total number of nodes in the network, which we are asked J to minimize, is given by the integral N = d(x, y) dx dy.
Relationship: reasoning
Domain: Networks
Sentence 1: Recall that ya = yc =1 and yb = .More­ group.
Sentence 2: we have developed a method to separate over,some load of user 2 or 3 can be shift from AP b to APs the APs in the bottleneck load group L from the rest of the c or a,which is indicated by the edges (b, c)and (b, a),and APs.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.2 Path persistence Any direct implementation of these equations requires a discretization of the state space and solving at each grid point anindependentODE,providing thedatafor calculat­ing the next iteration.
Sentence 2: numerical software rou­tines that implement the corresponding di.erential equa­tions in a recursive way are needed for obtaining the .nal results.
Relationship: reasoning
Domain: Networks
Sentence 1: Clearly, the problem is feasible if rsv and only if PgEG tg 1.
Sentence 2: if the problem is feasible, we can write Tg = tg - trsv g , and problem (9) can be transformed to rsv rsv maximize Xtg log(Tg + tg ) gEG subject to Tg .
Relationship: reasoning
Domain: Networks
Sentence 1: 7 be the resulting partitions of G. If a gi l&#38; more than one node, it is recursively di­vided and should have its own separator Si, oth­erwise the node itself is the separator.
Sentence 2: note thatthe children of a graph G do not include nodes of the separator S. this guarantees that every node appears in exactly one node in the rooted tree.
Relationship: reasoning
Domain: Networks
Sentence 1: In the worst case, tracenet returns the exact path that would be returned by traceroute, and, in the best case, it collects the complete topology of each subnet visited on the path.
Sentence 2: a single session of tracenet (1) discovers new IP addresses that are missed by traceroute, (2) marks multi-access and point-to-point links, (3) reveals subnet relationship among IP addresses on the path, and (4) annotates the subnets with their observed subnet masks.
Relationship: reasoning
Domain: Networks
Sentence 1: As a result, the calling Figure 5: Standard Session Set Up Procedure Figure 6: Test Bed Session Set Up Procedure party, Alice, did not include any preconditions line in the .rst SDP o.er and Bob, the called party, did not perform any resource reservation upon receipt of the initial INVITE.
Sentence 2: we cannot report whether this optional function of an IMS network is performed by our test bed in accordance with the speci.cations.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition, a variation in streaming content may arise due to the participants change of inter­ests (e.g., view change).
Sentence 2: there is a need for an adaptive multi-stream, multi-site 3DTI session management strategy, which is unobtrusive, and optimizes QoS parameters in the 3DTI content distribution based on the user activity and content variation.
Relationship: reasoning
Domain: Networks
Sentence 1: When the nodes and links fail, even though the network may still be connected, there are problems such as larger delay, lower efficiency and smaller network throughput with using the remaining routings to transmit data.
Sentence 2: a topology reconfiguration scheme is used to break and set up links to create a new topology, so that when the links or nodes fail, fault-tolerant operation and rapid service reconfiguration can be achieved.
Relationship: reasoning
Domain: Networks
Sentence 1: (6) Since the feasible set of LP(d) is convex and compact, and f(e) is a bounded function, by continuity, we conclude that U(d) .U(0) as d .0.
Sentence 2: for every E> 0there exists de > 0 such that for every d<de, U(d) =U(0) + E. From (6), we conclude that CL(.)
Relationship: reasoning
Domain: Networks
Sentence 1: However, we believe that the most interesting case of operation for dynamic spectrum ac­cess schemes is that in which the number of users is not known.
Sentence 2: we are interested in investigating how the probability of achieving successful dissemination of control information varies with respect to di.erent dissem­ination strategies as well as scenario parameters, and what is the impact of dissemination strategies with non-negligible probability of dissemination failure on the overall system performance.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, by taking ln on both sides of the inequal­ 2knpr pnt ity, we have B -a< ln A +ln(1+ ) A t/2 8ke =ln n + k ln t -t -ln k!+ln(1 + vv ).
Sentence 2: 2k p nt we have 8ket/2 t< ln n + k ln t -ln k!+ a +ln(1+ v ).
Relationship: reasoning
Domain: Networks
Sentence 1: Table 4: Nnd upload and totalE nergydp for di.erent delays Delay Nnd upload totalE nergydp 3-hour 10.7 178.9J 6-hour 14.7 167.0J 12-hour 18.0 140.3J 24-hour 19.6 130.4J Evaluation on Nodobo We also evaluate e.Sense on Nodobo, as this dataset contains users WiFi traces, which MIT Reality Mining lacks.
Sentence 2: we introduce ewif i , which means a user connecting to a WiFi AP.
Relationship: reasoning
Domain: Networks
Sentence 1: (packet/ms) µ(packet/ms) n = 5 0.07799 1/12.1808 n = 15 0.02665 1/36.4052 n = 30 0.01359 1/71.3596 Number of nodes fmodel for Markov model fmodel for Exponential MAC n = 5 0.0547 0.1736 n = 15 0.0789 0.1258 n = 30 0.0729 0.1040 chosen such as to satisfy that the transmission queue remains nonempty.
Sentence 2: utilization of the queue .
Relationship: reasoning
Domain: Networks
Sentence 1: At their core, these traceroute­like approaches provide a list of router IP addresses which can be viewed as aliases of a single router, to be determined [14].
Sentence 2: numerous solutions to the alias resolution problem have been developed including: examining IP ID values [9, 17, 25], using prespeci.ed IP timestamps [21], detecting variants in the source address of a probe s response [14], applying graph analysis techniques [15], and, as in this work, by examining reverse DNS lookups [24].
Relationship: reasoning
Domain: Networks
Sentence 1: Such outliers are di.cult to eliminate because they have many sources in complex systems; even in a well-provisioned system where individual operations usually work, some amount of uncer­tainty is pervasive.
Sentence 2: latency is a di.cult challenge for networked systems: How do we make the other side of the world feel like it is right here, even under exceptional condi­tions?
Relationship: reasoning
Domain: Networks
Sentence 1: Now we brie.y analyze the computational complexity of the worst case by Algorithm 1.
Sentence 2: with the algorithm, in the worst case the number of separate groups, a, when we deploy the last routing node, could reach up to m + n. in the worst case, we have 2m+n scenarios that the .exi­ble vertice connects to the separate groups or not; for each .
Relationship: reasoning
Domain: Networks
Sentence 1: For example, when the payload is 10 bytes long and the MAC is 2 bytes long (i.e., n =80,m =16), the success probability of selective forgery without MAC striping is 2-16, and with MAC striping it becomes approxi­ () 96 259 mately 2-75 (since 16).
Sentence 2: the MAC striping technique drastically decreases the success probability of se­lective forgery (from 2-16 to 2-75 in the example) without increasing the MAC size.
Relationship: reasoning
Domain: Networks
Sentence 1: By Lemma 5.3, ßLpQqe max log .rj , j 1,2,...,J so we only need to show that ßU pQqd max log .rj , j 1,2,...,J where ßLpQq and ßU pQq are de.ned in (25) and (26) respec­ tively.
Sentence 2: first note that ßU pQqd ßU pMq,where M is the queue­size vector of the virtual system BN.This is because, by Proposition 5.8, ÿNN ÿ Qiptqd Miptq` KpN ` 2q, i 1 i 1 deterministically and for all times t. in steady state, rN rN Qi is upper bounded by Mipt q` KpN ` 2q,de­ i 1 i 1 terministically.
Relationship: reasoning
Domain: Networks
Sentence 1: Furthermore, the removal of sessions with RTTs higher than 10 seconds does not change any of the results below and, at the same time, prohibits us from showing the extent of variation in the network parameters experienced by a home Internet user.
Sentence 2: since all sessions in {DlpuDz~} were able to successfully complete, we consider the removal of sessions based on their large RTT to be unwarranted.
Relationship: reasoning
Domain: Networks
Sentence 1: Here we present a theorem based on Berlekamp s algorithm which indicates that the trace poly­nomial over GF(2) can be factorized as a product of sev­eral monic minimum polynomials; each minimum polyno­mial corresponds to ai for some positive integer i where a is a primitive root in GF(2m).
Sentence 2: we can determine those roots for trace polynomial in the .eld GF(2m).
Relationship: reasoning
Domain: Networks
Sentence 1: Given the aforementioned goal, our NM im­ Table 4: Connectivity and switching capabilities of the mod­ules in device A. LEGEND is an up-pipe for B &#38; down-pipe for A B Module A has  A [down  down] switching Module A has A [up up] switching Physical pipe Figure 6: Potential Connectivity sub-graph for device A. plementation invokes showPotential at these devices to deter­mine the abstraction for the modules in these devices.
Sentence 2: the NM has a network map akin to the one shown in .g­ure 5(b).
Relationship: reasoning
Domain: Networks
Sentence 1: In this paper we identify scenarios where the error introduced due to these two factors becomes significant for a nominal range of relevant parameters (a detailed discussion is presented in Section 3).
Sentence 2: when there is significant motion between signal arrivals, in order to time synchronize the submersible, it has to be additionally tracked over the time epoch T. the key problem that we will solve is joint time synchronization and tracking of submersibles based only on one-way acoustic transmissions from beacons.
Relationship: reasoning
Domain: Networks
Sentence 1: Since Algorithm 1 implicitly removes duplica­tions of degree-2 packets on-the-.y, the constructed G(Ei) should be an acyclic graph with an average height O(log k) [24].
Sentence 2: we need at most O(log k) operations to .nd the path (i.e., equivalence chain) between any pair of ver­tices in G(Ei)by using lowest common ancestor algorithm.
Relationship: reasoning
Domain: Networks
Sentence 1: S2re­jected at most T calls before the current R phase and at most CR(sT +t) during the R phase.
Sentence 2: the rejection competitive ratio is at most CR T (sT +t) + =8cAcR + cR = O(cAcR) T/(8cAcR) CR(sT +t)/cR 2.2 Analysis of Acceptances We de.ne cal ls rejected because of algorithm R to be those rejected or preempted during an R phase and denote their number at time t with RR(t).
Relationship: reasoning
Domain: Networks
Sentence 1: In TDMA wireless ad-hoc networks, a transmis­sion scenario is valid if and only if it satis.es the follow­ing three conditions; (i) A node is not allowed to trans­mit and receive simultaneously, (ii) A node cannot receive from more than one neighbor at the same time, (iii) A node receiving from a neighbor should be spatially sepa­rated from any other transmitter by at least a distance D. However, if nodes use unique signature sequences (i.e., joint TDMA/CDMA scheme), then the second and third condi­tions may be dropped, and the .rst condition only charac­terizes a valid transmission scenario.
Sentence 2: our MAC layer is based on TDMA scheduling [16, 17, 31] such that collisions and interferences do not occur.
Relationship: reasoning
Domain: Networks
Sentence 1: From the non-queueing model, we obtain the service-time statistics corresponding to a given q.In the sec­ond phase, we consider a queueing model of the system with a given arrival process .
Sentence 2: (t) and queue length K.the probability of having a packet to transmit q corresponds to the probability q0 of having at least one packet in the queue.
Relationship: reasoning
Domain: Networks
Sentence 1: df ..L. 4pPrth 10Lw (f )f2.+2 dfL (2) Atarget can be detected by a radar only if r = .
Sentence 2: r.xf we de.ne the area covered by the ith radar as a circle of radius r.centered in x(i),in which TOA can be measured.
Relationship: reasoning
Domain: Networks
Sentence 1: (In Section 5, we tuned the algorithm to work well with multiple radios and frame combining, but did not alter the fundamental mechanisms used in the algorithm.)
Sentence 2: in fact, we can use the results from the previous section to show that there is room for improvement in the rate adap­tation algorithm.Table 3 and Figure 9(b) show that the frame loss rate to the active AP in MRD-R1 was 35% and that MRD-R1 selected a bit-rate of at least 24 Mbps over 90% of the time.Multiplying 1 -FLR with the the e.ective throughput of the 24 Mbps (17.8 Mbps) bit-rate yields 11.6 Mbps.we could have .xed the bit-rate to 24 Mbps for the non-MRD HIVAR experiment (R1) to improve the per­formance by 1.4× over the MADWiFi autorate algorithm, which achieved 8.25 Mbps.
Relationship: reasoning
Domain: Networks
Sentence 1: We use average of rp(i, n) because it gives a measure of the total magnitude of change.
Sentence 2: r(i, n) represents average proportion of change in next-hop decisions at timescale n. Figure 2 presents the time series of r(i, n) for our 4 datasets, where n is 1, 2, 7 and 30 days for datasets 1 to 3 (daily), and n is 1, 2, 6, 12 and 24 months for dataset 4 (monthly).
Relationship: reasoning
Domain: Networks
Sentence 1: In this complex situation, F-ODFC selects the contending BS who experi­ences the maximum contention failure rate as the winner.
Sentence 2: f-ODFC is able to allow a fair contention mech­anism for all contenders with varied frame demands and thus it signi.cantly improves the fairness of ODFC-based self-coexistence.
Relationship: reasoning
Domain: Networks
Sentence 1: Figure 8: Growing the black piece.
Sentence 2: a0-1 Letting i +1= |OP T |·ln |OPT|,wehave: 1 ai+1 = (a0 -1)(1 - )i+1 +1 |OP T | a0-1 1 |OPT|·ln |OP T | =(a0 -1)(1 - )+1 |OP T | a0-1 1 ln |OP T | = (a0 -1)( )+1 e |OP T | =(a0 -1) · +1 a0 -1 = |OP T |+1 a0-1 That is, after |OP T |·ln |OPT| iterations, the number of pieces remaining is at most |OP T |+ 1.For each additional vertex we choose, we will decrease the number of pieces by at least one.we need only pick at most |OP T |additional vertices to reduce the number of pieces to one.The total number of vertices that we choose is no more than |OP T |·ln a0-1 + |OP T |.Since |OP T |= n-1 , the solution found |OPT|.
Relationship: reasoning
Domain: Networks
Sentence 1: C c7 · rk · nc7 · rk Or we use the other formula to the multicast capacity as v n .k(n)= O( v v· W ).
Sentence 2: log n · k the multicast capacity per .ow is .k(n) .k(n)= = O( v v· W ) nn log n · k v 4.3 When k = o( m) v Clearly, when k = o( m), the expected number of subregions which contain at least one receiver, E(s)= k w.h.p.
Relationship: reasoning
Domain: Networks
Sentence 1: In the indoor setup, we used 19 nodes within a circular receiving node (94 ticks), and (d) any processing jitter in­volved(.52 ticks).
Sentence 2: we chose control slot duration to be 393(93 + 154 + 94 + 52) + 27 = 420 ticks, considering 27 ticks for the guard band as given earlier.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.6 Competing TCP-AP and TCP NewReno Flows Since TCP-AP applies rate-based transmission only within the TCP congestion window, the number of packets in flight can never exceed what the window allows.
Sentence 2: tCP-AP is TCP-friendly by definition, since TCP-AP cannot transmit at a rate higher than a standard TCP connection operating along the same path would achieve.
Relationship: reasoning
Domain: Networks
Sentence 1: After that, P becomes larger loading (C) than PMAP in case A exchanges RTS/CTS/DTS with B be­fore C does that with D, or the interference from C to B exceeds the planned loading at B, in the other case.
Sentence 2: only one transmission can proceed, and the throughput be­comes comparable to that of the 802.11 scheme.
Relationship: reasoning
Domain: Networks
Sentence 1: Any node u at distance d = D/41/a will have a clock rate differing by no more than J Da/(4B) from v s, and likewise for nodes close to w. Therefore, all nodes within distance D/41/a from v have by J Da/(2B) faster (or slower) clocks than the nodes within distance from w. (41/a) Since it takes in expectation DB/ 2 · time until the state of nodes further away than D/41/a in.uence v s or w s clock rates at all and clock rates are determined by averaging, v s and w clocks will (with constant probability) drift apart at the rate of at least J Da/(2B) for that time period.
Sentence 2: (41/a)(J D1+a) askewof J D1+a/2 ·= Ois built up.
Relationship: reasoning
Domain: Networks
Sentence 1: This is because under No-PSP, all the normal traf.c packets have to compete for limited bandwidth re­sources with the attack traf.c, while with our protection scheme only normal traf.c marked in low priority class is affected by the increasing attack.
Sentence 2: even in the extreme case when the attack traf.c demand is suf.cient to clog all the links, our protec­tion scheme can still guarantee that the normal traf.c marked in the high priority class goes through the network.
Relationship: reasoning