This would decrease the average number of hops a message has to pass through before being received and processed by a sink, as data will always be sent to the closest sink.

using multiple sinks is not enough by itself; the energy consumption depends largely on exactly where we deploy these sinks.


We can see that OSDRP fails substantially to deliver packets due to the large instability of links and nodes.

as the idle period of the primaries increases and the network operational environment is closer to a semi-dynamic environment, OS-DRP and LCBR throughput increases.


QT is also called a memoryless protocol because tags need not have additional memory except ID for identification.

the identification delay is affected by the distribution of tag IDs.


To address the latter problem, NAT (Network Address Translation) has been deployed for several years at the university.

nAT is a partial solution since it does not offer true end-to-end connections and, some Internet services that need to initiate connections from the outside do not work.


PKTPAIR and RTT still perform poorly and do not transfer most of the bytes.

with central placement in Figure 20, while the .rst three metrics perform similarly to Figure 16, PKTPAIR and RTT improve both the median and 95th percentile.


They make hop by hop path comparison more dif.cult.


In VL2, we also use bouncing switch to do the routing.

there are d0 paths between a server and a bouncing switch.


For example, cellular networks allow a seamless roaming and also WLANs support the roaming between different access points at link layer.

in case the roaming occurs between different communication technologies like from a WLAN connection to a cellular connection, this can usually not been solved in a transparent way at link layer and has to be handled at IP layer.


Note that the M/G/1/LASTOTAL queue is also in overload.

under LASTOTAL performance degradesgracefullywhentheloadisabove1: theseare .rstthe largest .ows that have an in.nite response time while the smallest .ows still have a .nite response time3 .


= 1 2 as suggested in [13] reduces the number of redundant transmissions and resolves the short-listen problem.

one could also consider using lower values of .. For example, one could consider setting .


This is because without bit grouping, byte level AC state machines need to have more than 256 next states, which increases exponentially as B increases.

with bit-grouping, the next states are reduced dramatically.


The paired state is similar to low power modes of IEEE 802.11 and Bluetooth.

it should be noted that the keep-alive messages EnHANTs exchange are short pulse bursts, rather than beacons that include tens of bytes.


Integrating DTN and MANET Routing J ¨org Ott Helsinki University of Technology Networking Laboratory  jo@netlab.tkk.. ABSTRACT Mobile Ad-hoc Network (MANET) routing protocols aim at establishing end-to-end paths between communicating nodes and thus support end-to-end semantics of existing transports and applications.

dTN-based communication schemes imply asynchronous communication (and thus often require new applications) but achieve better reachability, particularly in sparsely populated environments.


In case a continuous number of corruptions, the codec will decide to take a rest by dropping some portion of incoming packs.

the number of dropping packets must be decided by some criteria.


Node k- 1was not able to overhear node k s transmission or receive an explicit ACK from k.  In case 1, k- 1needs to retransmit immediately.

in case 2, k- 1needs to time its retransmission so that the retransmitted packet does not collide with the overhearing of data packet transmitted by k+1at k. The knowledge of next two forwarding hops, i.e., kand k+1, can be used to accurately time the k,k+1 D retransmission at k- 1to avoid collision at k.If 2Tp - Tt < k-1,k k+1,k D 2Tp <2Tp +Tt ,then k- 1 s retransmission will collide with the overhearing of the packet transmitted by k+1at k. Thus, collision can be avoided if k- 1delays its retransmission by k,k+1 k-1,k D 2(Tp - Tp )+Tt to reach node kexactly after it .nishes its overhearing from k+1.


CONTROL ACTIONS 2.1 Spreading Gain Control The backlogged traffic generated by a packet session (n, s), s 2 is transmitted at rate C =FW where F is the ns ns chip rate of the system and W is the spreading gain.

ns due to interference, only a fraction of transmitted packets is accepted at the base station as received correctly, i.e.


For example, iOS devices, and to a lesser extent Mac OS X devices, generate a large proportion of init-reboot requests.

android and BlackBerry devices generate mainly select requests, meaning once they acquire a new address, they rarely contact the DHCP server again.


In 89% of the cases, the consumer retrieves Data within one second.

it can take up to 40 seconds to .nd a working path in some rare cases.


With the assumption that the initial bits are set to 0, Claim 9 from [1] demonstrates that for 0 <u =d: .. XWj u pu(Wj)= , (2) 4 Thus, if the victim could determine a su.ciently good estimate on pu(Wj), for any u,0 <u =d,it would have enough information to determine the string Wj.

the adversary is able to hide the pu(Wj)s by choosing what fraction of the packets are sent on each of the di.erent paths.


As a result, to image objects at different positions along the same direction, these systems have to use ultra-wide band transmissions.

in Wision, the transmitter and the receiver are at different positions.


To fully ensure such isolation, one must enforce the access restrictions (and QoS guarantees) on all hops of an end-to-end path.

in virtualized servers, the real end-points are the VMs, and hence the end-to-end path extends through the server, involving the I/O subsystem as the last-hop.


Theoretically, we can obtain one RSSI measurement every 16µs.

given TelosB hardware limitations, we can only obtain a new RSSI reading every 113µs.


The choice of the bins to .lter is driven by the adaptive sensing module.

the receiver may not be able to use a .lter per narrowband group since .lters are resource-intensive in hardware.


The k-th packet's virtual finish time, fl k (t), in flow i is computed by ski(t) = max(V(t),fik-l(t)) (2) L (3) fik(t) = ski(t) + ¢'-~ where si k (t) is the virtual start time of packet k in flow i at time t, L is the packet length, V(t) is the virtual system time and ¢i is the weight of flow i at time t. The important property of the WFQ scheduler is that WFQ in itself cannot fall behind GPS with respect to service given to a flow by one maximum packet size.

in [1], it is shown that WFQ can be far ahead of GPS more than one maximum packet size.


Clearly, WARP bene.ts by considering the narrower case of a mobile node moving through a static mesh.

in our experience, existing protocols [11] fail entirely in these static mesh ex periments with even a limited mobility of the sink.


Someone may argue that we can easily modify the PCS procedure to enable a node that senses one stream to transmit since there is still one more stream available.

if node G regards the channel as free when it senses a stream from E, and then transmits to H, a collision will result at node D. Therefore, simply modifying the PCS procedure will not work.


This approach can easily account for home network traf.c and enable detailed performance evaluations.

while there are no fundamental technical limitations to this approach, coverage is limited by the cost to deploy infrastructure in today s large and rapidly evolving network environments.


Indeed, in the case of a left-turn (or in other examples such as a stop sign), the vehicle usually becomes stationary before the driver is allowed to turn, and it is in this stationary state that the vehicle would need the most to announce its presence to the other drivers.

using frequency adaptive techniques such as those presented above would result in extremely reduced communication opportunities in situations where stationarity is not induced by tra.c conditions but by drivers intentions.


This means tsd =1 for DOT and tsn = 8 for Optimized Slotted 1-Persistence and Slotted 1-Persistence.

while .nding the optimal value for tsn in Optimized Slotted 1-Persistence and Slotted 1-Persistence depends on accurately knowing the current network density, DOT with tsd =1 scales independently from other factors.


Most of the papers targeting wireless sensor networks assume monitored regions of regular shapes.


However, they focus on NIC design rather than the host CPU communication stack.

our work do not rely on NIC support and we examine communicationratesupto100 Gbits/s.


The random offset selection may then lead to the reception of synchronization messages in a way that may be out of order, which causes a problem particularly in the case of simple synchronization models.

this problem can be solved using the RFA.


Therefore, it can guarantee communication efficiency.

these protocols cannot be implemented on current offthe-shelf sensor modules because they have a single-radio transceiver.


In Figure 6, packets in the lower circle are duplicated because the MN already received on left part.

packets the upper circle are new valid packets for the MN although they are out-of-ordered because they are arrived after first packet received through a new path.


We trade off less .exibility in the program layouts that can be slightly different on different sensor nodes.

different program layouts can be easily avoided by programming the same binary code in the in-systemprogramming process.


GIA [6] attempts to make Gnutella (a .ooding-based unstructured lookup method) scalable.

gIA achieves this by depending upon the heterogeneity, in particular by leveraging nodes with higher storage and connectivity capabilities.


Total goodput is increased as compared to the omnidirectional case because (i) TAP and TAP are no longer starved and now contribute to goodput, (ii) there is a second air interface, and (iii) there are reduced collisions.

notice that the total goodput achieved by the system is 67% of that of the reference model for CSMA (and slightly less for CSMA/CA) and signi.cantly less than twice that achieved with a single omnidirectional antenna.


The vehicles inside the advertisement zone that receive the request message and are not closer to the gateway than the sending vehicle, ignore the message.

for fault tolerance purposes, vehicles inside the advertisement zone that receive the request message and are not supposed to forward it, but they do not hear the message forwarded by a neighboring vehicle closer to the gateway, force the forwarding of the request message.


If they failed to relay the packet, the lower-priority candidates would instantaneously relay the correctly received packet without needing to wait.

if the candidate coordination delay is very large comparing to the sender delay, then it is preferable to retransmit the packet in stead of waiting for other forwarding candidates to relay the packet.


Accurate clock synchronization can be achieved if nodes are synchronized to an external global clock using GPS devices [17].

gPS devices only work in outdoor settings with a clear sky view.


This is because it takes some time for the two policies to build up their discounts.

the modi.ed-knapsack policy has worse utility than the  (a) Utility (b) Penalty Figure 1: Delay-Constrained Networks two proposed policies because it only concerns itself with satisfying the minimum service requirements of clients and does not consider utilities.


If the web page is loaded without any frame, then the defined style object is removed from the page and the original display is restored (i.e., if part of the code).

this prevention technique can be easily thwarted based on reflective XSS filtering, clobbering of object, restricting JavaScript zone, event handler overriding, and multiple iframe usage.


Thus, the load at the max AP tends to increase again, until saturation is reached again, and so on.

the observed load at the avg AP is more stable, and shows a slightly increasing trend.


Another observation is that heterogeneity in terms of both intracommunity weight as well as inter-community (cut) weight can indeed be reproduced by the synthetic models.

we want to stress that careful tuning of synthetic models is needed, when used to evaluate protocols based on social network structure [13, 15, 16, 34], to ensure that realistic community and inter-community structure is reproduced.


Services such as BGP monitors, looking glasses, and traceroute servers provide public views of the Internet.

only a sample of ASes operate these as a public service, therefore it is hard to get direct data from the world viewpoint.


[2] establishes bounds on the optimal throughput of interference-limited wireless multi-hop networks given the existence of an omniscient and omnipotent central entity.

developing interference-aware routing protocols was left as an open problem.


To the best of our knowledge, the only prior work that deals with scaling laws in wireless networks with multicast .ows is [14].

they use a Steiner tree approach to construct a multicast tree, and their results only apply to a single multicast .ow in a large network.


Comparing with fingerprint based location service in those previous work, we argue that our work only share the same principle that different location has somehow different signal IDs and strengths.

we follow fundamental different idea since we don t care the exact geographical location but the relative distance between the locations from the changes of signals.


E.cient delay estimators can further improve the level of di.erentiation.

considering only traditional performance metrics as evaluation criteria may lead to false conclusions since an algorithm that behaves well in simulations may not lead to desired results in real world.


+ |X| Security is when q2l2 « |X| With AES-128: |X| = 2128 , ql < 248 Nonces are generally generated using larger length random number generation (RNG) to minimize collision attack.

in practice, true RNG is difficult to find [12].


The .... sufficient to suppress GPS activations if r approaches20m show that collaboration actuallyincreases the =.

results for 5m.when=2.... energy consumption when m, the consumption is only31% of 56 J/hconsumed5=7....=.


Secure sockets use public-key operations to authenticate peers and private key operations to establish private, end-to-end unicast connections.

the use of end-to-end unicast communications is not compatible with the broadcast-based dissemination algorithms used in Deluge and other network programming systems.


These paths are ordered in a three-dimensional matrix F: for every SGW k and every WGW i,F contains an ordered vector F[k][i]withupto M di.erent elements that represent a route in the mesh between WGW i and SGW k.  Interference matrix I: Based on Section 3.2 and the pre-assigned channels of the NICs we can calculate the interference level for every communication link in the WMN.

interference cannot be expressed per communication link because it can only be expressed per receiver.


Intuitively, it would be beneficial to set u to a large value for finer-grain resolution of priorities among the nodes with different RC values and, thus, for a better approximation to the greedy oracle scheme.

large values of u have the disadvantage of increasing the delay, since the TS grows longer (quadratic in u, from Proposition 1) and large number of initial time-slots go by empty, as no nodes are then admissible  5.2 Changing Network Topology For all of the mobility experiments presented here, each data point was obtained after a simulation warm-up time of 1000 [s] in which the mobility model could converge to a stationary node distribution.


were demanding reliable data transfer and sharing resources based on best-effort principle was satisfying their demands.

new applications came out with different requirements from which Internet was originally designed.


the optimization metric calculated by fp.


This can result in disastrous consequences on the overall performance of the network.

with controlling the client-gateway registration, the load balancing can be improved dramatically, leading to a reduction in latency and transmission errors.


The IEEE 802.11 DCF MAC protocol does not offer any specific support for multi-hop communication, because a node contends for the channel before each transmission attempt.

multi-hop flat topology protocols work by considering that a packet has to be relayed over many intermediate nodes to reach its destination.


For knowing the abstract behavior and evaluating the algorithms of these technologies, software simulators are a good method.

we should evaluate them including bugs and behavior that is not described in speci.cations, by using real implementations on a realistic testbed, before introducing the new technologies to the Internet.


To repeatedly attack the same destination without being caught, Hs must either wait for its .lter to expire, which means it has stopped the attack, or exhaust the router s .lters to make its .lter (Hs,Hd) replaced.

it can at most trigger Nf StopIt requests in a period Ti to exhaust router .lters.


The majority of these approaches assume time-driven scenarios and/or single-hop communication between participating nodes.

there are several real-life applications for which an event-based and multi-hop operation is more appropriate.


If the APs can identify the good relays among the mobile clients that pass by them in time, the network performance should surely be improved.

to realize such a vision, the infrastructure needs a means to know the movements of mobile clients.


We note that LTC performs as well as AE for large error bounds, but is unable to keep up when the error bound is small.

the truncated LZW does well for small error  (a) Spatial compression: Compression ra-(b) Spatial compression: Compression ra-(c) Temporal compression: Error bound tio vs. relative error Erel .


This leads to a high probability to reach this neighbor at the .rst attempt.

plain PBR is with growing beaconing intervals very likely to select a neighbor already out-of-range.


When de-aggregation is not required (99.97% of the failures), a link failure in DRAGON produces, at worst, a network-wide effect for the pre.x at the root of the pre.x-tree and only a local effect for each of the other pre.xes.

in BGP, all pre.xes in the pre.x-tree are prone to network-wide effects.


Themodelsmentioned aboveareforsinglehop networks and cannot be applied directly to a multihop ad hoc network.

practically, a network may not always be saturated, andinanadhocnetwork, therecanbemultiple hops between a given source and a destination, therefore, there is a need to analyze how IEEE 802.11 DCF performs in case of an ad hoc network under nonsaturation conditions.


We call nodes with access to such constraints landmark nodes.

relative constraints limit the distance between a node and another node or event whose position itself is undetermined.


The nodes in close proximity of 1-hop distance generally exhibit persistently high correlations in sample values.

the correlations between the 1-hop clusters are generally nonpersistent and dynamic when observed over a long time window.


In [17], the authors proposed a new OFDMA-based multichannel CSMA/CA protocol, which enables the nodes to contend with each other for channel access both in time and frequencydomains through a two-dimensional backoffscheme.

it segments the channel bandwidth into multiple narrow-band random access channels and adjusts the transmission probability according to the multichannelactivityina.exible manner.theseworks neither consider the effects of the signi.cant guard time in long-delay underwater networks nor explore the FDM/OFDM scheme, which is quite practical and ef.cient in the wide-band underwater acoustic communications.


For example, a collaborator might learn which URLs or .les have been accessed by the initiator.

despite the IOUs signed by it, the initiator can still e.ectively remain anonymous and di.cult to track, as discussed in Section 5.4.


It can be directly retrieved from the data.

the time associated with when a customer experiences an incident is often hard to determine -if it is available, it will be embedded within a Twitter message or in a ticket s description.


If the MDP were always better than the MCKP, we would see a step function at 0.

we observe that the MCKP sometimes outperforms the MDP algorithm.


4.2 Limiting Heavy Usage Tra.c shaping is sometimes viewed as a poor solution to managing network resources.

we have found situations in which tra.c shaping would provide many bene.ts.


However, this would be an inaccurate conclusion as routers R2,R4,R5 and R8 are sharing a multi-access link and P1 and P3 are not really link disjoint.

a tracenet collected topology info as shown in Figure 2.c would include the subnet information hence, would help to avoid the incorrect conclusion above.


In the presence of accurate information about customer tra.c pro.le and available network resources, a provider can make accurate provisioning decisions while ensuring Service Level Agreements (SLAs) are met.

in reality it is hard to specify customer tra.c statistics accurately a priori.


Unfortunately, imposing an RDN does not provide A the ability to prevent B from processing packets broadcast by A.

by imposing a PLN which excludes B, A can ensure that B does not gain access to (and thus, cannot process) packets sent by A.


According to the data type, USB data transmission protocol can allocate different bandwidth and priority, and transmit them according to the allocation.

as conventional USB utilizes wired medium, these data are almost always guaranteed of the bandwidth, and even transmitted without contention.


This problem has historically been bounded by physical limits on data center size, as well as practical considerations in the physical placement of server resources.

the increasing popularity of server virtualization technology (e.g.


Note that the VMs and the controller application cannot, for example, determine the precise location of every packet in the network.

there are some differences the tenant may detect during a migration: (a) latency or throughput of data traf.c may change, (b) packets may be lost or delivered out of order, and (c) control messages between the controller and the switches may experience variable delays.


2.4 Congestion Control Mechanisms The service models described in the last sections represent the major efforts of the IETF for improving the Internet services; they main objective was to offer a better service to emerging real-time and multimedia applications.

the vast majority of Internet traffic is best effort [7].


In all cases the expressions are challenging to interpret.

it is quite easy to obtain scaling laws for non-cooperative multi-hop systems (see Section 3.3) and to show that the probability of error degrades steadily with the number of hops and, thus, with the distance covered by the message.


In HMIPv6, it introduces a new mobile entity called the mobility anchor point (MAP) and aims to reduce the amount of signaling and registrations between the MN and Home Agent (HA), so that the signaling costs is shortened.

hMIPv6 still suffers packet loss and handover latency problems.


Only uncompressed voice connections with Pulse Code Modulation (PCM) are supported, and 64Kbps bandwidth is assigned to each voice connection.

with the use of speech coding techniques that produce compressed voice and/or detect silent periods, it is expected that high quality voice data can be transmitted at or below 4Kbps, and that the Bluetooth speci.cation will support voice transmission at two or more distinct rates.


We thus have d .2.3/2 (u(t)-v(t))=· dtu(t)+v(t) Integrating, this yields .2.3 t dt u(t)+v(t)= u(t)-v(t)= u(t0)-v(t0)+ · 2 t0 u(t)+v(t) (43) Provided u(t0) = v(t0), this implies that u(t)+ v(t) is at v least of order t. Since we also have that u(t)= v(t)+u(t0)-v(t0), v necessarily u(t)must also be at least of order t. However, we can always choose t0 such that u(t0)- v(t0) = 0, for otherwise, it would follow from (41) that u(t) is bounded, and in turn from the previous display that v(t)is bounded.


When two or more events are not co-related, each incoming event can be treated independently.

when events are co-related, a mechanism for capturing and interpreting these events, jointly, is necessary.


The goal of the tail in Phases 3 and 4 is to enable the radio to quickly resume packet exchange, without the time and energy cost of waking up.

if it is too long, power is unnecessarily wasted when no transmissions occur.


Moreover, the independence assumption always leads to a pessimistic prediction, which is a desirable property in the context of network design and management.

in thepresenceofalargeamountofcross tra.conthe paths of the .ows, one may think that intermingling of packets belonging to di.erent .ows, with the consequent separation of packets belonging to the same batch, would mitigate the strong correlations that we have found in the tra.c produced by the TCP sources.the ack compression phenomenon [22] is expected to exacerbate the burstiness of packet transmissions.Finally, heterogenous link capacities should be taken into account.Whatever happens, it is intuitive to understand that a queue model with instantaneous batch arrivals will always produce a conservative analysis, provided that there are enough active .ows to assume uncorrelated batch sizes.


These solutions regard the sensing coverage to a certain geographic area as binary, either it provides coverage or not.

we argue that, in most scenarios such as battlefields, there are certain geographic sections such as the general command center that are much more security-sensitive than others.


In [15], the indistinguishability is de.ned on the view of the honest parties (on their input, states, and output) in the ideal-world and in the real-world models.

an adversary can distort the states of the honest parties in unavoidable ways, and hence, the classical de.nition would be too strong and no routing protocol would satisfy it.


Sensitive Modulation and Coding Schemes (MCSs), Multiple Input/Multiple Output (MIMO) and other new Physical Layer (PHY) technologies provide high data rates.

upcoming wireless technology does not increase coverage.


Related Work The routing protocols used in the current generation of mobile ad hoc networks, such AODV and DSR, are based on the principle that all nodes will cooperate with routing and forwarding packets.

if a certain node in the network might become a misbehavior node such as a selfish node to save its power, network throughput will be dramatically decreased.


In a nonhierarchical or flat network, the network topology database in all nodes is synchronized to provide for efficient and optimized routing.


The results presented in this paper are derived assuming channel model 1.

all the derivations are applicable for channel model 2 as well, and the results for model 2 can be obtained by replacing W in the results of model 1 by Wc [14].


In an attempt to be loss-free, Split/Merge halts, and buffers at the controller, all traf.c arriving at sw while migrating per-.ow state [34].

when traf.c is halted, packets may already be in-transit to srcInst, or sitting in NIC or operating system queues at srcInst.


By analyzing delivery ratio, we observe that all algorithms deliver more packets to the destinations when the TTL increases.

as the TTL becomes high the increment in the delivery ratio is marginal, since the capacity of the network to forward packets becomes the performance bottleneck.


As NU increases, the hybrid protocol operates more like the unscheduled access 20 18 16 14 12  Efficiency (bits/J) Energy (J) 10 8 6 2 4 2 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Reception Probability, PR Transmission Probability, PT Figure 2: Protocol Energy Figure 4: Random Protocol E.ciency independent of its operating state, the optimal PT equals T 1 .

this is not the case in underwater networks.


In case of a failure, the InP will send back a FAILURE message (optionally with reasons for the failure).

sometimes it might know of other InPs that it believes will be able to embed part or whole of the VN request.


Some Gnutella applications solve this bootstrapping problem with a cache of well-known, reliable peers, and this list is kept fresh with new peers the application comes across in general usage.

we .nd it convenient to study the worst case of a network with a single published gateway.


G. Bonchev 1113 Sofia, Bulgaria +359 / 2 8732614 alekova@ifi.uio.no rudimentary amount of existing infrastructure, mobile ad-hoc networks are used for communication.

these networks might be sparse, e.g., low node density and high node mobility.


Note that this holds for any property Q.

the fact that the expected number of subgraphs with property Q is at least as large in G.,f as in its independent core does not necessarily mean that the same holds for the probability of having a subgraph with property Q.


4We cannot exclude the possibility that one or more of the other scenarios cause an occasional burst.

we focus here on the mechanisms that produce the overwhelming majority of bursts.


On average, the available bandwidth changes by a factor at most µ per round.

there can be times of only small changes, but consequently, the bandwidth can change by factors larger than µ in later rounds.


Finally, CHIPS was set to turn off its cut-in scheduling feature when the ratio between the number of tagged flows and the other flows are greater than 50%.

under our simulation, CHIPS was always on since the ratio was always under 50%.


This is also called a macro view of the trace, since it is concerned with tendencies and average values, e.g., the average speed of cars in a road.

considering details makes performance evaluation more complex as it gets closer to individual behavior.


LIA follows an ad-hoc design based on the three predetermined performance goals given in [34].

our scheme, eXplicit MultiPath (XMP) congestion control, is developed using the network utility maximization model [21, 22].


This solution is optimal in terms of node processing and therefore battery savings, since only the dormant node that is paged processes the paging request.

as stated in [9], it suffers from scalability problems under high load conditions, when a large number of dormant MNs are paged.


One approach is to transmit them immediately using 802.11 broadcast.

since 802.11 broadcast uses no control packets such as RTS/CTS/ACK and transmits each packet only once, the CONTROL packets will likely be lost due to collisions with other CONTROL or data packets.


We observe that the distribution of packet delays is similar compared to those for failover events, i.e., recovery events have impact on packet round-trip delays.

from Figure 11 (c) and (d), the average reordering offset or the degree of reordering is smaller for recovery, about 2 compared to 6 for failover.


When QPSK data modulation is used, the joint iterative Tx/Rx FDE & FDIC can reduce the required Eb/N0 for achieving BER=10-3 by about 1.0dB and 0.8dB compared to the conventional iterative receive FDE & , modulation is used, the joint iterative Tx/Rx FDE & FDIC can (24) reduce the required Eb/N0 by about 0.5dB and 1.0dB for R=1/2 where the second term represents subtraction of the residual ISI and R=3/4, respectively.

in the uncoded case, the BER replica as in the receiver given by Eq.


The dominance of server-side failures at the level of TCP connections might seem surprising, given the presumption that large websites are better engineered and managed than client networks.

there are a couple of reasons why this is so.


By avoiding leaf-pushing Tree Bitmap ensures that an update needs to modify only one trie node achieving the O(1) bound.

because Tree Bitmap cannot use leaf-pushing, it almost doubles the size of each trie node (see Section 2.1).


Finally, our study demonstrates quantitatively that optimizing the lifetime-distance factor can lead to signi.cant performance gain, under low to moderate levels of imperfect schedule implementation.

scheduling inaccuracy in ad hoc networks can considerably degrade the performance of a scheduling scheme.


It is known that DTNs require only minimal (if any) investment in supporting infrastructure (e.g., infostations).

dTNs compromise network reliability and the quality of service by introducing unpredictable delays, because data is moved from one wireless relay to another in a store-carry-forward approach.


Using MIPv6, we can keep routability to MN s home link address and deliver a packet to MN wherever it is on the network.

the basic MIPv6 protocol works in network layer and does not concern access technologies.


In wireline PFQ algorithms, service share of unbacklogged flow i is distributed to other flows.

in wireless environments, an error-experiencing flow gives its service share to other flows for efficient link utilization and elimination of HOL (Head-Of-Line) blocking problem, even though it has packets to transmit.


In this case, Super-speed of USB 3.0 (5 Gbps) can be used instead.

as stated above, Super-speed of USB 3.0 cannot be toggled with USB 1.0 or USB 2.0 due to different connector/port usage.


Overview of MINT Protocol In general, routing protocol makes use of hop count to build routing table and take shortest hop as major metric for it.

short-hop routing is needed to be studied in depth when network constraints are concerned in wireless sensor networks.


This is mainly attributable to high tra.c levels in these benchmarks where the speculative techniques used by the baseline fail whereas EVCs, being non-speculative, show large gains.

.t, lu, radix, barnes and ocean represent low to medium tra.c with moderate hop-counts, leading to a latency reduction of 20.8%, 22.9%, 34.6%, 19.4% and 35.8%, respectively, using the dynamic EVC design.


nbr(n) as Vd(k,t) ideally at time t. increases as the hop countfrom n6increases.

mes-because nodes have toperiodically exchange sages .ow toward the lowerpotential node, and potentials suchasbyradio broadcast, thepotential that .nally reach the destination.


Furthermore, the recent developments in Embedded Computing and Wireless Sensor Networks [5, 6], along with the successful IP for Smart Object (IPSO) Alliance, clearly illustrate the need and bene.ts to be gained from making embedded devices part of the Internet.

these trends illustrate only connectivity at the TCP/IP level without actually considering what goes on top, at the application level, where a standard protocol is lacking.


The usage fluctuations of the available spectrum may lead to lack of communication for the CR user in a given time slot.

using the key enabling technologies of CRNs, the capability to share the spectrum in an opportunistic manner, the CR user may find an appropriate communication channel in the consequent time slots that may establish an end-to-end path between source and destination.


Several previous studies have explored the subject of crosslayer optimization of error coding rate, signal power etc.to maximize TCP throughput in CDMA networks.

none of them have considered TCP-aware rate adaptation and related RF layer optimization.


The only difference between Amazon and Open Telco is the fact that Open Telco does not sell any concrete items, but it provides context information such as location and profile.

the abstract data can lead to increased sales.


It is particularlyevinced that around half of the users use Web applications duringsuch special events, that another relevant part uses messaging applications, and that real time applications are limited to less than10% of the usage.

real time applications generate most of the traf.c against negligible part for chat and msg apps.Moreover, TCP-based applications largely overcome UDP ones inabsolute volumes (even if there is no apparent correlation betweenTCP and UDP applications and geographical location).


In wireless sensor networks, since the transmission power is associated with the physical distance between the source and the destination, it is reasonable to assume that the transmission cost associated with each link is identical to the transmission cost with its opposite direction.

constructing the minimum cost multicast tree is the well known for Steiner tree problem, which is proven to be the NP-completeness [1][8].


However, 800 Average Wireless Latencies as the workload increases, the latency of both the Email and the IM requests increase at the same rate when FIFO scheduling is used.

pro.le trades o. the email response time to maintain a low latency for IM requests.


INTRODUCTION The fast development of wireless networks and mobile communications is exhausting the limited radio spectrum resource.

currently, almost all spectrum is statically allocated to large service providers on a long term basis for large geographical regions, which is re.ected in the radio regulations published by the International Telecommunication Union (ITU) [11].


The tier-1 server in the cloud processes the request and sends back a reply, with the client s address as the destination and the server s address as the source.

the client is expecting a reply with a source IP address of the load balancer, not the server.


A possible lower bound would be the number of essential neighbors.

when essential neighbors do not cover all nodes, at least one additional neighbor must be inserted.


This common control layer enables a more plug and play style of internetworking that will enable sophisticated network features, and allow also dynamic business relationships between network providers.

the dynamic nature of the network introduces a number of new challenges for mobility support that are addressed by the project.


3.3 MitigatingUnfavorableListeningCosts Reliable broadcast has been extensively studied in the multihopgrid model[5 7,19,30],particularly with ajamming adversary[2,4,8].Reliablebroadcastispossiblewhen tByzantinenodes can each corrupt at most nc transmissions[8].

unfortunately, the protocol of[8], and theimprovementby[4], requires that correct nodespossess much more energy than theByzantine nodes.Inparticular,whilethesendingcostsareimprovedin[4],both[4,8]allow theadversarytoforceacorrectnodetolistenforO(t· nc)slots(listening costsin[2] are similar).eachByzantine nodeis activefor nc.


3.2.2 OS limitations Operating systems for mobile devices are user oriented and they are optimized to ease the production of applicationlevel software.

these OSes provide little support for the implementation of low-level custom mechanisms; this restriction became particularly evident during the implementation of traceroute-like tools as they require low-level networking primitives.


In TFRC, the sender adjusts its sending rate as a function of the measured rate loss, where a loss consists of one or more packets dropped within a single round-trip time.

tFRC is mainly proposed for wired networks especially for the Internet and when applied to the wireless networks, it suffers from performance degradation [16].


As such, DHT systems hold great promise for the rapid deployment of Internetscale applications and services.

because in most DHT systems a request will take .


These studies all focus on the avail- ability of a centralized service.

given the pervasive use of the Internet to access remote services, even 100% lo- cal availability will not necessarily deliver high availability *This research is supported in part by the National Science Foundation (EIA-99772879, ITR-0082912), IBM, Intel, and Microsoft.


In such a scenario, the nodes that are farther away from the base station will have their power sources drained much faster than those nodes that are closer to the base station.

utilizing a conventional multi-hop routing scheme such as the Minimum Transmission Energy (MTE) routing protocol will also result in an equally undesirable effect.


A limitation of the computational approach is that it requires sweeping the di.erent parameters of the model to completely characterize the dynamics.

our task is greatly simpli.ed by the fact that the dynamics of the normalized model is completely determinedbythetwoparameters ¯Weproceedby w, and g. de.ning stability of limit cycles.


Interestingly, when comparing the results, the samples we analyzed showed increased usage of all protocols.

the ranking and the proportion of the protocols remain similar.


The seller eventually receives all bids in clear and can hence apply any possible win function.

he can only link bids to pseudonyms, not to bidders.


A consistent theme in these new architectures is that a large number of network devices are used to achieve 1:1 oversubscription ratio.

at most time, data center traffic is far below the peak value.


With HM and SM being feasible actions, the Nash equilibrium of the arising noncooperative game produces either unfair or Pareto dominated distribution of bandwidth among the stations.

for a repeated version of the game, we have constructed a heuristic strategy, called MBIB, that ensures convergence to all-HM under all-MBIB.


Therefore, 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.

the AP is not yet convinced that the STA knows PMK and PTK.


Therefore, these APs can perform joint beamforming and send concurrent packets to different users.

jMB does not consider the scalability of the AP.


With this growing adoption of the technology and increasing dependence on WLANs by mission critical applications, users are beginning to demand reliability, performance, scalability and ubiquitous coverage from the wireless networks.

existing 802.11 deployments provide inadequate coverage and unpredictable performance.


Currently the HPN-SSH application will query the kernel once every round trip time.

in LAN transfers, with sub millisecond RTTs, these queries can impose additional overhead that may end up reducing overall performance.


4.3 De Bruijn From the diameter perspective, de Bruijn graphs o.er signi.cantly smaller end-to-end upper bounds on routing time.

the improvement by a factor of 4 over Chord for N =106 no longer holds when we examine the average shortest distances in each graph.


In this algorithm, landmarks flood their location to a whole network, and nodes estimate their location based on hop-counts and hop-distances.

it is not appropriate to apply these algorithms to mobile sensor nodes.


(2) DLP s route-update cost can be made O(1) by using Tree Bitmap [4], if memory man agement overhead is ignored.

tree Bitmap almost doubles the worst-case memory size due to its inability to use leaf-pushing, and requires over 100 memory accesses, in the worst case, for a route-update if memory management overhead is considered.


As expected, DSD increases for larger groups, due to the threshold maximum distance of 2R units for every pair of nodes.

dSD considerably decreases when the maximum pause time increases 3 .


Most of our simulations are conducted with zero channel losses (we report on one set of simulations with non-zero channel losses), although packet losses due to collisions do occur.

we adjusted the carrier sensing threshold to reduce interference range to equal transmission range in order to generate interesting topologies to study.


In the presence of non-determinism not accounted for in our symbolic formula, our approach is no longer sound.

it is likely that in many cases it would still work, as intuitively programs are constructed to behave in a deterministic manner based on their input, even when some non-determinism is present.


Both these earlier approaches achieve some .exibility in topology through the use of a limited number of single-hop optical links.

proteus can choose an arbitrary topology from a large class of graphs (connected k-regular order-N) and also vary the capacity of the edges.


This ensures the relevant state is always available regardless of which switches are assigned to an instance.

the volume of state maintained by applications can quickly overwhelm the memory resources of controller instances [9].


Examples include IPv6 stateless address autocon.guration protocol [29] and IETF Zeroconf protocol [30].

neither of them can solve the autocon.guration problem in new data centers where addresses contain locality and topology information.


Design and Implementation of a Framework for Persistent Identi.cation and Communication in Emerging Networks * Joud S. Khoury Henry Jerez Luca De Cicco jkhoury@ece.unm.edu hjerez@cnri.reston.va.us ldecicco@gmail.com ABSTRACT The Internet Protocol (IP) is currently used to provide internetworking among heterogeneous access networks.

the evolution of and the innovation within these networks is greatly hindered by the geographical and topological rigidness of the protocol implementation that hinders the support for .exible unstructured communication paradigms.


The decreases in the loss window size is slight congestion has occurred in the network, and the given by loss window size is decreased by approximately (1-()× cwnd = { dwnd (where 0 <( < 1).

when a packet cwnd (duplicateACKpackets) loss is detected by means of a timeout, it is concluded 2 (1) that serious congestion has occurred in the network, and 1.


The locations of the nodes were chosen such that the transmissions from the UHF and 2.4/5 GHz bands would reach the receivers (the UHF band transmitters can easily transmit further than 50 m).

even by reducing the receiver distance to what is shown in Fig.


From a BGP routing table, one can infer provider-customer relationship among different ASs [10], and a naive estimate of an AS s bandwidth distribution would be the number of its customer ASs.

this lump-sum measure does not distinguish between customer ASs of different sizes.


In the homogeneous best shot game, we do not observe individually rational protection contributions at all since agents cannot overcome the associated coordination problems.

they can achieve higher protection levels when agents have heterogeneous tastes.


Each RNC keeps track of the current cell a device is using as part of normal operation.

due to vendor limitations and resource constraints, this information is not recorded.


The power of this residual signal is S12 -S1.

its noise component is 2N since subtracting signals does not cancel noise; instead, noisecomponentsareadded[24].


Due to its architectural .exibility, MANETs can be operated as robust, inexpensive alternatives to current networks.

we cannot simply apply the existing protocols designed for IP subnets to MANETs because the link model of MANETs is quite di.erent from what the protocols assume to communication links.


What they have realized are synchronization andinteractionbetweendifferent simulationinstances at thegranularity ofdiscrete simulation event.

rTT (ms) RVIP is a pure networking solution which does not rely on the simulation events .red amongst different simulation instances.


This greedy algorithm clearly makes the best possible selection decision (without future knowledge).

maintaining a heap in hardware incurs high implementation complexity and a large amount of SRAM, which is about twice the size needed to store the SRAM counters.


6)Network coding with implicit acknowledgement: This scheme is similar to (5).

nodes eavesdrop on other transmissions if they are in range.


REFERENCES updates sent after session re-establishment should consist primarily of duplicate announcements.

with our three-month RIPE data set,Figure 15 shows that duplicate announcements are not produced only by table transfers.


Our classi.cation of the adversary attacks is inspired by the well known active attack categorization and the attacker model of [14].

the speci.c attacker strategies we designed and implemented for evaluation of our scheme are protocol-speci.c.


This means that the same transmission will be received at di.erent RSSI levels depending on the distance between the transmitter and receiver.

several factors a.ect a packet s RSSI value in real world environments, which makes accurately associating packets to their transmitting devices using physical layer information a very challenging task.


We assume users are obedient, and they do not change the protocol behavior by circumventing the software.

obedient users can choose not to join the overlay if the level of altruism is higher than they can tolerate.


This has the advantage that delegates can be monitored and misbehaving delegates can be immediately removed from the whitelist, creating an incentive for responsible delegate management.

vetting all delegates is a huge burden for a single authority and the role (and power) of a single organization in charge of such a critical function is likely to raise political concerns.


Such new metrics can, in principle, be used with any detector that learns their normal trend from time series data and .ags bins which deviate from that trend.

we develop a new method which is fundamentally di.erent from time series approaches used by Kalman [26], Wavelet [2], or PCA [13], because it does not require training from normal tra.c data, and thus is immune to data-poisoning.


[7] suggested opportunistic communications using delay tolerant network paradigm to deliver mobile content.

these mechanisms are limited to delay tolerant tra.c only and assume the presence of other forms of network connectivity like WiFi.


We decided to have immobile nodes as it makes it easier to analyze the impact of an attack.

the analysis can easily be applied, without loss of generality, to a scenario of mobile nodes.


Whether a name is an alias or a canonical name is configured by the domain's administra- tor, and is not expected to vary as a function of location.

some CDNs leverage the function provided by CNAMEs in DNS to increase performance of web object retrieval so we expect some portion of the actual CNAME mappings to change from site to site.


Table 6 shows the duty cycle of ZiSense is 5.14%, which is just 22.1% larger than the of.ce environment.

comparing with the of.ce environment, the serious interference leads to 100.7%, 125.2% and 141.7% more energy consumption for BoX-MAC-2, AEDP and A-MAC separately.


The average energy difference of EBHMM likely keeps constant.

the ADA and TCSC curves change shape significantly.


Different from general P2P .le sharing, P2P media streaming poses more stringent resource requirements for real-time media data transmission.

as .rst addressed in our earlier work [33], for a media .le of playback rate R0, a single sending peer may not be able or willing to contribute an outbound bandwidth of R0.


Therefore, any adversary equipped with similar capability radios and located outside of vulnerable domain cannot receive data packets.

limiting the maximum transmission range of each node has its drawbacks regarding to the maximum achievable lifetime due to the increased indirect transmissions, increased amount of transmission energy and possible hot spot issues.


Interoperability: The user agent will need to support redirection and not change the Contact header received from the anycast servers.

it is often the case that SIP clients do not support redirection due to poor implementation or for policy reasons as redirection could be used for fraud when a user is lured to call a free number but then gets directed to a costly number for example.


Several approximation algorithms for constructing km-CDSs have been proposed in the literature.

all of these algorithms only consider some special cases for k =1, 2 or k = m, or are not easy to implement, or have high message complexity.


The weighted averages are shifted over about 45 minutes; half of the time we find ourselves in a change-free region of under 1.5 hours duration.

throughput does not wildly fluctuate minute-by-minute: only 10% of the time do we find ourselves in a CFR of under 20 minutes duration.


For low-distance threshold values (5 meters), we see that the external adversary has a TPR comparable to the case where no community information is extracted (for most weight functions).

the FPR values are signi.cantly di.erent: The false-positive rate for friends and classmates relationships is three to four times lower when using community structure than when not.


The alternate approach like Content Distribution Network (CDN) is also widely studied and deployed in the current Internet services (e.g., Akamai, Limelight) [13, 16].

due to lacking of collaboration of multiple CDN service providers, CDN approach has limitation on how to place their services and contents to support users [5].


We can observe that the absolute run time of the algorithms changes slightly with the number of result records.

the relative performance of the three algorithms stays the same.


Figures 2(a) and 2(b) show perfectly positively correlated link pairs for two different cases; when both the links have same PRR and when they have different PRRs.

if the second link s transmissions that fail are a subset of transmissions that succeed on the .rst link, then a node maximizes the chances of every packet making progress.


On the other end of our parameter space, a three-week TTL with ten questions per transaction produces an average load that is nearly the same as the load with a shared resolver.

the 99.9th percentile and peak load show a 65% and 6% increase, respectively.


if we want to prove the concatenation property for weak stochastic service curve, we need to prove [(A1 .ß1) .ß2(s) -A2* (s)] = [A1 .ß1(s) -A1* (s)] + [A2 .ß2(s) -A2* (s)] for all s =0, which is di.cult to obtain and does not hold in general.


Module numbers 1 and 2 represent the compressed and uncompressed versions of the .rst Module of data.

our tests required no more than four open Modules and four open Blocks, and these numbers can likely be reduced further with occasional Flash bu.ering and re.ned coding in the Data Search algorithms.


KNN doesnotwork wellbecausetherearenotemporally near neighbors, and no spatial neighbors at all.

if we can use the temporalpatterninthedata more creativelywe canmakeprogress.


The per-permutation max-load variations are ampli.ed with .ow-hashing, under which the max-load reaches values up to 10.

oSMR2 minimizes the variations, and keeps the max v load below M = 6.


SAODV has a higher routing control overhead due to more additional fields in the RREQ and RREP packets.

sAODV still gives a higher packet delivery ratio than AODV in the presence of an attacker.


The arrival times recorded through MLSSH are extremely consistent and clustered around the one second mark withlittle variance.

openSSHexhibitsjitter within a range of ±100ms;delays arebeingintroducedwithinthe server which causeittodisrupt the arrival times.


This resource planning at .rst glance may seem similartotheplanningthatwasperformedinproviding plain old telephony services(POTS) with resources(phone circuits) statistically shared by multiple users.

in this network the number of users is smaller and the cost of alineisfargreater, making accurateplanningfar more critical.


Virtually all existing techniques and tools for path discovery require direct access to the source.

the uncooperative nature of the Internet makes it dif.cult to get direct access to any remote end-point.


requests are normally broadcast, since the whole point of needing to use ARP is that neither A nor B know what MAC address to associate with the other.

replies to ARP requests come back to the requester via unicast.


We will not discuss the possible reasons for this here.

note that for all measurements we have used default installations of Windows and FreeBSD/Samba servers, without doing any attempt of tuning them.


The database community has extensively explored centralized triggering mechanisms [3, 15].

the goal of minimizing communication overhead in widely distributed Internet environments introduces new challenges.


The unbounded buffers allow for suf.ciently large memory, so that no receive-window limitation occurs.

if the receive buffer is bounded (as it is often the case on a smartphone), the Multipath TCP connection may become receive-window limited.


That process is trivial for stateless applications: we can merely replicate all functions on all controllers.

this process is challenging when we deal with stateful applications.


We see that  Table 2: Ef.Cuts Average Memory Reduction over HyperCuts as the classi.er size increases within each classi.er type (ACL, FW, or IPC), HiCuts and HyperCuts memory requirements grow quickly (the Y axis is log scale) and vary widely across classi.er types.

ef.Cuts memory requirements are almost constant across classi.er types and sizes.


This implies solving a complex problem for each of the iterations in the NP-hard problem.

some advantages can be taken for the concrete problem described in this paper.


The BASIC scheme has been considered for saving energy [1, 6, 10, 15].

past work did not identify the above de.ciency of the BASIC protocol.


but also changing node states by adapting the graphical appearance of the node.

the possibilities in nam regarding a dynamic change of appearance are rather limited.


We require no new protocol mechanisms to support mixed policies; routers run the algorithms we have already described in Sections 2 and 3, constructing the pathlets appropriately to match their routing policy.

since we believe this is an important way of using pathlet routing, we illustrate the process here.


The DTLS approach exhibits an overall larger memory footprint because DTLS (i) involves more messages than HIP and (ii) requires SHA2 while HIP-PSK only uses AES-CMAC.

for key management, HIP adds slightly more overhead, as it requires the de.nition and handling of new parameter types whereas in DTLS the required information can simply be carried in the payload.


To facilitate visual illustration, we use only a 1D deployment (nodes on a line) as an example, which leads to easily discernable Voronoi tessellations in R2 .

our FAVOR algorithm works for any dimension higher than 2, while our experiments in Sec.


Our motivation is to evaluate actual implementations on the Internet-like environments to know the realistic behavior of these implementations on the real Internet and to avoid bad in.uences to critical services on the Internet.

the gap between the Internet and laboratory-level testbed is very big, especially at points of scale and complexity.


However, the nodes along the path will not have more information to base their decision on, as it is the case with the other QoE formats.

as it will be noted in Section 4 below, this format is currently the only format available for IPv4 ConEx based feedback.


C, seeFigure 1(we show1-weekdata only, as the second week results are very similar).

the sink was not exposed to sunlight, and therefore its temperature was constant, about 25 .


When the bottleneck queue is 8 packets, the packet loss ratio is about 2.0% and FS-ATs can get more throughput than Reno,because of the retransmission control of FS-ATs; however, FS-AT loses the throughput when there are enough queue in the bottleneck nodes.

fS-ATmax can maintain the fairness between Reno.


The results reported in Table 2 show that both schemes can reduce on average the energy consumption with respect to traditional single-hop cellular transmissions.

these schemes result in a significant lower energy-efficiency performance with respect to the proposed context-based opportunistic scheme as a result of a selection of the MR that does not take into account the optimum configuration.


When the channels are good, then we have L < K and the system delivers multiple bits per symbol.

in current backscatter systems, nodes transmit sequentially, thus making the highest rate 1 bit/symbol regardless of the quality of the channel [14].


In [7, 8] good proposals are presented for optimizing the mesh throughput such as intelligent channel assignment or load balanced routing.

in [7] the load-sensitive path weight functions may cause network instabilities because they are depending on tra.c variations which may be very large and irregular.


The curves saturate when the queues get full (the delay is calculated only over packets that are not dropped due to queue over.ow).

mMAC outperforms DMAC since it utilizes the longest possible links between node pairs.


2) Soft Sign Function: Sign function quantizes the value to either +1 or -1.

a larger absolute value in the eigenvector shows higher con.dence in that the quantized value is correct.


FQandStopItperform exactlythe same,becauseinthese colluding attacks,theyboth resorttoper-senderfairqueuing toprotecta legitimate user s traf.c.

unexpectedly, we note that they provide legitimate users less throughput than attackers even when the user traf.c is long-running TCP.


Preliminary experimentation found that removing external power had no a.ect on any output variables or signal strength.

it is conceivable that future energy-aware cellular radios could exploit periods where external power is available to improve QoS by, for example, increasing their transmission power level.


The simulation of the radio propagation is based on theoretical data and validated with empirical measures, and it does not need to know the exact location of the buildings since it approximates them by using the streets width.

unlike our proposal, the CORNER algorithm implies very complex calculations and it is only valid for Manhattan-based topologies where the streets are arranged orthogonally.


Indeed, suppose that one of the honest stations switches from wh to ws, its bandwidth share becoming bs(N, xNE(R) + 1).

by (14) and (15), its perceived bandwidth share then becomes bC, meaning a payoff decrease: the station now obtains a less-than-required bandwidth share "in exchange for" increased power expenditure.


5.2 Replacing BWT in Structured Datasets Tothispoint,wehaveassumedthatweknowverylittleaboutthedatawearetryingtocompress.ifwecanidentifyasimple,reversiblewaytoreorderthedata,wecouldsurpassthegainsobtainedwithBWTatareducedenergycost.


We suspect that this has to do with the circuit design and thermal characteristics of some components on this mote.

a detailed investigation is left for future work.


A more pertinent conclusion is that the placement of gateways strongly affects this indicator for multicast trees based on pre.x continuity.

one can always .nd Average noise (by tree member) 6 5 4 3 positions for gateways in order to minimize the average depth 2 of multicast trees, whatever group members and tree size.


The problem of identi.cation in our anomaly diagnosis framework bears resemblance to the problem of traf.c matrix estimation as formulated in [23].

traf.c matrix estimation is concerned with the problem of estimating all underlying OD .ow intensities from link data, which is a much harder problem.


The maximum number of authentication failures takes place in case of 1 AP deployment, which is due to the difficulty of ad hoc clustering to provide full coverage for all nodes with this minimum infrastructure.

a little increase in the number of APs allows more utilization of ad hoc chaining and thus allows less authentication failures.


It is well known that single path routing is simple, but may not be as e.ective as multi-path routing in balancing network loads.

multi-path routing introduces complications such as packet reordering that the network system must handle.


ETX provides a small bene.t to some pairs in the intermediate and low throughput ranges (the middle and bottom of the CDF).

failure feedback alone allows DSR to perform almost as well as DSR with ETX.


The fairness should be applied to the principal entities in the network, e.g., each user or groups of users.

a .ow is merely an information transfer between two applications.


The server sends the .rst couple tens of seconds of video as fast as possible, then it rate-limits the transfer based on the video encoding rate to minimize wasted network capacity if a user cancels the rest of the video.

for most video downloaded in India, there is little or no di.erence between the throttled and un-throttled data rates because there is little or no surplus network capacity above the video encoding rate.


We note that their analysis only consider links secured by preloaded keys, and hence the fraction of  6.2 Connectivity As shown in Section 2.1, RKP and SRKP require high density deployments to ensure the entire sensor network is securely connected with high probability.

gKE ensures that any two neighboring sensors are able to establish a path key, regardless of the sensor density or distribution, as long as the sensor network is physically connected.


End service name is the only mandatory parameter that must be specified in the Creq.

for achieving a CS efficiently and adapted to context,, we consider that Creq can also specify, at least, requirements of the service in terms of: network performance parameters, additional constraints (e.g.


Our proposed virtual WiFi approach is similar to emulated I/O approach in that it supports unmodi.ed WiFi device driver in guest OS.

it is different from emulated I/O in that it requires device model emulate the same device as the physical device on the host and it passes many of the commands to the physical device without emulating it.


Thus, even though Tree Bitmap guarantees O(1) route-update cost, in the worst case its memory management scheme can add an overhead of more than 100 memory accesses to any route-update due to compaction operations.

we use only 1-bit trie nodes without compression, ensuring that all nodes have the same size across all levels and all stages.


Using a separate SSID for each experiment also means each SSID can use di.erent encryption and authentication settings.

all the virtual interfaces are limited to use the same wireless channel and power settings.


Then, 16-link can be viewed as the above link and its dependence on packet arrival rate of download tra.c is same as that of upload tra.c.

an 11-link which is based on CSMA/CA can not reserve the resource of interface, and it shares the resource of interface among other links within the same interface of a base station.


For each of the access points, the server computes the waveform of the signal to be transmitted in the nextdownlink slot.

itdoes notperform anyphase correction at this point.


Another option is to insert repeaters, similar to conventional wire designs, but with fewer repeaters and faster propagation.

this would require either multiple unidirectional buses or a ring topology, as well as higher power consumption due to the extra circuitry per hop.


Therefore, the amount of state information stored at each node is a function of the number of neighbor nodes, rather than the number of .ows traversing the node.

each individual .ow is e.ectively policed in a distributed manner by the nodes on the path from the source to the destination.


We have chosen it because it has been used in many previous routing studies (for example, [11, 12]), it is used in capacity planning decisions by ISPs, and it may well be correlated with other metrics of interest, such as loss rate.

we also believe that the techniques we have introduced here can be extended to incorporate other relevant performance metrics, such as end-to-end delay.


if a receiver is still using the initial RTT when the .rst loss event occurs, it will underestimate the loss event rate and the initial loss interval will be too large.


What is encouraging is that the recovery from the 100 msec range dispersive events takes only a few rounds to achieve, thus showing that the system can recover quickly from perturbation.

a more rigorous instrumentation and experimentation setup will be required to pinpoint the causes behind this behavior.


One reason for this is that papers in this category tended to have the word automatic or model in the title.

the same was not true for papers in the prototyping category.


The combination of opportunistic forwarding and duty cycling is a useful approach for wireless ad hoc and sensor networks that are plagued with energy constraints and poor connectivity.

such a design is hampered by the di.culty of analyzing and controlling its performance, particularly, the end-to-end latency.


In mobile WMAN, mobile station (MS) can move freely while remaining easy to get high-throughput at all times.

since the mobile equipments often use batteries as their power sources, how to reduce power consumption to prolong the battery life time becomes a very important issue.


4.2 Trace-Driven Simulation The above prototype with USRP shows the potential advantages of DOMINO.

the limited number of USRP platforms and the latency with USRP prohibits a large scale implementation.


This decision is taken because Class 1 tra.cs are very delay sensitive and not resources greedy.

with the Class 2 & 3 tra.cs, in spite of RSS level and eNodeB load, source vehicle will check the CH features.


Our focus 2RCP s implementation avoids the problem by setting the maximum rate feedback to be the link price.

this solution is not applicable to weighted proportional-fairness [27] because the rate feedback (inverse of price per unit charge) can be larger than the capacity at equilibrium.


Nix-Vector routing mechanism even requires none of the storage space without any computation for routing information during the initialization of the simulator.

as it needs to use BFS algorithm to compute shortest-path routing information whenever a new packet is generated, Nix-Vector routing mechanism has a large time complexity for routing lookup.


Consequently, its packet delivery rate is limited.

non-aggressive contention maximizes packet delivery rate by making use of full contention area.


After the selection of a source, the next source is selected after 15 seconds.

all communications last till end of simulation.


even achieve O(1) authentication e.ciency for a single tag, based on their own weak privacy model [21].

even combing state-of-the-art anti-collision methods and tree-based authentication schemes, the maximum identi.cation throughput is still linear with the number of tags.


is 125 octets, the uncoded case will lead to highest energy efficiency when Eb / N0 is above 15.2 dB.

if Eb / N0 is only 13.5 dB, the coded case would lead to five times higher energy efficiency for the same payload length.


Moreover, a route-determination algorithm was applied to .ll the gaps between position updates.

the characteristics of taxis are not comparable to buses.


The log-normal model has only two parameters which need to be evaluated.

the sector-based model hasasmanyas NS *n + 1 parameters, where NS and n are the number of sectors and relays, respectively.


Latency T will remain constant since the same set of journeys is used every time.

instead of conducting experiments to .nd this limit, we can compute it based on data gathered by the resource-discovery mechanism presented above.


In Figure 4, the first mutation takes effect in router S. Therefore, the bulk transfer changes the path from S to router 4 instead of going trough the congested router 1.

we think that a single mutation on the first router before the congested router is not enough, because of the possibility that the router 4 would choose the router 1 as the next hop.


Besides commercial hotspots, many universities, enterprises and home WiFi networks have implemented techniques to share their WiFi networks with visitors.

sharing a WiFi network induces security risks if the visitor misbehaves.


If the number of CGTs is small, and we can search them quickly, we can obtain good worst-case performance.

if we make the CGTs too large, the space required to represent the .lters is likely to become excessively large.


Especially 50 Mb/s 0.3 for lower loads it is too pessimistic.

for high loads the 0.2 calculated bound is tighter.


Our discussion so far has implicitly assumed router-level redundancy, i.e., that the code running in parallel would be the operating system and entire protocol suite of a single router.

our architecture also enables two additional forms of redundancy: network-level redundancy, where entire virtual networks are run in parallel, and process-level redundancy, where individual routing processes and threads running inside a router implementation are replicated.


Although this does not bias against selection of any one packet, it can bia~s against se, lection of multiple packets from short flows.

we do not believe this effect would be important for sam- pling from high speed links that carry, many flows con- currently.


In addition to the administrative cost of managing the creation of these accounts, the identity of the visitors should be checked and they should be informed about the acceptable usage practices.

a user coming from another company has already credentials in his home network, so why do not use these?


This paper also deals with the problem of computing the optimal throughput of a wireless network.

a key distinction of our approach is that we work with any given wireless network con.guration and workload speci.ed as inputs.


One approach for developing signatures is to analyze traf.c dumps collected by actively downloading video content [24].

given we collected our traces over a span of three years, we cannot employ an active approach like this, as signatures can change over the years.


We note that the existing RR scheduling also requires a high average end-to-end delay to deliver a data packet.

this average queue jitter includes the packet in the BS server (physically, the packet being transmitted).


When there are 13 channels available, there are still only three non-overlapping channels.

when we choose four channels, namely, 1, 5, 9, and 13, the two neighboring channels are very partially overlapped such that the interference between neighboring APs using these channels becomes not very severe.


An Interest copy is used for probing so that regular Data retrieval will not be a.ected if probing is unsuccessful.

this causes extra Interest and Data in the network.


Radar-based techniques are used for Adaptive Cruise Control (ACC), i.e., for maintaining a safety distance from the vehicle in front.

inter-Vehicle Communication (IVC) is the basis for creating, managing, and organizing the platoons.


With the 20 MHz channel the observed normalized throughput with JPRA-CR is 43% higher as compared with that of the Standard Rate adaptation (Figure 8).

fARA still outperforms JPRA-CR by about 7%.


Then it tries to improve this assignment in each iteration.

tabu assigns channel randomly in the begining without applying the radio constraints.


It can be seen that UDI and the room needed for its suppression is less at lower transmit powers.

at higher transmit powers, FDoS provides a large UDI suppression of up to 20 dB per DL stream in the 2 antenna case even without any clock sync between the nodes.


Thequali.cationof anodeto markapacket should alsobeveri.able.

during path fragmentation, it is necesing.


The attached CCM*-MICs could be short since our goal is just to discard most of the spoofed ANNOUNCE commands.

we think that this attack will be dif.cult anyway if all CCM*-MICs .t within a single ANNOUNCE command.


This is because of the packet loss induced by transmission error is not an indication of congestion here.

both ECN and Re-ECN still treat it as a signal for congestion to reduce the sending rate, which results in low network utilization.


Moreover, the backlog is non-empty, keeping the bottleneck link fully utilized.

without parameters well tuned to the new network environment, RED fails to maintain its intended operational behavior.


A Back button tracks historical paths, regardless of contexts or logic.

pVRN provides what is essentially a multiply-linked list to multiple contexts with the links tightly integrated into the UI.


During this time, there is no time-sync correction available and the node s clock may drift.

this drift is negligible: only about 20-40 µs per second [3, 29], or about 1-2 ticks per second.


By Lemma 3, for any time W i ¯ t = tm, the probability that = W for any node i at time t is at most d/2.

w i ¯ suppose that = W for all nodes i at time t = tm.


The receiver-oriented orchestration of transmissions desired for MPR can be accomplished using contention-based or scheduling approaches.

we advocate a design consisting of establishing transmission schedules by means of distributed elections of the information .ows that should be o.ered to the channel during the time slots of the schedule, together with opportunistic reservations of time slots after they are acquired through election.


This means that the underlying assumption of physically-static stub networks that represent a range of IP addresses does not hold anymore and that IP addresses only function as unique identi.ers without added co-notations that are exploited for routing.

the use of IP addresses solely as unique identi.er in MANETs is questionable.


Joe et al proposed to use tra.c class to estimate the energy consumption for prediction of mobile terminal lifetime in available networks [3].

the experiments we performed for this paper suggest that more .ne-grained estimation of tra.c is necessary due to the large di.erences between tra.c load inside each tra.c class, as discussed in Section 4.3.


An alternative strategy would be to switch to CAM whenever an incoming packet is received.

this aggressive strategy works poorly in other cases.


When a packet is lost or the length of the queue is more then limit L, the probability pm is incremented.

when the link is idle or the queue is empty the probability is decre 10 0 1.0Mbps 1.5Mbps 2.0Mbps 2.5Mbps 3.0Mbps 3.5Mbps Speed of the link Figure 4: Average Queue in AVQW experiments setting different link speed mented.


More formally, we want to maximize: a* TB a* TB log( ) + log(min ( ,(1 - a) * TA,B)) 2 2 Due to space constraints, we refer readers to [4] for detailed derivation of the optimal a.

we show that either a =0.5 or a= 2TA,B/(TB +2TA,B), so the optimal ais the one that maximizes the throughput.


However, the activity of the SSH brute force attacks is not similar to that of the Web proxy because the contents of the invoked .ows in the attacks are not related to the original SSH requests.

in the Web proxy, the contents of the invoked .ows are strongly related to the original requests.


INTRODUCTION In many-core processors based on networks-on-chip (NoC), memory quality-of-service (QoS) becomes one of the most important issues since both memory and on-chip network are critical shared resources.

the improvement of memoryperformance aided by a memory subsystem independentlyworking with an on-chip network is severely limited.


They show that the message drop probability can be extremely high in this scenario, especially for large number of sensor nodes and message sizes.

they do not consider the effects of using acknowledgements and retransmissions.


For updating routing tables, each node transmits control packets periodically, which constitute an ine.cient use of network capacity.

in source-initiated on-demand routing protocols, routes are obtained only when desired by the source.


In an environment where the route table changes frequently, the update cost can become prohibitively large.

most successful IP lookup algorithms are essentially variations of the basic binary trie that allow for examining multiple bits per memory access [9].


The DAP also maintains a similar table indexed on MAC addresses.

it only sends information about disconnected clients and APs to the DS; otherwise, the DS would end up getting updates for every client in the system, making it less scalable.


In fact, it may continue to communicate with other nodes in the Internet while using its home address.

a link layer connection with the attachment point must exist.


RC(u, i), once that rank for all next-hop nodes that have paths to d becomes equal to or greater than the number of credits assigned for that batch at 350 that node, the node distributes its credits to next-hop nodes in a fashion similar to Algorithm 1.

this time the 300 node only focuses on one session i, and the credits that are assigned are real not virtual credits.


BesidesBGP data, we use registry and traceroute data to show evidence that the observed data is indeed explained by the model.

it remains a research challenge regarding how to perform a thorough validation, given the lack of public information about ISP connectivity changes.


Active networks [14] enables certain forms of architectural evolution, particularly on the datapath, but it does not address architectural aspects such as naming and interdomain routing.

a .exible datapath is extremely important for enabling architectural evolution without requiring new hardware.


Multihop forwarding in a similar manner is also supported by RMAC.

dW-MAC dramatically reduce the collisions experienced by RMAC due to schedule con.icts, as DW-MAC ensures that two data frame transmissions will not collide with each other.


Ironically getting the few good developers to react is probably easier than getting all the developers with vulnerable apps to react.

evaluating and discussing the rami.cations of this kind of roll-out is beyond the scope of this paper and would need to be discussed in the community.


In equation (36), both n and its multiplicative factor depend on jmin.

as illustrated by the plots of Figure 1, the decrease of n with jmin always dominates the non monotonous variations of the other term.


functionality) which is used in current CSMA implementations.

strictly following this sequence causes a severe performance drop due to the low signal processing capacity of conventional PC hardware.


Overall, we are underestimating the probability of instantaneous meetings, and we might incur some penalty for this underestimation.

as we will show through simulation results later, this e.ort is worth-while despite the simpli.ed model.


This gives us a collection of IP addresses for routers that could potentially be used as destinations to measure paths passing through NAPs.

we still have to ensure that the paths do in fact traverse the NAP.


The above examples clearly illustrate the need to provide a fairness mechanism for the multi-AP backhaul aggregation scheme.

it is important to agree on some notion of fairness, since each one could have di.erent design implications and trade-o.s.


There, carriers tried to minimize congestion by using small cellular or WiFi cells in areas that were expected to see high traf.c loads [3, 11].

this approach presents several challenges.


Indeed, while the forwarding rate reported in recent virtual router work (e.g., the rate for minimum-sized packets of roughly 700kpps in [6] or [7]) is signi.cantly better than that originally achieved in VINI [5], it is still rather low for practical applications in a real network.

on many occasions over the last few years, we have heard people assert that for routers to go fast, they would need dedicated forwarding hardware, with the various camps pushing the case for Network Processors, FPGAs, and various forms of of.oad engines; usually such pitches include graphs showing the sorry state of software forwarding.


Consequently, if exponential (and Weibull) distributions are close, but imperfect, models of user behavior, they might be accepted with a small number of data points but rejected when we supply a large number of data points (i.e., enough data points for the test to detect the di.erence).

the di.erence could be to a fundamental di.erence in user behavior between the two datasets.


(7) suggests that it is bene.cial to set the calibration window to be large.

we argue that in practice, the solution is beyond such a simple strategy and there exist practical limitations.


Hence it is also hard for cryptanalysts to correlate the route pseudonyms established on top of the cryptographic onions.

an unbounded eavesdropper can trace on-demand routes by exploring other data .elds in RREQ/RREP packets: (i) RREP packets with the same prdest .eld are likely on the same route.


All of them associate the sensed data with a tag of brief description, and sensor nodes use such tags to establish dissemination path as well as aggregate data.

as mentioned before, .ooding is the underlying method for communications in both SPIN and DD.


Determining if a host is currently vulnerable to Heartbleed is relatively easy, as one can simply send improperly-formatted SSL heartbeat messages to test for vulnerability.

determining if a site was vulnerable at some point in the past but has since updated their OpenSSL code is more challenging.


Not letting the adversary pick the session ID (which corresponds to a replication index in CryptoVerif s process calculus), on the other hand, restricts the adversary s capabilities.

since the number of sessions is polynomial (in the security parameter), a non-negligible advantage of winning an attack game for a two-phase adversary as in [21] implies a non-negligible advantage for the adversary we described above.


Between the onset of a forwarding loop and its detection, the network may suffer from a very brief period of packet duplication.

the EtherFuse is able to quickly stop packet duplication before it escalates into network congestion and packet loss.


In particular, they analyze the conditions that lead to aquick spread orquick extinction of thedatum.

they do not analyze the problems of statistical .uctuation, geometrical modeling,power consumption and collectingtimethatwehighlight inthispaper.


In this manner, labeled IPsec can solve many of the authentication de.ciencies in plain IPsec.

labeled IPsec builds upon the Linux kernel, SELinux, and IPsec, each of which are very complex.


For this scenario, binary exponential backoff performs worse than the other 95   Summary and Future Work State-of-the-art multiple access protocols for shared chan- nel wireless networks often lack a well-defined notion of fair- ness, and provide somewhat ad hoc mechanisms for achiev- ing fairness among contending flows.

as shared channel wireless networks move from the academic domain to the commercial domain, these environments must sup-port network-level quality of service and service differen- tiation, which translates to MAC layer weighted fairness.


For reliable communication in a wireless network, network coding can be added to the retransmission control of the MAC layer to reduce the number of retransmissions [4], [5].

when the network coding e.ectively works, the coded frames have to be correctly received at all receivers by broadcasting.


Once the user authenticates with respect to the operator, there will be no need to communicate with the authentication server except if there is a need to require more credentials.

the extra credentials if need would be obtained in an optimized manner without needing to authenticate with the server again.


That is, the use of a small, or more accurately, a su.cient relevant area size will naturally tie the information to the right location.

obtaining such su.cient size for the relevant area will in its turn be problematic as well.


We consider only detection rate and false positive rate in our experiments to evaluate our programs.

other non-functional properties of the programs such as program Figure 4: Relation between classi.cation accuracy and number of generations size, power consumption should be taken into account for MANETs where the nodes might well be highly resourceconstrained.


In a reliable protocol it makes no sense to transmit packets that the receiver may discard.

timing-critical applications may, under some circumstances, be unable to avoid doing so.


This data shuffle pattern arises in large scale sorts, mergesandjoinoperations inthedatacenter.

wechosethistest because,in our interactionswithapplicationdevelopers, welearned thatmanyuse suchoperations withcaution,becausethe operations arehighlyexpensive intoday sdatacenternetwork.data shuffles are required, and, if data shuffles can be efficiently supported, it could have large impact on the overall algorithmic and data storage strategy.


Further, since the bene.t of reuse outweighs the diversity gain in static environments, even CSMA is better than DAS.

as we vary the number of mobile clients in the network, the performance ofbothnetMIMO andCSMA start todegrade;the degradation for netMIMO being especially severe.


Vcut,we tend to require Vcut samples from .ows before detecting them.

if p = d/Vcut, we also tend to sample every byte.


In order to understand the DTN characteristics of our metropolitan bus network, we perform three ways of modeling and analyses -spatial, temporal, and mobile.

we aim to focus on the description of measurements in qualitative and quantitative ways rather than aim to design an accurate and reliable model, that is able to generate synthetic data.


Rather, we only assume that the mobility of the nodes during an epoch can be predicted with reasonable accuracy using a mobility prediction scheme.

the framework does assume that the set of active .ows in the network remains constant over the duration of an epoch.


In the proposed scheme, the throughput of femtocells shown in Figure 6 is greatly enhanced because the femtocells interfere less with the macrocell users than in the comparison schemes.

in the FFR-3 and NoFFR-3 schemes, the subcarriers are randomly assigned to the femtcells regardless of the sub-carriers used by the macrocell users.


Also, this allows for the nodes to be certain that no one has altered the packets.

some fields of the packets must change and these are signed as if they were zeroed out.


The µTESLA approach provides true broadcast authentication of page advertisement and SNACK packets.

due to the use of µTESLA, there has to be either receiver side or sender side delay [25, 26].


A more general approach is for instance taken by the Media Services Architecture (MSA) presented in [3].

our overlay network distinguishes itself from the cited systems by its application awareness.


Monitoring the state change has one of the lowest overheads, but has some of the farthest reaching implications in terms of overall program correctness.

the gps o. aspect is used in a much more narrow scope, but incurs a much greater performance penalty.


This results in a NBV with a higher lexicographical value.

this contradicts the assumption that the given allocation is max min fair.


Moreover, our analysis in Example 8 and 9 assumes a uniform distribution of the guessing value and thus there is no better way than brute force guessing.

in reality, weak secret (say, n bits) usually has low entropy, making it easier to guess (<n-bit hard).


Note that typically the path received at the monitoring point does not contain the AS in which the monitoring point resides, for brevity called the monitoring AS.

should the path indeed contain the monitoring AS, then we can exclude that AS if care is taken to exclude all updates associated with session resets on the monitoring session.


The partial coef.cient algorithm in [17] can be a source of local communication overhead since a few additional bits are allocated to each partial to mitigate the effects of quantization as in [3].

this increase in cost is minimal since these added bits are only carried over a few hops.


First, OpenRadio assumes that the majority of the computation time is spent in the processing plane of the protocol, and decision overhead is negligible.

heavy decision planes would incur prohibitive inter-core communication overheads implying that decision/processing plane separation is not the best design choice.


Axelson argued that effective intrusion detection systems will maximize both positive predictive value (PPV) and Negative Predictive Value (NPV) [2].

when the probability of attack is low, the low attack rate will dominate NPV calculation such that NPV will be high even in cases of low accuracy.


In fact, aggregating distance updates for multiple pre.xes is easier than aggregating LSAs from multiple sources.

given that the maximum size of a control message is a constant value independent of the growth of N or C, this aggregation does not change the order size of the overhead incurred by the routing protocols.


All the followers must have the same velocity as the leader, i.e., vf (t)= v(t).

each follower has some, but not complete, discretion regarding its choice of .f (t).


Traditionally, a client program issues a series of socket calls: socket(), connect(), and send().

with AppSalt, connect() cannot be called .rst as it will initiate the 3WHS and send the SYN before the kernel has the necessary application data over which to calculate integrity.


If 2 It is important to note that RL can also deal with non-Markovian environments [13].

markov property is a good approximation for many network characteristics observed over long time intervals.


Contiki s 6LoWPAN stack is organized like the theoretical 6LoW-PAN protocol stack shown in Figure 1.

contiki currently does not allow for an additional layer in between the MAC and the 6LoWPAN adaption layer for implementing link layer security.


A THEORY FORMULTI-INSTANCE ROUTING Although a considerable body of research has been devoted to the correctness of routing, most prior work concentrated on the behaviors of one speci.c routing protocol (e.g., RIP, OSPF, or BGP) at a time.

this section presents a general framework to study routing properties across multiple routing protocol instances.


When these ACKs collide at a DATA transmitter, the transmitter cannot learn of the successful delivery until it overhears future transmissions from those nodes.

this is rare when using a low duty cycle.


the degree of the other clusters is much lower and there will be a waste of resources if only one color is assigned to cluster A, B, G, H. By using multicoloring, it is possible to assign 2 colors to these clusters and increase the overall network capacity.


The collaborative effort of such sensor nodes, inter-connected in an ad-hoc fashion to achieve a complex sensing task have revolutionized the .eld of sensing and information gathering in a range of application domains [2, 27].

the coordination between large colonies of sensors to report sensed information to specialized sensors (sinks) is challenging.


Second, based on our results, Vegas [1] deserves serious consideration as a high-performance TCP for both the Internet as well as distributed computational grids.

(the weakness in this claim is that we did not test TCP Vegas in a dynamically changing environment of short-lived connections.


The MN can continue to use the same IP address in the PMIP domain, since the MAG emulates a the MN s home link on the access link.

a PMIP-based mobility solution is only suitable if the node s mobility is limited to one particular domain.


At large loss rates, highly asymmetric loss patterns cause this method to disregard a poten- tially good path because the reverse direction of that path has a high loss rate.

the benefits of avoiding the high loss rate path seem to outweigh the cost of missing one good link, but we in- tend to remedy this problem soon by explicitly estimating one-way loss rates.


When packet errors are frequent, it is better to use a high threshold value in blacklisting and exclude many neighbors with low-quality links.

when there are few low-quality links, the use of a high threshold value may exclude useful neighbors and lead to longer paths.


i =1 where N is the number of PF nodes on the path, Cdi is the propagation delay between the (i -1) node and the node (the th ith 1 As mentioned in Section 1, this is not necessarily the case.

this paper reports preliminary work and studies only this scenario.


With regard to ASes it is possible to see that including more than the top 200 ASes in the sample does not increase signi.cantly the fraction of changes captured.

there are hundreds of thousands of pre.xes that experience signi.cant levels of routing changes.


Also, each sensor incurs small communication overhead for key establishment, regardless of network size.

these random key predistribution schemes suffer from two major problems, which make them inappropriate for many applications.


Figure 3b con.rms that, in the last ring for both topologies, the mean tree depth approaches the network radius (XR) used in each test.

the simultaneous progress of various branches in the tree leads to the possible appearance of unnecessary hops, as the maximum number of hops for each one is shown.


References values are taken from a ZigBee node im- On the one hand, with CMSA, presented .gures show that the failure anticipation window size has any impact on theprovided networkdysfunctiontime,giventhatit canbe considered as CPMS-NB with a single expected failure window.

since they use the same heuristic, CPMS-NB and CMSA give the same robot scheduling solution and consequently the same network dysfunction time with a small size of expected failures window.


Note that by ensuring that the next stage PM s tail pointer is always equal to its own head pointer, a PM can guarantee that all the downstream PMs in the pip-eline are accessing blocks of data that do not overlap with its own data window.

when several PMs work in parallel at a same pipeline stage, their tail pointers must be shared , that is data gets released to all these PMs simultaneously.


On the other hand, the normalized MLU of oblivious routing never exceeds 1.6, showing the robustness of oblivious routing.

from Figure 9(b), we observe that the robust performance of oblivious routing is surpassed by COPE and COPE-MLU.


Micciancio and Panjwani [40] considered the case where the adversary adaptively chose the formal messages to be computationally interpreted, the necessary security of the encryption scheme still corresponded to security against passive adversaries.

we have given a static program analysis [32] and a type system [35] that work directly in the computational model, handling programs containing symmetric encryption.


Protocols that implement service discovery at routing layer generally reduce the communication and energy consumption overheads.

the proposals made along this line rely on the assumption that communication between two devices in a network is possible only if these devices are both simultaneously active, and if a transmission route can be established between them whenever needed using reactive or proactive techniques.


We seek a predictor based on an intuitive and parsimonious model rather than a black box.

virtual path changes are characterized by extreme variability and are in.uenced by many different factors, making model building, and even feature selection, problematic.