It is achieved by using the transmission range(R) as the distance unit [16].

the average distance between nodes i,j from time 0 to T, AD(i,j), is de.ned according to equation 3.


Second, the wireless channel conditions are different at the transmitter and the receiver.

a collision detected by the transmitter may not indicate a collision at the receiver.


P is arbitrarily large, we propose to maximize the size of CN by mapping the problem of .nding CN to solving the maximum independent set problem [21].

we construct a graph in which each packet that originates from a node N under investigation is represented by a vertex.


Note that PC may not be able to shrink the cells, for every channel.

we apply the PC algorithm only on those channels where PC can be bene.cial.


Thus, the backoff interval of flow 2 will count down from 20 to 0 before flow l's backoff in- terval counts down to 0.

flow 2 will transmit a packet before flow 1 can transmit.


bb b X [0,1], where Ebdenotes the event space of S + 0 and .b(.

)= 0; the transition measure Qb:(S E. .Bb)× b bX b X , is such that as t .


If a different scramble seed is used for the retransmission, it is impossible for Remap to collect bit blocks from retransmitted frames.

in our implementation, we simply use the same seed for all retransmissions and only change it for a new frame.


While we can compute it more precisely, since reproducing the PRNG sequence lets us extract the exact size of each intervening packet sent, for convenience we will often use the average payload size (1070 bytes including UDP, IP and Ethernet headers).

the transmission rate can be computed as  9000 9000 8000 8000 7000 7000 6000 6000  Rank 5000 5000 4000 4000 3000 2000 1000 0Estimated access bandwidth (bits per sec.)


In particular, after visiting any 2.3 n 73 nodes, the sink is able to collect information from about 90% of the nodes, as implied by the analysis in Section 3 and [5].

these results con.rm that Supple with an exponentialimprovement of thenumberof messages(cf.


GATEWAY SELECTION GAME OF MUL-TIPLE AUTONOMOUS DOMAINS 3.1 Game Formulation Note that the cost of a single domain m, given by (2), depends on not only its own gateway selection, but also the decisions of other domains.

coupled by the interdomain communication cost, we formulate the interactions of gateway selections by multiple domains as a gateway selection game, where each autonomous domain is a player, with an objective function of (2), and the strategy space for domain m is Nm.


In IEEE 802.15.4a such as wireless sensor network, using higher duty-cycle is di.cult since the power consumption is also signi.cantly high.

when the LDC-UWB signal power is .xed power per unit of time, the duty-cycle of LDC-UWB should be set to distinctly low values of less than 0.1 % and using PRF = 15.6 MHz is absolutely essential.


Therefore sorting and filtering is implemented in small custom methods, which are easily adaptable to new protocols.

cost can be kept low, and web technology can be used at every single management node, and not only at one central database server, as compared to [6].


It can be easily veri.ed that our proposed Markov chain is time-reversible [11] and the detailed balance equations apply.


But in the protocol model solution, the .ow rate on this link is 117.84, which is larger than this link s capacity.

the solution obtained under the protocol model is infeasible.


Experiments 3/63 6/66 Random Selection 0.15% 0.70% Experimental 11.06% 46.36% Improvement 7,097% 6,530% be used only once per circuit.

a more precise expectation can be described by ( m )( m-1 ), m>1.


capture the wireless channel and others could be starved.

the second problem that our work focuses is the problem of wireless channel capture.


Less complexity and a better manageability are the most bene.cial effects of homogeneity.


Although neighbors around the node can still avoid collisions and transmit frames to other directions with DVCS, radio power leaked towards the sides and back of the node undoubtedly causes substantial interference with other communications, which reduces network capacity.

the effects of side and back lobes cannot be ignored in the evaluation of network performance with directional antennas.


Although, the concept of using a private storage for personal information, and the use of higher level information to obtain an array of relevant ads have been proposed, to the best of our knowledge they have not been used together with cloud based resources as proposed in CAARETA.

we believe this is the .rst proposal which fully addresses three fundamental requirements of a privacy preserving mobile advertisement delivery system.


It leads that the nodes on the shortest die fast and causes the partition of the network.

to increase the lifetime of the wireless ad-hoc network, we should .nd the path which either has lowest cost of energy or avoid the partition of the network.


As the advanced mobile devices such as smart phones now have the capability of forming opportunistic networks in an ad-hoc manner through WiFi Direct or Bluetooth connectivity [8], and people normally carry with them in their vehicles every day.

the users can use their mobile devices on board vehicles to establish a VANET independently of a fixed infrastructure in an inexpensively and conveniently way [9].


5.4 Prototype While simulations can provide extensive exploration of the system space, it is important to understand how Parking-Meter works in a real system.

we implemented a prototype of ParkingMeter and tested it as part of the Illinois Vehicular Project using our implementation of LoadingZones as a test service.


The time complexity of .rst part is O(N(T2 - T1)), the time complexity of second part is divided into two aspects: O(num 2 + num 2), and the time complexity of third part is O(num 2).

the total time complexity of 2 22 whole algorithm is O(N(T2 - T1), num + num , num ) = 22 2 O(N(T2 -T1), 2num , num ) = max O(N(T2 -T1), 2num ).


Each source sent packets in exactly 1 hop to exactly one destination which was also the node s sole neighbor.


Note that, any two IP addresses can be grouped into an address range for a su.ciently large address range that can be represented using a su.ciently small /x pre.x length.

we need to analyze path traces to collect evidence to eliminate candidate subnets that may not correspond to real subnets in the underlying network.


In the .gure we show a set sSN for the SN; this set will always contain one pair of values representing the header and MAC sizes that the SN will use to parse incoming messages, and to send messages to the MN..

the MN will be able to receive a message from the SN if sSN .


In the p =0.0 case, nodes mobility are very deterministic.

the nodes future mobility prediction becomes accurate.


But it requires solving a computationally hard combinatorial optimization problem in a centralized manner.

in recent years, through a sequence of exciting results, entirely distributed and lowcomplexity medium access algorithms have been developed starting through two distinct independent approaches by Jiang-Walrand[4]andRajagopalan-Shah-Shin [5].Butthey resultinvery highdelay evenfor modestthroughput.wecanobtainhighthroughput andlowdelaybut withahigh complexity algorithm, or high throughput and low complexity but with high delay.


Both these techniques rely on a lead transmitter to transmit a synchronization header in the air.

these implementations are applicable only to nodes within a single collision domain.


The ISM radio band (2.4GHz-2.5GHz) is shared among several standards.

in a real WLAN network there are interferences originating from other protocols.


Batteries loose power over time and require recharging or replacement.

power consumption must be limited to the bare minimum required for effective performance.


Each edge is contained in the paths of at most 4mc 2 requests.

the expected cost of requests which are rejected in step 4 because of this edge 2 33 is at most (4mc )(2mc)3/(m c )=24/m.


The invariant we maintain is that the number of breadcrumbs outstanding is less than or equal to the congestion window.

the num- ber of packets in transit from the source to the receiver is bounded by the congestion window.


However, the cluster members that were reached by the SCH will not exchange the regular setup messages.

the average cluster setup messages will be reduced too by the factor (1 -Ps).


The proposed methods should perform better than blind flooding which does not use network topol- ogy information.

we use the performance of blind flooding as the lower performance bound.


The .rst one, and most straightforward to specify, is the node density d(x, y), measured in nodes per m2 .

in a location where d(x, y) > 0, there is a concentration of nodes such that the number of nodes in any set of incremental area E centered at (x, y)is d(x, y)E. the total number of nodes in the network, which we are asked J to minimize, is given by the integral N = d(x, y) dx dy.


The key aspect is that when using erasure coding with a replication factor of r, only 1/r of the code blocks are required to decode the message.


From the clique example in Section 3, one might conclude that one way to detect route changes due to path exploration is to avoid penalizing successive routes with non-decreasing path lengths.

if a new route has the same or longer path length than the existing route, we do not increment the .ap penalty.


Ageneral rule of thumb of one virtual machineper threadperprocessor[19] means thata single server mighthosttens of virtual machines.

the design should be scalable enough to handle the bandwidth of an increasing number of virtual machinesper server.


For example, for 40 sending servers with 64kbytes per server, the goodput is 741Mbps for 2MSS as shown in Figure 6, while 564Mbps for 1MSS as shown in Figure 8.


But in our topology setting with realistic workloads, pFabric is better than PASE and PDQ [13]; pFabric actually achieves near-optimal performance.

we directly compare PIAS with pFabric in Figure 8.


Recall that ya = yc =1 and yb = .More group.

we have developed a method to separate over,some load of user 2 or 3 can be shift from AP b to APs the APs in the bottleneck load group L from the rest of the c or a,which is indicated by the edges (b, c)and (b, a),and APs.


The size of a COW .le is typically around 10MB.

a Netkit installation takes about 600MB of disk space for the backing .le plus about 10MB for each started virtual machine.


Even thoughq-RPBisstronger thanbasicRPB against node compromise, a key exposure is still possible.

a way to regularly update the KR must be found.


4.2 Path persistence Any direct implementation of these equations requires a discretization of the state space and solving at each grid point anindependentODE,providing thedatafor calculating the next iteration.

numerical software routines that implement the corresponding di.erential equations in a recursive way are needed for obtaining the .nal results.


Figure 1(a) has shown that for the current value of T , the number of feedback messages in EXP is already larger than that in the other schemes.

further decreasing T to lessen response latency will make the suppression performance worse.


typically promised a bandwidth she pays for, such as 128Kbps for $24.99/month.

a fundamental requirement for WMNs is to provide clients with similar service options1.


When the second condition is true, the condition provideri = myID in algorithm line 3 is not met.


Clearly, the problem is feasible if rsv and only if PgEG tg 1.

if the problem is feasible, we can write Tg = tg - trsv g , and problem (9) can be transformed to rsv rsv maximize Xtg log(Tg + tg ) gEG subject to Tg .


7 be the resulting partitions of G. If a gi l& more than one node, it is recursively divided and should have its own separator Si, otherwise the node itself is the separator.

note thatthe children of a graph G do not include nodes of the separator S. this guarantees that every node appears in exactly one node in the rooted tree.


Selection of initial guess is essential for these algorithms to perform.

our detector takes the output of ZF-VBLAST as its initial solution guess.


Clearly, |Luv nD|/ |Luv|achieves the minimum when both u and v are in .D.

it is su.cient to show the lemma for u, v .


In the case of a hierarchical ad hoc network, there exists a backbone of wireless devices that have more powerful computation and transmission capabilities.

they can relay the tra.c coming from low-tier devices.


We assume that the wireline network always has suf.cient resources for supporting a connection as long as the wireless mesh network can support, and that transmission delay introduced by the wireline network can be neglected compared to that in the wireless mesh network.

in the remaining of the paper, we only consider packet transmission scheduling in the wireless mesh network.


We also show that the auction mechanism schedules clients in the same way as that done by the on-line scheduling policy.

the auction mechanism is both truthful and utility-optimal.


YouTube videos are archived data stored in the service servers, transmitted reliably over TCP on-demand (a transfer starts when a user explicitly requests a video).

youTube videos are classified as on-demand documents.


In the worst case, tracenet returns the exact path that would be returned by traceroute, and, in the best case, it collects the complete topology of each subnet visited on the path.

a single session of tracenet (1) discovers new IP addresses that are missed by traceroute, (2) marks multi-access and point-to-point links, (3) reveals subnet relationship among IP addresses on the path, and (4) annotates the subnets with their observed subnet masks.


As a result, the calling Figure 5: Standard Session Set Up Procedure Figure 6: Test Bed Session Set Up Procedure party, Alice, did not include any preconditions line in the .rst SDP o.er and Bob, the called party, did not perform any resource reservation upon receipt of the initial INVITE.

we cannot report whether this optional function of an IMS network is performed by our test bed in accordance with the speci.cations.


On the other hand, energy consumption is considered as a crucial issue in all types of wireless communications.

it is important to extend existing testbed experimentation tools and develop new ones, in order to equip cognitive testbeds with such advanced monitoring capabilities.


Finally, we observed that the prediction of the link throughput S(i, j, k) is usually very poor if only a few frames are available (received) for the calculation.

our algorithm treats measurements produced by fewer than 3 probes as if no frame was received.


2.2 Scheduling Phase Once the clusters are formed for a given round, each CH node associated to a cluster will play a role as a coordinator for processing and transmitting data between MNs and the BS.

it broadcasts node has k bits of data to be sent and the consumed time for transmitting a byte of data.


To support parallel receptions, PAR-CDMA needs to use a smaller data bit rate than 802.11 for the same available frequency bandwidth.

the performance of PAR-CDMA is expected to be worse than 802.11 if parallel receptions do not happen that often.


Previous work has not taken these inevitable errors into consideration [1].

the deployment specifications, such as the distance between sensors and the number of sensors required, are either overestimated or underestimated, respectively.


That is, we can adopt the most time-saving filter based method for anomaly detection without obvious loss of performance.

in this paper, we would like to use a well-known filter based method Information Gain (IG) to fulfill feature selection tasks.


In addition, a variation in streaming content may arise due to the participants change of interests (e.g., view change).

there is a need for an adaptive multi-stream, multi-site 3DTI session management strategy, which is unobtrusive, and optimizes QoS parameters in the 3DTI content distribution based on the user activity and content variation.


Reference [12] proposed that n-th forward and reverse delays are analytically derived from the initial values (which can be heuristically obtained) of the forward/reverse delays and the sender- and receiver-measured RTTs.

the precision of its method is up to a magnitude of estimating the initial values.


Although it is possible to build up these connections and transmit some data, it is nearly impossible to maintain packet routes or maintain directories for ef.cient localization of users.

we need communication links to sustain for some time span .


the variations in the obtained results mainly occur due to the randomness of the topology caused by the gateway position and .ow initialization.


These applications are often composed of many collaborating sub-tasks, each involving only a subset of the nodes in the system.

the programmers must worry about how to identify these subsets and address them, before concentrating on the application goals.


At the end of this protocol, the STA believes that the AP knows the new keys, PMK and PTK, because the Authentication Response is authenticated with KCK, a part of PTK.

sTA can be sure the AP is genuine (belongs to the target network), otherwise it could not have received the key PMK from the RS.


One of the reasons the current Internet architecture calls for a dumb middle is so that routing changes within the network e.g., caused by a network failure do not hinder communication.

one practical issue that our framework must address concerns routing changes.


With the vertical handoffs, this handoff latency is even larger (Refer to Table 2).

there is a need to provide mechanisms to mitigate the effect of such handoff latency to minimize the information loss.


In the two-round protocol, only the last step is computationally expensive (compared to simple UMAC veri.cation).

the two-round-trip protocol, guarantees client liveness.


For example, bubble rap [15], maxprop [5], and others [19, 27, 29] assign utility values for social based forwarding, vehicle based routing, and general opportunistic net mal operating point of individual nodes to maximize overall works respectively.

let U xv represent the utility value network .ow.


Since such a tracking of the age is done using the clocks we want to adjust, we need a way to rate the quality of the data.

the main issue of distributing time-references is the decision which clock is more accurate than the other and which provides the better timestamp.


The gaps, which can last up to two seconds each, account for around 90% of the total table transfer time.

these gaps, which are caused by the sender, are clearly the reason behind the slow table transfers.


Since the client received the response after the time at which the 142 B send was to occur, it immediately sends the 142 B packet, requesting nothing in return.

session start times are always  Figure 3: Transactions are Request/Response Exchanges in a preserved, and transaction start times are honored if possible.


Our results show both degree distributions and percentage of users in the largest connected components stabilize within 7 days of user activity.

we focus only on weekly time periods for our .rst UAG growth model.


When the nodes and links fail, even though the network may still be connected, there are problems such as larger delay, lower efficiency and smaller network throughput with using the remaining routings to transmit data.

a topology reconfiguration scheme is used to break and set up links to create a new topology, so that when the links or nodes fail, fault-tolerant operation and rapid service reconfiguration can be achieved.


(6) Since the feasible set of LP(d) is convex and compact, and f(e) is a bounded function, by continuity, we conclude that U(d) .U(0) as d .0.

for every E> 0there exists de > 0 such that for every d<de, U(d) =U(0) + E. From (6), we conclude that CL(.)


The .rst approach, although sensible at the .rst sight, has the disadvantage, that the structure of the overlay network is totally agnostic of the routing con.guration in the upper pub/sub layer.

the risk remains, that the evolution of the overlay network leads to sub-optimal performance.


However, we believe that the most interesting case of operation for dynamic spectrum access schemes is that in which the number of users is not known.

we are interested in investigating how the probability of achieving successful dissemination of control information varies with respect to di.erent dissemination strategies as well as scenario parameters, and what is the impact of dissemination strategies with non-negligible probability of dissemination failure on the overall system performance.


For example, if M = 1000 and K = 5, the number of possible sequences increases to 1015 .

even for small values of K = 5, it becomes computationally intractable for the eavesdropper to learn the library of sequences and perform interference cancellation.


When c raises its bid to 4, VERITAS charges c by its critical neighbor e s bid which is 3, and c s utility becomes 2-3= -1 < 0.

c cannot improve its utility by bidding untruthfully.


In the example at the start of this section, four lagging units do not always mean that the lagging flow used to have de- mand of transmitting four packets.

it is natural to distribute remaining amount of lagging of flow i to other flows.


We note that only timing parameters are affected.

irrespective of channel width, modulation 24 OFDM coding (24 Mbps at 20 MHz using 16-QAM, 1/2 rate encoder) carries the same 96 data bits per symbol.


Each video channel serves client requests through a multicast tree t; all the multicast trees used forms set T .

|t| denotes the number of edges in tree t. the network bandwidth consumption can be represented as: B =|t| .t.T We also de.ne channel merge rate as the number of clients that are merged over the total number of clients.


Control messages form a small portion of the total tra.c and are often critical.

we do not employ any congestion control mechanism for control packets.


As a result, a terminal, say i, is basically deaf while transmitting, so it does not hear any transmitted control packets in its vicinity.

when i becomes idle, its information about ongoing receptions in its vicinity may be outdated, leading to collisions (i.e., if i decides to transmit again).


This is mainly due by the typical arm movement performed during the walk, in case the Coordinator is held in the hand.

it is possible to take advantage of the movement and avoiding packets transmissions during period during which there is a lack of visibility and aggregated data transmission when the visibility between nodes is gained.


First, we target peer-to-peer .le replication in the Internet.

the peers are well connected without severe network bottlenecks.


Then, by taking ln on both sides of the inequal 2knpr pnt ity, we have B -a< ln A +ln(1+ ) A t/2 8ke =ln n + k ln t -t -ln k!+ln(1 + vv ).

2k p nt we have 8ket/2 t< ln n + k ln t -ln k!+ a +ln(1+ v ).


Shortest path metric in MANET may lead to selection of unreliable nodes which in turn degrade the overall performance of MANET.

there is a need of routing metric which attune with these characteristics and select reliable path instead of shortest path.


Furthermore, in order to minimize the network load, we tried to further reduce flooding by fully exploiting carriers mobility.

while in Propicman, intermediate nodes can continue to forward messages to other nodes that have higher delivery probability and still keep messages after forwarding, in PROSAN only the source node can forward messages.


Table 4: Nnd upload and totalE nergydp for di.erent delays Delay Nnd upload totalE nergydp 3-hour 10.7 178.9J 6-hour 14.7 167.0J 12-hour 18.0 140.3J 24-hour 19.6 130.4J Evaluation on Nodobo We also evaluate e.Sense on Nodobo, as this dataset contains users WiFi traces, which MIT Reality Mining lacks.

we introduce ewif i , which means a user connecting to a WiFi AP.


On the other hand, sin ZClplC2 _ 2--q~-2¢ 1 ... z2ca va c2.

after algebraic manipulations we have d = x/2x ~ + 1 - 1.


We introduce a mechanism to detect uncooperative nodes and ignore them to save energy.

a possibility to modify the default OLSR routing behaviour in order to extend the life of the node is presented.


(packet/ms) µ(packet/ms) n = 5 0.07799 1/12.1808 n = 15 0.02665 1/36.4052 n = 30 0.01359 1/71.3596 Number of nodes fmodel for Markov model fmodel for Exponential MAC n = 5 0.0547 0.1736 n = 15 0.0789 0.1258 n = 30 0.0729 0.1040 chosen such as to satisfy that the transmission queue remains nonempty.


In general, receivers that have higher target reception rates will have earlier join times and receivers that have lower target reception rates will have later join times.

the join time is a re.ection of the target reception rate of a receiver before the join, and the MRTT value measured as a result of the join impacts the target reception rate after the join.


The WiMAX R6 data plane utilizes Generic Routing Encapsulation (GRE) to route packets.

in addition to the mapper function, it is also necessary for the AP to be able to encode and decode GRE packets.


For future work, both WiMAX and LTE introduce relay stations in order to help balance the loads of BSs, enhance signal quality, and extend the service coverage [23, 24].

it deserves further investigation to take relay station into consideration in the BS placement heuristic so as to improve the system performance while reducing the construction cost.


EVALUATION We have not actually implemented SDCs, either in a simulation or in an emulation such as NetFPGA.

we evaluate the feasibility of SDCs using some back-of-the-envelope analyses.


despite that the SVs collected at di.erent APs have di.erent variance (i.e., spread), we can still use the same cuto.


The re-announcement of the route causes the fourth .ap.

the key to our explanation is understanding the circum stances under which node ntwice announces an alternate route in response to a route withdrawal.


At their core, these traceroutelike approaches provide a list of router IP addresses which can be viewed as aliases of a single router, to be determined [14].

numerous solutions to the alias resolution problem have been developed including: examining IP ID values [9, 17, 25], using prespeci.ed IP timestamps [21], detecting variants in the source address of a probe s response [14], applying graph analysis techniques [15], and, as in this work, by examining reverse DNS lookups [24].


It is worth noting that, as previously discussed, we exploit XML technologies to de.ne entries (and templates) as well as to implement the matching evaluation between data .elds.

our model does not preclude the discovery of a Web Service satisfying a particular kind of data in the WSDL .eld of the tuple.


Since the IP address changes to IP4, VM2 does not respond to the probe ARP request.

{IP2, MAC2} is deleted from the BtoU table by the time-out handler (Figure 7 (iii)).


However, it is a p roblem t hat t he coexistence p redicted with each measured sin gle valu e at the M AC or NET lay ers is not high ly reliab le.

a r eliable coexistence p rediction model considerin g elements of interference measurement at each lay er comp lexly is required for WBAN.


Such outliers are di.cult to eliminate because they have many sources in complex systems; even in a well-provisioned system where individual operations usually work, some amount of uncertainty is pervasive.

latency is a di.cult challenge for networked systems: How do we make the other side of the world feel like it is right here, even under exceptional conditions?


Even when only some infrastructure was added, mean inter-contact times were reduced by up to .ve times.

even though the inter-contact time distribution kept its power-law properties, the existence of infrastructure in the network should still improve forwarding performance in Pocket Switched Networks.


Table 2: DesirablepropertiesforaperVM paymentmodelusingweights.

onecanachievehigherbandwidthguaranteesbutbe lesssensitivetoweightallocation,orrespectweightsstrictly on eachlinkbutprovideverysmall bandwidthguarantees.


executions are exactly the same and the members of Y and in particular the receiver R receive and send the same messages in both executions.

the receiver R cannot distinguish whether the set D1 is corrupt and the message transmitted by S is m1 or the set D2 is corrupt and the message transmitted by S is m2.


Now we brie.y analyze the computational complexity of the worst case by Algorithm 1.

with the algorithm, in the worst case the number of separate groups, a, when we deploy the last routing node, could reach up to m + n. in the worst case, we have 2m+n scenarios that the .exible vertice connects to the separate groups or not; for each .


The movement of a vehicle in a platoon group is restricted by the vehicle ahead and behind itself, as well as the roadway speed limit.

it has some well de.ned movement characteristics, which can help to predict the relative location of two vehicles in a platoon group after a period of time.


g P * which completes the proof by invoking Lemma 2.

the proposed MAX-logit algorithm enjoys a provably fastest convergence rate than any other algorithms in G, including B-logit.


We believe that services should be defined according to SOA (Service Oriented Architecture) approach.

we think the proposed vision (leftt part of the figure 1) cannot cover all the requirements of NGN.


For example, when the payload is 10 bytes long and the MAC is 2 bytes long (i.e., n =80,m =16), the success probability of selective forgery without MAC striping is 2-16, and with MAC striping it becomes approxi () 96 259 mately 2-75 (since 16).

the MAC striping technique drastically decreases the success probability of selective forgery (from 2-16 to 2-75 in the example) without increasing the MAC size.


On the other hand, as APs are relatively static, the connectivity among the APs can be considered relatively stable and reliable.

periodical signalling exchanges among the APs are possible in such networks.


By Lemma 5.3, ßLpQqe max log .rj , j 1,2,...,J so we only need to show that ßU pQqd max log .rj , j 1,2,...,J where ßLpQq and ßU pQq are de.ned in (25) and (26) respec tively.

first note that ßU pQqd ßU pMq,where M is the queuesize vector of the virtual system BN.This is because, by Proposition 5.8, ÿNN ÿ Qiptqd Miptq` KpN ` 2q, i 1 i 1 deterministically and for all times t. in steady state, rN rN Qi is upper bounded by Mipt q` KpN ` 2q,de i 1 i 1 terministically.


Further, since the re.ected signal propagates by different distances to the two antennas at the receiver, the channel changes created on the two antennas are different.

by comparing the relative channel changes across the two antennas, we can identify the bits transmitted by the backscattering device.


In the method, the cluster is de.ned as a set of locations sharing a common set of access points (called cluster key).

the SS-MAP is sorted according to the cluster keys.


As the number of nodes is .nite and there is a path between s and r, the JoinQuery message eventually reaches r, whose JoinReply message travels by the reverse path.

eventually all the multicast receivers are covered.


It follows that for 1 = i = m - 1 that si = ei = si+1 + 1.


The operations on integers are far faster (almost multihundred times [15]) than global memory access on GPU.

only the performance of memory access will be discussed in this section.


In all three cases, if more than one AS was identi.ed as actor, or if there was an AS-link, we counted each AS involved individually.

events with more than one AS as actor are counted more than once in Table 6.


Worth noting is that this model can be readily applied to .nite-energy systems with NC, where the objective is to maximize the system throughput before the energy is depleted for further transmission.

the energy and delay constraints can be used interchangeably.


With an interfering MSK signal the shape of the curve is di.erent.


In addition to the computational complexities, there are lots of subtle performance side-e.ects in changing the placement of bees.

to improve the initial placement, we employ a greedy heuristic aiming at processing messages close to their source.


Furthermore, the removal of sessions with RTTs higher than 10 seconds does not change any of the results below and, at the same time, prohibits us from showing the extent of variation in the network parameters experienced by a home Internet user.

since all sessions in {DlpuDz~} were able to successfully complete, we consider the removal of sessions based on their large RTT to be unwarranted.


Since edge routers correspond to boundaries between ISPs, edge routers belonging to different ISPs need to cooperatively handle failover.

we have designed a failover protocol which must be implemented by each participating ISP.


Unfortunately, these facilities are indirect and sometimes expensive for end users.

we cannot expect all content in the Internet to be facilitated with these technologies.


This last scenario better illustrates the effect of spurious errors on proactive property of SmoothTCP-q.

to take the whole advantage of the QoS characteristics of SmoothTCPq when compared to TCP, we should take into consideration the bursts of packets that follow the retransmitions of discarded packets.


This is impossible without knowing Di and Fi because of Mi = h(Di||Fi||A||T ).

the proposed scheme can resist the replay attacks.


Here, ffetchWqeSq is currently producing black tokens on the output .fo allocated for RS1, while ffetchWqeRq is producing white tokens on the output .fo allocated for RS2.

interleaving of tokens of different colors is avoided at this point.


Thekernel trick is a way of mapping observations from a general set into an inner product space.

thevalueofthekernelisequaltothe inner product of two vectors xi and xj in the feature space f(xi) and f(xj ).


If some servers/links in a path are down, choosing another path may cause a huge path length increase.

the packets delivery latency in BCN or FiConn under server/link failure is quite unpredictable.


Using this model for an iterative k-steps-ahead prediction2 has the bene.t, that the model already exists and can simply be applied.

in any case, even if the current situation was not observed before, a prediction will be available.


Here we present a theorem based on Berlekamp s algorithm which indicates that the trace polynomial over GF(2) can be factorized as a product of several monic minimum polynomials; each minimum polynomial corresponds to ai for some positive integer i where a is a primitive root in GF(2m).

we can determine those roots for trace polynomial in the .eld GF(2m).


Furthermore, it is easy to see (as in all previous cases) that the community-based mobility process is also ergodic.

the probability pm c is equal to the percentage of time a node is in a moving state in an in.nite evolution of the mobility process.


As one can notice, the weights applied to the assisting cell s HS-PDSCH di.er by ninety degrees.

there are four possible sets of transmitting antenna weights and one of these sets is chosen based on the UE feedback information.


Given the aforementioned goal, our NM im Table 4: Connectivity and switching capabilities of the modules in device A. LEGEND is an up-pipe for B & down-pipe for A B Module A has  A [down  down] switching Module A has A [up up] switching Physical pipe Figure 6: Potential Connectivity sub-graph for device A. plementation invokes showPotential at these devices to determine the abstraction for the modules in these devices.

the NM has a network map akin to the one shown in .gure 5(b).


Once an appropriate next-hop appears in range, all messages for this neighbor are forwarded immediately.

for intermediate nodes (other than the source), message arrivals would be highly non-uniform, more speci.cally, clustered at the time when the contact turns up.


However, for most problems of interest, extremely strong inapproximability results hold [19, 44].

it is essential to use near-metric properties of the decay space.


In this paper we identify scenarios where the error introduced due to these two factors becomes significant for a nominal range of relevant parameters (a detailed discussion is presented in Section 3).

when there is significant motion between signal arrivals, in order to time synchronize the submersible, it has to be additionally tracked over the time epoch T. the key problem that we will solve is joint time synchronization and tracking of submersibles based only on one-way acoustic transmissions from beacons.


The problem is similarly ampli.ed in the case of the real RFTrax sensors, due to the short, one-second measurement window remembered by the sensors.

averaging over a small number of measurements does not give accurate estimates of the true source intensity, which is needed for RoSD to work well.


Since Algorithm 1 implicitly removes duplications of degree-2 packets on-the-.y, the constructed G(Ei) should be an acyclic graph with an average height O(log k) [24].

we need at most O(log k) operations to .nd the path (i.e., equivalence chain) between any pair of vertices in G(Ei)by using lowest common ancestor algorithm.


MR Rank (rij ) For the transmitterreceiver pair i - j, the rank of the potential next hop MR j is the maximum channel rank over all the channels fj in its favorable receiver set, FjR .


The DSR Route Discovery phase precedes flow state establishment along a route [6].

the source only forwards the flow establishment packet to the destination along a known route obtained from its Route Cache by using the Source Route Option [6] during the Endto-End Flow State Establishment Phase.


1, increasing region 3 and region 2 on the expanse of region 1 and region 4.

there are cases where the system would have converge to the optimal state, but allowing monetary transfers it would converge to the other stable state.


As we showed earlier, RSSI in backscatter communication is primarily impacted by pathloss and not multipath e.ects.

as RSSI reduces, the maximum throughput of the channel reduces and a bitrate that leads to a lower throughout should be chosen.


S2rejected at most T calls before the current R phase and at most CR(sT +t) during the R phase.

the rejection competitive ratio is at most CR T (sT +t) + =8cAcR + cR = O(cAcR) T/(8cAcR) CR(sT +t)/cR 2.2 Analysis of Acceptances We de.ne cal ls rejected because of algorithm R to be those rejected or preempted during an R phase and denote their number at time t with RR(t).


In TDMA wireless ad-hoc networks, a transmission scenario is valid if and only if it satis.es the following three conditions; (i) A node is not allowed to transmit and receive simultaneously, (ii) A node cannot receive from more than one neighbor at the same time, (iii) A node receiving from a neighbor should be spatially separated from any other transmitter by at least a distance D. However, if nodes use unique signature sequences (i.e., joint TDMA/CDMA scheme), then the second and third conditions may be dropped, and the .rst condition only characterizes a valid transmission scenario.

our MAC layer is based on TDMA scheduling [16, 17, 31] such that collisions and interferences do not occur.


From the non-queueing model, we obtain the service-time statistics corresponding to a given q.In the second phase, we consider a queueing model of the system with a given arrival process .

(t) and queue length K.the probability of having a packet to transmit q corresponds to the probability q0 of having at least one packet in the queue.


An AC cannot decrease its backoff counter and send its frame before the end of its AIFS even if the channel is idle.

higher priority classes can decrease their backoff counters relatively faster and transmit more frames, while lower priority classes should wait until the end of their AIFS.


However, for PP+BTP and PP+BP, with increase in the number of nodes, it is better to increase .opt reducing the number of route broadcast.

the scalability of these protocols is increased with high number of nodes in the network.


Our MILSes are vectors in R(GT ), and the MILS set contains a basis of R(GT ).

inference with MILSes is equivalent to inference with the whole end-to-end paths.


df ..L. 4pPrth 10Lw (f )f2.+2 dfL (2) Atarget can be detected by a radar only if r = .

r.xf we de.ne the area covered by the ith radar as a circle of radius r.centered in x(i),in which TOA can be measured.


(In Section 5, we tuned the algorithm to work well with multiple radios and frame combining, but did not alter the fundamental mechanisms used in the algorithm.)

in fact, we can use the results from the previous section to show that there is room for improvement in the rate adaptation algorithm.Table 3 and Figure 9(b) show that the frame loss rate to the active AP in MRD-R1 was 35% and that MRD-R1 selected a bit-rate of at least 24 Mbps over 90% of the time.Multiplying 1 -FLR with the the e.ective throughput of the 24 Mbps (17.8 Mbps) bit-rate yields 11.6 Mbps.we could have .xed the bit-rate to 24 Mbps for the non-MRD HIVAR experiment (R1) to improve the performance by 1.4× over the MADWiFi autorate algorithm, which achieved 8.25 Mbps.


We use average of rp(i, n) because it gives a measure of the total magnitude of change.

r(i, n) represents average proportion of change in next-hop decisions at timescale n. Figure 2 presents the time series of r(i, n) for our 4 datasets, where n is 1, 2, 7 and 30 days for datasets 1 to 3 (daily), and n is 1, 2, 6, 12 and 24 months for dataset 4 (monthly).


In this complex situation, F-ODFC selects the contending BS who experiences the maximum contention failure rate as the winner.

f-ODFC is able to allow a fair contention mechanism for all contenders with varied frame demands and thus it signi.cantly improves the fairness of ODFC-based self-coexistence.


For example, packets assigned to a TCP pipe by an application cannot be withdrawn from that pipe, notwithstanding any bandwidth reduction the pipe may experience.

if bandwidth reduction were to occur, packets assigned to the pipe that have not yet been transmitted due to lack of space in the reduced congestion window cannot be reassigned to another active pipe.


knows its future light weight f.light(.).

while applyingthe abovemethodforchoosingthe port label at ., the procedure uses .


Also, unlike most special purpose apps, it displays a meaningful error message when faced with an incorrect certi.cate and allows the user to continue on to the site if (s)he wants to.

it relies on the ability of the user to understand what the displayed warning messages mean and what the safest behavior is.


The more it deviates from the actual, the smaller the likelihood value it has.

based on this criterion, the selected path will be at least very close to the actual path even if it is not the actual one.


However, the rest of the frame contains symbols from both transmitters at similar power levels.

the rest of the frame would have a very low signal to interference and noise ratio (SINR).


However, BGP tables and the WHOIS database have few clues for inferring geographic information of AS boundaries.

figure 2: The clustering method of AS boundaries using common IP addresses.


As expected, the rate of SAR 2A realistic DSL loss rate is at the level of 1e-5, but this is a rather unrealistic condition for simulations, since it would take too long to generate meaningful results.

we chose PLR 1e-3 in the simulation instead.


If it is need to scale to fj , there is an period of incapable time d, the router can only handle packets in the next (.t - d) time with fj .


the location table does not get updated properly.


In uplink experiments, retransmissions are turned o..

the gain in the uplink experiments is solely due to space diversity.


Google, as well as mobile operators, Assisted GPS (A-GPS) chipset and handset vendors can also provide SUPL and FOTA services.

it is plausible that some of the root certi.cates included by other vendors may be used for similar purposes.


All other nodes remaining to other clusters set their status to a sleep mode.

the network should reorganize and initialize itself according to LEACH protocol procedure.


(iv) Handling of Powerless (Dead Nodes): Special care is taken in the HTAP algorithm concerning the nodes which their battery is exhausted.

when a node is going to lose its power, it is immediately extracted from the network and the tables of its neighbor nodes are updated.


a0-1 Letting i +1= |OP T |·ln |OPT|,wehave: 1 ai+1 = (a0 -1)(1 - )i+1 +1 |OP T | a0-1 1 |OPT|·ln |OP T | =(a0 -1)(1 - )+1 |OP T | a0-1 1 ln |OP T | = (a0 -1)( )+1 e |OP T | =(a0 -1) · +1 a0 -1 = |OP T |+1 a0-1 That is, after |OP T |·ln |OPT| iterations, the number of pieces remaining is at most |OP T |+ 1.For each additional vertex we choose, we will decrease the number of pieces by at least one.we need only pick at most |OP T |additional vertices to reduce the number of pieces to one.The total number of vertices that we choose is no more than |OP T |·ln a0-1 + |OP T |.Since |OP T |= n-1 , the solution found |OPT|.


This technique is strongly in.uenced by the methodology of reverse traceroute [10] and a prior technique used to estimate ICMP generation delays [7].

while the control probe is routed through the forward hops, we inject the i-th test probe at hi.


In Cloonix-Net, UML functionality also allows us to run different VMs with different Linux kernels.

it is possible to create a virtual network with different entities, each having its own unique role, communicating together as if in a real network testbed, but operating on a single Linux host.


On the other hand, in the 39.4 kbps inter-vehicle CDMA system, introduced in [11], transmission delay of one bit data is 25.38 µs, which is much larger than the maximum additional delay calculated above.

we can roughly say that our diversity combining will not induce much additional delay to the cut-through forwarding operation.


When transmitting to or receiving from the peripheral nodes, however, the backbones nodes will use the peripheral channel.

a backbone node can conceptually be thought of as consisting of two virtual nodes: a virtual peripheral node for communicating with peripheral nodes associated with it; and a virtual backbone node for relaying packets over the backbone network.


Furthermore,the annotation is made before the simulation is executed.

the native environment simulation environment Figure 2: Node structure time taken to annotate the application code with calls to requireCpu() does not a.ect simulation performance.


Any bit error contained in the video packet will lead to all the equivalent loss in the entire video packet.

during the transmission and reception of multimedia data by the end equipment, the high bit error rate in wireless environment could easily and seriously affect the multimedia service quality.


In this paper, we present A-MAC, a new receiver-initiated link layer that shows it is possible to support multiple services under a uni.ed architecture, and to do so more ef.ciently and scalably than prior designs.

we narrow thegap between sender-and receiver-initiated approaches to low-power wireless.


C c7 · rk · nc7 · rk Or we use the other formula to the multicast capacity as v n .k(n)= O( v v· W ).

log n · k the multicast capacity per .ow is .k(n) .k(n)= = O( v v· W ) nn log n · k v 4.3 When k = o( m) v Clearly, when k = o( m), the expected number of subregions which contain at least one receiver, E(s)= k w.h.p.


In the indoor setup, we used 19 nodes within a circular receiving node (94 ticks), and (d) any processing jitter involved(.52 ticks).

we chose control slot duration to be 393(93 + 154 + 94 + 52) + 27 = 420 ticks, considering 27 ticks for the guard band as given earlier.


In order to analyze all types of packet loss, we have run experiments for 2 di.erent network conditions: without background tra.c and in presence of congestion.

four experiments, as detailed in Table 2, have been run to generate all the .gures shown in the rest of the paper.


4.6 Competing TCP-AP and TCP NewReno Flows Since TCP-AP applies rate-based transmission only within the TCP congestion window, the number of packets in flight can never exceed what the window allows.

tCP-AP is TCP-friendly by definition, since TCP-AP cannot transmit at a rate higher than a standard TCP connection operating along the same path would achieve.


Given that the smallest n is used, the minimum number of distinguishable responses from a server required for a complete reordering detection during each probing session is 2.

if one probing message will trigger at least one distinguishable response, then the client only needs to send 2 probing messages during each session.


Timing in the emulator is governed not by the actual time but rather by the num- ber of cycles the processor spends executing instructions.

any cycle may be adjusted to have an arbitrary duration in terms of actual time.


After that, P becomes larger loading (C) than PMAP in case A exchanges RTS/CTS/DTS with B before C does that with D, or the interference from C to B exceeds the planned loading at B, in the other case.

only one transmission can proceed, and the throughput becomes comparable to that of the 802.11 scheme.


experiment in the same topology of Figure 9  Figure 10: A handoff-capable exists between the upper- and lower-bound of the handoff threshold  the hando.-capable region guaran- tees that a hando.


Any node u at distance d = D/41/a will have a clock rate differing by no more than J Da/(4B) from v s, and likewise for nodes close to w. Therefore, all nodes within distance D/41/a from v have by J Da/(2B) faster (or slower) clocks than the nodes within distance from w. (41/a) Since it takes in expectation DB/ 2 · time until the state of nodes further away than D/41/a in.uence v s or w s clock rates at all and clock rates are determined by averaging, v s and w clocks will (with constant probability) drift apart at the rate of at least J Da/(2B) for that time period.

(41/a)(J D1+a) askewof J D1+a/2 ·= Ois built up.


Vehicles broadcast beacon messages periodically, and they use the ratio of packet transmission delay between two successive beacon messages to represent the relative mobility between two vehicle nodes.

after receiving two beacon messages, the vehicles can calculate the relative mobility between itself and other vehicles.


The stale message will always be kept in host buffers until the TTL of the message has reached its expired time, usually supposed to be so long in Disruption Tolerant Networks that a high message delivery ratio can be achieved.

it is a big waste to store such redundant copies of a stale message for a long time in the buffers of the nodes in network.


In addition, we assume that end-to-end security mechanisms can be used to insure that each user s data remains con.dential and unchanged as it passes over a network.

our architecture only needs to focus on security of the network itself.


This is because under No-PSP, all the normal traf.c packets have to compete for limited bandwidth resources with the attack traf.c, while with our protection scheme only normal traf.c marked in low priority class is affected by the increasing attack.

even in the extreme case when the attack traf.c demand is suf.cient to clog all the links, our protection scheme can still guarantee that the normal traf.c marked in the high priority class goes through the network.


Each peer is not only a system resource consumer, but also a resource contributor.

the system capacity is linearly adapted to the number of peers in the service.


Let: TL = Tabu list; TS = Size of the tabu list Four objective functions focus on where to best locate APs.

initialization procedure: a collection of adjustable AP placement locations is 1.


Thorough understanding of network QoS in a Cloud environment forms a foundation for obtaining deep insight about Cloud service performance.

analysis on network performance for Cloud service delivery becomes an important research problem.


For a job using N VMs with Mc map slots per-VM, the maximum number of simultaneous mappers is N * Mc.


Although exact encounter rate depends on many factors, such as .oor layout, mobility patterns and so on, the number of users in the system is generally positively correlated with the frequency of user encounters.

in this section, we investigate the impact of number of users on the localization accuracy.


In this experiment the receiver is the bottleneck, and the main cost component here is the system call, which howeveralways .ndsdataavailablesoitneverneedstosleep (a particularlycostly operation).

a small batching factor su.ces to reach the peak performance.


Also, we know that p is in segment Sk at the beginning of phase pb+1.

by Observation 8, at least one of p ' or the chosen leader for Sk will transmit during phase pb+1.


Other multi-hop clustering algorithms such as OCND [10] and ECTC [1] adopt the same modeling approach as in EEHCA.

their accuracies are almost identical to that of EEHCA.


And the packet service rate is µij , where µij =1/TMAC .

the queueing delay of M/M/1 queue is .ij /µij Tqueue = (10) µij - .ij summing the queueing delay and packet service time, we have the .nal result for LPTT as follows.


The HC may allocate TXOPs to itself to initiate frame transmission after waiting for a time equal to PIFS, which is shorter than DIFS as well as any of AIFSs.

hC gets priority over all other stations in medium access.


Specifically, flows that experience more contention will "shut up" more contending flows while they are trans- mitting.

a general framework for modeling fairness for shared wireless channels must provide the abil- ity to capture the location-dependent nature of contention.


Since IxwI=1, IuwI=1, and IxuI> 1, we have Lxwu > p/3.

lxuw  1, and IuyI> 1, we have Lyux  p, which is impossible.


In high-performance routers, it is more common to use multi-core network processors (NP) that are programmed for packet forwarding directly without the use of complex operating systems [7].

there is a need for controlling processing resources in these highperformance, embedded packet processing systems.


For instance, in a multi-hop wireless network, functions such as routing, power management and media access would probably rank higher than inducing cooperation.

the cost of cooperation inducing mechanisms must be low and commensurate with its bene.ts.


On the other hand, a=0.05 provides a cushion in this comparison, and it can be tested whether a new feasible solution is statistically worse than the best feasible solution with a 95% confidence.

the probability of rejecting a true new best feasible solution is low.


And by vi-2 s decision to choose vi-1 , f(vi-2 , vi-1 ) > f (vi-2 , vi-3 ) > f(vi, vi+1 ), f being an monotone increasing function.


There exist at most.dominateesin each HC and LC.

data from all high power dominatees can be aggregated to their dominators in .


As the route between each sensor and the actor is refreshed at a .xed time interval (3 seconds in our experiments), the maintenance of connectivity to the actor is not adaptive to mobility.

the decreasing of delivery ratio can be observed as mobility increases, and the performance of all the algorithms, except RP s, becomes more and more similar.


Network administrators who attempt to avoid computers on their internal network as being part of botnets can simply block the outbound IRC connections.

more and more botnets are now evolving from the centralized communication way to the advanced distributed strategy, such as the early Sinit [3], Phatbot with WASTE command [4], Nugache [5] and the recent Peacomm (Storm worm) [6].


However, interdependency of vulnerabilities distributed in the network and the connectivity of hosts, which is realized through the network con.guration, can signi.cantly elevate the networkwide risk.

it is mandatory to collectively analyze the compliance reports of all connected systems.


Given S replaces Mo with Mn in its forwarded message batch, it is computationally infeasible for A to tell whether Mn is the decryption of Mo using some unknown secret key K, even if A may be able to link Mo with Mn as the messages originated from the same sender, assuming the semantic security of symmetric key encryption and the security of one-way function f ().

a cannot link S with Mn with a probability better than random guessing either.


Furthermore, to manage the multiple IPC processes, a multi-interface system would have a higher-level IPC process that performs not only multiplexing but also a relaying function.

to manage the IPC channel through a multi-interface system (e.g., a router), a relaying-andmultiplexing task would be required to forward messages toward their destination.


We measure GSM signals at different indoor and outdoor scenarios and find that the accuracy of distance has to be different.

we collect GSM signal at 10m distance for indoor and 20m for outdoor, which is feasible to detect new Wi-Fi AP.


Additionally, the number of leaf-nodes is at least half the total number of nodes of the tree.

the total memory requirement can be rewritten as: M =(|S1| + |S2|)(L + LP +log m + LNHI ) + |S1|LPtr1 + |S2|LPtr2 (7) From the formula, we can observe that the total memory requirement M is not sensitive to the number of routing tables m.In fact, M is proportional to LVID = Ilog m1.


(2) After 15 s, User 2 is starting some downloads which overwhelm the access network.

the YouTube video experiences problems and the bu.er level is decreasing, until the video stalls for several times.


A node fails to acquire an IP-address in the cell Ci if the number of nodes already in the cell equals the size of IPaddress block, BS,of the cell Ci.

the probability of address acquisition failure is Pf = PBS = P(#nodes in the cel l Ci =BS).


That is, a party can get veri.able intermediate results when the signature exchange protocol is executed unsuccessfully.

this party may obtain some bene.ts by showing such universally veri.able intermediate results to a third party.


In Re-ECN, the sender re-inserts the congestion information received back to the network as a feedback.

as the packet passes by each router along the path, it carries a truthful prediction about the congestion condition of the remainder of their path.


As mentioned before, the testbed is composed of several modules running in parallel on different PC s. Then, it is very important to have a simple but powerful graphical user interface for setting up, controlling and visualizing the whole testbed execution and results.

aGMT has been programmed to support the following set of functionalities:  Control the execution flow of the testbed and selection of the scenario to be demonstrated.


However, besides the controller s con.guration, an administrator cannot in.uence the controller.

for example, an administrator cannot send controller messages that respond to a switch message unless the switch has indeed sent such a message, nor can a controller send arbitrary messages to the switch.


Nevertheless, there is a signi.cant number of packets that are likely to spend milliseconds of delay through a single node.

measurements of output link utilization at 1 ms intervals are able to reveal the amplitude of microcongestion episodes.


The results indicate that a NoC node consumes around 750 LUTs per node.

a BPU Node using double precision floating point operations will be around 18,000 LUTs large.


On the contrary, the use of ECN+ (i.e., Table 1: Normalized Throughput (%) AQM scheme RED/ECN RED/ECN+ RED*/ECN RED*/ECN+ REM/ECN REM/ECN+ PI/ECN PI/ECN+ 90% load 84.91 85.11 73.24 79.29 78.28 78.63 86.37 86.56 105% load 94.65 95.02 76.62 96.51 94.42 99.73 99.76 99.89 marking instead of dropping packets) during these short congestion the bound determined by Wmax.

because the initial window periods can have a dominant impact on end-to-end performance.size is two packets [6], and because TCP s slow-start mechanism doubles the window size each round-trip-time, the .ow arrives into the system in n bursts of size Xs = {2, ..


However, our algorithm may be extended so as to find the maximum subset of transmitters (N-q) that satisfy their targets.

in the state that stopped the FM algorithm, transmitters that have achieved their targets have no incentive to change their powers.


A sequence of probes with a .xed sampling interval of 500milliseconds wasdispatched to a remoteADSL endpoint with a downlink speed of 8 Mbits/s and an uplink speed of 800 Kbits/s.

the forward path (from the measuringnode to theADSL node) contained theADSL sdownlink, whereasthereversepath(from the ADSL node to the measuring node) contained the ADSL s uplink.


Cache hits from the key CCN nodes enable fast response to content requests, but this needs to be balanced against the cost of having a large number of complex CCN nodes.

additionally, by a judicious choice of placing a limited number of full-.edged CCN nodes that can also cache content at key points in combination with a larger number of hash-based forwarding (similar to IP forwarding), we address the problem of e.cient migration to an Information Centric future.


Clearly, M corresponds to the maximum completion time across the set of phones in the rotated visualization.

packing allitems(tasks) using at most lPlbins(phones) and minimizing the maximumheight acrossbins will minimizethe makespan 5.


The number of possible orders in which events can occur is, in fact, exponential in the number of members in the group and the number of actions (JOIN messages and group departures) which will occur.

two facts quickly became clear: protocol veri.cation would need to be automated, and this automation would have to be heavily optimized in order to keep veri.cation tractable on standard hardware.


Initially, the packet insertion rate of f3,f4 into sw2 is thus higher than their service rate.

regardless of bu.er sizes, the input bu.er at the end of the link sw1 .


Therefore, we can directly expand Ni to P and be sure that no p I .P is on the line segment between v I and pi.

there exists an fI(·) such that f I(pi) lies on the convex hull of f I(P) {v I}.


(11) Using experimental data and the Method of Least Squares, -0.420049 the authors shown that a = e and b = 0.045195.

in this model the distance is given by 0.045195S dREX = 0.657014625e .


Rate(d ) = S ; for R < d = R , 1 = i = n (1) i i+1i where, Ri is the transmission range of data rate Si that meets a given BER objective, and S1 and Sn are the minimum and maximum data rates respectively.

rn+1 = 0, and R1 is the maximum transmission distance.


Hence, we conclude that IP reachability re.ects physical media state.

iP reachability must be formed in order for IS reachability to be established, but it is not suf.cient to establish IS reachability.


Here, NumPE is the number of processors used and C is a constant value.

the additional amount of mem- ory required for efficient parallel execution only grows as the number of processors is increased.


The downlink channel in between the base station and mobile node i is characterized by stationary Rayleigh fading.


We argue that mobile access will become, in addition to data centers and PCs, another contributing factor from the ICT sector to greenhouse gas emissions and that current mobile access technologies limit further network expansion in rural areas.

we need to start working on making mobile networks much more energy-efficient than they are today, maybe even fully selfsustainable using renewable energy sources.


Forwarding rule veri.cation is further complicated by the fact that there can be a mismatch between the control plane s view of routing state and the actual forwarding state in hardware.

verifying whether every packet has been correctly forwarded requires help from the dataplane.


Due to the various complex e.ects of wireless signals, however, the network geometry usually is quite irregular.

this paper proposes a novel systematic and uni.ed approach to obtain the GDD between two random nodes associated with arbitrary network geometries.


The trends of fi,p for different peer classes, under 70% and 80% uploading capacity, are qualitatively similar to those when uploading bandwidth is 60% of the capacity.

we only depict the average of fi,p in Fig.


1(e) there are three leaves with label 2, but only one with label 1 or 3.

we could save space by representing label 2 on fewer bits, similarly to how Hu.man-coding does for strings.


The delay of 802.1X authentications was evaluated in [4] and the minimum value (150 ms) was obtained with 802.1X fast resume; the minimum values obtained for a full 802.1X and for the 4WHP were 750 ms and 10 ms, respectively.

our minimum reassociation delay is at least two orders of magnitude smaller than the lowest delay with 802.1X and at least one order of magnitude smaller than the 4WHP delay.


The reason for this small overhead is due to an avalanche effect that gets triggered during channel access when several devices speculatively transmit, nodes in their vicinity detect these high SNR preambles and immediately abort their respective transmissions, thereby quickly reducing overall interference.

we believe that the costs of WiFi-Nano are small compared to its bene.ts.


Since each transmission .2r2  can move forward at most r meters, the bit-meter of the network is at most T( mH DW ).

we have: .2r mDHW E(t)= T( ) (4) .2r From Lemma 2 and Eq.


RandPhaseKing(vi )  Note that one phase with a correct king in each sub- protocol is sufficient in order to guarantee the protocol's correctness as can be seen from the analysis of Protocol 2.

running each sub-protocol for a sufficient number R of phases will guarantee, except for some negligible proba- bility, that eventually, some correct player is elected as king.


For a sensor network .eld, the area in which the sensor nodes lie correspond to a .nite region of the plane.

let this region be called S. any point in S maps to apoint h =(x, y, z) on the sphere where z = k for some 0 <k < 2r.


An IaaS cloud may host thousands of tenants each of whom may require several virtual networks, which may span across multiple data-centers.

network virtualization is required to isolate network tra.c among tenant systems (physical or virtual servers) in both intra-and inter-data-center connections.


To halt a DDoS attack in progress, slave machines, which in this paper are simply called attacker, need to be identi.ed but the source address of attacking packets is not accountable for this purpose because, in the current Internet, hosts can write spoofed source addresses in packets to send.

we need to have an alternative that allows us to trace network paths along which attack packets travel in order to identify attackers.


This decision a.ects the Return Condition of the VITP request and must be based on the semantics of the incomingVITP message.

vITP provides cache-control headers that can be included in VITP messages and act as directives to VITPpeer cachingdecisions.


The data may include the indication of the QoS model, the major QoS parameters, the policy data, and other quality-related information.

an AU message contains Home Agent Option, Alternate Care-of Address Option, and Session Pro.le Data Option to deliver the necessary information required by the proposed scheme.


As noted in Section 3.2, the cellular interface consumes signi.cantly less energy than the Wi-Fi interface when not in use, and users rarely disable it.

cell2Notify results in significant energy savings when using smartphones for VoIP over Wi-Fi.


If we want that the second curve starts when the .rst is 0.999, we make k =logc 1000.

if we increase the value of k, we postpone the appearance of the second slope and delay the increase of the value of p .


ns ' is feasible} 8: end for 9: c = c +1 10: end while 3.1.3 Selective Growing/Delete A further step to reduce the complexity in comparison toSelectiveGrowing(SG) is todeletethose network states which were assigned a duration smaller than a threshold t> 0.

theinitialization of Sc+1 in theprevious algorithm, line 5 becomes Sc+1 = Sc|d* >t c Hence, the relation Sc-1 .Sc does not hold any more.


However, when we evaluate this mechanism in a 802.11a wireless network, there are still many collisions.

to decrease the number of collisions, we choose a slower network, 802.11b wireless network with maximum data rate of 2 Mbps, to evaluate this mechanism.


In this paper we present a novel Swarm Intelligence routing algorithm for Wireless Mobile Ad-hoc Networks, named Stigmergic Landmark Routing(SLR).Itis inspiredby the behavior of bees and uses the concept of landmarks to indicatekeynodes which store routing information.

little routing information needs to be stored and maintained in the network.


[3] obtained stretch 3 with space O ( v n), and Abraham, Gavoille, and Malkhi [2] obtained stretch O(k) with space O (n1/k log D) where D is the normalized diameter of the network.

surprisingly, the best name-independent schemes nearly match the namedependent ones.


Finally, routers allow all copies of packets with a valid stamp through because they have no per-.ow state.

an attacker that is incorrectly granted a capability by a receiver can .ood the receiver at an arbitrary rate until the permission expires.


All this can be achieved with standard management interfaces and tools used by ISPs today.

intercepting tra.c to a pre.x in the Internet is almost as simple as hijacking it.


Suppose the ratio of empty buckets is (, we have (s = be/m = e -ts = 0.051, where (s is the ratio of empty buckets when t = ts.

n can be estimated as follows " 1 m M(j) m j=1 Cmm2 if 0 ( < 0.051 n =.


As shown in Figure 6, in 10 × 4 nodes network (the longest dimension is X), the source node S can send packets to many nodes with XY-routing, and then, in 4 × 10 nodes network (the longest dimension is Y), the source node S can send packets to many nodes with YX-routing.

this routing algorithm can utilize advantageously the fact: The performance of XY-routing is better that of YX-routing in a oblong mesh network in which the longest dimension is X.


As mentioned above, the single correlation model, which breaks from time to time, is not stable enough to serve as a validator alone.

the pair-wise spatial model needs to be updated periodically to adapt to the stochastic changes.


At the sink node (b), obviously, its forwarding sequence is empty, the EDRb(0/) value is 100% (i.e., no packet loss), while EEDb(0/) and EECb(0/) values are both zeros (i.e., no delay and no energy consumption).

we can obtain following initial equations: EDRb(0/)= 1 , EEDb(0/)= 0 , EECb(0/)= 0 (1) Data Delivery Ratio 0.8 0.6 0.4 0.2 Expected Delivery Ratio Actual Data Delivery Ratio 0 Let the bi-directional link quality pei denotes the success ra tio of a round-trip transmission (DATA and ACK) between node e and the ith forwarder in Se .


Although the blur assessment can .lter out images of poor quality, the colors of pixels of selected images still deviate from the original ones.

after blur assessment, the selected images with less blur are then processed by the color enhancement component.


If there is no set cover of size k, then the network must have a MLU > 1.

objects must be placed in some (m 0 k) nodes in the node V1 = {1,..., m} in the top row to satisfy the demand for special node s. at most k nodes are available for placing special object o.


The movement contour of user s is likely to be mostly outside the protection area of any link s ' .

even setting As(t + 1) = 0, Problem 1 is likely to judge that links s and s ' have a low probability of mutual interference and make a resource allocation decision as same as that in the case of setting As(t + 1) = 1 (so that the mutual interference probability is 0).


In the beginning of the simulation, the nodes do not store any messages.

their gains are volatile in the .rst time steps.


Also the average cluster merge operation latency and the number of messages needed to reform the cluster are reduced.

the saved time will be spent in sending or forwarding packets instead of just building or joining clusters.


Equation 1 directly yields n-1 X CoE(vn,EEBL) = l4(vi) (4) i=0 which is linear with respect to the number of received noti.cations from other vehicles.

given a valid event (in which case vehicles v0,v1,...,vn-1 send their messages), we have: CoE(vn,EEBL) = O(n).


Their values are owned by hardware, and writing any value except for 0 is not allowed (writing 0 is an initialization).

head registers should be restored using state replay.


Furthermore available throughput and delay information can be easily collected between end hosts.


Basically, the Critic actually is a function predictor that during time learns the value of a state in terms of the expected cumulative rewards for that state.

the critic solves a prediction problem, while the actor solves a control problem.


Indeed, the slope of the line .tted to the data points is 0.478 and if we interpolate this line, the ordinate of the 0 variance point is 0.93.

clt =0.478 and cµ =0.93-1 =1.075 which are almost identical to the theoretically derived values of 1/2 and 1 respectively.


While our tests have been proof-of-concept deployments, it is important that it does not stop there, as a quick deployment for a couple of weeks, but that it can be taken further.

the user community has been part of initiating the projects, and have been taking active parts in o.ering feedback and user requirements throughout the entire project lifespans.


Note that the cc-topology can be viewed as a collection of horizontal lines of active nodes, such that the spacing between adjacent horizontal lines varies alternately as rand (rN2).


of the total in.ation in the ping latency, which itself is a fraction of the Internet s latency in.ation.

to summarize, loss, queuing, and bufferbloat do not explain most of the large latency in.ation in the Internet.


Once the forwarding paths are determined, they remain stable as long as the costs do not change.

it is likely that nodes on the optimal paths are used quite often and run out of energy quickly.


The above actions are repeated by node 3 and its descendants (if any) in the next communication periods.

the pause phase shifts to lower levels one communication period at a time.


Their count is at most 22., and the total cost of reaching them is proportional to 2k+./2k .

the increased cost is a constant factor over our original scheme, where the constant depends on .


They found that when a machine enters the receive livelock state, most of the packets are dropped, and no forward progress is made.

nAPI [24] and NIC interrupt throttling are enabled by default in most of the kernels and NICs, respectively.


Relatively high values of pfp (e.g., 10-2 , i.e., 1 % of all messages) may result in revoking many benign nodes.

we selected a much smaller value of pfp, namely10-4 ,which canberealizedby requiring nodestoreceive several bad messages before identifying their sender as an attacker.


The child-pointer redundancy enlarges the node s child-pointer array which contributes about 30-50% of the total memory for the tree.

reducing this redundancy signi.cantly reduces the total memory.


This decentralized per-.ow control approach di.ers to the earlier work [3, 8] in the regards that they focus on distributing the per-.ow controls horizontally (i.e., distributed per-.ow control architecture) while we tend to distribute them somewhat vertically (i.e., towards decentralized per-.ow control architecture).

in this workin-progress paper, we design a pilot implementation of decentralized per-.ow control by employing OpenFlow, NOX and Click.


In each round, we need to calculate the shortest tour among at most |S| sensors, which can be done in O(|S|2 ) time.

the time complexity of the selection algorithm is O(|S|2 log(|S|)).


a-RPL is dedicated to time-sensitive applications, where application messages must arrive quickly to the .nal destination while sacri.cing the energy level of sensor nodes.


However, it can not recon.gure the system structure, which means it can not solve the problems caused by imbalanced services distribution evolved in runtime.

we propose a Services Migration solution based on Genetic Algorithm, which can restore the system to a more balanced state.


This results in a furcation and eventually multiple healed paths toward the source.

the collaborative C and B cannot attack any X in C s community (due to the cooperative D.C transmission).


Also, for now, we will assume that the broadcast session finishes in less than or equal to |T| time-slots.

then, we define the following rule: Broadcast Rule: At every time-slot, ti, a node considers broadcasting only if it has not broadcasted earlier in this session and it is admissible in Ti at the beginning of the time-slot ti Proposition 2 implies that nodes with smaller RC values would not be able to broadcast (i.e., be admissible) at the beginning of the time sequence TS, but will potentially be admissible in later timeslots (i.e., at lower levels).


Also, all viruses, even those that are weakly contagious, will spread and persist in a SF system.

once introduced, computer viruses are very di.cult to completely remove from the Internet (see [35, 5]).


BGP allows the aggregation of routes into one such AS-SET [21], that summarizes the AS-PATH attributes of all the individual routes.

bGP route aggregation, used to keep BGP routing tables manageable in other contexts, can also be used to greatly mitigate the cost of multipath next-hop routing.


The message-complexity of the up/l/up broadcast protocol is respectively at most 3n in a network off order n supporting any strict IRS, and at most 9n in a network of order n supporting any IRS.

networks supporting a shortest path Interval Routing Scheme allows broadcasting with O(n) message-complexity.


In particular, temporal closeness quanti.es how fast a user can disseminate a piece of information.

applications of this metric include viral marketing and the study of rumour spreading.


BU message In our scheme, the NQA sends BU message to CN in place of the MN.

we propose to add anew Home Address Option in the BU message Home Address Option: Used to indicate the home address of the MN.


Because Q has a normal distribution, we can use the error-function to evaluate this probability.

we get the following lower bound for the utilization.


The lifetime optimization problem with only physical sensors, which is a special case of our problem, has been proved to be NP-Complete [21].

we only consider heuristic algorithms for the sensor selection problem in this paper.


Note that minimum cost path can be e.ciently computed in a loop-free manner using Dijkstra and Bellman-Ford algorithms if the routing metric is isotonic [24].

the number of paths to check for feasibility grows linearly with the number of gateways and mesh nodes.


Because all the tables produced by our reencoding schemes have widths less than 36 bits, we can set the TCAM width to be 36.

using a pipelined-lookup architecture, we can achieve a classi.cation throughput of one packet per cycle; using multi-lookup architectures, we can achieve a classi.cation throughput of one packet per twelve cycles.


Speci.cally, an application only expects the network stack to reply with a unique data item, without needing information regarding which interface was used.

in an ICN, a request can easily be multiplexed over a number of di.erent interfaces without the need for application-level awareness.


Conversely, anISP-onlypoweroptimization mayyield a server that is closer to the terminal but whose power cost ishigh.

ajointpoweroptimizationshouldprovidethe right balance and yield higher power savings.


AP1 is a hidden terminal to AP3 while C2 and AP1 are exposed terminals to each other.


In a P2P system, each peer can work both as server and client at same time.

the network capacity increases as most peers are connected to the network.


Hence q arrived at its destination by time t -dLwrJ+dLwrJ=t: since the length of its path is at most d, all its arrival times are earlier than t, so we may apply the induction hypothesis.

all the LwrJ+1packets that use e in the time interval [t, t +LwrJ] must have been injected in the interval [t -dLwrJ+1,t].


18, where the global blocking rate decreases signi.cantly given our schemes of (1, 1, 1) and (1, 0, 1).

the multicell system as a whole will bene.t from the load balancing by accommodating more satis.ed users, which will boost the system revenue in general.


Exhaustively listing all subchannel access combinations to construct the strategy space would result in an exponential growth (2C).

we examine two approximate de.nitions of the strategy space with polynomial space size: we call these the Binary Branch strategy space and the Consecutive List strategy space, and de.ne them as follows: In the Binary Branch, we use a binary branch tree, where each node represents one strategy.


Informally, a dominating set (DS) contains a subset of all nodes such that every node not in the DS is adjacent to one in the DS.

a DS creates a virtual backbone that can be used to e.ciently .ood messages.


Hidden Information and Actions in Multi-Hop Wireless Ad Hoc Networks Xiang-Yang Li* , YanWei Wu , Ping Xu , GuiHai Chen , Mo Li§ ABSTRACT For multi-hop ad hoc networks formed by individually owned nodes, the endpoints can only observe whether or not the end-to-end transaction was successful or not, but not the individual actions of intermediate nodes.

in the absence of properly designed incentive schemes, rational (i.e., sel.sh) intermediate nodes may choose to forward data packets at a very low priority or simply drop the packets at all, and it could put the blame on the unreliable wireless channel.


2 will always encounter a node located closer to t than the node where face exploration was started at.

restarting face exploration at the node located closest to t compared to all nodes on the face boundary yields a sequence of nodes v1,v2,.


However, from a practical point of view, all the actors in the telecommunications domain prefer to use this gain to increase the bit rate with a constant power level than to maintain a constant bit rate with a lower power level.

our approach seems to oppose these .nancial considerations.


The mean value of R' is then +1 (1 - p3) - (p3 rmax + 1)(1 - p3)rmax E[R']= .

[1 - (1 - p3)rmax+1] · p3 (31) we can derive the conditional mean values of M and N as ()( )() rmax+1 p1 p3rmax p1 - +1· p1+p3 p1+p3 p1+p3 E[M']= +( ) , rmax+1 p1 p3 1 - · p1+p3 p1+p3 (32) and ()( )()rmax+1 p2 p3rmax p2 - +1 · p2+p3 p2+p3 p2+p3 E[N']= + .


Hence, Cells A and B must be neighbors, inducing Edge AB in the dual of the approximate CVT.

if K > 15, the dual graph of the approximate CVT is the same as the ideal triangulation, i.e., a Delaunay triangle mesh.


When the (dij /d0)a target is absent, the weight is just noise nij .

the false alarm probability becomes higher and the coverage region is smaller than the case that the target positions are known.


Unlike the packet-based antenna selection, this PHY symbol-based method requires changes to the network infrastructure.

we target it for the long-term deployment of directional communication.


7.6 Spatial splitting outperforms temporal LocalFlow uses a precise, spatial technique to split an individual .ow based on either .owlets or counters that is oblivious to the timing characteristics of the .ow.

it achieves accurate load balancing despite traf.c unpredictability, unlike temporal splitting techniques like FLARE.


The median spectral e.ciency of trace A is 2.4 bit/s/Hz (this is in line with early 3GPP estimates [12, Chapter 26]), the 90th percentile is 4.8 bit/s/Hz and the 99th percentile is 6.4 bit/s/Hz.

in operational conditions, the highest spectral e.ciencies are not reached.


)}.R2 , (18) where the dependence of the region R1(u) on R1 and R2 has been dropped for the sake of notational clarity.

r1(u) is the re gion of channelgains [g1,g21 ] where receiver1 incursfailure con ditioned on the control variable ub =u.


Note that because the set of active ASes and pre.xes has changed over the 9 year timespan, the sampling procedure was done independently for each year.

the sets of pre.xes and ASes considered vary from year to year, in order to capture the maximum amount of routing changes, and hence results in the remaining of this work were computed independently for each sample.


Therefore, within testbed goals is the control and interworking of these IP-based functionalities like QoS-aware mobility with CRRM.

specific objectives to be covered by the testbed framework are categorized under the following general points: Implementation and emulation of specific protocols, functional entities and algorithms that can serve as a proof of concepts for other studies but that can also provide an additional validation of such concepts under a more realistic scenario with the typical wireless constrains.


At the beginning, these protocols have been used essentially for emergency applications, but nowadays ad hoc networks .nd new applications in the realm of ubiquitous computing.

in order to promote the use of these protocols, we need to be con.dent in the underlined protocol.


In particular, an administrator could partitiontheEIDs belongingtothedifferent subnetworksofanAD tooneof255possible paths (inpractice,weexpectthe numberof pathstobealot smaller)bysettingadifferentvalueoftheinterface .eld for each partition.

anyupstream network can chooseto zero the interface bits in its wide-area advertisements as a way to reduce theamountof global routingtablestate,in muchthesamewaythatit aggregatespre.xes today.most wide-area routerswillforward usingADlookupsasbefore,butthose nearthedestinationthatmight be obligated to payattention to the interface bits of an AD address.


Studies have shown that in many cases the set of candidate neighbors (e.g., recently heard nodes) is much larger than the set of useful neighbors (e.g., neighbors which can provide a reasonable reliable link) and too large to retain in the memory of most microcontrollers [53, 57].


We point out that for a given network with given antenna gain patterns, this de.nition can be directly generalized by using the attenuation as the link metric, as opposed to the Euclidean distance used in the Boolean model.

for any given network, this threshold attenuation range for k-connectivity can be determined using the algorithms presented in [6].


The major challenge associated with the use of honeypots is that, in general, each IP source is not observed at each of the honeypots.

rather than obtaining a complete M-dimensional hop count vector for each IP source, typically only a subset of the honeypots observe each source (see Equation 1, 2).


The trust level is minimal since clients establish a direct chain of trust with the content provider.

the DNS infrastructure is used as a simple mapping service and the possible attacks that can be performed is related to the denial of service to the clients.


4.3 Modeling False Positives Tags are most useful as evidence after a search warrant has been executed.


Although the Linux systems do not respond to unacceptable ACKs, they respond to unacceptable SNs.


On the opposite, DBA-MAC (FMF+CBF) attempts to limit the retransmissions to BM vehicles only, which are also chosen in order to maximize the distance covered at each hop.

the load produced by the forwarding process is quite low, while the performance of the safety-alert applications in terms of DD and DR indices are guaranteed.


Equa-tion (1) implies that on average there axe at most 0.444n white leaves.

the expected reactivate overhead is at most 1.8n.


Using a .xed grid size might not accurately capture the heterogeneous spectrum condition of areas with large variances (needing to use a smaller grid size), or might waste time to measure the spectrum condition of open areas with small variances (needing to use a larger size).

the complete monitoring adaptively determines the grid size based on the degree of heterogeneity in spectrum characteristics in a given measurement area.


In this paper, we present MAETT (Mobile Agent Electronic Triage Tag) [13][9][21] and Haggle-ETT [14], that allow the triage data to be collected and represented in an electronic format and to be transmitted, to a coordination point where they will be processed and made available for the managers of the disaster recovery, even if no network infrastructures are present.

these applications provide a collection of additional information for a better coordination and a faster response.


K sj pj dj .Ci MCAED = ( ) (2) 2 × Bi i=1 As we mentioned before, both the channel allocation and the intra-channel broadcast program a.ect the .nal performance.

the optimal allocation method has to consider di.erent factors in both processes.


In particular, the gap between the JIT approach (optimal in terms of state, though with potentially unacceptable interruption time) and the static approach, which does not suffer from service interruption, however maximizes state cost.

when a session relay approach is not an option due to stringent delivery delays required by the application, the application-aware solution constitutes a good tradeoff between the two extremes.


By comparing our algorithms results with the VPN routing con.guration, we found that most (97.2%) PEs that are connected to those default-route-advertising sites are anyway chosen as hubs because those sites usually have higher span values or generate/receive large amount of traf.c volume.

the penalty due to those exceptional cases are very low.


The destination-centered DAG is reconstructed as described in Section 4, with the new value of the radius.

expanding the radius from rto sfor s> ris straightforward and imposes no extra routing overhead on SHARP proactive protocol.


The HyCast client on the traveler s device will group up with the subscribers of similar podcasts and exchange new or missing episodes.

the traveler will be able to receive podcasts on the way without having to use an Internet connection.


This is achieved using a feature which allows SIP proxies to be con.gured to route SIP requests based on domain names of the SIP URL (the CS in this case), when the exact URL is not registered.

even when the conference URL is not registered with the proxy, a message of the form sip:conf-id@conf-server is routed to the CS.


Since the forwarding cache has small .xed-sized entries, we believe the cache can eventually sit directly on the router using high-speed memory.

the forwarding cache allows quick highspeed forwarding of packets.


In addition, the spoo.ng process and the continuous changing of the MAC address may impose high energy consumption on the malicious device, which may equal to or even exceed the energy spent in the legitimate cooperative process.

a malicious device may bebetter o. cooperatingwith other devices.


The function SHIFT shifts the list of packets by one position to the right.

the oldest packet is deleted and the subsequent packets are played with reduced delay.


Due to mobility, a node is not always aware of all its neighbors, and it is di.cult to guarantee that (IPaddress, key) database is updated at all neighbors at all times.

for DSR we recommend that source routes learned by promiscuous listening of routing-related packets be utilized, but the routes learned by promiscuous listening of data packets should not be used, unless it can be veri.ed that the overhearing host is aware of the (IPaddress, key) database at the transmitting node.


In Coolstreaming, each node periodically advertises data availability information to a set of nodes called partners1, retrieves locally unavailable data from them and supplies available data to them.

data arrival drives the dissemination of availability information, then the information triggers the request for data and finally data is delivered.


Based on Corollary 1, any price equilibrium sustains when ais and µIs scale at the same rate.

we normalize the APs aggregate maximum traf.c intensity ato be 1.


Furthermore, such a simulated proof is computationally indistinguishable from the real proof generated by Alice and Bob together.

the proposed protocol is also abuse-free.


Notice that, Penrose [22] had showed that when the domain is a unit-area square, the probability that a random geometry graph G(V,rn) is k-connected and has minimum vertex degree k goes to 1 as n goes to in.nity.

we can conjecture that the transmission radius rn such that the graph G(V, rn) is k-connected with high probability satis.es npr2 .ln n +(2k -3) ln ln n - n 2ln(k -1)!


0 transition in the pre-transcoded input stream leads to a pair of consecutive0sinthepost-transcoded stream.

all the reverse transcoder needs to do is identify a 00 or 11 and place the alignment boundary between the two.


Irrelevant BGP withdrawal updates will be ignored by the receiving BGP routers.

from the viewpoint of security, it is su.cient to monitor BGP route announcements.


Versions of such techniques customized to operate in indoor settings can provide an alternative solution for extending wireless coverage.

obviating the need for repeater altogether.


The data publisher should not only be able to understand the vulnerability or utility of a network object, but should also be able to use the analysis results to apply di.erent sanitization techniques to better satisfy the privacy and utility requirements of the sanitized trace.

we need to provide guidance about which .elds contribute more to the adversary s privacy attack or to the loss of utility than other .elds.


Therefore, our main objective in this paper is to propose a solution that allows for adapting new calls in a way that decreases NCBP while at the same time preserving the priority of handoff calls which translates into minimum HCDP.

the idea is to find a way to describe the state of the cell at any given time so that allows the system to decide whether it should adapt for the new calls or not.


Therefore, upon sensing one stream, it should be the one indicated in the overheard RTS/CTS frame.

one stream remains available and the node regards the channel as free.


Before verifying initial side alleged IP address, the response side keeps the non-state status.

iKEv2 has overcome the security shortage of IKEv1 and has the ability to protect against the DoS.


However, by cheating MORE to use 0.1 as the loss probability on link (R,D), node Rcan reduce its expected number of transmissions to 0.78, a reduction of expected workload by 34%.

r has incentive to cheat, but this cheating may lead to reduced throughput for the session from S to D. 2.3 Solution Concepts To study the incentive compatibility of opportunistic routing, we use a strategic game model.


The rationale behind LRU and LFU is that most of popular objects are consumed many times once they are used, and their popularity generally follows Zipf distribution, which re.ects the power-law effect [4], That is, a relatively small number of popular objects are requested by a large number of users, which account for the majority of the Internet traf.c.

our conjecture is that, if the in-network caching can detect and cache popular objects more timely (i.e.


it does not capture the impact of packet losses and collisions on the latency perceived by periodic applications.

we introduce a novel latency metric that re.ects the critical role played by successive packet collisions in degrading the performance of periodic safety applications as follows: Packet inter-reception time (IRT) at the HV for packets sent by a given transmitter: de.ned as the time elapsed between two successive successful reception events at the HV of packets broadcast by a speci.c transmitter (i.e.


For the fair analysis, we assume that for all the protocols, the MNs are allowed to access a service provider s network after the AAA procedure is completed.

we do not consider the AAA access delay.


Since the amount of aggregated traffic decreases as the hop distance from an DAP to the relay node increases, the traffic load switched to a new serving DAP becomes smaller if the relay node that is farther away from the congested DAP changes the serving DAP.

it takes more time to distribute the load of the congested DAP to the other DAPs.


Because no single cell can cover cluster c4, we then check its two children, c1 and c3.In this case, both two clusters each can be covered by a macro-cell.


Although we have seen attack clouds of that magnitude (or larger), the ones used in actual attacks seem to be much smaller in practice.

an overlay-protected system should be able to withstand the majority of DDoS attacks.


Ballon s study identified six different business models that incorporate different municipal inputs ranging from just site rental to full financing, ownership and operation of a network.

the municipalities obtain varying return of investment in terms of control and services ranging for example from just limited amount of free usage by city employees to full control and completely free access to general public.


3.1 Premise for Identity Federation in SIP For every transaction that a SIP UA/network entity initiates and/or propagates, it must be appropriately authenticated and authorized before the transaction can be allowed to complete successfully and any relevant services are provided.

by virtue of being successfully allowed to complete a SIP transaction, a SIP UA has infact proved it s right to a certain set of permissions and/or attributes (post-authentication), which were required for completing that particular SIP transaction.


Figure 7 shows that the durations of the majority of the links are also within this range, regardless of the mobility model and the node speed.

the di.erence in Linq can have a signi.cant impact on the connection probability when k is 1.


To maintain the connectivity among routers, some routing information should be exchanged among routers, such as hops.

fA can obtain the hops to the MHA in actual scenario and operate according to this information as shown in Fig.1, where D(FA, MHA) is the distance between FA and MHA.


A timeout event is thrown, if the time span for the last packet sent exceeds a prede.ned threshold value which depends on the network subsystem that is associated with the TH.

for instance, we set the threshold for GPRS ten times higher than for WLAN.


As a comparison, our robust path-based TE/FRR performs well under all single-link failure scenarios, being close to optimal for both days.

with an effective TE/FRR algorithm such as the robust 120 140 160 180 200 220 240 Interval (b) Friday, September 3, 2004.