[4] proposed the degree of spatial dependence (DSD), which indicates the similarity between the velocities of two nodes that are not too far apart (less than 2R).

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 represent aero-vehicles, people, or even small animals.


5 shows that the .xed subcarrier allocation with channel coding does not have SNR gains.

the optimal transmission scheme for OFDMA systems should combine the maximum matching in MAC layer and the universal coding in PHY layer.


With complete knowledge, it determines whether or not each user subscribes to or unsubscribes from it.

it .nds locations of its access points AP [1] at decision time 1.


AHMAC SCHEME In IEEE 802.11s mesh networks, the MPP becomes the natural bottleneck node since all frames are transferred to wired networks through the MPP.

it is important that an MPP e.ectively uses the wireless resources.


This happens because, as described in §4.1, the analog comparator used in the receiver, typically, outputs either a constant sequence of ones or a constant sequence of zeros in the absence of a backscattered signal.

the receiver sees the same bit during a 10-bit interval.


(28) There are no more than 2re 2/spairs of iand jsuch that ij, for 1I1:eand, for any iEI,atmost 2re/slines satisfy the  relation with i.


However, in reality, the nexthop di.eres from what we have expected.

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(.


Practitioners need to operate on a cyber-physical topology at a variety of levels of granularity.

we formally de.ne network/attribute contraction and expansion in order to satisfy that requirement.


We found that 91.7% of all networking API calls are related to HTTP(S).

we decided to focus our further analysis on the usage of HTTP(S).


Data packet retransmission provides implicit ACK to k- 1.

the hold-off time for ACK, which is started at the reception 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.


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.

the binding is between the interface identifier (if_ID) and the serving MAG, not anymore between the HNP and the serving MAG.


Substituting variables back in the cyclic part, we get, 1 !

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 .


Since these results were generated with simulated data, we will need to confirm our detection rate with real data.

future tasks will include capturing live network data, and repeating the process of cluster database building and analysis with generated attacks.


If the RDNSdes are resolvers, then they are likely handling DNS requests from their clients for some of these Web sites.

some of these popular host names should be in the RDNSdes caches.


However, we believe that even though imperfect 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 infrastructure 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 globallyvisible pre.xes or ASes seen supporting IPv6, the fact that some local paths are missed does not speak to the global adoption state.

we present the data knowing full well it is a less-thanfull statement on the routing state.


Flow symmetry di.ers greatly for all TCP tra.c, but negligibly for TCP data traf.c.

tCP data tra.c is robust against the di.erent .ow de.nitions (timeout vs .ags).


Node 0 is the Gray node covering the most White neighbors (nodes 4 and 6), hence it is chosen for the Backbone and colored Black.

all its neighbors are colored Gray (Figure 1(C)).


We also note that the effectiveness of the Q-learning approach depends on whether the Markovian property of the underlying environment holds.

sDPP s degree of efficiency depends in part on the accuracy with which the host mobility model describes the movements of real people.


the m th step leads to a higher energy consumption.

the single local solution is the global optimal and both ob jective functions are convex when c=2.


From the scheme it is easy to see that each predistributed pairwise key between two sensors is randomly generated.

no matter how many sensors are compromised, the direct keys between non-compromised sensors are still secure.


of Computer Science & Engineering The Pennsylvania State University, USA kandemir@cse.psu.edu communication energy can be orders of magnitude higher than computation energy.

in most cases, communicating all the data read (sensed) from the environment as it is (that is, without any filtering) may not be acceptable.


The fallback feature could be needed, for example, when the Internet-wireless gateway (or whoever the transcalar happens to be) do not have enough processing power for performing the desired transcaling process(es).

and unlike (non-scalable) transcoding based services, transcaling provides a scalable framework for delivering higher quality video.


At small speeds, if most of the communication tra.c is between nodes on the same lane (for the FW model) or between nodes in the same group(for the RPGM model), greater will be the path duration for this tra.c, which will also result in higher average path duration.

intuitively the throughput will be higher.


In other words, this will maximize the number of lost packets to be combined at once.

this signi.cantly reduces the number of retransmissions, especially when we compare it to  (a) (b) (c) Figure 5: The result for 120 MSs based on a network topology in Fig.


The current context domain of a context consumer corresponds to the domain de.ned at its current point of network connectivity.

when a context consumer moves and changes the network segment where it is connected, the domain where it is included will also change.


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.

instead of visiting (l, p), TH should directly hop to the left child of (l, p).


If our original signal z consists of mea- surements taken at five minute intervals, then the derived signal HiL j-1 (x) consists of data values that are 2 j × 5 minutes apart one from the other.

as j grows, the corresponding output signal becomes shorter and records a smoother part of the sig- nal.


So, grouping nodes increases the productivity and the performance of the network with low overhead and low extra network traffic.

good scalability can be achieved in group-based architectures.


The result follows trivially when d 2 =(L ' ,K)because, 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.

in d/k 2 consecutive sleep-awake cycles a sensor receives all the k coronas.


A gateway node, upon receiving an outgoing message, republishes the message in the destination cluster.

the gateway node pretends to be a child of one of gateways of the destination cluster.


In scenarios such as disasters, it is conceivable that some images are more important than others (e.g., a human in need of rescue versus a damaged uninhabited vehicle).

one could conceivably target prioritizing image uploads based on content; however, we defer studies of such possibilities to the future.


Data for experiments commonly come from a variety of sources, including RocketFuel [37], the Internet Topology Zoo [26], and programmatically generated network topolo gies.

the system has been designed to easily accept data from a variety of formats.


Second, to simplify the implementation of Wi-Fi hardware, the bitrates available for transmission are discrete.

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.


In summary, the proposed secure routing scheme can withstand the DoS, Sybil attack, and wormhole attacks.

it is quite suitable for securing against malicious nodes in MANETs.


In contrast, only few external data types are reused in the definition of the data model of OMA BCAST Service Guide, such as the TVAnytime GenreType [14], and the data type defined in OMA Location enabler [16] for specifying the target broadcast areas.

even though the highlevel designs of the two data models are similar, they only share little common XML namespaces.


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 obtained from an optimal solution of the budget-constrained network augmentation instance.

we consider approximation algorithms for our augmentation problems.


http://dx.doi.org/10.1145/2661714.2661731 multimedia applications such as Internet Protocol Television (IPTV), Internet TV, video sharing, and video podcast have gained significant popularity.

the study and investigation of new distribution infrastructures to reach a vast number of users without affecting aspects of availability and quality have become vital.


We believe that a 32th WSS is enough for current and future packet networks (it can provide up to 4Tbps rate with granularity of 1kbps).

under this condition, the space complexity of 216 SRR is c + O(N × K ), K= 32 and c = 3× .


To expand the overflow capability, when a MS arrives to a saturated compnet but is not compatible with an alternative compnet, a substitute MS can volunteer to overflow to free resources for the arrival.

a multimode MS can volunteer to overflow for a single mode terminal, or a number of speech calls can volunteer to overflow for a data session that is not supported on alternate compnets.


MR3 , in turn, generates an update message to its parent-MR, MR1, containing its MNP and the MNPs hosted by its child-MRs, in this case MR4 s MNP.

mR1 updates its topology list which indicates that both MNP s of MR3 and MR4 is bindedtoMR3 sCoA.Theroutingofpacket usingthisbinding is illustrated in section 3.3.4.


The paging area information is only updated in the LMA when the MH hands o. to the new paging area.

when the LMA needs the precise location of the MH, the LMA uses a speci.c multicast address of paging area to send paging request message.


Those packets will experience less delay through the P2P overlay.

comparing with the other two comparisons, the overall latency experienced by all peers is reduced, and so is the average latency.


ß-1 Proof: From the above analysis, C is the union of TCDS and the added shortest paths.

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.


First, each sensor node is limited in memory, battery life, computation, and communication capacities [3].

some techniques that mainly use the methods based on cryptography, like public key, or authentication are not expected to be used in WSNs.


Factors such as userbehavior randomness and radio link quality in.uence the collected data and thus the analysis results.

to obtain a representative understanding of the application studied, ARO can be used across multiple runs or by multiple users to obtain a comprehensive exploration ofdifferent usage scenarios of the target application, as exempli.ed in our case studies (§7.1).


In terms of the assumptions on tra.c patterns, made in the design of RPL [19], this entails that equal importance should have been given to point-to-multipoint and multipoint-to-point tra.c.

1.4 Statement of Purpose one purpose of this paper is to explore the performance of LLN routing protocols for scenarios where bidirectional 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.


Further away from the sink, the smaller the traf.c load it is expected to transmit.

the duty cycle of node 0 becomes lowered to a smaller value than those of nodes which are closer to the sink.


At the end of Phase 2 we are in the same situation as at the begin of Phase 1, except that now b packets remain queued.

we can iterate the same injection pattern to create instability.


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.

no hard QoS (quality of service) assurances can be given for a municipal wireless network deployed on the unlicensed ISM frequency band.


The bu.er of R8,4 and R8,5 is large enough to allow the intermediate level to be used until the end of video clip.

these two rule sets do not switch to quality level l0.


With the increase of hops, more and more beacons consume the limited bandwidth which also a.ects the reception rate of RSU.

we design a set of experiments in Section 5 to compare the performance of RMB with one next hop and two next hops.


When a handover occurs, the MN should re-authenticate itself to regain access to the network since the new AR IPsec databases are not con.gured.

the whole authentication processing has to be set up from the beginning to re-establish the IPsec tunnel.


Finally, existing techniques typically either cannot perform graph rescaling or do not do so in a manner that re.ects known patterns of network evolution.

the goal of this paper is to produce a topology generator capable of outputing a range of annotated Internet topologies of varying sizes based on available measurements of network connectivity and characteristics.


In our system, the strength of this technique in confusing an adversary is boosted by the fact that the set of RDIS issuing nodes is also changing every time.

correlating RDIS packets across different rounds of topology discovery is a more difficult task.


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.

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.


First, the potential threat of IPv4 address exhaustion has led to careful allocation of IP address blocks.

increasing number of networks have a limited number of available addresses to serve their user bases.


We know that fopt found in this step is not necessarily the best one for other separation values.

in the next step, different separations within the given range [L1, L2] are tried to improve the con.guration.


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 produces the set of candidate best eBGP routes; the best route that each router selects is an element from this set.

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.


Unfortunately, network administrators cannot rely on endnode software (often controlled by a di.erent organization) being up to date in terms of Anti-Virus updates and patches.

just as in the case of .rewalls, the use of an IDS is a popular retro.t strategy.


In scenes with signi.cant geometric complexity, an application can perform many millions of such calls per frame and will be limited by the available network bandwidth.

the amount of data required to represent the function calls, as well as the amount of time required to construct the network stream, will determine the overall throughput of the system.


Consequently, the desired change in the .ow s congestion window is proportional to its current congestion window (i.e., !cwndiecwndi).

again, the desired perpacket 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 multiplied by its .ow s RTT (i.e., niertti·si).


As we will show in Section 5, the latency of geographic routing in a TVC network can be controlled by tuning the minimum number, k, of awake neighbors in an epoch for all nodes in the network.

our algorithm enables tuning the value of k, in order to achieve a target routing performance.


While designing DCTCP, a key requirement was that it be implementable with mechanisms in existing hardware meaning our evaluation can be conducted on physical hardware, and the solution can be deployed to our data centers.

we did not consider solutions such as RCP [6], which are not implemented in any commercially-available switches.


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.

we cannot tell which one is better between BCCC and BCN without specifying the ratio of a to ß.


Moreover, authenticity today is typically achieved by securing the channel to the source, rather than explicitly authenticating the data.

several of the most natural features one would want for service access and data retrieval  persistence, availability, and authentication are made unnecessarily hard by the current hostto-host model of the Internet, often requiring awkward or expensive work-arounds.


However, Algorithm 1 is dynamic when the set of interferers are collected on-line.

algorithm 1 is .exible in that it can support both static and dynamic channel assignments.


On the other hand, a completely parallel register-based buffering of a complete packet uses to many hardware resources for a small-footprint solution as the one described here.

our concept combines both approaches using single parallel .lters which are controlled by a linear VLIW-style program.


However, in practice, the buffer will also be occupied by packets from reverse ACK traf.c, UDP .ows, etc.

in the presence of such background traf.c, the DoS source can potentially lower its peak rate and yet maintain an effective attack.


The cost of warping the blue curve to align with the green curve is the lowest.

pinIt successfully identi.es the green tag as the nearest neighbor of the desired tag.


We stress that this general strategy is not given as an optimal allocation,whichoughttobe derivedfroma(game)theoretic perspective.Rather, suchanintentionallynon-optimized(and actually inef.cient)policyservestoshowtheeffectivenessof our software implementation.

moreover,it canbethoughtof asacharacterizationof the inef.cient Nashequilibriainthegameswith competitive sharing,whilethe goalof spectrumsharing should ratherbe a collaborative assignmentoffrequencies.ourreferenceallocation policy correctly re.ects that, if the whole common pool isshared competitively,inthelong runonlyinef.cient and unfair allocations willbeachieved.


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.

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.


We also assume that all the wireless links have the same data rate and let .t0 denote the maximum tra.c that a wireless link can transmit in a period.


However, we cannot control the path taken by a packet and make it to pass through a certain subnet or router.

we build destination IP address sets for Internet2 and GEANT by selecting a random IP address from each of their original subnets.


In this regime, the probability that two or more occurrences of such interarrivals is highly unlikely.

the higher order terms in the binomial expansion are negligible and the union bound is tight.


As we have considered .ows with large delays before, operators may also care more for larger .ows, for which latency effects may be more pronounced than smaller ones (say with fewer than 10 packets).

in Figure 6(b), we plot the average relative error for .ows binned by their sizes.


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).

both MDS-MAP and HOP-TERRAIN are guaranteed 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.


However, given that we used a real network topology, along with a real demand schedule from that network, we feel reasonably con.dent that in the 10 to 30% threshold range, we would see similar performance in other scenarios.

it would be advantageous to set the thresholds at the high end of the (10 to 30%) range to reduce the number of messages.


Further, and in contrast to server workloads, HPC jobs are typically CPU-intensive and task synchronization points (e.g., in the MPI communication library) often require equal-paced CPU resources on all available cores.

it is an open question whether the consolidation bene.ts of the cloud model can really be achieved in HPC environments.


Additionally, when OLSR incorporates a bandwidth and channel metric, RDCS will be able to make more intelligent channel assignments.

while RDCS currently outperforms static channel assignments, we project that the di.erence will also grow with more intelligent routing metrics.


We note that in the unit value model, there is no admission control question, since there is no reason to prefer one packet over the other.

we deal with the scheduling problem alone.


Since users of a enterprise network are probably employees, they are more likely to be active for the entire observation period.

the top half of each graph is probably a good estimation of the fraction of users that an adversary can detect on a typical day.


The condition that node Xj is isolated means that no other node can fall in the range of Xj .

the nodes are restricted to the rest of the domain, in which Xi resides, too.


5 shows the status of OpenFlow switch (via OpenDaylight controller) by the other experimenter.

we can confirm that multiple users can utilize the OF@TEIN testbed at the same time.


These results recon.rm that the proposed protocol indeed successfully reduce number of collision in initial stages by taking large CW and reduce unnecessary empty slots in successive stages.

the increases in gain becomes more prominent when higher number of nodes contend in the cluster.


For example, counter aggregates can be constructedinsucha way as to accurately estimate the sample rate and the size of each sample.

counter aggregates can reliablybeassigned to cover a .xed time range (without taking all the storage from other formats) and the remaining space partitioned between .ows and packets.


Among these, KDD 1999 data set is arguably the most commonly used one (the other important trace is DARPA 1998, which is a predecessor of KDD 1999) [8].

we focused on the KDD 1999 dataset in our work.


To demonstrate that our policy routing module works, and to make our measurements closer to what Internet hosts in general would observe, all the measurements reported herein were taken with a policy that prohibited sending traffic to or from commercial sites over the Internet2.

for instance, a packet could travel from Utah to Cornell to NYU, but not from Aros to Utah to NYU.


Additionally, we only applied mechanisms and concepts already de.ned in existing speci.cations.

it is not necessary to go through a time-consuming speci.cation process.


2.2 Communication Protocol The SensorFly networks goal is to route all sensed data from mobile nodes to the base station.

the system implements aggregate and broadcast communication for the airborne explorer nodes while peer-to-peer routing is supported on landed anchor nodes.


The more trees are used in order to ensure that all nodes receive at least K packets, the higher is the source transmission rate.

minimizing the source transmission rate is equivalent to minimizing the number of trees.


As seen in Figure 1, the lookup engine is a reconfigurable hardware containing the hardwired routing data.

the engine performs high speed lookup decisions with no memory accesses.


The radius of an AS, the distance from the center, is computed based on the out-degree of the AS that is a number of its outgoing links (shown in Equation 1) so that ASes with higher out-degree are placed closer to the center.

the AS Core Map allows to identify AS structures by the geographic locations of ASes and their coreness based on the out-degree.


When local minima occur frequently, the shortest path length may also be growing, so the stretch does not necessarily change monotonically with K. Nevertheless, as our analysis and simulation will show, K (and hence LMD) can serve as a convenient control knob for an algorithm s performance, which typically meets its worst case either at the ends (e.g., O(N)) or right v in the middle (i.e., O( N )of K s complexity range, and changes monotonically elsewhere.

the TA model not only provides a framework for us to derive an algorithms scaling properties, which may otherwise be elusive to obtain, but also o.ers an easily controllable tool for average case performance evaluation.


The focus in this approach is the average utility per unit of time; then the total utility over M time units can just be taken to be M times the average utility.

in this approach we try to maximize the expected value of limM-.~(Y~M=x u,)/M.


In this case the number of links traversed, can be calculated as the average time to absorption by the last node L, starting from 0, at the following Markov chain of Figurel 1. i p 'i-/~ ...... X ~ Figure 11. packet-hops for a uniform chain Let E i be the average time to absorption by state L, given that we are in state i.

being in state E i means that the packet coming from the source was dropped just before the node i. Et.=O, EL-I =1 +pEo, EL.2 = 1 +pEo+(1-p)EL-I ..... Eo= 1 +pEo + (1 -p)El E° (1 - p)L ~ (I - p)/.-I ¢- "'" + ~ = p -1 (2) This procedure can also be applied to a non-uniform chain.


Since the independence number of each node in UDG is at most 5 (i.e., the number of jobs that will be preempted by ej is at most 5), the total pro.t made by algorithm GTD may be counted at most 5 times.

there is an additional factor 5 in the competitive ratio.


As the slave nodes only react on the beaconing signal, a loss of the master node causes the complete wireless network to stop.

we want to extend our protocol to support redundancy via multiple transceivers and to be able to detect the absence of a beacon.


VARIABLE VALUE PACKETS In this section we consider the case of variable value packets.

the goal of the scheduling policy is to maximize the total value of the packets successfully transmitted.


We assume that message transmissions proceed in synchronous time slots.

the schedule can be represented as an assignment of node transmissions to time slots.


............................ is usually small, and we have also claimed that the optimal ............ is almost independent on the channel matrix, while in fact it is mainly decided by ........ and the channel noise level ....0.

the optimal ............ could be computed offline, with a loo-kup table with different ........ and ....0.


The routing paths in wireless ad-hoc network are often multi-hop paths because destination node is usually out of the transmission range of source node.

before reaching the destination the packets travel through some intermediate nodes between source node and destination node.


The results in Table 3 indicate that within the selected factor ranges, queueing delay is more critical, and the correlation between processing and queueing delay is negligible.

for delay-sensitive applications, we believe that congestion control will be an e.ective way to improve end-to-end delay.


for the purpose of analyzing the rest of the steps of the distributed algorithm, we can assume the covered nodes are removed from the network because they can no longer a.ect the operation of the algorithm.


There is a great reduction (> 30 dB) in the direction opposite to the main lobe.

a great part of the radiation is absorbed by the human body.


For example, in Amazon s EC2, a user creates an account using his email account and a valid credit card.

an attacker can create and control virtual machines in the cloud.


A .nal aspect concerns the systems view of jamming as concurrent jammers can improve upon both the target frame detection and the jamming signal s power level.

the number of concurrent jammer is another important success factor.


We used a state-of-the-art WiMAX system suitable for both fixed and mobile deployments and explored its capability to deliver video streaming traffic.

in this section, we review previous studies focusing on VoD and video streaming over WiMAX.


3.1 Simple Random Network Coding Algorithm(SRNC) Using the SRNC algorithm, the sender is assumed to have no knowledge about which packets are at which receivers.

at every time slot, the sender generates and broadcasts a mixed packet c = v1p1 + v2p2 + ··· + vDpD, where vi s are drawn uniformly at random from the .nite .eld GF (F).


Later, when P1 arrives again at the EtherFuse, its hash will replace P2 s hash in the duplicate detector without detecting a duplicate.

the EtherFuse will not detect that there is a loop.


Moreover, if a roadside router RRi that is supposed to forward the FTQoSRep msg detects the failure of the link to the next RRj that is also supposed to forward the message, then, RRi sends the FTQoSRep msg with a force broadcast .ag.

all the neighboring road components that will receive the FTQoSRep msg with the force broadcast .ag activated, will forward the FTQoSRep msg even if they are not closer to the requester than the sending RR.


According to this de.nition, we could rank the features into classes for the features of which hold same number of high correlated features.

we rank the revealing example in Section 3, and .nd that f2 , f3 , f4 and f5 can be categories into a class, and f1, f6, f7 can be classi.ed into another class.


In a typical small or medium sized network, contention overhead is much smaller compared with data transmission.

without loss of generality, we .rst consider a single receiver SU-MIMO network6 , where the transmitter has 2 antennas and receiver 1 antenna.


When connecting, the servers send an updated server list to the bot.

.ltering access to these 22 hardcoded IPs prevents bots from updating their server list and, as a result, from receiving commands.


As the number of mobile hosts increases, the hand-o.s are successfully completed but with more di.culty.

both packet burst length and packet burst duration increase.


In general, when faced with a design decision for the simulator, a design similar to actual networks was chosen whenever possible.

any user who has a good understanding of the design and operation of real networks will .nd that GTNetS works similarly.


Furthermore under low contention, Z-MAC works like CSMA with or without synchronization.

z-MAC requires clock synchronization under high contention to implement HCL.


If it turns out that there are no tags with prefix q0, then we know that there are at least two tags with prefix ql.

the reader should as well skip the prefix ql.


We do not consider VDSL or .ber relevant as VDSL bene.ts are limited in range (2km), whereas cable/.ber deployment is planned based on demographic parameters such as population density.


bmn ( -E )-K e 2 ~ 2n~ 1 - .n when K v 2 log n. -E-log(1-E) V (K ) Pr Dmin > m (1 - .)


Therefore, all the guards of M now know that M not only needs to forward the REP but also that it should forward it to A and not any other neighbor.

two tasks have been added to the functionality of the guards in monitoring the REP packets.


While we suspect that the POC is often the same for both forms of congestion, this need not be the case.

the best way to determine that the POC that causes loss is shared is to apply the loss-corr technique (and wait the extra time).


Note that even an order of magnitude increase in p does not necessarily have a proportionate e.ect on Mmin .

the server does not have to impose harsh penalties in order to prevent cheating.


However,this method incurs signi.cant memory copycosts, particularly for large messages.

it best suits small messages, /* Sender : */ /* Receiver : */ /*The sender and the receiver begin /*The sender and the receiver begin communication at the same time */ communication at the same time */ MPI Barrier(.


The total number of bits to be matched is 8 times the number of bytes considered at a time (B).

equation 7 becomes « NBLSM 8 · B = (11) Nsubset b And Equation 8 will be rK/kl 8·B/b X X T (k, b, B ) = ' ij · (k + e · eij ) (12) j=1 i=1 with eij = =log2 ' ij = (13) and e(b) = 2b (14)  4.


Olivier Marcé Alcatel-Lucent France Olivier.Marce@alcatel-lucent.com overloading the network infrastructure and the tra.c control equipments.

today operators are faced with a capacity management problem.


However, in our scenario the throughput of .ow i is readily given by Ai/Di.

we de.ne the PF scheduler so that it selects the .ow i that achieves * Ri i =arg max .


Pab , then the requested is immediately obtained.

we are free to assume that additionally to lying on an attached tree, n is also on the path Pab .


However, the block resolution of the immediate enhancement layer, layer n+ 1, does not permit efcient use of the redundancy in the reserved block.

we could carve out extra areas for layer n+2, where its blocks are 1/64 of the layer n blocks.


The MRDS uses the link-layer data frame checksum to detect errors in the MRD-ACK packet.

the size of the MRD-ACK payload is small (25 bytes in our implementation).its overhead is largely dominated by the preamble and header associated with the 802.11 frame.We can potentially decrease overhead further by piggybacking MRD-ACK packets on data frames being transmitted in the same direction.


The RNC is therefore a natural choice for protocol termination/translation.

in this modified multicast architecture we have moved the multicast routing protocol termination from GGSN to RNC.


Applications trying to conceal the privacy of their participants rely on shaky ground.

the entire protocol stack should protect the identity of the participants.


With this comes an on going battle against wasted spectrum.

spectrum as a scarce commodity should be used both effectively through better modulation and coding systems or shared between systems.


On many networks that use dynamic addressing, including the Georgia Tech campus network, DHCP leases are tied to authentication.

a client whose lease expires must re-authenticate a manual, inconvenient, and time-consuming process.


CW adaptation is performed in a stop-for-a-round fashion and differentiation is provided by varying the up and down scale factors for di.erent tra.c classes.

cW size for higher priority tra.c decreases faster than the lower priority where an increase is performed more slowly.


At each arrival, a data message is generated with a geometric number of packets.

the interardval time between consecutive message arrivals is exponentially distributed with a rate of Xa~i for data user i.


A data plane of a virtual network slice comprises the virtual forwarding engine of the router and the virtual link: both of these is isolated with other slices.

a packet should not be passed across di.erent slices.


Interestingly, we were not able to .nd evidence that Maude-NPA was generating any in.nite paths in its search.

rather, the use of homomorphic encryption gave the intruder so many opportunitiesfor generatingdifferent typesof statesthatit overwhelmedthetool.thisprotocoldid turn outtoprovide anexcellent opportunityforstresstesting, andlikely willbe useful forbenchmarkinginfuture work.


the algorithm will choose (Stwo1, Skk)and (Stwo2, Skk) links at the .rst two iterations.


Our underestimation is most probably due to the fact that there are links along the path with very similar available bandwidth.

the second linear segment become too short to detect.


Therefore the uplink SINR decreases, according to increment of d, more than the downlink SINR.

the channel asymmetry can be caused by the di.erence of channel models of the downlink and the uplink.


Therefore, its size is given by SH, plus a term SC · n · that is proportional spmin to the number of node identi.ers .

table 2: Values used for the parameters de.ned in in Npmin TMSP2 =SH +SC · n · spmin .


We assume the distance of a multicast tree is confined within a limited number of hops.

if the route request message can not reach the source node within the predefined TTL value, this node is treated to be fail to join the tree.


On the other hand, by allowing NC in the network, a node can transmit simultaneously all the bits it receives from its neighbors to their respected destinations or relays.

the dissemination of information is maximized during transmission using NC and during reception using MPR.


That is, the resulting multicast tree may cover a subset of mesh routers where end-users can receive video streams successfully.

our goal is to determine a partial multicast tree that can maximize the number of serviced end-users.


Packets received on an incoming interface are passed to NetEm which processes the packets according to the con.gured impairment factors before enqueuing them on the outgoing interface.

as indicated in the .gure by means of distinct impairment function symbols, NetEm impairment parameters can be set on a per-interface base, which is a pre-requisite for modeling unidirectional links.


In practice using a signal for each user would be too large for a BlueTooth device name, which is limited to 256 bytes.

rather than using the maximum clique cover, we compute a minimum clique cover: the smallest msuch that C1 .C2 ..... Cm = R .{u}.


However, DeTail ensures that packet drops only occur due to relatively infrequent hardware errors/failures.

it is more important for the timeout duration to be larger to avoid spurious retransmissions.


Head (QUEUE_D) UPD_QUEUE_D (N_Holder_token, QUEUE_D) End When a site receives the token and queue QUEUE_D, the Reception_message procedure updates the variables (privilege and father) of this site.

constantly the site having the token is the root of the tree structure.


9 shows a sensitivity analysis of the peak bandwidth on their expected energy savings.

even if storage is available, our implementation might decide not to save a content item because the expected energy savings may be negative, if our belief that the item will be watched (Eq.


However, it increases system s complexity and reduces the access reference locality of anygiven .le, since requests are spread across manydeltas.

from our data, we can observe that 90% or more of all users can be satis.ed by very few deltas of recentversions(e.g.2-3).averysmallsetof deltasissuf.cient to patchmost users, thereby,decreasing the need for publishing and archiving a large number of older deltas per .le.


Direction to start/stop stacks running on a node either from Director or from Console will be passed on to the node s Nethamnano stack, the acting node controller.

every node is required to run the Nethamnano stack from the moment of its instantiation.


Message Utility Consideration The dynamic factor takes also into account the utility of the sent message, according to the number of its retransmissions by the neighborhood, in case of periodic or geocast messages.

when a node A has to send a periodic or geocast message M,and receives the same message M, sent by another node B (cf.


The goal is not to facilitate generic programmability of the access point, but to  Figure 3: Conceptual model of the Router Core run a light-weight messenger between layer-2 of the AP and layer-3 of the access router.

its tasks include: (1) Monitoring the state and channel quality for each of its associated hosts, as reported by the device driver.


The dSPT is executed at each node x simultaneously, after that, x needs to broadcast the longest path in SPT rooted at x and compare it with the longest paths returned by other nodes.

this procedure needs O(n 2) time complexity and O(n 2) message complexity.


1, the ESPN website shows 30% of CPU utilization, whereas Amazon requires 1% of CPU utilization for the initial loading time.

web browsers staying on ESPN will consume more energy than Amazon, because power usage is generally in proportion to CPU utilization.


The problem of query routing concerns the discovery of relevant peers to the query after we have denoted which peers are considered as relevant.

we .rst have to de.ne the criteria that make us to decide whether a peer is relevant or not.


Each cluster consists of a random number of nodes.

the topology generated is not as static as in previous settings in order to evaluate the e.ect of ferry route design better.


NetLord mostly ignores anytenant-visible L3 issues (except as discussed in sections 3.2 and 3.9).

by placing no re strictions on how tenants assign L2 or L3 addresses, NetLord provides full address-space virtualization: multiple tenants can use the same address without having their packets mis-routed.


To see how this is possible, recall that in traditional, deterministic forwarding, a link is selected to forward data packets if it makes good progress toward the desired destination, and can support the desired bit-rate with an acceptable probability of success.

deterministic forwarding neglects links that can deliver packets closer to the desired destination, but that have large transmission error probability.


This is because, for the pedestrian model, even if the cameras are not con.gured with optimal FoVs, as long as they are focused on the streets, the moving targets themselves will enter the FoV region, eventually.

irrespective of camera and target density, Greedy can be a policy of choice for tracking targets moving on streets, since it provides near optimal coverage based on purely local decision (i.e.


As such, interaction with neighbouring networks is deliberately rendered impossible [9].

the most widely adopted way to build cooperation between separate WSNs is to connect them via the Internet, using dedicated gateways.


For example, the buffer may be bursting or the bandwidth is not sufficient, so to prevent the packet from being dropped, the first agent could improve its learning policy to service an other queue until the second agent indicates the possibility to receive the packet indicated beforehand.

these mobile agents gather and distribute information between routers.


3.3 Transmission Control of Z-MAC At the end of the DRAND phase, every node forwards its frame size and slot number to its two-hop neighborhood.

a node knows about the slot and frame information of its one-hop and two-hop neighbors at the beginning of the Z-MAC phase.


Still one problem remains: as discussed in Section 2.2 and as shown in Figure 1, CDNs try to take advantage of their distributed infrastructure by serving traf.c locally.

how can we expect to derive estimates for interdomain Web traf.c demands from traf.c to CDNs?


According to the result of the polynomial-based key predistribution, as long as no more than t polynomial shares of a bivariate polynomial are disclosed, an attacker knows nothing about the non-compromised pairwise keys established through this polynomial.

the security of our scheme depends on the average number of sensors sharing the same polynomial, which is equivalent to the number of sensors that are expected to be located in the corresponding cell and its four adjacent cells.


The main di.erence with that of its ON period is that when one of the two processes (X(t)and Y(t))is in an OFF period, the state of the other process does not matter, as Z(t) will be in an OFF period.

there may be multiple combinations that generate an OFF period of Z(t).


In this paper, though, we are particularly interested in the delay constraint.

the problem to be solved is maxE[w;ß,u] subject to E[q;ß,u]-DE[.


Indeed, since .1 =2/3, (a1,a2) has to be active in at least 2/3 fraction of slots.

(a,m)and (m,a) can be active in 136 at most 1/3 fraction of slots.


For longer paths and h=o, the probability of receiving a truthful reply for 10% malicious supernodes is reduced to 65.6% and for h=0, to 53.1%.

the attack is increasingly powerful with larger has DoS nodes have increased opportunity to intercept queries.


Badinteractionwith TCPForwardRTO-Recovery(F-RTO) SincePAWSmakes thebufferedpackets useless tothe receiver, we were wondering whether letting the receiver accept the buffered packet would reducethenegativeimpact ofbuffering onTCPperformance.

wedisabledtheTCPtimestampoption onthe sender side and repeatedthe experiments to measurethedownloading time.


Furthermore, after the transmission of RTS, nodes in node 4 s interference range will not initiate a new transmission in the duration of DIF S. Hence, while node 5 is transmitting CTS, node 3 and 6 will not transmit.


For example, access points and antennas may be too visible to guests and, therefore, interfere with artistic intentions.

services must rely on spotty Wi-Fi coverage (if any), ad hoc communication between visitors devices, and GPS localization.


Recall that at most 12 connectors are needed for u to reach all dominators in D2(u).

it will take at most 12 time-slots for the dominator u to collect data from all these connectors.


Let N denotes the preset number of turbo iterations.

in the SL-PC, 2TMSN(k-1) (MS + 1) arithmetic additions is required to update variables in (12) and (13), while in LLR-PC, TMSN(k -1) log2 |S| arithmetic additions is required to update variable in (17).


Moreover, we want to be able to exchange the recent technologies by their eventually superior successors.

a high-level abstraction of the underlying technologies is needed.


Then the time for execute a single instruction is in average 0.10 ns, although it may differ depending on the instruction.

the total instruction execution time of a lookup is about 6 ns.


Given knowledge of the approximate total set sizes a priori, the number of strata in the Strata estimator can be adjusted to conserve communication costs by only including partitions that are likely to contain elements from the difference.

we choose the number of strata to be .log2(dmax)., where dmax is the largest possible difference.


However, certainly these differences are lower bounded by k(1 - e)B/2 for some e « 1, since hardware clocks progress roughly at the rate of real time.

inserting this bound, the error of the scheme is dominated by the absolute value of the random variable mD X := 4 ..(Xi+k/2, j - Xi, j) k2(1 - e)B i=1 j=1 with expectation E[X]= 0.


We say that A is larger than B or A > B, if and only if FAA.NEA > FAB.NEB or PAA.NEA > PAB.NEB while FAA.NEA = FAB.NEB or IDA > IDB while PAA.NEA = PAB.NEB and FAA.NEA = FAB.NEB  According to assumption 7 in section 4, the routing Protocol already has information on all neighbor locations.

by counting the messages from neighbors, instead of using time schedule, we can trade the chance of having breaching points in the network with a bit more control messages.


To boost the data rates, DSL relies on advanced signal processing and error correction algorithms, which can lead to high packet propagation delays.

the properties of DSL access links vary depending on the length or the quality of the wiring between a modem and its DSLAM.


We observe that in a tree, a node has only one neighbor that reduces the distance to the destination; i.e., only one neighbor can increase the length of the longest pre.xmatch.

in contrast to the generous .exibility in choosing neighbors, a tree o.ers no .exibility in route selection.


In Doppler s scheme, since eNB estimates data rate for RM based on the amount of total bandwidth, more DUEs prefer RM than the other modes compared with the proposed scheme.

more UL resources can be allocated to CUEs in Doppler s scheme than the conventional cellular systems.


Let represent the probability distribution function of the deployment for group .

the probability that a node from group with deployment point resides within this small ring area is .................. ........... ...................


At some APs (e.g., APs 13 -15), there was little reduction during most instances of interference.

these APs were mostly impacted by higher airtime utilization at the sender.


[7] argue that in static situations, for large-scale networks, after the lifetime of the sensor network is over, there is still a great amount of energy left unused, which can be up to 90% of total initial energy.

the static models with uniformly distributed homogenous sensors cannot effectively utilize their energy.


At first, in accordance with signal strength so that coverage area can be gird.

we proposed an interpolation predicts values for cells in a raster from a limited number of sample data points.


As justi.ed in section 3.7, the link change interarrival time density for a node can be modeled by an exponential function.

let the link change interarrival time density for a node be fchange (t)= .e-.t .


x 104 12000 (TCP) will be a.ected by the routing protocol.

we 10000 see that that de.ciencies pertaining to the end-to-end-ness 8000 of the routing protocol can only be pointed out using TCP 60003 .ows for evaluation and we should try to improve the routing 40002 protocol s behavior such that it a.ects TCP performance 1 2000       TCP UDP 5 10 15 20  Pkts.


We define a multicast flow as a collection of flows along di- rected trees (rooted at the source and reaching all receivers) obeying the capacity constraints for each arc.

for a network G = (N,A) with node set N, are set A, arc ca-pacities cij, source s and set of receivers R C_ N -{s}, any multicast flow is identified with a collection of directed trees {T1, T2,... , Te} rooted at s and reaching all nodes in R and associated flows {xl,x2,...,xe} obeying the following ca- pacity constraints: Z f(i,j, Tk)xk < cij V (i,j) E A l<k<~  where 1 and cycles; the cycles don't send arty additional flow from source to destination and hence can be ignored.


Besides, Section 3.3 maintained that the determination of the most important (leading) eigenloads is based on the selection of a suitable statistical model, which accurately .ts the distribution of the original tra.c load series, to be used in the .2 test.

a statistical analysis for the selection of the best model is necessary.


We observe that without FS, links that fall under cases (c) and (e) (described above) always exist.

pC is not able to shrink the co-channel cells.


It can also reduce the peakedness of the traf.c on the downlink.

we explore how a small cache on the end-devices can save on downlink capacity, and make eMBMS-based multicast more effective.


Note also that our QoS definition is not node-based, but flowbased, which means that the traffic flows generated or received by a node may belong to different classes, as time varies.

for QoS class priority definition, the precedence has been given to traffic flows belonging to application Class III services, in normal conditions.


In principle, SPAV is executed locally at each vehicle in order to computea common maximum transmissionpower for all vehicles in its environment.

sPAV derives a so called catchment area for each segment in its environment partition using the merged vehicle density histogram provided by DVDE.


(G) = H uv.G luvl, and .ß (G) is the total power consumption of H links in G, i.e., .ß (G) = uv.G luvlß .

lowweighted structure is asymptotically optimal for broadcasting among any connected structures built in a localized manner.


On the contrary, if background tra.c is bursty and IJk is none-zero mean, then bk will be larger than the residual bandwidth.

the throughput of TCP-Westwood will be degraded signi.cantly under bursty background tra.c due to extra timeout events.


Our centralized al  (a) Divide the space into 11 cones radius r2 k can be placed inside the disk R(vk,3a).

there exists a node set in V1 with size at least |Vk 1|/(6a+1)2 such that k each node in the set interferes with each other.


In addition, the behavior of lossy links may be more complicated than those of synthetic models.

we deployed and evaluated our LEND system on the PlanetLab [26] and discuss the results in this section.


In the worst case, the latency values can be all over the entire permissible range, but in general, this is typically rare.

instead of storing packets and their associated delays, we can .rst cluster packets into equivalence classes based on the delay values, and associate a single delay value, called cluster center, for all packets within the cluster.


In the following, we will use the notation .G T (q) to access the correlated workload release times of the tuple, which .G(q) returns, and .G W (q) to access the correlated workload arrival.

the minimum distance between the .rst and the last frame of a sequence of any q workload correlated frame arrivals of G can be de.ned.


In our baseline scenario, we assume that all podcast users should be able Spectrum usage (Hz/bps) 0.3 0.2 10 0.1 to receive the episodes.

the multicast transmission rate is limited by the achievable rate of the weakest user in the cell.


Since this alphabet compression table (ACT) is shared by all states, it will be accessed for every input character, and thus likely reside in the cache of the processor.

while alphabet compression adds one extra lookup to the per-byte processing, it does not have a signi.cant negative performance impact as there is no need foranextra o.-chipmemoryaccess.


However, the probability of successful transmissionsin this caseis very small andyield on average close to zeroprogress.

the above expressiongives a close approximation ofthe averagedistancein eachtransmission.


We have proposed a new communication paradigm called Range Multicast [1] to enable users to join a multicast stream at their leisure and still see the entire video.

there is no waiting time and the server resources are shared effectively.


j 1 1 ´ .rj By Theorem 4.1, the individual residual workload in steady state is independent from the number of packets in the network, and is uniformly distributed on r0, 1s.


(MGF Envelope for Arrivals) An arrival process A(t) is bounded by an MGF envelope, with rate r and scaling factor M, for some choices of a parameter .> 0, if for all 0 = s = t .A(s,t)= Me.r(t-s) Ee .

tra.c is by de.nition essentially unknown but subject to regularity constraints [12].


The CS call takes 0.96 W while the PS data service takes 1.42 W. Another measurement conducted in [17] shows that the energy consumption of a VoLTE call can be twice as much as that of a 2G call.

voLTE may pose potential energy issues for the client device.


Instead of using an access point, the TBMAC participants reach a distributed agreement on the order of allocations and deallocation of CFP slots.

updates to the allocation of CFP slots in a cell need to be totally ordered across all mobile hosts in the cell.


Our results show that increasingly successfulpacketdeliveriesallowthelosing .ow sTCP sending window to increase by 15 fold.

the losing .ow is able to generate enough packets that consume its fair share of bandwidth.


To change the directions of edges in path from sj1 to sjy in T2,the transmission power of Sji must be adjusted to p(sji-1), 2 = i =y by Lemma 5.

if the power p(sjy )of Sjy is less than the power p(sjy-1) of its parent node Sjy -1 in T2, then, the extra power (except the powers used in X1' ) for this tree merge is p(sjy-1) -p(sjy ) =p(sjy-1).


In the following,our routine colors AP c with white and ends the coloring iterations.

the computed groups are L = {a} and F = {1},which are indeed the bottleneck groups.


Finally, cable modems can concatenate multiple upstream packets into a single transmission, which results in short bursts at high data rates.

the upstream latencies can .uctuate heavily, depending on the allocation policy, and the amount of signaling and concatenation used by the CMTS.


The shaded components are disabled when a station is not using the repeater network.

when a station is performing well, the wireless card is always connected on the primary wireless network.


In addition, it admits a simple and e.cient hardware implementation.

we believe that Strati.ed Round Robin is a good candidate for practical deployment in highspeed routers.


We then compute the signaling density, de.nedbyNtrans/Npackets,for eachtype of network applications whose Npackets is greater than 0.1% of the overall uplink traf.c observedfromtheRNC.Thisavoidshaving avery largeratiodue tothe very small number ofpackets observed.

an application is signaling-prone ifNtrans/Npackets ishigh, or signaling-averse if Ntrans/Npackets is low.


In previous years, enabling students to perform practicalexperiments on WSNs proved to be a complex task, evenwhen only one aspect of WSNs was covered.

animplication of the goal to cover a wide range of WSN topics isthat we need to signi.cantly reduce the amount of time spenton the struggle to use the tools.


This means that it must remain in the fast-recovery mode for as many round-trip times as the number of drops.

our duration of fast recovery increases linear to the number of dropped packets.


Although the contribution of queueing delay to total delay may be quantitatively negligible, especially when propagation delay is too long, this (minor) inaccuracy may lead to a scheduled deadline failure of a contact opportunity.

even a minor queueing delay may cause severe end-to-end delays.


For the lowest coherence times, the duration of 300 µs is even smaller than the turn-around time of the RTS/CTS exchange.

an SNR-based decision at the time of the RTS reception is stale by the time of the data packet reception, resulting in underselection by SNRtriggered protocols.


Nevertheless, Chord does not use its presumed PL knowledge for routing, but limits itself to log N outdegree neighbors (and ignores indegree neighbors).

it could be possible to design structured P2P networks that allegedly admit PL-like degree distributions from the conventional structured DHT.


Since nij are independently distributed Gaussian noise with variance s2 , the sum of nij will be a Gaussian noise with variance of ks2 .

the false alarm probability of the virtual sensor is: k X v pfv = P{ nij > kT } j=1 v kT = Q( v )= pfp (16) ks2 the virtual sensor has the same false alarm probability as the physical sensors.


Turn model routing algorithms result in uneven degree of adaptiveness due to the dependence of the path diversity on the packet direction.

the adaptiveness is not distributed uniformly across the network.


Also, the security features of the browser that ensures the privacy of the data by encryption prevent us from analysing the content of the packets.

we are unable to accurately determine which one of the scenarios, described above, is in effect for a particular user from the current trace information.


In LQS, failed connection attempts to previously o.ered services are not considered as the OP S and CPS tables keep track of previously open ports in the monitored network.

the high detection rate in LQS is not at the cost of high false positive rate (the same can also be inferred from our empirical evaluation on both datasets; see Section 5).


It can locally determine this value by just keeping the parameters of the last prediction sent to the monitoring node.

each node keeps track of the error of its energy value.


When combined with policy consistency and consistent .ltering, this route allocation is globally optimal.

if these three properties hold, we can use a path-vector protocol to compute welfaremaximizing routes.


Theprevioussectionshowedhowvariousfactors such astopology,SNR of alink,carriersensing rangeand receiversensitivity determinethe interactionbetweentwolinks, andhencedecidetheperformance of the network.

the approach we take(InteractionEngineering) controls one or more of the transciever parameters to control the interaction modesbetween the competinglinks.


0 2s Over the same interval, the amount of .uid in Q2 at time t is given b2 +(s - µ)t. Thus, the total congestion cost lT0 incurred at Q2 over [0,T0]is c(b2 +(s - µ)t) dt = 0 () cb1b2 cb21 µ +1 - .

now, the amount of .uid in Q2 at s 2ss ()µ time T0 is B2(T0)= b2 + b1 1 - .Q2 drains com s 'B2(T0) pletely at time T0 = T0 + and the amount of .uid in µ Q2 at time t for t .


Typically, the I frame is signi.cantly larger than the P and B frames.

for videos with different temporal redundancy, the encoding results are different.


6, the paging areas are modeled as identical mesh planes.

the number of subnets considered in a paging area, Np, can be obtained as follows: ( ) Np = minN, 4Ns 2 +4Ns +1 (8) Cis denoted as the total signaling costs when an MN idle is in the idle mode in the DP-MIPv6 scheme.


Note that each head sever should inform via broadcasts all the other head servers of the tra.c demands it has collected.

traditional wireless technology rather than the EHF communications is suitable.


Figure 3: Example of Crossover by Cluster However, a child generated by a crossover may cause interference.

in such a case, to satisfy the constraint, the proposed method excludes the AP which causes interference and has the lowest impact on the .tness value from assignment candidates.


Given that the neighborhood of 2 is included in the attacker s one, 1 deduces that 3 should choose the attacker as MPR.

according to the rule (16), 1 will mistrust the information provided by neighbors 0 and 2.


This policy, however, may be unfair to large-scale organizations.

we o.er a second proposed policy that allows a .xed number of addresses to be allocated to each request.


As it moves, the antenna acts as if it were a different antenna situated at that point in space.

this moving receive antenna emulates in time an array of antennas spaced along a line.


For this purpose, the routing information should be exchanged among terminals, and the information should include the available wireless system information such as radio frequencies, media control methods, and so on.

the terminals are able to select the most e.cient data path into the available wireless links.


MiRA always gives higher priority to the rate option closer to the current rate.

it always probes the adjacent rate .rst, and then the next higher/lower rate in the same mode when probing upward/downward.


Even one time 1500 3 retransmission-upon-failure will additionally introduce a delay of 12 at least 3 × 2= 3 second1, which is quite large for some timecritical applications.

to meet certain delay requirements, less or no retransmissions are preferred.


SDSS-R and PSS-R) are less effective, since the reachability information available at each node is also low.

the .rst iteration of the reachability algorithm where only the nodes with highest reachability information rebroadcast the RREQ packets, may not always be successful.


Typically, the connection between a MANET node and an Internet gateway (IGW) is multihop.

there is normally no direct wireless link from this MANET node to the IGW.


The probability of .nding a point inside a small area element dA about r *Aat a random time instant is proportional to E[p .dA]where p denotes an arbitrary line segment.


Under contention, a node has to wait for a certain number of idle slots chosen at random in the range of [0,cw -1], where cw is the so-called contention window.

the total delay until retransmission = D+ DMAC,where DMAC is the component in is Dtotal curred by the contention resolution algorithm of the MAC layer.


Through discussions with our IRB, the compromise with regards to data was to restrict data solely to where, when, and with whom communications occur but not the actual contents of the communications themselves.

for a text message, we would know the recipients of the text message, where it was sent, when it was sent, and the length but not the actual content itself.


This is particularly the case in late-binding approaches that require request and response packets to follow the same path.

this means making a truly location-agnostic mobile ICN (e.g.


However, N - 2 of the variables are supplied by the scaling coe.cients at the receiving APs.

a total of N2 2 -N -(N -2) = N2-2 3N+4 transmitting APs are required.


8 that any multipath pro.le P(a) depends on angles of the form a - fi,where fi is the orientation of the device during the ith snapshot.

if each fi is shiftedbyanoffset d between the two time windows, then a is also shifted by the same value d between them.


Furthermore, unlike the previous studies, we did not manually select Web sites to examine but included the sites hosted on a large server farm.

our study provides a more representative view of the properties of run-of-the-mill commercial sites.


DAH does not exhibit clear correlation with the distance.

the distance is not a crucial factor affecting DAH s accuracy.


In fact, in the case of a partition detection, it is very easy to .nd the way to the new Leader; there is no need to launch a new election in the partition like in [21].

many messages that would locate the new leader in the new partition are saved.


= 1) for baseline for single and multiple-zone models, respectively.

dMPC saves network cost by 22.7% and 9.3% for single-and multiple-zone models, respectively.


the per-packet energy consumption sible that the application used is data-limited (e.g.


The several Jini services responsible for di.erent domains form a federation.

to access context information or use a service of a speci.c domain, a client must query the Jini federation, passing parameters such as the name and location of the target domain.


3.2 Shortest temporal distance In essence, shortest temporal distance (tij ) provides the minimum time (using epidemic forwarding) it would take for some information to travel from node i to node j.

to compare e.ciency of an underlying forwarding scheme to send requests to di.erent nodes in network, we simply compare this lower bound on the propagation time.


A similar property can be observed in our case: in Figure 2, we plot the average aggregated throughput (the system throughput) obtained by 5 cheaters, all of which use the same contention window size; the simulation setup used here are described in Section 4.1.

we conclude that our game admits a unique CWopt solution CWiopt = j ,i,j =1,··· ,C. We apply this property to our game model and assume that the contention window (CW) size for all nodes are the same so COST is reduced to COST ={cost =(Cost1,··· ,CostC ): Costi = fi(CWi),i =1,··· ,C; CWi .


Second, in the initial association, the collector transmits its unique ID number and associated network address in the clear to the utility.

knowing this ID for a target collector may be useful in a DoS attack.


As in 802.11, a node tracks the state of each channel with a timer called NAV (Network Allocation Vector); the NAV for a channel is started when the node receives control frames coming from other nodes, signalling that a transmission of a given duration will take place on the stated channel.

physical carrier sensing is supplemented with a virtual carrier sensing.


However,in any integral solution, one AP,let say a,experiences a load of ya int =1/c while the other has a load of yb int =(2c - 1)/c.

the int/yfrac ratio ya a =1/c and it cannot be lower bounded by any constant.


Vehicle arrivals and departures during a tagged vehicle s sojourn time T the (j-1) vehicles left behind is the number of new vehicle arrivals during our tagged vehicle s sojourn.

n(t) is a random process with (i-1) down-steps and (j-1) up-steps, starting with N(0) = i, and ending with N(T)= j.


At this point Property 1 holds -however, trace sample Figure 2: Space-Time Diagram to Illustrate Quasidependencies 3 violates Property 2, because the computational delay exhibited in trace sample 3 is 25 (E8 is received 25 before transmission of P13).

e8 is removed from the reception dependency set.


This value is assigned to new packets that PM V starts to schedule at t * .

when the assignment routine .nishes, no value is assigned to packets that are not successfully scheduled.


On average, the E2ED is 262.34 ms when the packets are transferred through the DE-OLSR routing paths and 337.05 ms when using OLSR.

although the routing paths are longer when using DE-OLSR, the packets spend less time to travel through the network and reach the destination nodes.


Recall that ord(ai) = 2 and e is an odd number (due to e .

z* f(n) ' ' se )e and f(n) = 4pq), so we have ¯A = (aih(m)d mod n = aih(m) mod n. Bob can get the value of ai by computing ai = ¯Ah(m)-1 mod n. It is well known that se with the knowledge of such a non-trivial element of order 2, Alice s RSA modulus n can be easily factored, i.e., (ai - 1) and (ai + 1) are the two prime factors of n. Consequently, Bob can get Alice s private key d by using extended Euclidean algorithm, and then obtain the value sA by computing sA = h(m)d mod n. Based on the above discussion, we conclude that case (c) does not happen in the real world unless Alice wants to reveal her private key.


Since k(x) is non-negative and i=2 rik(x) is strict increasing for all link i, ri > 0.

when we devide both sides of (11) by ri, !


When the session arrival rate is low (the MN moves fast relatively), the BU cost has a greater impact on the total cost than the PD cost.

as shown in Figure 1(b), the furthest and the adaptive selection schemes, which have lower binding update costs, show lower total costs than the nearest and mobility-based schemes, respectively.


A received cluster key packet is decrypted .rst and then veri.ed with the MIC in the packet.

one MIC generation (or veri.cation) and one encryption (or decryption) per transmission of a cluster key message are required on the sender (or receiver).


The problem here is that if nodes have low quality connections to neighbors and/or are in motion, the overlay structure must be adapted.

a high rate of management messages may be required, and if a .ooded message is propagated while the overlay is out of date, that message may experience a high loss rate.


Group vehicles beyond the transmission range of the braking vehicle will be warned through a multi-hop manner.

drivers can become aware of emergency brake before they actually see the braking light of the vehicle in the front.


This gives the attacker access to the SUT s requests, as well as the corresponding replies.

the test procedure for the man-in-the-middle attack security test uses the web client as the system under test, and a man-in-the-middle machine as the attacker.


Data replication, multicast routing, group management and other functions are achieved at the application layer.

it enables easier deployment without the need to change the current IP infrastructure.


Because pTDMA controls contention in each window, it allows the WiFi interface to more e.ciently utilize its active time and to sleep longer outside of the ontime window.

pTDMA makes WMM-PS also attractive for best e.ort tra.c.


Clearly, aliasing is an undesirable effect in any communication system.

modern wireless transceivers are fundamentally gated by the Nyquist sampling theory and must operate with a minimal clock frequency of Nyquist rate.


But Pmax,BS and Pmax,MS are adjusted to receive the constant value at the BS from the MS which is in the edge region of the cell, and vice versa.

when re is .xed and d increases, Pmax,BSneighbor and increase in proportion to the .th power Pmax,MSneighbor of the neighbor cell coverage.


This range is quite small compared to the data subcarrier width(0.63% of 80KHz), and its impact to orthogonality can be neglected in practice.

we conclude that an infrequent frequencycalibration process can support FICA very well.


The hardware capabilities are the most limiting factor in the proposed key generation protocol.

in the next section we analyze the amount of secrecy if current technology limitations are lifted.


Since future public wireless network will consist of thousands of shared APs, a completely centralized solution is not feasible.

a distributed solution is highly desirable.


Since when a user starts the sensing on his own initiative he is aware of that, the application can ask the user to shake the terminal.

we base the generation of the initial secret key required for the sensing protocol on a temporal selective wireless physical layer security protocol.


For example, at 2.4 GHz, we only require that Eve be roughly ./2 =6.25 cm away from Alice and Bob to ensurethat shegets no usefulinformation.

whilefading is typically considered harmful, we pro.tably exploit it to extract perfectly secret bits without leaking information to an adversary.


Besides, in the case of macro user like macro user terminal 2 and 3, they operate in narrower bandwidth than ordinary case.

the macro user terminal s individual data rate becomes lower, and the whole macro cell throughput is reduced as a result.


Only these permitted XRLs will be resolved; the random XRL key prevents bypassing the Finder.

the damage that can be done by an errant process is limited to what can be done through its normal XRL calls.


Any optimization in loading the data and rendering calculations that we could achieve would demand more bandwidth for image transmission.

re.ned compression methods are needed to further improve the image transmission rates.


The.rstmethodistopartitionlinksintog(L) differentgroupssuchthatthespreadoflinksineachgroupisconstant,hereg(L)= log .


larger than traditionally expected [33].

a 10,000-node graph almost always has a peer whose zone size is smaller than average by a factor of 2,700.


This problem possibly occurs less frequently in network B since most radios are from the same manufacturer whereas network A uses two different cards on each machine.

certain frequencies may have different propagation or interference characteristics from others depending on the environment.


Then, they contend for the third transmission opportunity, if allowed by the AP s threshold K. Once the counter is equal or larger than K, the station should defer its contention attempt until the channel becomes idle again and the counter is reset to zero.

up to K frames may be overlapped to form a transmission burst.


The presented bit allocation algorithm is derived from geometric progression of the additional transmission power required by the sub-carriers and the arithmetic-geometric means inequality.

compared with the algorithm existing now, this algorithm has a simple procedure and low computational complexity.


With reduced Tp, the anchor network can achieve higher ac-the average sampling points for the signal region is Mp = curacy by receiving more radio beacons from the controller a × (3t ) × Fs.

the two conditions of the hypothesis for every second.


Two domains are coupled at the RRClayer.

we propose a domain decoupling module in RRC.It aims to eliminate the unnecessary interference (e.g., triggered events in §5.3, modulation downgrade in §6.2) from one domain to another.


In particular, even with a median 3.7 cm error on points along the trajectory, the shape of the overall trajectory is still preserved, because this error only re.ects the coherent stretching or squeezing of the trajectory.

the handwritten characters reconstructed by RF-IDraw are correctly recognized by MyScript Stylus in 97.5% of the cases, and the words reconstructed by RF-IDraw are correctly recognized in 92% of the cases.


di.erent transmission radius or di.erent number of nearest neighbors, 2r).

h1, n is proportional to r1 2 in the one dimen 2 +1 sional case.


The H.264 video stream is a succession of NALUs (Network Abstraction Layer Units).

each NALU is encapsulated in the RTP/UDP/IP protocol stack.


The infrastructure scenario consists of many (900), but small elements.

the segmentation process produces many, small query windows (56).


TCP is a pure window-based control protocol.

during initialization, the inter-packet time is set to zero.


It has no control over how that reachability will be propagated or used.

due to the advertisement, all kinds of traf.c not envisioned by the originating AS may take place.


However, in Figure 16c, when a SYN or a FIN packet is transmitted through LTE, the power level stays high for about 15 seconds due to the Tail Energy effect.

even if only SYN and FIN packets are transferred through LTE, the LTE interface still consumes an excessive amount of energy.


of less than 2 of the probability for any other node.

now as men- tioned above, the number of nodes at level d + 1 and beyond is at least some constant, say '7, times the number of nodes in levels d - 1 and d. the expected number of nodes in levels d + 1 and beyond that connect to s2 is at least a constant fraction (around -~) of the expected number of nodes in levels d -1 and d that connect to s2.


The base RREP message (20 bytes) is smaller in length than a base RREQ message (24 bytes) [10].

a recipient of the malformed RREQ assumes it as an RREP with extensions [10] which causes AODV-UU to crash.


Finally, if two sensor sets have the same HC and TC, smaller average cost within the sensor set, referred to as AC, implies that all the sensors in that set have been used to a similar extent, and less energy will be wasted in the end.

the sensor set with the lowest AC will be finally selected.


Flow F 1 is the original transmission .ow from the source.

each packet transmission is delayed by a .xed time when the .rst packet is in the process of trans mitting, the second packet is ready to be transmitted and it waits in the queue.


Temperature information can be obtained by the temperature sensor and the clock skew is obtained based on timestamp exchange [1].

the TSF at the i-th TSF estimation period can be updated as: g(.a[i]) T SF [i] = f(.T [i], T0) g(.a[i]) and f(.T [i], T0) express the temperature variation and the clock skew variation during the i-th TSF estimation phase.


In turn, for the inquiring node it is crucial to obtain the correct recommendation in order to assure that he will be able to choose the service provider o.ering the best service for his needs.

the system is considered to be secure if an unauthorized improvement of the recommendation is impossible.


When that happens, since a missing tag cannot transmit, the reader will observe an empty slot instead, resulting in the detection.


In sharp contrast, that corresponding to a stable Levy motion has a heavy tail, its tail probability decays in a power law manner.

for large x, the Levy motion part dominates in the large delay regime.


It is clear that expanding the current rule will not make any already processed rule become downward redundant if originally it is not downward redundant.

in our algorithm we only need to consider upward redundancy.


A} The probability of the Markov chain (Xn)n=0 ever ends at A after starting from state i is: hAi = Pi(HA < 8).

the mean time taken for (Xn)n=0 to reach A is given by KiA = Ei(HA)= n<8 nP(HA = n)+8P(HA = 8).


In the default MAC layer protocol, a packet can only absorb a maximum of 6 retransmissions (7 total transmissions including the .rst attempt).

each retry attempt has an average delay associated with it throughout the course of 802.11 network operation.


(V M S T (c|3d3)) + d3 = 2M -(M -E) + M - E = 2M and the utility of terminal v3 becomes u3(c|3d3) = 2M - (M + E) = M - E, which is larger than u3(c) = 0.

vCG mechanism based on VMST is not strategy-proof.


We have chosen to emulate web tra.c on nodes B through E because we assume that the wired Internet is not the bottleneck.

since the access tier bandwidth is not accounted for in our multihop experiments (that is, there is no access tier contention), if node A were also emulating web users, the only e.ect would be an increase in load over the wired connection to the Internet.


Proof of Theorem 5: From Lemma 7 and Corollary 1 results that at each iteration the load balancing algorithm detects the current load and fairness bottleneck groups,denoted as Lk and Fk,and their user-AP association.

at each iteration,the algorithm reduces the size of the AP and user sets until a complete min-max load association is detected.


In all the approaches above, mapping updates are transferred directly from the mobile to correspondent ends immediately when mobility occurs.

once the connection is set up, mobility can be handled by end hosts without any assistance from some third parties, except for the scenario that both ends are mobile.


tra.cpacket arrivalsbetween the twopackets[5,10].

figure5(b) shows that pXY (0,1)peaks near Sf = Sc but drops for Sc >Sf and Sf >Sc.


content in storage such as Solid State Drives (SSDs) or Hard Disk Drives (HDDs).

for later requests to the same content, the PoP directly sends its cached copy to the users if the Time-To-Live (TTL) value has not expired.


SYSTEM MODEL The network model consists of N equal-capability nodes with unique IDs, randomly distributed in 2D plane.2 The transmission range of all nodes is R [meters].

two nodes are referred to as 1hop neighbors (or simply as neighbors) and can communicate directly if the distance between them is less than R. the network can be modeled as a Unit Disk Graph (UDG).


Consider another node l. It does not have a concurrent transmission with node i if it does not transmit in either of the two adjacent slots that overlap with the interval [t, t+t].

the probability of no concurrent transmission with node i is (1 - p)2,and the probability of concurrent transmission is 1 - (1 - p)2 .


Although an AFN is expected to be provisioned with much more energy than an MSN, it also consumes energy at a substantially higher rate (due to wireless communication over large distances).


The di.erences are that (i) the messages are sent in the opposite direction (the initiator is the STA, while in the 4WH it is the AP), (ii) the .rst message is authenticated, while in the 4WH it is not and (iii) PMK is negotiated by the .rst two messages.

assuming that PMK is secretly distributed, our protocols, together, are more secure than the 4WH, which is considered secure.


2 using numbers from (1) to (13), on a green background.

t1 packs message m1 into frame f1 (1) and inserts it into a queue Q1,Tx (2).


Then, the predictive control system Jc minimizes the energy consumption and tries to reach the reference signal RT =[11...1]r(k), where [11...1] is a 1 × 2Np s identity vector; we assume that the reference signal remains constant in the optimization window, where r(k)= [rl (k) rg(k)]T , rl (k) is the indoor luminance reference and rg(k) is the re.ected glare angle reference at kth sample.

the objective is to .nd the best actuation vector (in Lux) .U =[.u(k) ....u(k + Nc - 1)]T such that we minimize Jc, where u =[ul ub]T , ul is the arti.cial luminance actuation (in Lux), ub is the blind tilt angle (in arc-degree), .u(k)= u(k) - u(k - 1) and Nc is the control horizon.


fd(q,q )= max ,, (10) q *(d)q(d) where q(d) = max{d,q} and q * (d) = max{d,q *}.

q and q * are treated as being not less than d, and having done this, the error factor is the maximum ratio, upwards or downwards, by which they di.er.


This problem is further complicated by the fact that some of the routers use a 32-bit byte counter which may over.ow.

when we see a counter value that is less than the previous one, did the session actually reset?


BACKGROUND AND MOTIVATION While working in the area of opportunistic networking and developing routing protocols for opportunistic networks, our intuition has been that users with similar interests or social behavior have greater probability to meet each other and to exchange data.

we tried to leverage this social pro.le knowledge in our protocols, e.g.


As explained earlier in Section 3.3, because preambles are transmitted on different channels, they will generate different patterns even though they contain the same signal.

only the pattern with the matched channel will have the highest peak.


Namely, the knowledge of a person s current or past locations could reveal sensitive information about the person s interests, her health, or her political preferences.

location information itself is sensitive, and the operator should have assurance that the service provider deals with location information about the operator s customers in a privacy-preserving way, based on a given privacy policy.


We chose to experiment with the latter option because we assumed that the faults in the sensor boards are independently distributed.

the probability that multiple neighboring sensor motes are simultaneously in error is lower than the probability that a single sensor mote is in error.


PROPOSED MECHANISM The problem of maximizing the throughput of a wireless ad hoc network is known to be NP-hard, even if only one single transmission power/rate is supported [1].

we resort to heuristic approach to increasing the network throughput.


As a result, leading MHs move towards lagging and lagging MHs move towards leading.

a larger fraction of MHs tend to lag albeit by much smaller margin.


That is, even without DozyAP, users already experience long page load-ing time with large variance.

the small latency increase of less than 5.1% is very hard to detect.


1) We estimate the packet delivery velocity and predict the position of the mobile sink at thetimeitmeetsthe Response packet.

the Response packet can be forwarded towards the meeting position via multi-hop wireless transmission directly with geographical location aware routing.


For a=0.50, the variance of the simulation estimator is not considered when a new feasible solution is compared to the best feasible solution so far, that is the comparison is based on only the means.

the probability of rejecting a new solution which is actually better than the best feasible solution so far is high.


If a node obtains the locations of a sufficient number of anchor and/or PA nodes, it calculates its own location using (8) individually and broadcasts the calculated value as the location of a PA for other nodes.

the location of each node can be estimated using the calculated locations of the PA even if the node cannot directly receive any anchor-node locations.


Among many energy-consuming operations of sensors, communication-related one is much more critical than computation-intensive operations [1].

a reliable and energy-efficient packet transmission is crucial.


For example, the duration in number of slots for AIFS [AC_VO] is less than the duration of AIFS [AC_BE] as shown in Table 1.

traf.c category with AC_VO over AC_BE gets a higher priority to initiate transmission even when the packets are residing in both queues at the same time.


However, the upper layer functions can be run in parallel according to the request.

we can solve the problem by implementing a large number of upper layer processors and their scheduling mechanisms.


Since the goal of the protocol is fast data evacuation this is not acceptable.


These selection rules except rule (1) must be implemented in all border routers as the standard and should not be changed in designing the routing control architecture.

the VR architecture which modi.es local pref and next hop attributes can control the forwarding addresses of the next hop in the path to the destination, and therefore can control conventional routers externally without any protocol extensions.


Internet Gateway collects this table information during T-DAD procedures.

if an ad-hoc node wants to verify the uniqueness of its global address, it just asks gateway to do that.


Current tools for obtaining anonymity or resisting .ngerprinting try to automate disabling or changing sensitive browser functionality [45], but require vigilance on the user s part.

it seems reasonable to expect developers of such technologies (or users employing it) to consider disabling Fathom as needed.


Given the growth rate of wireless technologies, networks composed of hundreds of thousands up to millions of nodes will be widely diffused in the next years.

we need tools suitable for the detailed simulation of very large scale wireless networks.


As the session size increases, the portion of the PD cost to the total cost also increases.

the nearest MAP selection scheme outperforms other schemes because it always chooses the LMAP.


Our results suggest that (1) users are not getting the speeds that their ISPs advertise; (2) mobile broadband users commonly achieve higher throughput than fixedline users, although the performance that they achieve is variable; and (3) speed (i.e., throughput) is not the only limiting factor on performance in South Africa, and that latency to popular websites and services as determined by both geographic location and Internet peering relationships may significantly affect performance.

many of the positive network effects promised by broadband connectivity may not be realized in South Africa; rather the widespread problems associated with throughput and latency may ultimately affect the ubiquity of cloud and other services as they extend beyond corporate use.


Additionally, transition from a two-party to a multiparty session is awkward.

while multicast can be useful for webcasts, in networks which support it, it tends to be architecturally less applicable to the conference call model of group communications.


This enables MIM-aware association among APs to increase the concurrent transmission chances with the minimal efforts, (iii) NOX and OpenFlow system support a virtualization technique that organizes the multiple logical networks from a single unique physical network.

an MIM-capable virtualized network can be managed separately from the MIM-incapable virtualized network.


Numerous studies have analyzed the ELLT of RWMM, but studies of the ELLT of MGMM are rare.

this study focuses on formulating the ELLT of nodes moving in MGMM, and verifying the formulation via simulations.


After receiving the RTS packet, the intended receiver appends the Ri value in its CTS packet to propagate such new duty cycle to the nodes within its one-hop away.

all the nodes, either within one-hop away of the transmitter the receiver, may follow the same new duty cycle during one bor asic cycle time.


All other anomalous IPs we eliminated before creating the merged graph were similar in that they originated a large volume of traffic but only received very few replies.

we can conclude that all suspect IPs we eliminated were probing the network or were misconfigured.


After gathering data from sensors around the polling point, the MobCar moves directly to the next polling point in the tour.

each data gathering tour of a MobCar consists of a number of polling points and the straight line segments connecting them.


Furthermore, two f1 functions (one for calculating the commitment value and one for verifying the received commitment value) are calculated in each round.

a total of 40 f1 calculations are performed in one device during the pairing procedure.


We replace µ (the service rate) by µ, the average service rate in the presence of rate variability.


The .rst is preferential attachment [7] which says (1) the growth of the network is realized by the sequential addition of new nodes, and (2) each newly added node connects to some existing nodes preferentially, such that it is more likely to connect with a node that already has many connections.

high-degree nodes are likely to get more and more connections resulting in a power law in the distribution of node degree.


WiFi data, however, is more valuable when collected from a single location over an extended period, since it helps capture the variability in the WiFi signal at that location.

wiFi RSS measurements were collected even during the time when the device was stationary.


Thus, if a station trans-mits a frame that is significantly shorter than the contention win-dow, the other stations will not update their NAVs and the medium will be idle for a while.

the access point can use this idle time in order to transmit a frame in the downlink to one of the stations.


Although each link needs to accept frames from both sides for unicast communications in the IEEE 802.11, control frames to be transmitted in the other direction of data are small.

extended links are reasonably robust even if the reverse direction does not meet the directional condition.


Then the system could be engineered so that TBS = TP2P = T. However, the p2p throughput may vary significantly among subscribers, which makes it more difficult to strike a balance TBS has to be larger than TP2P in order not to limit the subscribers that enjoy aboveaverage p2p throughputs because that would in turn affect the p2p throughputs of other subscribers.

in the quasi-static regime T = TP2P and TBS > TP2P.


Due to the random selection of covering nodes to be included into the backbone, CSCA approximation algorithm does not produce a good result in constructing the broadcast backbone.

in our scheme LBAS, we completely exploit the propagational direction of broadcast message and the relationship between covering nodes and covered nodes, so as to design an e.cient strategy of connecting these nodes and the broadcast source for constructing the backbone.


Because of this, we say that a network is an optimally synchronized network if all nodes in the network can achieve the optimality conditions of (3) and (4) and the mean squared error achieved in (4) for each node is the smallest possible mean squared error achievable for that node over the area of the network.

the optimality condition for an optimally synchronized network is cj cj 2cj cj 2 E(dt -t d)=minE(dt -t d)for all j.


Routing in Clos networks was mostly studied in the context of systems where a centralized control unit allocates virtual circuits to injected flows [19] (see Figure 1(a)).

the network s topological properties that support strict sense non-blocking (SNB), rearangeable non-blocking (RNB) and wide-sense non-blocking (WSNB) [4] were defined.


We have thus obtained another solution with the same network longevity where the base station  is now at a boundary point of the common region.

it is suf.cient to search only a boundary point for solutions to achieve the maximum network longevity.


the average service time for a routing .


However, thegood newsisthat softinformationisalreadycomputedatthePHYfordecodingchannelcodes, FlexCastonlyrequiresthePHYtoexposethisalreadycomputedinformation.

architecturally FlexCast is similar to the recently proposed SoftPHY abstraction [13] and uses a modular network stack at the receiver where the PHY interface is augmented to expose softinformation along withdecoded bits.


An anomalous event is considered as a critical situation.

lA-TinyOS is designed to utilize all of the available processor capacity when an anomaly is detected.


The maximum size of one packet in the network system is denoted by .

the arrangement of each packet must satisfy the following constraint:  (2) for all , where and denote the size of ith packet and lth transmission unit, respectively.


The factors that determine a transient s shape are poorly understood, perhaps because they are of limited use, since, lasting under 2µs in 802.11 [18], they cannot serve a protocol function.

transients have to be treated essentially as arbitrary waveforms, and .nding a compact representation that will be e.ective for all possible transients involves heuristics and guesswork.


We refer to the time to exchange control message as signaling time.

a time slot can be one of the following two states: signaling or data transmission (simply transmission).


(18) Note that in this case there exist multiple combinations of the .th(i)s and nki s that ful.ll (18).

the set of thresholds and detectors should be selected in an ad-hoc manner to adjust the complexity at a desired value.


SOKE is computationally e.cient because it can work in an appropriate subgroup of the multiplicative group of a prime .eld without requiring a safe prime ; similarly, it could be used with elliptic curves or other groups.

the computations for SOKE can use smaller exponents than those required for [23] or [24].


S Ui = (3) 0, otherwise where S denotes the set of all packets in X s bu.er.

ui is the negative expected delay if i is a packet with the maximum expected delay among all packets held by Y .


Since all the nodes save their keys in the same places, once knowing where keys are stored, .nding the keys of the next compromised nodes will be a trivial task.

our goal is two-fold: .rst, we will make identifying and revealing the keys of the .rst compromised node a challenge task; second, we will make the data structures for di.erent nodes di.erent, so compromising a subsequent new node is as hard as compromising the .rst one.


6(d + 1) Obviously, e(T ) = k. For a multicast tree T ', there are at most k leaf nodes.

if we remove all edges in T ' incident on leaf nodes, the total edge length of all edges left is at least |T ' |- k · r. the '' number of internal nodes |I(T )| in T is at least |T '|-k·r .