sadat2307/MSciNLI huggingface dataset:
Domain: Networks
Sentence 1: Observe that the TCP .ow obtains 64% of the idealized objec­ 1200 tive throughput, whereas the UDP .ows obtain 75%.
Sentence 2: by throttling uncontrolled UDP .ows at the input, IFA ensures that an upstream TCP .ow can obtain nearly its fair share, with the dif­ 800 Goodput [kb/sec] ferences between TCP and UDP shares in isolation explored pre­viously.
Relationship: reasoning
Domain: Networks
Sentence 1: 3.3 Signal Strength For tracking signal strength variations, we acquire the Ar­bitrary Strength Unit (ASU) value from Android OS once per 500 ms. ASU is an integer value ranging from 0 to 31.1 Then by using the formula: dBm =2 · ASU - 113, we can acquire the signal strength power in Watts.
Sentence 2: dBm value is always odd in our measurements, which we will see in Section 5.
Relationship: reasoning
Domain: Networks
Sentence 1: Exceptionally, num erts which vehicles in the same cell measure can be di.erent with each other due to packet loss.
Sentence 2: the biggest one among num erts, pNA[( n+1 )] and NA[( m+1 )] 22 is stored at NA[( m+1 )], where pNA[( n+1 )] indicates the 2 2 number of vehicles in the cell v belongs to.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.1.1 Neighbor s forwarding ability To model a node s forwarding ability, a selection probability gd(j) is assigned to each neighbor node j based on its PWM value dij ,for a speci.c ultimate destination d at time t. Probabilistically, the tran­sition must go through the nodes that have maximum PWM mean­ing they are less affected by the primary users.
Sentence 2: gd(j) is found based on the odds on PWM probability distribution as fol­lows.
Relationship: reasoning
Domain: Networks
Sentence 1: In addition to the backscattered signal from the sensor, a wall-re.ected multi­ 1 path signal, S1, is also received at the reader.
Sentence 2: the backscatter signal received by the reader is the summation of 1 two signals: wall-re.ected multipath signal S1and sensor­ 1 backscattered signal S2.
Relationship: reasoning
Domain: Networks
Sentence 1: The load LMC generated by a complete Pool refresh in multicast mode is R LMC = Rlm + Pilu i=1 The above formulas for LDA and LM C show that service dis­covery in DA mode is usually much more e.cient than the multicast procedure.
Sentence 2: the multicast discovery should only be used as a fallback mechanism when no DA is avail­able.
Relationship: reasoning
Domain: Networks
Sentence 1: In GF, nodes exchange their location information with neighbors; forwarding decisions are made by selecting a neighbor that is closer to the destination.
Sentence 2: gF relies on an underlying localization mechanism that allows the sensor 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.
Relationship: reasoning
Domain: Networks
Sentence 1: When the LDC-UWB signal power is .xed power per pulse, the interference to wideband OFDM is mitigated with reducing duty-cycle of LDC-UWB system.
Sentence 2: when the LDC-UWB sig­nal power is .xed power per pulse, the duty-cycle of LDC-UWB should be chosen low values of 0.1 % and using PRF = 3.9 MHz is absolutely essential.
Relationship: reasoning
Domain: Networks
Sentence 1: L2 Cic,ir Assume that on average, Ncell sensors are expected to be deployed in each cell.
Sentence 2: among all the sensors with home cell Cjc,jr , the average number of sensors that a sensor u can directly communi­cate with can be estimated by Ncell ×p(Cjc,jr , Cic,ir ).
Relationship: reasoning
Domain: Networks
Sentence 1: (10) 0 0 sin .m cos .m and V = [xm,ym, 0, 0]T (11) 'new ' 'new = · z bnew as ' new -1 ' new A U· (z -V) = b(12) A 'new ,U,Vand bnew are known, hence by now we have transformed the partitions created in the second iteration into linear constraints in the .rst iteration s coordinate system, with the same variable z ' .
Sentence 2: we can combine these linear constraints with the ones in the .rst iteration and solve them jointly.
Relationship: reasoning
Domain: Networks
Sentence 1: Mutation operators (see subsection 3.3) can ei­ther (a) switch a gene from one allele to the other or, (b) in the case of a .nite set of possible gain values (for noisy strong links), tune the allele selecting one of those values.
Sentence 2: an individual with a strong link at a given matrix position is close (in the parameter search space) to an indi­vidual without a link at the same position, regardless of the actual gain of the link.
Relationship: reasoning
Domain: Networks
Sentence 1: As mentioned earlier, when an AP has no more than eight antennas and a client has no more than four antennas, to maximize the number of streams CoaCa usually does not need to allow more than three APs to concurrently serve their clients.
Sentence 2: even if the MU-MIMO network included more than three cells, they would not lead to a multiplexing gain increase.
Relationship: reasoning
Domain: Networks
Sentence 1: However, there are several reasons why these properties are not measured: 1) different systems have their own measure­ment commands on system performance, which means it is not good for heterogeneous networks; 2) it is sometimes very dif.cult to implement on some development platforms, such as JAVA; 3) System Call is very expensive.
Sentence 2: we try to .nd other properties that can be measure easily and ef.­ciently.
Relationship: reasoning
Domain: Networks
Sentence 1: If it does not drop the packet, it decides to forward the packet with probability pf given by 1  ... 7 p =~ f N K(1- E ) If the node decides to forward the packet, it sends an acknowledgment as a confirmation of forwarding, back to the source.
Sentence 2: the acknowledgment serves the purpose of letting the source know that some node which is willing to forward the packet has already received the packet and the source should stop further retransmissions.
Relationship: reasoning
Domain: Networks
Sentence 1: However, the security in ad hoc networks is hard to achieve due to the limited physical protection to the nodes, lack of the computational ability and limited power.
Sentence 2: in this paper, we propose a robust and secure data transmission scheme, based on identity-based cryptosystem, elliptic curve cryptography and hash chains, to satisfy the routing security and data secrecy requirements for mobile nodes' communication over ad hoc networks.
Relationship: reasoning
Domain: Networks
Sentence 1: Indeed, if each node in the clique receives n/c messages, with only small probability the received messages induce a partition of the nodes to c disjoint subsets.
Sentence 2: in general, for graphs with large weak conductance we can only aim for each message to be received by n/c nodes (and for each node to receive n/c messages), but not necessarily as a well-structured partition.
Relationship: reasoning
Domain: Networks
Sentence 1: We have implemented a matrix R(tk)=[.wh], which stores ran­dom variables ., with a unit-mean Rayleigh distribution, to account for the statistical attenuation in the channel from cube w and h.The use of Rayleigh random variable gives the worst case behavior of the channel (saturation condition), as it is often the case in shal­low water environment (depth less than 100m) [3][8].
Sentence 2: the statistical transmission loss is modeled as, D 2 TLij (tk)=TLij · .wh, (17) where i and j are the sending and the receiving nodes respectively, w and h are the cubes where i and j are located, respectively, .
Relationship: reasoning
Domain: Networks
Sentence 1: Since some error pat­terns induced by the hidden collision might not be clearly di.erentiated from the errors from mobility, i.e., both can induce relatively more errors in the latter part of A-MPDUs, the above schemes might not work properly in the presence of hidden stations.
Sentence 2: to ameliorate such a hidden station problem, we employ an adaptive use of Request-To-Send (RTS) and Clear-To-Send (CTS) exchange.
Relationship: reasoning
Domain: Networks
Sentence 1: The cost function w : E × R+ -R+ , gives the cost as a function of edge and time.
Sentence 2: the interpretation of w(e, t) is the following: Let e be an edge from node u to node v. Given a message at u at time t, w(e, t) is the cost (delay) of sending it to v. if e is taken the message will reach v at time t+w(e, t).
Relationship: reasoning
Domain: Networks
Sentence 1: Another issue posed to the client during a VoIP call is that apart from receiving packets from the peer, it is also sending pack­ets to the peer at .xed intervals.
Sentence 2: assuming it buffers any generated packets when it is in sleep state, it also needs to ensure that its sleep/wakeup schedule is such that these packets reach the peer by their playout deadlines If the client knew the network latency for each packet through­out the call (i.e.
Relationship: reasoning
Domain: Networks
Sentence 1: In principle, in order to collect the bandwidth Tik from APi, station k needs to connect to APi during a duty cycle fik = Tik/wik,where wik is the wireless capacity from APi to station k. By reducing the time spent on APi, the duty cycle fik e.ectively acts as a gauge that limits the amount of bandwidth that can be received from the AP.
Sentence 2: tCP .ows adjust their transmis­sion rate to meet the request Tik.
Relationship: reasoning
Domain: Networks
Sentence 1: In order to take advantage of these clustered sensors, a Wireless Array-based Cooperative Sensing Model (WA-CSM) is proposed in [4], which forms the closely located nodes into WA s. It has been shown that the cooperative sensing cov­erage of WA s can be represented by larger sensing circles with sensing range dictated by the number of sensors and the geometry of the wireless array.
Sentence 2: the proposed WA-CSM is shown to provide a higher degree of sensing per­formance to the network than that achievable by using the sensors separately.
Relationship: reasoning
Domain: Networks
Sentence 1: Subject to R = r, his expected e.ective budget re = E[Re|R = r] is no larger than X X i -1(d -1) r +(d -1) r  m = r + r (i -1)m b(d -1) bm(d -1)m i=1 i=1 because this corresponds to the case where all his samples were rewarded with the highest probability, assuming, for each, that all prior samples failed and raised counters in the most convenient way; even if they didn t. Given that PR m+1 rr+1 r (i - 1)m = (x - 1)m = and that the attacker i=11 m+1 must use d e.ective samples per entry, re re r 1(d -1) r m+1 E[No|R = r] =LJ= = + .
Sentence 2: d d ddbm(d -1)m m +1 unconditioning from R, E[Rm+1 E[R] 1(d -1) ] E[No] = + .
Relationship: reasoning
Domain: Networks
Sentence 1: Since the pairwise distances of the centers of these disks is greater than r, then the disks must be non­intersecting.
Sentence 2: moreover, any point on a disk in H is at a distance at most (a+1)r+ r 2 from v. the number of nodes in H is upper-bounded by the number of non-intersecting disks with radius r 2 whose areas are completely contained within the gray area shown in Figure 5.
Relationship: reasoning
Domain: Networks
Sentence 1: Virtual Machines Placement for Network Isolation in Clouds Gyuyeong Kim, Hoorin Park, Jieun Yu, and Wonjun Lee Department of Computer Science and Engineering Korea University WCU Future Network Optimization Technology Center (FNOT) Seoul, Korea wlee@korea.ac.kr ABSTRACT Performance isolation is a serious issue in multi-tenant data center because interference among tenants can cause im­mense service troubles.
Sentence 2: present data center pro­vides performance isolation among tenants.
Relationship: reasoning
Domain: Networks
Sentence 1: Guv da Guv iv i da da i uv Giv uv Since Kuv := and Muv := Nv, we have Guv da Guv iv = Ki (17) i Quv uv .iP + Muv .
Sentence 2: i Qumu = Kumu .iP + Mumu , (18) i .Qumu i = Kumu .i.
Relationship: reasoning
Domain: Networks
Sentence 1: 0 A probabilistic Turing machine is a non-deterministic Turing machine which randomly chooses between the available transitions at each point with certain probability.
Sentence 2: a prob­abilistic Turing machine can (unlike a deterministic Turing Ma­chine) have stochastic results; on a given input and instruction state machine, it may have different run times, or it may not halt at all; further, it may accept an input in one execution and reject the same input in another execution.
Relationship: reasoning
Domain: Networks
Sentence 1: Then, for a DF scheme, the outage proba­bility of the source-relay-destination path can be described as P(CIN|OS,R,OR,D) =1 - Pr(zS,R >.th)Pr(zR,D >.th) =1 - (1 - P(CIN|OS,R))(1 - P(CIN|OR,D)).
Sentence 2: (18) the overall outage probability of SC is obtained by the product of the outage probabilities of each branch, i.e., P(CIN|SC)= P(CIN|OS,D)P(CIN|OS,R,OR,D).
Relationship: reasoning
Domain: Networks
Sentence 1: Itis convenientthereforetoseparateout the singular and non-singular parts of P(sr,0|z)as follows 1 1+aN 0 (z) P(0,0|z)= 1 × + .N(z) (30) N(1-z) 0 2 1-aN(z) where N-1 { 11 .N(z)= L N m1=1 (31) mn which can be derived by remarking that the vectors e z (1- cos(2p m1))(1-c2 (z))12 m1 2 N 1+aN (z) m1 } pN i2 e cm1 (z) m2 × -am1 (z) 1-aN (z) m1 m2 =0 1 } × pNV21-1-()cz i2 where am1 (z)is the smaller root of the equation 2 2 X- X +1 =0 cm1 (z) whose discriminant is positive for 0 <z< 1.
Sentence 2: we .nd am1 (z)= m1 · (27) cm1 (z) Now, using partial fraction decomposition, we can write m2 -a-1 m1 (z) e is holomorphic at z = 1.
Relationship: reasoning
Domain: Networks
Sentence 1: [4] proposed the degree of spatial dependence (DSD), which indicates the similarity between the veloci­ties of two nodes that are not too far apart (less than 2R).
Sentence 2: dSD is high when the velocities (magnitude and direction) of two nodes are similar, what normally occurs when the movement of a node depends on the other s. when applied to the whole wireless network, this metric reveals when nodes move in agroup manner, no matter if they rep­resent aero-vehicles, people, or even small animals.
Relationship: reasoning
Domain: Networks
Sentence 1: However, in reality, the nexthop di.eres from what we have expected.
Sentence 2: with Equation 9, we have,  3.3 Message Over.ow and Threshold  V dk (n,t) V(t)- .T .V(t) .t (10)  Figure 5: An example of message over.ow .V(t) Fkd(n,t)=.T (11) .t .V(T) Whenpotentials are getting up(.
Relationship: reasoning
Domain: Networks
Sentence 1: Data packet retransmission provides implicit ACK to k- 1.
Sentence 2: the hold-off time for ACK, which is started at the recep­tion of retransmission, is determined such that the transmission of ACK is de-synchronized from the transmission of data packet so as to avoid collisions between the ACK and data packets, thereby reducing the number of retransmissions.
Relationship: reasoning
Domain: Networks
Sentence 1: The BCE at the LMA contains a unique HNP per HIT_MN, which is notified to all MN s interfaces, resulting in a per-MN-prefix scheme and not a per-interface-prefix approach as in PMIPv6.
Sentence 2: the binding is between the interface identifier (if_ID) and the serving MAG, not anymore between the HNP and the serving MAG.
Relationship: reasoning
Domain: Networks
Sentence 1: Substituting variables back in the cyclic part, we get, 1 !
Sentence 2: s V1 = YH1 Hii V1,ki =(i +1)(mod)q (8) iki i=q (i) V1 can be composed of any p +1 Eigen vectors of the H1 matrix Q1 Hii to provide the required N .
Relationship: reasoning
Domain: Networks
Sentence 1: However, we believe that even though im­perfect the data still yields useful information about IPv6 adoption for the following reasons: (i) no substitute data lacking bias exists (e.g., traceroute also has bias); (ii) the view of the global routing in­frastructure of ISPs whose routing data is represented is a real view from their perspective, and any path or AS counts observed are, at worst, lower bounds; (iii) we have no reason to believe that the bias present in these data for IPv6 differs systematically relative to that for IPv4, suggesting that looking at ratios of adoption, especially over time, is reasonable; and (iv) in the cases of counting globally­visible pre.xes or ASes seen supporting IPv6, the fact that some local paths are missed does not speak to the global adoption state.
Sentence 2: we present the data knowing full well it is a less-than­full statement on the routing state.
Relationship: reasoning
Domain: Networks
Sentence 1: When (l, p) is the Pr {(l, p)} 2 (10) ) n(z = right child of its parent, if the parent is a collision node and (l, p -1) is an empty read node, then (l, p)will also be a collision node.
Sentence 2: instead of visiting (l, p), TH should directly hop to the left child of (l, p).
Relationship: reasoning
Domain: Networks
Sentence 1: The result follows trivially when d 2 =(L ' ,K)be­cause, from Lemma 2.8, the k coronas transmitted at the beginning of the awake periods divide the k coronas to be broadcast in intervals of (L ' ,k) consecutive coronas and each of such intervals is received by a sensor in a di.erent awake period.
Sentence 2: in d/k 2 consecutive sleep-awake cycles a sensor receives all the k coronas.
Relationship: reasoning
Domain: Networks
Sentence 1: Second, to simplify the implementation of Wi-Fi hardware, the bitrates available for transmission are discrete.
Sentence 2: in order to protect against the uncertainty in measuring SNR, and due to the discreteness of bitrates, for every successful  Figure 2: The CDF of the link margin between the actual SNR measured by the channel sounder, and the SNR threshold chosen by SoftRate s rate adaptation algorithm.
Relationship: reasoning
Domain: Networks
Sentence 1: In contrast, only few external data types are reused in the definition of the data model of OMA BCAST Service Guide, such as the TV­Anytime GenreType [14], and the data type defined in OMA Location enabler [16] for specifying the target broadcast areas.
Sentence 2: even though the high­level designs of the two data models are similar, they only share little common XML namespaces.
Relationship: reasoning
Domain: Networks
Sentence 1: For each vertex v, we can add an edge of cost pv with capacity sv at v. The budget constraint B in the network augmentation problem is equal to the knapsack size C. It is easy to see that an optimal solution of the knapsack instance can be ob­tained from an optimal solution of the budget-constrained network augmentation instance.
Sentence 2: we consider approximation algorithms for our augmen­tation problems.
Relationship: reasoning
Domain: Networks
Sentence 1: MR3 , in turn, generates an update message to its parent-MR, MR1, con­taining its MNP and the MNPs hosted by its child-MRs, in this case MR4 s MNP.
Sentence 2: mR1 updates its topology list which indicates that both MNP s of MR3 and MR4 is bindedtoMR3 sCoA.Theroutingofpacket usingthisbind­ing is illustrated in section 3.3.4.
Relationship: reasoning
Domain: Networks
Sentence 1: ß-1 Proof: From the above analysis, C is the union of TCDS and the added shortest paths.
Sentence 2: combining the Theorem 3 and Lemma 6, |C| = |TCDS | + Psize (5-ß)K = 2K|CDS * |- 1+ |CDS * | +3 ß-1 = (ß+3)K |CDS * | +2 ß-1 0 THEOREM 6.
Relationship: reasoning
Domain: Networks
Sentence 1: Factors such as userbehavior ran­domness and radio link quality in.uence the collected data and thus the analysis results.
Sentence 2: to obtain a rep­resentative understanding of the application studied, ARO can be used across multiple runs or by multiple users to ob­tain a comprehensive exploration ofdifferent usage scenarios of the target application, as exempli.ed in our case studies (§7.1).
Relationship: reasoning
Domain: Networks
Sentence 1: In terms of the assumptions on tra.c patterns, made in the design of RPL [19], this entails that equal im­portance should have been given to point-to-multipoint and multipoint-to-point tra.c.
Sentence 2: 1.4 Statement of Purpose one purpose of this paper is to explore the per­formance of LLN routing protocols for scenarios where bi­directional tra.c is prevalent, in particular understanding the behavior of RPL, and the viability of the sacri.ces made in generality by the design of that protocol, when exposed to this common tra.c pattern.
Relationship: reasoning
Domain: Networks
Sentence 1: This can lead to congestion and high packet loss due to interference, particularly on the 2.4 GHz band used by the more popular IEEE 802.11b/g technology, and other devices such as Bluetooth peripherals, ZigBee sensors and wireless surveillance cameras.
Sentence 2: no hard QoS (quality of service) assurances can be given for a municipal wireless network deployed on the unlicensed ISM frequency band.
Relationship: reasoning
Domain: Networks
Sentence 1: The key difference between server IPs and ASes is that the stable pool of ASes represented by the white portion of the week 51 bar is about 70% compared to the 30% for the stable pool of server IPs.
Sentence 2: a majority of ASes with server IPs is seen at the IXP during each and every week, and the number of ASes that are seen for the .rst time becomes miniscule over time.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.1 Computing the Set of Best eBGP Routes The second phase of the algorithm begins with a complete set of eBGP routes (after modi.cation by the import policies) and pro­duces the set of candidate best eBGP routes; the best route that each router selects is an element from this set.
Sentence 2: the second phase of the algorithm must have the following properties: It must eliminate any eBGP-learned routes that could not be the best route at any router in the AS.
Relationship: reasoning
Domain: Networks
Sentence 1: Consequently, the desired change in the .ow s congestion window is proportional to its current con­gestion window (i.e., !cwndiecwndi).
Sentence 2: again, the desired per­packet feedback is the desired change in the congestion window divided by the expected number of packets from this .ow that the router sees in an interval d. we .nally .nd that the per-packet negative feedback should be proportional to the packet size multi­plied by its .ow s RTT (i.e., niertti·si).
Relationship: reasoning
Domain: Networks
Sentence 1: This result 4 4(a+ß) depends on the ratio of a to ß.If ß is much larger than a, the average bandwidth per server for BCN can be reduced to 0.25, while if ß is far less than a the average bandwidth per server approaches 0.
Sentence 2: we cannot tell which one is better between BCCC and BCN without specifying the ratio of a to ß.
Relationship: reasoning
Domain: Networks
Sentence 1: We stress that this general strategy is not given as an optimal allocation,whichoughttobe derivedfroma(game)theoretic per­spective.Rather, suchanintentionallynon-optimized(and actually inef.cient)policyservestoshowtheeffectivenessof our software implementation.
Sentence 2: moreover,it canbethoughtof asacharacteriza­tionof the inef.cient Nashequilibriainthegameswith competi­tive sharing,whilethe goalof spectrumsharing should ratherbe a collaborative assignmentoffrequencies.ourreferenceal­location policy correctly re.ects that, if the whole common pool isshared competitively,inthelong runonlyinef.cient and unfair allocations willbeachieved.
Relationship: reasoning
Domain: Networks
Sentence 1: 4.4 Application Interface The above integration of DTN and AODV routing is capable of collecting information about different options to reach a target but it is the application on the originator that must decide how to use this information.
Sentence 2: the application needs to be able to inquire and obtain the extended routing information from the lower layers and also be able to feed part of this information, e.g., routing hints, to (not just) its local DTN router.
Relationship: reasoning
Domain: Networks
Sentence 1: The .rst term is inversely proportional to a and is independent of n,whereas the second term is linearly dependent on a and vanishes as n grows large (this e.ect is shown numerically in Figure 2).
Sentence 2: both MDS-MAP and HOP-TERRAIN are guar­anteed to produce estimated positions less that any .xed threshold d so long as the constant a and number if nodes n are chosen large enough.
Relationship: reasoning