Generally, database design begins with logical database design followed by normalization process to check its integrity and produce the physical design which is the final design before proceed with implementation to the real database software.

since the database design is not main orientation of this paper, thus simple logical database design is illustrated in Figure 3.


Our techniques for detecting whether or not a pair of flows share congestion are based on two fundamental observations of Internet congestion: Losses or delays experienced by two packets passing through the same POC exhibit some degree of correlation (i.e., a loss or ex- cessive delay observed by a packet increases the likelihood that a later packet will be lost or experience a large delay).

in general, the degree of correlation decreases as the time between the packets' transmissions is increased [12; 13].


Delay-Aware Interleaving and Forward-Error Correction for Video over Wireless: A Bluetooth Case Study  Rouzbeh Razavi University of Essex Wivenhoe Park Colchester, U.K. +44 1206 872442 rrazv@essex.ac.uk ABSTRACT Martin Fleury University of Essex Wivenhoe Park Mohammed Ghanbari University of Essex Wivenhoe Park Mahta Sadeghzadeh UCLA Los Angeles Colchester, U.K. +44 1206 872817 Colchester, U.K. +44 1206 872434 California, U.S.A +1 949 305 1795 fleum@essex.ac.uk ghan@essex.ac.uk mahta@bolproxy.college.ucla.edu Packet-level interleaving combined with FEC has tended to be disregarded for video streaming over wireless, because of the delay introduced by the need to assemble the interleaved packets.

packet level interleaving has the ability to cope with lengthy bursts of error on a wireless channel.


As discussed earlier, the CCA threshold also plays a role in the context of collision avoidance.

adjusting the CCA threshold has a di.erent e.ect in the context of collision avoidance, where it directly a.ects the sender rather than receivers.


According to this approach, given a peer, its distance (in hops) to every superpeer is the same and equals the count to the closest superpeer plus the one hop through the satellite backbone.

the distance to superpeers through the terrestrial infrastructure is, in principal, greater.


SideCar expectsthe guesttomark and steerdisk commandpacketsto a sidecarthat can trackthese metrics.

aguestcan deflateitsrequest ratebyonlysteering someofits commandpackets.Topreventthe guestfromdoing so, SideCar can sample allpackets and verifythat allthe requestpacketswereindeedmarkedtobe counted.


The size of an anomaly then is the difference between the actual value and the modeled value, |zt - z t| where z t is the Fourier approximation of the OD .ow at time index t. We con.rmed that every OD .ow anomaly that we could visually isolate was also discovered by both these approaches.

we did .nd several instances where both schemes mistakenly marked a moving average schemes) to identify single-timestep spikes, is that the scheme often mistakenly marks the time after a spike as an additional spike.


This might be di.erent in scenarios with higher load, but as this requires an adaptation of control phase and data phase (the end-to-end delay for value of 1 2 3 4 5 6 Number of concurrent chains Figure 9: Comparison of end-to-end delay the initial JamTDMA packet and MAC-RSV solely depends on the slots available in the control phase), we leave the discussion of throughput optimization for further studies.

when the end-to-end path is established, the delay is constant for this path.


Such a strategy is not e.cient at attacking DTNs: a network where 10% of participants are attackers still achieves over 90% of its unassailed delivery rate, and it achieves over 70% of its rate when 30% are attackers.

we provide the strong attacker with knowledge of future events.


Moreover, we used multi-threading to accelerate the MAC processing in parallel, and work stealing [14] is used in the multi-thread implementation.

for the VBS Pool scenario 2 (Figure 2), usually multiple MAC instances need to be supported on one processing node.


For example, many existing schemes divide the allocated bits into groups and di.erent groups have di.erent functionalities, like hop-count, hash value etc.


Another potential issue with ILNP is its reliance on DNS Security to authenticate domain-name, Identi.er, and Locator mappings.

iLNP uses the existingDNS Security mechanism designed for the IP Internet.


Finally, in terms of framing we note that the funneling-MAC uses the low power listening (LPL) algorithm and preamble technique proposed in B-MAC [3] to reduce energy consumption for sensor networks with low duty cycle.

unlike B-MAC f-nodes do not need to transmit a long preamble in the LPL mode because their communications are synchronized by the superframe.


performance, that network discovery or scanning phase can be signi.cant [15, 9].

in the application scenarios that are being considered in this paper, the users would have had an association with the network in the past.


While these efforts present transfer-level simulation studies similar to ours, they focus on the algorithm design and assume a simple network information model with complete low-level information.

we also take into account different NIMs in network path selection and scheduling.


These numbers exist because independent nodes are placed at least d from each other, so there is a certain area needed to contain the nodes.

c de.nes a polygon of perimeter at most |C|, which cannot enclose arbitrarily large areas.


Monitoring of User Generated Video Broadcasting Services Denny StohrDistributed Multimedia Stefan Wilk Distributed Multimedia Wolfgang EffelsbergDistributed Multimedia Systems Systems Systems Technische Universität Technische Universität Technische Universität Darmstadt, Germany dstohr@cs.tudarmstadt.de Darmstadt, Germany swilk@cs.tudarmstadt.de Darmstadt, Germany effelsberg@cs.tudarmstadt.de ABSTRACT Mobile video broadcasting services o.er users the opportunity to instantly share content from their mobile handhelds to a large audience over the Internet.

existing data caps in cellular network contracts and limitations in their upload capabilities restrict the adoption of mobile video broadcasting services.


It also includes the connection time, protocol used, connection state, and .ow direction.

in some cases the directionality is not evident from the .ow record (e.g., UDP .ows, long-lived TCP .ows that extend beyond the .ow timeout).


As expected, there are more hits on the Web site during the daytime than during the night; server administrators can utilize this time period for daily maintenance tasks.

as more international users come online, we expect the graph to become flatter; go up.


The damage by natural disasters varies according to the geographical location of the areas where it occurs, so do the relief goods needed subsequently.

any natural disaster cause serious damages to the ground communication infrastructures, including base stations and divisions of telephone networks, which makes situation extremely difficult for grasping the exact nature of damages and its subsequent relief.


In fact, we .nd that its average and tail FCT for the small .ows (< 100KB) is almost as good as default pFabric [6].

for the web search workload, its performance completely breaks down at high load.


3.3 Link stability The adjective .aky is often associated with performance of wireless links, and is a potential concern for using wireless links in the DC.

the performance variability seen in typical WLAN/Wi-Fi deployments comes from device mobility, environmental movement (people, doors opening and closing), temperature changes, and interference.


For example, .owing based DoS detection algorithm [14] detects spoofed IP packets in real time.

systembased IDS is more powerful to handle deep packet inspection tasks and is widely used to detect and classify network attacks.


They identified limitations of the technology and pointed out that the performance that can be anticipated by the early realizations will be significantly less than many had thought.

they did acknowledge that there are well-known techniques which can be employed to significantly improve the system performance, such as MIMO and adaptive subcarrier loading.


We observe that when the .rst slice uses a simple round-robin scheduler, both clients in SLC 1 get similar airtime when channel quality is good for the mobile client.

as the mobile client passes through the area with poor coverage, the airtime consumed by the mobile client increases, leading to a corresponding decrease in airtime available to the static client in SLC1.


Normally, during a count to in.nity, a hand-shake operation between adjacent bridges, called sync, prevents a forwarding loop from forming.

a race condition between two RSTP state machines and a non-deterministic transition within a state machine that together allow a sync operation to be mistakenly bypassed.


Although the size of the Hello packets may be reduced by using differential Hellos [24], the periodic packet overhead is still a concern.

in situations when Hellos must be used for maintaining local neighborhood and to detect link failures (e.g., when the link layer cannot provide any feedback about link failures), incremental overhead for unidirectional link detection may not be very much.


In practice, the length of the connected region depends on the deployment environment and can be derived through an RF site survey.

this approach will also require redundant relay nodes as the connected range can be as little as 30% to 50% of the radio s total range [43].


Having recognized the similar nature of PinIt s multipath pro.le matching and speech pattern match 3Note that the SNRs of the two tags are below 8 dB in this trace.

channel noise in time domain signals only translates into distortions in the shapes of multipath pro.les, rather than noisy curves.


router level Internet topology maps are considered useful in various contexts such as analyzing the topological characteristics of the Internet at the network level and designing topology generators that can produce Internet-like synthetic network topologies to be used in various simulation studies.


First, the initiator might not know of some node v which lies between Ki and w on the identi.er ring.

this contradicts that the initiator knows all n nodes in the network with high probability (per Section 4.1.4).


Furthermore, WSNs are often deployed in unattended or even hostile environments, making their securing even more challenging.

due to the limited resource, the implementation of complicated security techniques is impossible.


This allows researchers and operators to explore new protocols, create complex models of networks and predict consequences of con.guration changes.

our abstractions could also allow the discussion of the broader con.guration management problem.


As a consequence AAAH cannot generate AAA-Key as [10] proposes.

instead, in our proposal, AAAH computes the AAA-Key as following: AAA-Key = KDF(MSK, AAA-Key-name) [10] does not de.ne any speci.c format for AAA-Key-Name.


Most of the previous researches [15], [16], [17] focus on how to move the sensors to cover the network .eld uniformly.

the uniform deployment is not the best method for increasing the network lifetime.


It is a natural extension for wireless messaging service to integrate with messaging services over heterogeneous networks and provide a seamless and ubiquitous wireless data access.

to reach this ubiquitous and seamless integration demands at least the following requirements: Heterogeneous connection: the messaging session should be seamless managed and user devices should have the capability to access among heterogeneous networks.


By setting TRi = 8 every node in the network has direct access to the sink, thus expending a lot of energy of the nodes because of the long transmissions, however delay should be minimal since there is only one-hop transmissions.

setting TRi to a small number will decrease communication cost a little but at the same time the data will take a long time to reach the sink.


The UDP-based implementation requires that ICMP messages are generated and forwarded by intermediate nodes.

we discovered that in many cases (48.4%) where stateful middleboxes are involved, the provider blocks outgoing ICMP messages as an answer to incoming UDP packets, which leads to problems with our algorithm.


The small value of Ld enables a fast hando..

controlling Ld is not simple because it is relevant to the lifetime of PIT entry(Lp).


In the parallel trace model, the cloaking box covers a larger area, in which users could enjoy higher location privacy values.

the users are still located inside the circle most of the time, Figure 5.


Moreover, in this case the business model is not yet clear, as operators would indeed o.oad tra.c, but also lose revenue as direct ad-hoc communication would be di.cult to charge and privacy issues may arise.

combining hotspot connectivity and multihop communications is an appealing answer to broadcasting geo-localized informations e.ciently.


The combination of downloadable Java code and Java's RMI model allows a discovered service to be loaded dynamically and then executed either locally on the client, on a service provider, or any combination of the two.

jini relies on the use of a central server which acts as a broker; it registers services on behalf of service providers and answers look-up requests on behalf of clients.


on the rate of its transmissions on the channel and how these transmissions are spread over time.

the primary network on a channel has priortized access to the channel.


The combination of the uptime distribution (Figure 6) and the session length distribution (Figure 4) present an enlightening view of churn in P2P systems as follows: At any point of time, a majority of participating peers in the system are long-lived peers.

the remaining small portion of short-lived peers join and leave the system at such a high rate that they constitute a relatively large portion of sessions.


Of particular concern here would be architectures with the primary goal of improving performance properties such as path loss or delay.

this is likely to be less of an issue for the (many) proposals that seek to add IP-level support for security, mobility, addressing, robustness, and so forth [2, 3, 7, 12, 13, 16, 17, 35 37].


As long as the sender is still online this is no problem since it will transfer the data to another node.

if the sending phase is .nished, the server is not part of the transfer any more.


Now C waits for the RREQ to be relayed along another path (A, B, G, H).

with access to ß2 transmitted by B, C has the ability to remove its immediate upstream neighbor H, or both G and H, from the path.


Low-energy nodes must try to avoid serving as clusterheads to save energy.

to balance the load of serving as clusterheads, every node should take the responsibility of serving as a clusterhead for some period of time with some likelihood.


From few Kbps per second to several megabits by fiber, the speed of network transmission has been promoted greatly.

the increase of user number causes plenty of pressure to network infrastructure construction.


For example, in a clustered network, cluster heads or gateway nodes might have higher power than other nodes.

in a certain power control scheme, a node enlarges or shrinks its transmission range according to a measured frequency in collisions.


This design means that the contents delivered through interactive channels are mainly for assisting the contents delivered through broadcast channels.

in OMA BCAST Service Guide, the contents delivered through either broadcast or interactive channels are of the same level in the data model hierarchies.


After a device has failed once, its failure probability decreases by a factor of 1.5, and the probability continues to decrease with subsequent failures indicating that it is favorable to consider repairing devices of this type when they fail.

note that for some device generations, repairs may not be as effective e.g., the probability of failure likely increases with each subsequent repair for old devices close to their end-of-life as expected.


Theories of Homomorphic Encryption, Uni.cation, and the Finite Variant Property * Fan Yang Santiago Escobar Catherine Meadows University of Illinois at DSIC-ELP, Naval Research Laboratory, Urbana-Champaign, USA Universitat Polit`ecnica de Val`encia, Washington DC, USA fanyang6@illinois.edu Spain meadows@itd.nrl.navy.mil sescobar@dsic.upv.es Jos´ e Meseguer University of Illinois at Urbana-Champaign, USA meseguer@illinois.edu Abstract Recent advances in the automated analysis of cryptographic protocols have aroused new interest in the practical application of uni.cation modulo theories, especially theories that describe the algebraic properties of cryptosystems.

this application requires uni.cation algorithms that can be easily implemented and easily extended to combinations of different theories of interest.


This causes them to deplete their energy quite rapidly.

nodes that have a larger number of neighbors than m are less vulnerable, since they typically have many busy neighbors.


In both cases, the loops were unidenti.able with a BGP event, affecting the match ratio.

nYC-25 presents an interesting case in that we were able to associate all the persistent loops (which account for 15% of the total loops) with BGP events, indicating that the loops originated during the trace.


In this design, each node s share of the medium is the same.A node with a good channel probably does not need the amount of share it gets, while another node with a bad channel would not be able to deliver its data within its share.

backscatter nodes inBuzz randomly collide in different time slots andkeep doing so until the reader signals that it has correctly received their data, as shown in Fig.


Speci.cally, if the bandwidth reserved for a channel exceeds the demand for it, other channels/applications can use the unreserved bandwidth or the idle part in the reserved bandwidth.

if the demand for the channel exceeds the reserved bandwidth, the aggregate downloading rate of the video will be capped by the reserved bandwidth.


We plan to extend our model and capture bidirectional traffic, or traffic between several pairs of providers.

we believe that the results will not differ significantly, under the assumption of symmetry.


In our design we have considered two types of users, the visitors and the firefighters.

the network performs different according to what is happening (due to sensor alarms) and to the type of content that is being delivered.


Application-speci.c alternatives tightly couple thesetwo components, only retaining counters and statistics relevant to a speci.c application context(Figure1).

we envision a minimalist approach that decouples the collection and estimationphases as much aspossible.


If the AP actually uses less airtime than Wi, then the remaining airtime is lost because it cannot be used for other clients.

immediately after it has .nished servicing the client, the AP recomputes new values for Si and Wi and instructs the client to go to sleep so that it can save energy.


In this way, if femto basestation lowers the transmission power, interference to macro user terminal can be mitigated and the macro user will operate properly without any difficulty.

in femto cell side, the cell coverage will be reduced.


5.3 Network Connectivity With the availability of ubiquitous network technologies, we ex- plore the usage of wireless networking on the digital camera as a storage management technique.

there is also an inherent battery cost in transmitting images.


v 49 msu 237 MI 3561 PL v 50 uky 10437 KY 209 PL 51 ac-uk 786 UK 3356 PL v  3.3 Validation of Bandwidth Bounds v 52 umich 237 MI 3561 PL v 53 cornell 26 NY 6395 RON v A number of groups have shown that packet trains can be used 54 lulea 2831 Sweden 1653 RON v 55 ana1 3549 CA 1239, 7018 RON v to estimate the available bandwidth of a network path [26, 18, 21].

56 ccicom 13649 UT 3356, 19092 RON v 57 ucsd 7377 CA 2152 RON the source has to carefully control the inter-packet gap, v 58 utah 17055 UT 210 RON and since Pathneck sends the probing packets back-to-back, it can- BW: measurements for bandwidth estimation; GE: measurements for general properties; ST: measurements for stability analysis; OV: measurements for overlay analysis; not, in general, measure the available bandwidth of a path.


INTRODUCTION As broadband access connectivity becomes more prevalent, more users are able to stream video over the Internet.

the besteffort service model and shared infrastructure of IP networks means network impairments (such as delays, jitter, congestion, and loss) have the potential to hamper viewing experiences.


In addition, we only consider the performance up to the DataLink Layer, i.e., we do not include protocols like TCP, UDP and IP.

the model and result of this paper also applies to networks with such protocolsimplemented.


Keeping this parameter low allows the classi.er to work in almost real-time.

letting the optimization algorithm tune this parameter even to a relatively high value allows the classi.er to obtain the most precise results possible.


6.3 The Effect of Remediation The drastic ampli.er reduction we saw was also evident in the number of ampli.ers seen per each victim IP, which also decreased by an order of magnitude across the ONP samples.

we don t show this in a .gure, but the number of packets that the average ampli.er sends all victims has actually gone up by about an order of magnitude, to somewhat compensate for the reduced number of ampli.ers.


As it has been shown in the previous sections, this model is inaccurate, as the degree is a function of speed, radio model, channel utilization and the neighbor discovery mechanism in use.

using method 2 described in the section Methods for applying Neighbor DiscoveryModel in [10], the results obtained with on/o.


Running a virtual router in unprivileged domain has unacceptable forwardingperformance [16] but running it in privileged domain yields viable data planeperformance [15].

letting a virtual network run directly in the privileged domain of the underlying hardware leads to less .exibility in customizing the virtual network,because a virtual network willbe limited to use a set of trustful elements to avoid jeopardizing the shared substrate.


A link transitions states whenever a syslog packet says such a transition has occurred.

we do observe cases where we receive two down state transitions without an intervening up transition and vice versa.


The victim s gateway cannot possibly .lter millions of .ows today s most sophisticated routers can accommodate up to tens of thousands of .lters [2].

a sophisticated attack involves a large number of routers, which can share the .ltering load with the victim s gateway; and the closer we get to the attack sources, the larger the amount of .ltering resources that are available per attack source.


Given the exponential complexity of path selection in large overlay networks, several heuristic based algorithms for path selection, using both single constraint [13] and multiple constraints [15], have been proposed.

the existing solutions for overlay path selection are not suitable for path selection in SON due to the additional constraint.


In particular a high adoption of MPTCP from servers is expected due to the signi.cant bene.ts that MPTCP provides for data centres [6].

in the meantime, few servers will support MPTCP.


For the Nissan Leaf, the battery lasts for around 160 km on the EPA (Environmental Protection Agency s) city driving cycle  at 40 km/h and with air condition off.

on highways at 90 km/h and with air condition on the battery lasts for around 110 km.


In Figure 4(c), the percentage of interested nodes in the relay candidate set is increasing in InterestSpread.

the ContactOnly has the lowest percentage while using interested nodes.


Indeed, it increases considerably with the increase of the messages generation rate, the mean size of messages and the mean number of neighbors.

the service packetsloss rate still almost negligible in the most cases of the network context and the ego node charge.


In this model dynamic constraints are encoded directly into a particulargraph realizationtechnique.

ourproposed model encodes measured displacements directly into thegraphitself, allowing a wide variety ofgraph realization algorithms to be used.


In a DVE, multiple users concurrently explore the high quality visual scenes of the virtual world.

close interactions and co-operations among avatars are likely to be improved with the addition of a multi-party immersive voice communication service, which immerses each avatar in a personalised Auditory Scene.


When the packet is delivered, each node gets a reward based on its improvement, otherwise the payment stays in the network.

analysis in [34] does not consider collusion among relays to add fake relays or to change routing utility.


MIN builds ATs using the nearest nodes from a speci.c group, which constructs ATs within a much fewer iterations both when ATs are constructed from scratch and when ATs are reconstructed after revoking faulty or compromised nodes.

oPT incurs a lower operation cost (i.e., less transmissions to send one message to all the nodes in an AT) and a slower growth in the operation cost, while it takes longer and more messages to build ATs.


This is obviously a small variation in scale, in particular for IPTD.

the shape of probing and class estimates is not well adjusted.


This is due to the fact that the Cbase scheme uses a fixed counter value for all network regions.

a node using DCB uses low threshold values when in sparse regions and high when in dense regions of the network, which aids for more packet savings.


For instance, for a typical person, two to four activities cover 75% and eight activities cover 85% of all movements observed over four weeks [3].

a human activity is associated with one or more places and paths between them.


In addition, only a single LOS communication link between a transmitter and a receiver is assumed.

neighbor discovery becomes much more complicated in 60 GHz indoor settings since a neighbor can be discovered not only via a direct beam, but also with re.ected beams.


However, in Q3MA-B, since it is an access-Q3MA, MIRA configures the network and the multicast tree only on the outgoing interface.

if unicast is used in the wireless interface, MUSC maps each session-flow to a list of interested users, and performs the required packet duplication, increasing the usage of resources.


From our initial analysis of Kwiizya tra.c, we observe the tendency of users to place voice calls instead of sending SMS messages because voice calls are free.

it remains to be seen whether this observation would continue to hold once Kwiizya is opened to the general community.


(3) When a receiver joins a cluster due to node mobility, the CH will become an MCH according to our previous multicast scheme.

we must consider whether the upstream RP of this new MCH could be merged in this situation.


Need for DNS Privacy: Traditionally, privacy of Internet tra.c has not been seen as critical.

recent trends in DNS use, deployment and documentation of widespread eavesdropping increase the need for query privacy [3].


The arrival times of the components of these media are not critical.

continuous media such as video strips and audio tracks need to retain the temporal relationships between their components.


For these users, the availability of wirelesshop security would not be a major concern.

the provisioning of wireless-hop security is still important for a number of reasons.


For ZigBee nodes, we program the transmitter(s) to change its transmit power at each transmission by randomly selecting one among four pre-de.ned transmit power levels, i.e., +4.5 dBm, -1.5 dBm, -6 dBm, and -10 dBm.

we are unable to program the random power changes in WiFi nodes and hence, we simulate these power changes.


(proved in [25]) tT (I) E[T]be_ tT_tT (II) ar(T)be_(I(ItT)e) e tTtTI (III) E[DT]ITI 2 tT (IV) ar(DT)b(etTI) tT (V) DTeT Remark: We can see that from Lemma 1(III) that DTis a bi_tT_l ased estimator of ITIwith bias e'T 2.

this bias is very small compared to the parameter ITI, since ITIis typically in millions and the tT(load factor) we are working with is no more than 0.7, resulting in a bias no more than 0.16.


The .gure shows that the feedback transmitted by the receiver at S1 S5 is properly used to update the next beamforming matrix, resulting in a raise in received power level to deal with the change in the load.

the system with disabled feedback suffers a signi.cant loss whenever the load deviates from the presumed value.


This is because the AP operates at the effective RSSI corresponding to the bottleneck client in the beam pattern in GREP d, which gives more room (in dB) for other clients with higher RSSI in the beam to cope with fading (including interference) losses.

in GRASP 2 the AP is already operating at the effective RSSI that is socially optimal for all the clients in the beam (by .ne power splitting).


After the .rst 12 hours, the PRR of the link with static transmission power in Uniform drops dramatically, and it is above 95% PRR only 25% of the time.

the same link with ATPC constantly achieves above 99% PRR while exposed in the same environment and using the same radio hardware.


The optimal solution may not completely eliminate inter-cell interference since interference below the noise power is often no longer considered the capacity-limiting factor.

identifying the optimal solution is neither practical nor compatible with 802.11ac because (i) it is computationally intractable due to the lack of an analytical solution, and (ii) it has to be done in a centralized way with full channel knowledge of the entire MU-MIMO network.


These additional transmissions contribute constructively towards the packet decoding and hence are not wasteful.

in 10% of the scenarios, the AP fails to send the speculative ACK on time.


more samples than a downstream router, nor to reorder valid routers in the path by contributing more samples than the difference between any two downstream routers.


3.2.3 Synchronized pause frame reception Enforcing TDMA slots with 802.3x pause frames simpli.es the design of the end hosts, which can now become entirely reactive.

such a design hinges on our ability to transmit (receive) pause frames to (at) the end hosts simultaneously.


Because we have a single transmitter, the MAC layer s carrier-sense and collision avoidance strategy is e.ectively non-operational.

we had to modify TinyOS s MAC so that its acknowledgment mechanism could be optionally disabled.


PROPOSED TCP SCHEME TCP is able to work in any network environment.

the bandwidth of a network may change frequently for many different reasons.


Equation(4)translates that when the di.erence between two samples of the packetgrowthrateislessthan onepacket,thenthedetector considers that there was no signi.cant di.erence in amplitude, and hence it is not an indication of a change due to congestion.

if the di.erence exceeds the thresholdof onepacket,thesignfunctiontakesthevalueof +1 to indicate a positive increase while it takes the value of -1 when the di.erence goes down below the threshold of one packet.


2.2 For the In-.ight-target Model Usually when users or Web sites want to make sure the pages are safe when .y from the server to the browser, they choose to use Hypertext Transfer Protocol Secure (HTTPS)[13], which provides end-to-end security by symmetrically encrypting each document the user requested.

this secure protocol also has some disadvantages.


Now select the route with maximum route weight for transmission of data.

if two or more routes have same or nearby same route weight then the route with minimum hop count is selected.


proposed to take advantage of location information for constructing an efficient path from the source node to the sink node.

when a lot of source nodes simultaneously send the sensing information to the sink node, applying GPSR will establish individual routing path to the sink node.


Intuitively, one wants to express that a .ner policy may also contain re.ned obligations.

since a re.ned policy might contain additional obligations, whereas some others have been omitted, it is not possible to simply compare these obligations in the obligation model of the original policy.


UDP (User Datagram protocol) and TCP (Transport Control Protocol) are two main protocols at the transport layer.

the current transport layer protocol needs changing to adapt to cognitive radio networks.


As the foundation of WSNs applications, the correctness of WSNs protocols is critical.

due to the complex runtime environment of the WSNs, it s difficult to ensure such correctness.


CCNx would likely su.er heavily due to the increased overhead of maintaining routing information; this would be further exacerbated by the complexity of routing on hierarchical identi.ers in an unstructured (changing) topology.

approaches such as PSIRP or DONA would only be able to exploit this local caching if the local Rendezvous Point or Resolution Handler were accessible, thereby negating the greater potential resilience.


To work around the limitations of current hardware, we implement a version of A-MACthat misappropriates addresses, violates standards, and abuses acknowledgments.

the goal of our work is to demonstrate the power and performance bene.ts of the design; the underlying ideas are more principled than the hacks we employ to accomplish this goal.


Recent research has also produced mechanisms for estimating other important statistics such as the total number of .ows [4], the number of .ows of size 1 [1, 3], and the .rst and second moments of the FSD [5].

such solutions are often restricted to producing estimates for onlythe complete population of .ows.


Itspreads traf.c across both short and longer paths, and with this regular traf.c matrix it actually succeeds in equalizing the loss rate across all paths.

most of the traf.c takes multi-hop paths using the network very inef.ciently.


This is one of the closest work to ours together with [21].

with respect to these works, our data transmission overhead is lower (we do not have epidemic-like dissemination) and, thanks to the prediction techniques used to calculate the probabilities, the delivery of data is still reasonably high.


For the majority of campaigns (> 60%), most emails share at least one shingle.

the likelihood of these emails sharing all shingles is very low.


Since mobile phone customization is relatively uncommon in Tanzania, this may lead to a number of issues, especially concerning usability, as the PSWs did not seem to know how to use Java applications.

the PSWs were very comfortable using SMS.


For example, we need 9 transmissions to deliver data from two sources to two sinks without aggregation in Figure 3.


These methods reduce waiting time before playing data.

we did not considerthecaseofcloserangebroadcasting.


The software components of the proposed system are implemented as Java packages.

due to the space limits we cannot describe the details of the 14 implemented PoPprotocols and the functionality of the software components in this paper.


This means that, at the .rst transmission of the packet, the transmission has succeeded or failed.

this is not true with the retransmission mechanism used in IEEE 802.11 DCF.


And even though these primitives run in O(1) the constants still add up, building up delays too huge for line speed IP lookup.

a traditional pointer machine, like a pre.x tree, can follow a child pointer in just a single indirection with only one random memory access overhead.


E.ectively, a cyclical dependency is formed and the system is in deadlock.


Maximizing resource utilization helps to reduce the gap by increasing a user s resource consumption, xi, until the amount of resource utilized reaches a desired fair allocation.

increasing consumption aggressively may cause more resource waste due to more collisions.


The decoding of these eleven tags can generally be categorized into two types.Certain tags hadavery good channel and were therefore immediately decoded from the .rst collision theyparticipated in, such as the two tags decoded in the very .rst time slot.

other tags messages were uncovered as the belief on their data gradually built up when the tags they collided with were decoded.


MAC layer time-stamping is used to reduce possible sources of uncertainty in the message delay.

tPSN does not use drift compensation which makes frequent re-synchronization mandatory.


For example, AS 2 could use the direct route (0) and AS 1 could use the route (2, 0).

the system could also oscillate between two unsta- ble states.


3 and 4, we observe that the MUB scheme maintains stable and high utility at any time and is hence suitable for the applications which desire utility stabilization.

sEN energy allocation achieves very high utility when harvesting ability is high and is suitable for the applications where maximum utility is sought.


In order to be able to guide its user to an exit, the device must know its current position in the building and, with GPS not being available indoors, this alone becomes a challenge.

gPS-less localization of devices in ad hoc networks is a well-studied task (cf.


The value a is any number larger than 4. algorithm that .nds a pure Nash equilibrium if it exists.

we now show that the simple question (dubbed Pure Nash Connectivity with Triangle Inequality) whether a given connectivity game has a pure Nash equilibrium is NP-hard to answer, if the triangle inequality holds on the input graph.


According to the results presented by the authors, this approach is able to increase tra.c .ow in urban areas by up to 60 % in comparison to traditional intersection management.

their evaluation is based on optimistic and ideal assumptions, i.e., they neglected the existence of radio obstacles, and considered a perfect communications system based on which every broadcast message is received by every vehicle within a certain distance.


These types of approaches might be straightforward and true if TCP application heavily depends on the fine-grain interaction, that is, heavy transactions between client and server like telnet session or FTP (File Transfer Protocol) control session.

some of the Internet applications like e-mail or NetNews system was implemented by batch-oriented and was transmitted over intermittent connection, UUCP (Unix-to-Unix CoPy) dial-up for example.


The cutoff scale is hard to be measured as it changes on a daily basis as a function of many factors that cannot be rigorously quanti.ed.

we observe that for practical purposes aggregate web traf.c would bene.t for caching no more than a daily content catalog.


Manipulations of sending window [4] and congestion control and loss recovery algorithms [5] have also been explored.

we are the first to observe impact of server side optimizations on cellular data connections.


SAR builds multi-path trees with considerations to multiple QoS metrics: energy consumption and application-assigned data priority.

the protocol incurs control overhead in maintaining and reacting to network dynamics.


One could already deploy these mechanisms to implement a cooperation environment with most of the demanded features proposed in section 3.

by doing so we would accept two major drawbacks: The cooperation environment would have to be hard-wired to the chosen persistency technology and the developers of the cooperative applications would need to know about all technical aspects of the object distribution and replication in order to implement the desired behavior.


Second, there may be routers or links in the RON data set that fail frequently and bias the availability of a particular router type.

since traceroutes are initiated only when a failure is detected, there is no way for us to accurately estimate the overall failure rates of all individual routers.


In this paper, it is assumed that the power consumption value remains unchanged during data reporting.

it can easily change depending on various factors, e.g.


This metric has a direct implication on the target applications since frequent expiration of the paths will lead to highly intermittent connectivity.

it can be argued that path breakage enough [7].


This is somewhat expected because the third generation methods rely on rich priors obtained from direct measurements.

what is more surprising is that with only 1020% additional measurements, we can reduce the errors by more than half.


Under the assumption of support for the IEEE 802.11e Quality of Service (QoS) mechanisms by the MAP it operates as QAP too.

with several nQSTAs in the BSS the Mesh QoS Access Point (MQAP) competes with all of them on accessing the Wireless Medium (WM).


As discussed in Section 5.1 the DE-PPG model requires only the coe.cients[a1, ..., a11]and theModelPulse to be stored at the sensor.

variations in the pulse shape of the sensed PPG trigger a raw signal update of B · Fs = 625 samples.


HyperFlowpassivelysynchronizes network-wide views of OpenFlow controllers and localizes decision making toindividual controllers.

ourdistributed controllerdesignis speci.c to route computation and path assignment based on names.


In RTS/CTS scheme, nodes which do not expect to receive packets during the idle period indicated by NAV may go into a sleep mode.

this conventional RTS/CTS scheme is not appropriate to the network coding system since the node in sleep mode cannot overhear other packets necessary for network coding.


In addition, expanding a cellular network for higher capacity to accommodate more users is expensive.

in a Wireless Metropolitan Area Network (WMAN), a base station can broadcast videos to support a large number of mobile devices within its coverage range.


Given an explicit MACaddress identi.er, it is trivial to associate packets with their transmitting device.

even without explicit network identi.ers, it has been demonstrated that otherimplicitly identifying informa- Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


This algorithm function stipulates that at the beginning, a node broadcasts the request message to its neighbors with probability 1 for the first k hops and with probability p for the rest; if a node with n neighbors receives a message and does not broadcast it, but then does not receive the message from at least m neighbors within a reasonable timeout period, it broadcasts the message to all its neighbors with probability 1.

we discovered some critical issues for a broadcasting message with probability p on the relation of n neighbors in GOSSIP3(p,k,m).


The 3GPP and 3GPP2 HNB services have been deployed commercially by eleven operators.

not all complete standardization work related to 3G, WiMAX, and LTE HNBs have been published by both the 3GPP and WiMAX forum.


When the network is not very congested, their delay constraints can be easily satis.ed.

when the network is persistently congested which is uncommon in our dataset, adopters behave the same as non-adopters, 0 RTT between UE and Market Proxy (ms) Figure 17: The impact of the delay between UEs and the market proxy.


Thus the adversary can do a Reveal(s ' ) query to reveal the session key of s ' .

because the key type is A, we have that s and s ' compute the same keys.


Over all positions, the mean location error gets minimum when using the E-TOA technique which seems to cause a slight improvement in the TOA.

the use of enhanced AOA improves the AOA accuracy in a remarkable way.


INTRODUCTION The Internet and its protocols are designed for the model of end-to-end data communication, such as clientserver data communication.

it becomes apparent that it is content itself that should be center to the model of information access [9, 11].


Generated Orthogonal Sequence (GOS) [8] is a pioneering work, which generates an orthogonal sequence of length N(N+1) based on the random permutations of {1, 2, ·· · ,N}.

gOS is limited to the scenario where all channels are not occupied by PUs and all users can access them.


Median attacks over our sample period only lasted approximately 40 seconds in the samples since mid February, and about half or a quarter of that in previous samples.

the 95th percentile duration attacks lasted about six and a half hours in the January 10th sample and have been declining since, with 50 minutes being the 95th percentile duration in the later April samples.


For instance, selective forwarding attacks and blackhole attacks are node related attacks that cause partial and total packet losses, respectively.

interference attacks may also be responsible for packet losses as they have a negative effect on the network links and regions depending on the interference source location and strength.


However, when the speed of UE is high, the interfrequency handover failure rates will greatly increase with the longer measurement gap periods.

when the measurement gap interval increase, the UE power consumption will substantially decrease, comparing to that of the currently existing short measurement periods of 80ms.


RELATED WORK Various related techniques have been proposed to address the issue of delivering multicast or broadcast content using a hybrid infrastructure/ad hoc network architecture.

because these have only been evaluated in simulation and emulation environments, their performance in a realistic wireless environment is not fully understood.


Among all algorithms, Epidemic routing again has the highest delivery ratio.

for most TTLs, ML-SOR and H-Bubble Rap perform the same as Epidemic routing.


As before, this decrease should be performed carefully such that the event-to-sink reliability is always maintained.

the network operating in state (C,HR) is farther from the optimal operating point than in state (NC,HR).


On the one hand, the centralize strategies CMS and CMSA introduce many signaling messages to synchronize the maintainer robots with their manager.

with A-DPMS, the obtained signaling cost is induced by the multiple transition probability matrix copies transmitted to each maintainer robot.


Given this probability, two active links can be maintained when the user is likely to handover.

the WA link will be released when the user does not need to handover to the WA system.


Since such unexpected tra.c is likely to be dropped by the destinations themselves, classi.cation inaccuracy is not a show-stopper.

it implies that if deep packet inspection capable .rewalls are available, then policies must be de.ned to forward all tra.c to them, rather than allowing tra.c to skip .rewalls based on their 5-tuples.


We define a failure as the event that occurs when a system or component isunabletoperformitsrequiredfunctionformorethan.. s. Asexpected,mostfailuresaresmall insize(e.g.,...

of network devicefailures involve < .devices and... of networkdevicefailures involve < .. devices) while large correlated failures are rare (e.g.,thelargestcorrelatedfailure involved... switches).downtimescanbesignificant:...offailuresare resolvedin..min, ...in< .hr,.....in< .day,but.....last> ..days.


Generally speaking, the simulation results have shown the right trend as expected and provided a good approximation to the measured results.

we notice that the simulated results are more optimistic than the measured values, especially at smaller channel di.erences.


Because A can only discover neighbors in slots where S also does, there is limited information that A can learn but S cannot.

a device C frequently becomes active in slots where S is inactive (e.g., slot 3, 6, 9 and 15).


The queuing system provides four levels of hierarchy and 2K queues per port, allowing various combinations of de.cit round robin, hierarchical fair queuing, token buckets, and priorities.

it cannot simulate the sorting required for say WFQ.


Further, they operate independent of each other.

while the transmitter is active and backscattering signals, the receiver and harvester cannot capture much signal/power.


The devices in such a scenario are ad hoc in nature, i.e., they can neither be assumed to have a prior context (such as pre-shared secrets) with each other nor do they share a common trusted on-or off-line authority.

the devices can generally be connected using auxiliary physical channel(s) (such as audio, visual, etc.)


Thus, we can use a compressive sensing solution to ef.ciently recover x with a small number of linear combinations.

traditional compressive sensing algorithms are computationally infeasible to apply in this setting because A has as many columns as the number of nodes in the network (e.g., one million itemsinaWal-Mart store).Todevelopa practical solution, we exploit the sparsity in x to eliminate large chunks of columns in A.


In common with GUIDE the position of the WaveLAN base station can be used to provide a fix on location.

the OnTheMove system can also gain a location fix using GPS, if sufficient satellites are in view.


The Max-Prod scheduler provides very good performance at low traffic loads: the outage probability is negligible and the average utility tops the rest of the schemes together with the Max-Sum.

as the load increases, the performance of the Max-Prod scheme in terms of the average utility and its variance worsens abruptly.


Likewise, RPL[31] speci.es mechanisms that can be used in lieu of the 802.15.4 security sublayer.

these surgical security mechanisms introduce complexity and cannot prevent PDoS attacks.


We could not give analytic characterization to the equilibrium strategies.

we applied numerical analysis to see which strategies are equilibrium for some values of ., µ and Co .


Directional antennas can usually provide stronger signal strength than omni-directional antennas, which, in turn, can increase the data rate and improve individual link throughput.

in this paper, we wish to focus only on the improvements achieved by spatial reuse.


Once a C-TC arrives at a given cluster, it must be relayed to adjacent clusters only if the previous one selected the current cluster as a C-MPR.

in case the latter condition does not hold, the C-TC must still be forwarded inside the own cluster.


However, this solution only focuses on addressing bypass threats in OpenFlow-based networks.

fLOW-GUARD is a comprehensive framework for building robust SDN .rewalls to enable both accurate detection and .exible resolution of various .rewall policy violations in dynamic OpenFlow-based networks.


Each downloader sends requests to seeds and to other downloaders.

at any given time, the downloading demand of each downloader is D. due to the .nite supply of upload connections, a downloader might only acquire n download connections (0 = n = D).


The DCG method achieves high data accessibility by making good use of the information on the network topology.

since every host has to broadcast its host identi.er to grasp the network topology at every relocation period, the tra.c in the entire network becomes large.


Instead of taking into account these complex timing-dependencies between di.erent nodes sending in white spaces, we assume that in any (small enough) time-interval of duration t, the probability that a transmitting node returns to the control channel is .ret(Q)=(N - Q) · t/Tmax.

the probability that in a time-interval t, there is at least one successful handshake on the control channel can be approximated as psuc(Q) · t µsuc(Q)= .


(a) Unseen .ows (b) Unnecessary view (c) Rule explosion Figure 1: The problems introduced by the coupling between the visibility and the operability Figure 2: The architecture of FlowInsight O(m).

when they are composed into one .ow table, the number becomes O(nm).


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

in the time division scenario, the SNR remains the same across the entire frame.


pletes at time A (labels on right side of .gure).

for WPA/WPA2 secure association, a 4-way handshake at time C is expected.


This allows a fundamental analytical comparison of the e.ectiveness of each algorithm in identifying heavy-hitters.

in practice, it maybe unfair to compare Sampled NetFlow with our algorithms using the same amount of memory.


Time lines can be used to measure time since after n clockings of a given time line, at least n times a given amount of time (say n seconds ) passed.

clocking of time lines can take place much less frequently, hence only very weak synchronization among di.erent parties can be realized using time lines.


5.1 Bene.ts from Adjusting GOP and Adjusting FEC 30 the packet loss percentage is higher than 6% the best possible GOP pattern yields an absolute playable frame rate below one frame per second (fps).

the bene.t from Adjusted FEC is very high.


This approach provides deterministic guarantees about message communication and, therefore, is desirable for reliable dissemination of bulk data in sensor networks.

the major drawbacks of using TDMA schemes include issues with scalability and the strong need for accurate time synchronisation between nodes.


In general, constructing the optimal policy is very di.cult.

it can be done in a setting with 2 .ows and 2 possible rates for the channel state.


The motivation is that, even when the number of neighboring APs is large, at most 3 or 4 access points are targets of the hando.s [9]; it is likely that a similar motivation applies for ICNs, since the movement of users is the cause for mobility in both cases.

the application of such an idea for supporting mobility in ICNs is di.erent due to the di.erent nature of the problem: in ICNs the objective is to forward to mobiles items that match their subscriptions, whereas in [9] the objective is to proactively send a mobile s context to neighboring access points in order to reduce association delay.


The solution of the MIP tells us how many copies of each video are needed and where each copy should be placed so as to minimize the total network bandwidth consumption.

due to the scale of the problem, we .nd that eventhelinearprogramming(LP) relaxation of ourMIPistoolargeforo.-the-shelf software(e.g., CPLEX)to .nd an optimal solution within a reasonable time.


Best value O = 65o In general, deterministic approaches have low memory and processing complexity, since for each point only the mean values of the SS samples from all APs need to be stored and compared.

for probabilistic schemes, the probability distributions of all SS samples values need to be calculated and stored.


in [19] use utility to choose the .ttest custodian nodes which would carry the message.

in both papers in the context of DTN, there is no network-wide optimization of the accrued utility.


This is expected, since vehicles (c) 10:00 am -3:00 pm(d) Zoom leaving one cell necessarily move to an adjacent cell, generating large .ows between close-by cells.

it is more interesting to note that there exist several macroscopic .ows 1.0 2.5 1.0 5 0.5 0.5 4 of vehicles among distant cells (i.e., from 1 km up to 4 km 2 0.0 0.0 away) and that involve hundreds of cars per hour.


Withthismorepowerfulattaker,wealsoneedtodevelopamoreompliateddeodingproedure.Westart withsomeintuitionforthisdeodingalgorithmbydevelopinganexpressionfortheprobabilitythatapakethas hosetto1whenitarrivesatNo.LetvkbetheprobabilitythatapaketPisresetbysomenodebetweenN andN1,inlusive,andIot=k.Ifz(n,k)isthenumber ofintegersi,1:i:n,suhthatimodd=k,wesee j(.kk)p)(j-1)d+k-1 ak thatvk=j=1p(1-.Also,letjbethe probabilitythatapaketthatarrivesatNoisresetlastby somenodebetweenNandNk+(j-1)d,giventhatitisreset bysomenodebetweenNandN1,andthatIot=k.From 1j(.kk) -1)d+k-1  Bayesrule,weobtainak=np(1-p)(L jvL=j  LetPkbethesetofpaketsPsuhthatIot=k.For 0:k:d-1,letqkbethefrationofpaketsinPksuh thatnonodebetweenN1andN(inlusive)performsareset onthepaket.Notethatqkisnotavaluereadilyavailableto thevitim;animportantportionofthedeodingalgorithm isomputingforeahkavalueqikthatservesasanestimate forqk.Considerapakethosenuniformlyatrandomfrom thesetofpaketsinPkforwhihtheattakersetsho =t, fortE{0,1}.Theprobabilitythatthepakethashosetto 1whenitarrivesatNois j(.kk) j-1 Lj(.kk) k t r pk =t.qkrBk+(j-1)d(qk(1-qk)aj) 2 j=1 Thus,ifweknewexatlythevaluesqk,thedeodingproesswouldnotbeverydiferentfromthesinglebitprotool.

withoutatleastafairlyaurateestimateforqk, suhadeodingproesswouldnotbeabletodeterminethe stringBuniquely.Wenextdesribeadeodingalgorithm thatomputessuhanestimate.Weheredesribethisalgorithmfortheasewherethevalueofnisknown.thesameproessappliesforanyvalueofe:ndetermined bythevitim:thevitimandeodeanyprefxofthepath uptotheattaker.Weherealsodesribetheeasieraseof thedeodingproesswherep:1 .Wealsowanttoemphasizethatforthisversionofthepaper,wehavemadeno attempttooptimizetheonstantsofthealgorithm.The algorithmworksasfollows: No waitsuntilit hasreeived  ()2() ef 4.4ed F=ln(4d/.)pakets.


5.2 Experiments to Validate the Metrics To study how well the metrics can be used to estimate or predict algorithm performance, we need to measure actual algorithm performance under various channel conditions and compare the obtained throughput with the estimated throughput.

an underlying issue here is what channels should be used for this purpose?


Speci.cally, when TDMA scheme is adopted at the second hop, the number of cooperative relay nodes was optimally selected such that the best performance can be achieved.

when the FDMA/CDMA/SDMA scheme is adopted, the outage probability decreases with arising of the number of relay nodes.


The event type scheduling algorithm minimizes the number of event types to be sensed by each node and provides statistical coverage assurances for each event type without requiring node locations to be known.

the coding rate Copyright is held by the author/owner(s).


If the broadcast packet from the AP for switching phase is lost, a client will not switch phase and a.ect Symphony functionality.

this can be easily .xed by utilizing the client s local clock to switch phase at the appropriate time if the broadcast message is not received within a tolerance, much like how NTP [4] functions.


3.2.1 Energy Consumption of Pro-active or Table-Driven Routing Protocols  Pro-active (or table-driven routing protocols) work in a way similar to wired networks: based on the periodically exchanging of routing information between the different nodes, each node builds its own routing table which it can use to find a path to a destination.

keeping the information up-to-date, it may require a lot of bandwidth, which is sparse, and extra battery power, which is limited in mobile ad-hoc wireless sensor networks.


The existence of asymmetric links due to various transmission power levels at each node was considered in [16] and a distributed algorithm to construct a directed minimum spanning tree was suggested.

these works implicitly assume that a low node degree leads to low interference, which is not always true [17].


At .rst glance, it might appear that, since the problem of power ampli.cation is an old one, it should have been already solved.


TCAM-based solutions [13] provide deterministic performance, but do not scale well in throughput and power with classi.er size.

rAM-based algorithmic solutions have the potential to scale well in throughput and power.


1.2 Summary and Limitations of Prior Art IP lookup has long been a core networking issue and various schemes have been proposed.

none of them satis.es the two requirements of both constant lookup time and constant on-chip memory usage.


Jinsong Han, Yunhao Liu HongKong University of Science and Technology {jasonhan, liu}@cs.ust.hk Abstract Reputation based trust management is increasingly popular in providing a quantitative measurement for peers choosing reliable resources and trusted cooperators in a decentralized Peer-to-Peer (P2P) environment.

existing approaches do little regarding the validation of a peer s reputation, that is, it is challenging to guarantee the validation and accuracy of computing a reputation value due to malicious denigration or overpraising.


4.1 The Role of IPs and Geolocation IP address variation is often regarded as a strong indicator of botnet activity and often used as a reliable metric to detect spam.

it is unclear what should be adopted as a threshold for this metric, how many di.erent IPs should alert us of a distributed malicious activity, or how accurately we can classify email campaigns simply by looking at their IP address distribution.


Other classical utility and cost functions that are extensively used in noncooperative power control algorithms are discussed in [2] and [9].

they do not focus on maximizing the number of feasible links, but they incorporate pricing as a method to find a (more efficient) Nash Equilibrium.


(i, B(i)), Q(e(i), B(i)), and L(i, B(i)), on B(i) in the rest of the sec tion.

unless mentioned otherwise, the proofs and the algorithms are also valid when the dependency on B(i) is considered.


The OLSR protocol supports nodes having multiple interfaces.

oLSR employs a flat mechanism, whereby a node sends HELLO and TC messages through all its interfaces without regard to the link capabilities of the other nodes.


As for the video performance, the possible effects of high latency and variable jitter values can be mitigated with adaptive algorithms.

throughput degradation may cause serious problems.


There were no false positives for any of the Tl values.

in one instance we obtained no true positives either (i.e., the algorithm was unable to identify any masked host as infected.)


The LSSL takes up less bandwidth and reduces the computational load on the client side, transferring the majority of the computational work, mathematical and encryption operations, to the server side.

securing the R-CFG download connection is only one piece of the whole scheme, and it does not guarantee that a valid R-CFG has been downloaded.


In general, a higher data rate results in shorter frame durations, thus producing less interference.

a higher data rate requires more power to transmit towards a certain intended range, thus producing more interference.


A slight difference in the percentage of MPRs is due to variations in the time that Hello messages are received during each simulation repetition.

the data trend is what we have to look at, which is the same in both cases, before the traffic is injected.


Browsers such as the Pocket Internet Explorer (PIE)[6] are developed with capabilities that can address resource constraints on mobile devices.

they do not optimize communication performance which is the focus of A3 .


Poster Abstract: Supporting Heterogeneous LCD/Camera Links Frederik Hermans*, Liam McNamara , Thiemo Voigt* , Christian Rohner*, Edith Ngai*, Per Gunningberg* *Uppsala Universitet, SICS Abstract Visible light communication over LCD/camera links offers a potential complement to traditional RF communication technology such as WiFi or cellular networks.

the heterogeneity in receivers (e.g., mobile phone cameras) presents a challenge because the receivers differ widely in resolution, distance to the transmitter (LCD), and other factors, and therefore they differ in channel quality.


Thus, the data packet delivery fraction remains high even for larger values of a.

larger values of a imply that the nodes may have more stale routing information, increasing the likelihood of the data packets 1 0.9 0.8 0.7 0.6 0.5 0.4 0.3 0.2 0.1 Data Packet Delivery Fraction encountering broken links.


Note that we do not claim that Dispatcher is generally more accurate than Wireshark since we are only evaluating a limited number of protocols and messages.

the results show that the accuracy of the message format automatically extracted by Dispatcher can rival that of Wireshark, without requiring a manually generated grammar.


We outlined the groundwork for SDPP to be employed in MANETs of slow-changing topology.

sDPP can be foreseeable employed in any MANET in which the topology change rate is low enough to allow the learning system to respond accordingly before going into oscillation.


Traditionally, the computing (data) networks have been designed, constructed, maintained and managed as separate entities.

there have been dramatic changes in this approach over the past several years as voice over IP (VoIP) has emerged and moved voice communication from the dedicated circuit-switched network of the PSTN to the packet-switched data networks of the enterprise.


in other words, X can issue RTS only if this communication does not interfere with n or m. the RTS issued by X will be selectively omni-directional : X will issue RTS avoiding interference with n and m. Similarly, Y will respond to this RTS by sending a CTS if the directional beam from Y to X does not captures n or m, and the CTS issued by Y will also be selectively omni-directional : Y will issue CTS avoiding interference with n and m. Now, some nodes in the areas around n and m will not receive RTS/CTS from X and Y and therefore will be unaware of this communication event between X and Y.


INTRODUCTION Spatial diversity, in the form of employing multiple transceiver antennas, is shown to be very effective in coping fading in wireless channel.

equipping a wireless node with multiple antennas may not be practical, as the footprint of multiple antennas may not .t on a wireless node (particularly handheld wireless device).


DK Lee*, Kenjiro Cho , Gianluca Iannaccone , and Sue Moon* KAIST, IIJ Research Laboratory, Intel Research Berkeley {dklee, sbmoon}@an.kaist.ac.kr, kjc@iijlab.net, gianluca.iannaccone@intel.com ABSTRACT Delay is a key Internet performance metric and its stability, variation, and abrupt changes have been well studied.

little could have been said about the Internet-wide delay distribution.


Both the Mellanox HCAs and Chelsio RNICs can support the TCP/IP protocol suite.

we should note that their internal implementations for TCP/IP are di.erent.


Sm moves a small unit of distance in an selected direction and then, Sm needs to exchange the BEACON message to estimate the distance to Si.If Sm is able to hear from Si, it is moving on the correct direction (Figure 5b).

in this case, it will continue to move on the selected direction to reach the target Si.if Sm is moving on the wrong direction (Figure 5c), it needs to turn back the previous position and then move to the other direction.


The architecture proposed by [17] is more .exible, and enables the connection of WLANs administered by the operator, shared between operators and managed by the customer.

they assume corporate customers with infrastructure-based and stable networks.


5.1 RNC state machine dynamics In the past, RNC state machine has been modeled using probes and external power meters [1, 9].

although this identi.ed one of the main energy sinks of mobile systems, they are static and inaccurate as they are obtained in situ .wehaveused RILAnalyzer to record actual device RNC states and demonstrate that RNC state machines are much more diverse, necessitating more complex solutions for improving device performance and energy consumption.


In short, WLAN systems are great for hot sport coverage, while 3G systems provide global coverage and the necessary network and management infrastructure to cater for security, roaming, and charging requirements.

the integration of different access technologies may bring the vulnerability of cross-platform attacks to the confidential information.


Measurements are inherently bound to the present they can merely report the state of the network at the time of the measurement.

measurements are most valuable when they are a useful guide to the future; this occurs when the relevant network properties exhibit what we will term constancy.


This happens because the ingress switch has to encapsulate a packet and then look up the next-hop table with the outer header.

sEATTLE requires less packet processing overhead than Ethernet at non-ingress hops, as intermediate and egress switches do not need to learn source MAC addresses, and consistent hashing (which takes around 2.2 us) is required only for ARP requests.


From these results, on one hand, we can conclude, the best strategy for the operator, independently of the user actions and the network load, is again to accept a new user (payoff a12).

the strategy that gives the best reward to the user is the one that corresponds to payoff b32.


This dynamic approach has the ability to cover channels with few interfaces, thereby o.ering the potential to balance the load over di.erent channels and to improve the capacity under heavy load.

it may alter the network topology: some links are created while others may disappear.


During the activity period, the user is transmitting and receiving packets.

no tra.c is exchanged with any networkduringidleperiods, e.g., userreading time of downloaded content.


While not shown for 5: Sleep(T ); 4 k + 1 switches con.rm proposal) simplicity, a switch can further con.rm its notion of position 6: If (more than 7: my pos = proposal; 8: If(my pos = 0) 9: my pod = Request from Fabric Manager; 10: Update taken pos according to replies; change, this may still be a viable option.

to explore the limits to which PortLand switches may be entirely plug-and-play, we also present a location discovery protocol (LDP) that requires no administrator con.guration.


Generally, an incorrect diagnosis is unacceptable because the error information may be propagated to the base station or users.

an incomplete diagnosis is acceptable under certain circumstances.


From the above discussion, it is con.rmed that in ASAP/LD, although con.icts of slot assignment often occur, this has a little impact on channel utilization.

if the average density is very large, the deterioration of the e.ective channel utilization may not be negligible.


In TCP, since reliability is performed at the sender while resequencing is performed at the receiver, RCV.NXT is conveyed as the cumulative ACK to the sender for it to perform loss detection.

rCV.NXT conveys limited information about the state of the receive buffer, and hence early implementations of TCP that rely on the cumulative ACK for performing loss detection, suffer from recovering at most one loss per round-trip time, in addition to incurring frequent timeouts [10].


[2] model shows that if the number of active stations is 2, the capacity of the 802.11 could be up to 87.3% providing that the overhead of physical layer is not considered here.

if this number is up to 256, the theoretical capacity is only 14.5%.


Note that these estimations could come with a number of uncertainties and dependencies among each other.

as a .rst step, we assume that the traf.c and the associated revenue generated by a node is independent of other nodes in the network.


Theconsequence is that BitTorrent builds a random graph, connecting the peers, that has a larger diameter in simulations than in real torrents.

the diameter has a fundamental impact on the e.ciency of the rarest .rst algorithm.


Note that even smaller order chains perform adequately with the source coding overhead of less than 1% for all cases.

the inter-arrival-rate random variable incurs profound overhead for smaller order chains.


In the mass of the PAR readings, we can see that lower sensors receive less light.

though the mass of the distribution at each height moves closer to zero as height decreases, we see in the outliers that the incident PAR sensors still see almost the full range of light readings at every height.


It is this decoupling between infrastructure and service provider that would enable service providers to deploy a customized network or new service without needing to build an expensive infrastructure.

this model of hosted virtual networks raises a new class of security concerns.


Given the high probability of being out of the field-of-view of the neighboring vehicles, we expect that with the vehicle-tovehicle broadcasting limited to one hop, V2LC cannot maintain a reachability of 100%.

the performance of V2LC can be improved by either allowing 2-hop broadcasting or increasing the number of transmitters/receivers on the vehicles so as to enlarge the aggregate field-of-view angle.


This is because with increasing density of APs, it becomes possible for the clients to have stronger channel with the APs, thereby mitigating the e.ect of hidden terminal (due to data rate adaption and closeness to the AP).

with increasing density, the probability of two clients picking the same backo.


We have implemented Fedorov s exchange algorithm, which has been shown to yield the best performance among many existing algorithms [21].

our experience suggests that the additional path exchanges do not yield noticeable performance improvement in the context of network performance inference.


The MAD mechanism is built on top of decentralized 802.11 MAC for channel acquisition.

mAD gives each sender centralized control over its own multiuser diversity but with only partial feedback from its receivers.


Furthermore, in low power low rate UWB communication, LDC algorithm has been studied to improve the protocol design of medium access control (MAC) layer[7][8].

the design of the duty-cycle of impulse-based UWB communication system with LDC algorithm (LDC-UWB) has not been presented.


Therefore, our proposed routing protocol has several outstanding properties of Hop metricbased routing algorithm: simplicity in routing algorithm, stability and backward compatibility in operation (loopfree) and ease and practicability in implementation.

our proposal can overcome the big drawback of HopCount metric.


a = Number dropped packets / Number generated packets (5) Thus, when the loss rates a[i] of a given high priority flow exceeds a certain thresholds PCG[i], the corresponding AIFS is linearly decreased to mitigate the loss rate.

when the loss rate don t exceed PCG[i]/2, the AIFS is linearly increased in order to give more medium access opportunities to the best effort flows, and hence achieving better wireless medium utilization.


This suggests that a natural way to reduce the number of hot-potato routing changes would be to have rich peering at every PoP.

having rich peering at all locations is infeasible in practice, due to cost and geographic constraints.


The goal of maximizing the provider s revenue (utility), throughput (or resource utilization) in such a singleprovider system was harmonious.

in a competitive market, these two goals may not necessarily lead to the same resource management strategy.


This approach deliversalarge percentageof messages successfully,providedtheaverage link uptime is at least 60%, because the probability is quite high that an end to end path will be foundbefore anymessage expires.

the delivery ratio declines sharply as the link uptime percentage declines below 60%, resulting in a very low message completion rate with a link uptime percentage of 20% or less.


This solutions have an advantage that the selection is up to the MN.

the consideration of the RS and the RA signaling timing is needed, because the timing between sending RS and unsolicited RA are mutually independent.


For example, PDAs (Personal Digital As- sistants) typically provide a diary, address book and basic word processing.

the establishment of the Wireless Applica- tion Protocol (WAP) [4] means that PDAs and other dovices can easily be connected to the Interact.


Canali et al [21] install web applications on shared hosting providers and issue abuse reports on them.

we measure malicious activity by cloud users renting virtual machines.


During this time, the sender will continue to send native packets until it reaches the maximum number of outstanding native packets, at which time it stops transmitting until it receives an ack from the receiver about the status of these packets.

given that all packets were erased, and acks are triggered by packet arrivals, the receiver will also be waiting for the sender, creating a deadlock.


The rest of the users are served using DCH to cover the remaining outer cell area.

none of the above MBMS power control mechanisms takes into account the ability of the base stations to support many simultaneous MBMS sessions.


This does not a.ect the route or the search cost.

performance does depend on the homogeneity of the mobility processes.


For a .xed transmission rate, they are interchangeable.

they give fairly di.erent views of the system in practice: Because of the clear channel assessment (CCA) aspect of the 802.11 protocol, heavy tra.c near the transmitter inhibits it from sending.


A protocol s routing effort increases as the number of nodes increases.

we still want the protocol to have a high performance.


[23] use ORBIT to ex periment with rate control and frequency selection in 802.11, and comment on the use of channel diversity.

their use of the term corresponds to neighboring pairs of nodes using di.erent frequencies, which di.ers from the con cept of diversity used in this paper.


CONCLUSIONS AND FUTUREWORK Replicating content across a geographically distributed set of servers and redirecting every client to the server with least latency is commonly expected to signi.cantly improve client performance.

using data from Google s CDN infrastructure that serves over 170K pre.xes across the Internet, we .nd that routing inef.ciencies and packet queueing can greatly undermine the potential improvementsinRTT thata CDN can yield.To aid administrators in the taskof debugging instancesof highRTTs, wehavebuilt the WhyHigh system which .rst identi.es affected pre.xes, then prioritizes the several tens of thousands of in.ated pre.xes, and .nally diagnoses the causes underlying these cases.Wesee signi.cant improvements in client latencies offered by Google s CDN from the use of WhyHigh over the course of a year.


In traditional routing, each interior network node, which is not a source or sink node, simply forwards the received data or sends out multiple copies of it.

network coding allows interior network nodes to perform arbitrary mathematical operations, e.g., summation or subtraction, to combine the data received from di.erent links.


[5] and [6] discuss how to adaptively select packet size and transmission power level, respectively, to reduce energy in multi-hop communication.

the multi-hop transmission is indeed a sequence of direct point-to-point transmissions.


As mentioned in Section 2, the message authenticity process relies on a 64 bit explicit nonce, i.e the concatenation of the Epoch .eld and the Sequence Number .eld in the DTLS record header.

the presence of multiple sender nodes inevitably leads to reusing the same explicit nonce values, and makes it impossible to check that received multicast messages are actually fresh.


The models of this kind of networks can be applied to many areas, such as modeling the .ow of information through a distributed network and studying the spread of a disease through a population.

over the past few years, time-varying graphs (TVG) has recognized as the fundamental model for mobile network s. di.erent to the traditional static graphs, timevarying graphs perform dynamically and consequently more complex.


Our work on carrier sense in the presence of ongoing transmissionsisrelatedtopacketdetectioninZigZag[12]and carrier countinginSAM[31].These schemesdetectthe number of concurrent transmissions using preamble correlation.

n+ projects on a space orthogonal to ongoing transmissions, which cancels out theinterference.


This is useful to estimate the dual and single polarized MIMO capacity.

it is difficult to directly derive the XPD in the cell coverage planning of OFDMA-MIMO systems.


It shows better performance in terms of the network lifetime and the dissipated energy than those protocols that apply the same probability to the whole network.

the work of CODA relies on global information of node position, and thus it is not scalable.


This .exibility is one of the key factors contributing to the robustness and scalability of the P2P paradigm.

this .exibility also Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Sensor-enabled cars can locally exchange sensed information about tra.c and adapt their behavior much earlier than regular cars.

the accuracy level of sensors is a major challenge for merging algorithms, because inaccuracies can potentially lead to unsafe merging behaviors.


In simulation systems, time depends only on simulation progress; the actual computation time of events has no e.ect on this progress.

in emulation systems, time advances independently of emulation progress.


Regarding the hybrid protocols, the values of the .ndings are in-between that of the DAR and the LAR for the same reasons mentioned above.

the Threshold Hybrid protocol is cheaper than the Energy Hybrid protocol and consumes almost as much energy as DAR.


And then, we emulate lower-speed coprime ADCs by subsampling the 1GHz signal.

since our testbed has only 20 USRPs, we divide them into 10 receivers and 10 transmitters and capture 250 MHz at a time.


For example, ISPs measure and log information locally and correlate on an intra-net basis.

rarely is there correlation of such information with other monitoring sites.


The packet at the end of each chain is signed and the signature is sent along with the packet.

this approach relies on the reception of the signed packets at the receiver.


The current approaches to IP mobility are designed to ensure that the transportprotocols are unaware of the changes in the network location of a mobile node.

unlike our proposal, this is achieved by using one IP address (e.g.


The data suspension duration during intrasystem handoff is thus signi.cantly reduced.

in some exception cases, intra-system handoffs within 3G/4G networks still incur accounting gap.


Analyzing upstream traf.c for this purpose cannot be done reliably: because our monitors are less sensitive than the AP, if the AP misses an upstream frame our monitors will likely miss it as well, which biases our upstream sample toward successful receptions.

our monitors capture nearly all downstream traf.c, and so retransmissions are reliable indicators of previously failed attempts.


When a node is at capacity any newly generated data by is dropped due to insu.cient storage.

node 4 did reach capacity several times, but in all cases, a MULE was nearby to o.oad some or all of its data.


They show that their approach works for many interesting protocols.

this approach is intrinsically heuristics-based and cannot guarantee the correctness of the replay.


One basic problem is how to characterize the usefulness of the image data and how to optimize the network to achieve better quality of information.

very little e.ort has been devoted to this .eld.


Among these paths (barriers), we want to select the barrier which requires the minimum number of active cameras.

the number of s - t paths can be an exponential function of the number of nodes.


Our tests indeed show that EMM signaling messages are lostwhen the radio transmission is bad.

we do not observe theimplicit detach due to lost signals.


The DFS-100 algorithm missed about 17% of the contact information for the mobile-mobile data, on average.

the DFS-500 algorithm missed 10% of the contactsin the mobile-mobiledata.


The main advantage of such systems is their privacy, which is equivalent to that of paper cash.

double spending is a serious risk, preventing which requires either the overhead of online communication with the bank that issued the cash or the provision of a secure hardware device (e.g., smartcard) at the clients to detect or prevent duplication.


Some of these are: state maintenance at the RCA, network overheads, and loss of data while communicating with the RCA.

since the reputation scores are intended to give a general idea of peers level of participation in the system, certain amount of inaccuracy is acceptable.


These efforts make IP communications on LLNs ef.cient and possible.

increasing protocol complexity and security functions that are required to be added in the future makes developing the IP border router for LLNs harder and harder.


Both of them model the same piece of road (4km long) and have the same overall car density.

in the .rst one cars are placed in a deterministic, equally-spaced fashion (Deterministic Vehicle Density Fig.


The proposed protocol cannot prevent such an attack.

the in.uence of the attack is localized to a ring, and it is relatively easy to identify the attacker, as the attacker will join in the same ring with high probability due to the node admission rule.


Since dormant registration and deregistration requires additional signaling, the mobile terminal might decide to not enter dormant mode in case the ratio between SI and SD approaches 1.

there is space for optimization when the PC can be co-located with the mobility anchor.


In this case, the company that sells the software is obligated to provide technical support to the customer.

using OSS, companies could be faced with situations of needing some quick answers but find that it either does not get it in a timely manner, get no support at all, or they have to pay a significant fee for help.


Femtocell is recently introduced for throughput enhancement and indoor coverage extension.

interference problem between the macrocells and femtocells should be solved in advance.


(Speci.cally, the recipient must transmit an ACK exactly 192 µs after decoding the incoming packet s last bit, and transmitting the ACK packet takes 352 µs at 802.15.4 s 250 kbps data rate [12, 15].)

tinyOS disables the CC2420 s hardware auto-acknowledgement feature due to concerns over its reliability [4].


With this approach, the module is able to detect individual channels as long no other protocol interferes.

di.erentiating multiple interference sources that operate in the same frequency range remains as open challenge.


We brie.y examine how STAC can be achieved using a centralized entity, and propose a location-oriented challenge response protocol to support STAC.

we believe that centralized schemes can expose a user to a severe privacy risk, and therefore, in order to achieve better user privacy, in Section 5, we turn our focus to the problem of using the sensor network to enforce STAC policies.


Thedissolutionof thelargest componenthappens due to the sudden percolation of holes in the networks at r 0.2 which disintegrates the network into a large number of small disconnected components (Fig 1(b)).

in presence of proper rewiring, p2p network shows graceful degradation in face of churn.


Generally, not until all particles weights become zero and particle .lter crash will we realize the localization has failed.

the particle .lter may have failed positioning correctly for a long time before we realize.


Today s NICs have intense calibration procedures that mostly eliminate these issues.

the variation across links with 802.11a/g/n OFDM comes from frequency-selective fading [13, 27], which does not af fect spread-spectrum modulations in 802.11b.


There are many techniques available in the data mining literature to discover statistical causal dependencies, such as linear regression and partial correlations.

they are not directly applicable in our context due to two main problems: (i) many event-series pairs exhibit strong cross-correlations among each other, which causes regression and partial correlation coef.cients to be inaccurate (this is commonly known as the problem of multi-collinearity), (ii) regression when used to distinguish cause and effect produces erroneous edge directionality in noisy data.


As explained in Section 4, the optimal strategy for the jammer would yield * * Kw + K s = UHSzUH.

(83) in the general case with .nite JNR, the energy available at the jammer could be not su.cient to provide a total interference signal (jamming signal plus thermal noise) beamformed along the left singular vectors of the channel H. Nevertheless, we aim to provide a jamming strategy that exploits the optimal directions as soon as the JNR enters the feasibility region of Section 5 * Kw = Kw + .w = UHSwUH + .w, (84) in which S w = diag{s w,i}, with sw,i = 0, for i =1,...,KM and KM s s,i = EJ.


Consequently, the sequential search of the rules at the leaves of each tree would add up to a signi.cant number of memory accesses if we are limited to retrieving only one rule instead of wider accesses.

the leaves in HiCuts and HyperCuts hold pointers to the rules which are held in a table separate from the trees.


The physical deployment cannot be easily changed once the network is deployed.

by tunning the sleep planning protocol, the soft deployment can be .exibly changed upon new requirements.


This e.ect causes for the increase in packet errors with distance for both fOFDM and FBMC.

at the shortest distance, the packet error rate of FBMC is about 56× smaller than that of fOFDM.


An extremely useful approach to pro.le tra.c is to extract and display to a network administrator the multi-dimensional hierarchical heavy hitters (HHHs) of a dataset.

existing schemes for computing HHHs have several limitations: 1) they require signi.cant computational overhead; 2) they do not scale to high dimensional data; and 3) they are not easily extensible.


Another important reason is to exploit an optical network infrastructure that extends to the light posts.

these .xed locations are the geographical constraints for APs which are spaced at intervals of almost 400m.


RELATED WORKS To the best of our knowledge, there is not another work exploiting the use of grids or clusters of collocated APs with application-friendly heuristics to build scalable wireless VoD systems.

there are several interesting research initiatives, focusing on VoD delivery over WLANs and on strategies to control and optimize WLAN throughput, which use association control, channels aggregation, or transmission mode selection.


The function of the HCAC is similar to the CAC that pre-4G wireless networks employ.

the proposed HCAC needs to be able to do little more additional functions in order to comply with the heterogeneous environment.


In this case the nodes are located around the AP, as will occurs in many real cases.

results in this case are quite similar to the previous ideal results.


Figure 2-1) and Figure 2-3b) are the possible cases of multihoming support for Proxy Mobile IPv6.

figure 21) is not capable of using simultaneous access for the mobile node s on-going sessions.


With twice the amount of latency (or half the packet size), we can operate in row III(a) (of Figure 6), for which the tolerable packet losses are shown in Figure 7(b).

we can do better with iterative channel grouping.


4.3 Scheduling the transmitting nodes The parent selection step discussed above is node-centric in the sense that it is limited to node u when picking a parent, and assigning a time slot and channel.

con.icts may exist among the individual nodes which are not neighbors on the same level L. To illustrate, consider the example in Figure 1(a).


Our extensive packet-level simulations in §5 show that, regardless of the queuing scheme, TCP s performance degrades signi.cantly as either capacity or delay increases.

the new protocol achieves high utilization, small queues, and almost no drops, independent of capacity or delay.


Unidirectional interface-level sampling offers some improvement, since one can use a higher sampling rate on interfaces that carry less traf.c.

unidirectional sampling, say on the ingress direction, will not help in getting suf.cient samples from a small interface-to-interface traf.c ME whose ingress is on an interface that carries a high volume of traf.c.


Beyond the Bits: Cooperative Packet Recovery Using Physical Layer Information Grace R. Woo, Pouya Kheradpour, Dawei Shen, and Dina Katabi Massachusetts Institute of Technology Cambridge, MA, USA gracewoo@mit.edu, pouyak@mit.edu, dawei@mit.edu, dk@mit.edu ABSTRACT Users increasingly depend on WLAN for business and entertainment.

they occasionally experience dead spots and high loss rates.


This is intuitively satisfying since these schemes havebeenderived undertheiid assumption.

when a noise level mismatch exist, the Chiani et al.


In this scenario, eMPTCP consumes around 8% and 6% less energy than MPTCP and TCP over WiFi, respectively.

eMPTCP is approximately 22% slower than MPTCP since it utilizes an  450 600 such as Full-MPTCP mode (where all potential sub.ows are 400 500 used to transmit packets) and Backup mode (where only a 400 subset of sub.ows are used).


In order to cope with the highly partitioned nature of a VANET in an early deployment stage, they identify good spots for RSUs from a set of possible positions that are initially given.

their choice for the best set of RSUs highly depends on the tra.c situation simulated in the experiments.


shares the spectrum with other cooperating wideband devices using the SWIFT protocol.

the future may bring a variety of wideband protocols.


One approach, proposed among others by [7] and [8], consists in adjusting the CCH/SCH interval lengths in a dynamic manner.

this solution does not solve the problem of suboptimal utilization of DSRC spectrum resources, and also involves precise synchronization among the vehicles.


Similarly, 262144 may work better than the default 484848 in Verizon LTE network.

the optimal value depends on the BDP of the underlying network and is hard to be con.gured  statically in advance.


INTRODUCTION With the rapid growth of mobile data demands [5] and the increasing prosperity of mobile Internet, mobile wireless networks will keep growing at high speed.

wireless network has to face several intractable challenges.


This is called an intra-MBS zone handover.

since every BS in the same MBS zone broadcasts the packets of the MBS session regardless of the presence of a user, the scarce wireless link bandwidth can be wasted.


The library supports only simple data types such as strings, integers, etc.

it is possible to extend these basic functionalities to insert into the SOAP message any complex datatype by simply providing custom classes for these data types that implement the Java KvmSerializable interface.


Based on such assumption some e.cient central angle methods were proposed to identify fully sponsored sensors.

the disk assumption is too strong in the real world and can not be held in high accurate scenarios.


For instance, in an online game with few servers, a client can simply measure its latency to all servers and bind to the closest one for minimal response time.

collecting global information is infeasible for a signi.cant set of recently emerging large-scale distributed applications, where global information is unwieldy and lack of centralized servers makes it dif.cult to .nd nodes that .t selection criteria.


all those schemes are not abuse-free [23].


The following from [51] re.ects this observation: 1It should be noted that sometimes topology generators are used to tickle subtle bugs in protocols.

for this purpose the emphasis is not on .nding realistic topologies but on .nding hard cases.


More speci.cally, the Min-Max-Scheduling focuses on the challenge of unbalanced tra.c distributions and our heuristic intends to serve the hot WTUs in a greedy manner.

the Best-E.ort-Scheduling aims at maximizing the utilization of wireless resources and the proposed heuristic is based on the maximum weight matching over a utility matrix.


When the client wants to send traffic to 10.55.10.10, it chooses AS 10 and AS 20 according to AS_PATH, and finally the traffic reaches AS 30.

malicious AS 40 intentionally sends an invalid updated message that contains the IP prefix 10.55.10.10/17 to the client.


Note: It might be argued that routing setup by auto update will take much longer time than the existing micromobility protocols.

pRP based routing (via HM) is established in almost the same time in AUM as compared to other micromobility protocols.


Thus, mobile sensor needs to .nd the correct orientation to the target.

because energy spending on movement is costly, mobile sensor should move as little distance of movement as possible.


This means there has to be an even length path P1 in the collection whose endpoints have unequal weights; else the weights of M and M * will be equal.

depending on which endpoint is heavier, this P1 is either an absorbing path for M or M * ; again, either possibility is ruled out.


A redirect server is di.erent from a proxy server in that a SIP client B (4) SIP Server E (The home server of A) Home network of Home network of A SIP-NMS D (2) SIP Home Server (SIP-HS) F SIP Server (3) SIP Foreign Server (SIP-FS) 3  Figure 1: The Architecture of the SIP-NEMO redirect server only replies the callee s location to the caller.

a proxy server will forward SIP messages to the callee for the caller.


When the network is heavily loaded, shorter work-periods allow users to complete fewer tasks; however, users also spend proportionally shorter intervals of time waiting in the queue.

longer work-periods allow users to remain associated for longer durations, but cause longer wait times as well.


New goals are chosen inside the same area when the input social network is composed by loosely connected communities (in this case, hosts associated with different communities have, in average, weak relationships between each others).

a host may be attracted to a different square, when it has strong relationships with both communities.


Hence, although such attacks cause instability and performance degradation to the AS, they do not have a lasting e.ect.

were a vulnerability to be found in the speci.cation of the .ght-back mechanism that would allow it to be circumvented, an attacker could persistently control the routing tables of all the routers in the AS.


From a conceptual viewpoint, an ideal advertising framework is one that only monetizes user attention, without incurring the user any additional monetary or resource costs (such as network bandwidth or device energy).

as mobile ISPs universally move towards metered wireless data plans, consumers are progressively growing wary of the hidden costs of such advertising tra.c, both in terms of bandwidth consumption [12, 28], and energy overheads [19].