The local stability of a modi.ed algorithm for the case of heterogeneous delays is proved by [70], which establishes a model that is similar to what we show in Section 5.

a global stability result is obtained in this paper for the case of a single bottleneck with homogeneous delays.


The PAPR values for these codes are almost half than Walsh codes and also remain almost unaffected with change in code length.

walsh codes prove to be the worst candidate because of significantly high values of PAPR and high rate of increase of PAPR with code length.


Prior to this work, these special cases of the relay placement problem were known to be NP-hard to solve exactly [7].

it was not known whether they are also hard to approximate.


The overall number of APs discovered per scan increases as we upgraded the WiFi interface on the vehicles.

the increased range also discovered an increased proportion of encrypted APs, but did not show a noticeable trend of open APs disappearing.


cause it allows the node to quickly increase its rate if there is a sudden increase in available bandwidth.

flush-e2e produces highly variable queue lengths.


This indicates that the WSN becomes a periodic functional system, which in most designs it should be avoided.

if the detected events occur deterministically and periodically, this pattern can be used to wake up the system at the appropriate time to perform tasks in an attempt to save energy and prolong network lifetime due to the fact that for half of the lifetime half of the sensors are in sleep mode.


However, if the PEP/SNR relationship is steep, then all outcomes are predictable.

if the PEP/SNR relationship is shallow, then it is not possible to predict which nodes will correctly receive transmissions, and hence, there are events that opportunism may exploit.


Packet Loss for all traffic classes Figure 2 and Figure 3 show that ExtTeGaR with a priority based delivery provides higher throughput for C1, C2 and C3 packets compared to C4 packet.

sPEED which does not exploit packet scheduling has similar throughput for all traffic classes.


VN router allowsforquickbootstraping of an environment, allows for resource consolidation, and avoids overlay overheads in the LAN.

it can be a bandwidth bottleneck in network-intensive applications and can be a single point of failure.


Considering the performance in terms of delay jitter alone, SPR appears to be the best choice for routing in all scenarios.

the overhead incurred by SPR in providing low delay jitter indestination topology, with 600 nodes and a target loss rate of 5%.


An adaptive multimedia framework that guarantees the upper bound of cell overload probability is proposed in [7].

bandwidth degradation is not considered.


periodic and independent random sampling will select different individual packets.

we .nd in practice that the distributions of .ow lengths that they produce are quite similar.


have very di.erent policies and management goals, and b) new extensionstoBGPkeep emerging[5,7],itis alsoimportant for the control plane to inherently support for new BGP extensions and .exible expression of network-level control objectives.

previous work on RCP discussed little about how the RCP can provide such .exibility and extensibility in an e.ctive way.


Thus, a larger proportion of devices discovered in FT1 were owned by out of town people who necessarily did not recognize the local Science Centre stated in the authorization request and consequently blocked the transmission.

the Red Cross Blood Service is a well-known and trusted national brand, which Table 2.


INTRODUCTION Recent years have seen a rapid development of mobile computing and wireless communication techniques.

constraints such as limited bandwidth, frequent network disconnections, and limited local resources (energy and computing power) remain to be overcome for effective information access in wireless network environments.


Hence, the lower priority nodes (with larger AIFS) rarely get a chance to attempt and the throughput ratio goes to in.nity; this is demonstrated by the simulation results in Figure 8, (1) plots with + and .When nis kept constant and (0) nis increased (which is more typical), the collision probability of Class 0 nodes increases to 1 and their success probability tends to 0.

the collision probability of Class 1 nodes remains much less than ratio of throughput 14 12 10 8 6 4 2 (0)(1) n + n Figure 8: Ratio of the throughput of a Class 1 (higher priority) node to the throughput of a Class 0 node (lower priority).


In order to improve scalability, multiple schemes to share the load and so the tra.c on multiple sinks are proposed like round robin or random.

as highlighted by the authors, OpenFlow switches do not have the ability to achieve that since all actions of a rule are always applied.


Performance degradation in both scenarios could be addressed by users performing frequent operator selection.

this would require frequent inter-operator hand-o.s resulting in signi.cant switching overheads.


Thus we applied new Tabu [1] heuristic to form more stable clusters.

cHs do require multi-hopped routing of data, 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 profit or commercial advantage and that copies bear this notice and the full citation on the first page.


CCH/SCH Switch ON -Reinsert: This con.guration is close to the previous one where all the vehicles must perform periodic switching between CCH and SCH slots.

in case the CCH interval expires before the HELLO message has been transmitted, the message is enqueued and transmitted at the start of the next CCH slot (REINSERT policy).


DIRC [13], have used a centralized scheduler-based MAC using MaxCAP.

such designs are intrusive and require coordination among APs,makingitunsuitablefor somedeployments, e.g.,inwireless hotspots and neighborhood wireless networks.


We de.ned two scenarios and discussed the results of the experiments, where we concluded that TCP and DCCP protocols can share the network bandwidth without a.ecting each other.

uDP .ows can aggressively degrade TCP and DCCP .ows due to the absence of any kind of .ow control.


In fact, the simplicity of this scheme is yet another example of the utility of having virtual, reliable infrastructure in a mobile ad hoc network.

the VSA scheme requires maintaining a stationary virtual automaton.


It is also important to point out that in formula (13) we must use the Bit+1 value because it provides the size of sub-queue i in OC after completing the internal reordering, the insertion of new items and the removal of old items.

it is quite straightforward to observe that Bit+1 is simply given by Bt+1 ' i =min(N0,i + Bi,Fi) .


The total number of streams in FD (including both uplink and downlink) is the same as that in MIMO (either downlink or uplink).

the full potential of FD is not leveraged in this case (half of the RF chains are not used as shown in Fig.


KVM: The KVM module running inside host kernel, this part is separated from the host Linux kernel for more analysis.

some of KVM code calls routines in other part of kernel, the time spent by those routines is accounted to the host kernel.


Without classi.cation, a simple approach to limit damage is fair queueing (FQ): partition each congested resource among currently-active users equally [26], or using some weighted fairness rule [33].

because FQ acts on each resource in isolation and at a speci.c moment in time, FQ still allows attackers to grab disproportionately large amounts of resources by requesting many di.erent resources across space, or continually requesting resources across time.1 A more robust approach is to combine FQ with rationing by limiting the volume of data that users can send across time; for example an ISP might limit a user s total transfer volume over each month [6].


Router based mechanisms, such as Active Queue Management (AQM) schemes, schedulers and pricing mechanisms, have been suggested for managing uncooperative users in the network.

use of AQM schemes, schedulers require deployment at all (bottleneck) routers in the network, which is not only expensive but also requires signi.cant network upgrade.


For instance, such approaches in .le-sharing systems typically provide a reduction in .le downloading time as an incentive.

in streaming systems, a peer s quality of service depends on video quality (e.g., smoothness of video delivery), rather than on howfast the entire stream (e.g., video) can be downloaded.


The fastest route metric chooses longer but faster routes.

these faster routes are not really faster in our implementation.


Using GPRS, many users can share a radio link by adapting their individual data rates.

higher bit rates can be achieved, when resources are available.


That pattern in air was obtained for the three frequencies in the study.

measurements in water follow a nearly linear pattern.


More recent models tend to be trace-driven and some account for location preferences and temporal repetition [19].

similarity characteristics between clusters of nodes, which lie in the heart of behavior-aware networking, have not been modeled explicitly by these mobility models.


Using this list, the DLNA proxy in DAS2 establishes a virtual DMS in itself.

uRLs of the list have a host user s home network address.


Bluetooth has a low radio range and battery life.

these problems can be resolved by using solar panels to recharge the battery and upgrading the power class and antennas to increase the radio range.


We report benchmarks comparing Mininet-HiFi with a hardware setup for multiple traf.c types (UDP and TCP) and topologies (single link, stars, and trees) in [27].

the exact CPU usage for packet forwarding varies with path length, lookup complexity, and link load.


Instead of routing with multiplicative stretch, researchers have also started to investigate routing schemes with additive stretch guarantees.

only very little is known (see Table 2 for an overview).


For instance, a surveillance application may require any intruder to be detected and traced with a high accuracy.

scheduling is indispensable for such sensor networks applications due to three reasons.


3, we can notice that the CRN parameters (node density and transmission range) would affect the magnitude of the connectivity.

the drawn conclusion will remain the same.


They analyzed and simulated a GAF model based on both Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR) routing algorithms, and, compared to the normal AODV and DSR routing in ad-hoc wireless networks, the GAF assisted ones reduce the energy consumption by 40% and 60%.

in [1], the GAF virtual grids are the same size, and the optimal transmission radio range has not been considered, whereas in our paper we introduce adjustable size grids to improve the energy saving performance.


Here, AP1 could be satis.ed by 1/3 channel share, assuming that AP2 and AP3 will also consume 1/3 each.

aP3 may only be able to consume 1/5, opening up some slack in channel time.


Thus, the submatch of aaaa to(a*)aa is sub(t1)= aa.

a submatch assignment obtained by our approach is not necessarily the left most, longest submatch, which is requiredbyPOSIX.POSIXdoesn thaveanotion of greedy and reluctant closures, which give some control over the length of the submatch.


For example, a network failure in a stub ASwill trigger route withdrawals only for destinations in that AS.

a link or router failure within a tier-1 ASmay trigger a large burst of BGP updates the event not only a.ects network pre.xes originated by the said AS but also those from its customers.


FUTUREWORKS The scalability measurement brought clarity to essential performance of naming service at the PRISON/CAGE.

above evaluation is thought of as still inadequacy because we didn t consider a throughput analysis or a performance evaluation on an almost real network environment which requires the building of test network including a certain number of NATed network when we will evaluate.


Via interest message dissemination the sink speci.es the events to be monitored and how frequently information on such events have to be relayed back to the sink.

whenever an event of interest occurs, a subset of sensor nodes S close to the event location will start generating data packets, resulting in many-to-one communication (from the nodes in S to the sink).


Our results in Table 1 show that Red users do not receive any higher throughput.

the average rate of Blue users drops by 20%, which results in a drop of 13% in aggregate throughput.


First, it is possible to prevent excessive quality degradation by adaptively changing the bit-rate allocation update interval.

as we discussed earlier, certain limitations apply to the update interval.


If the input rate suddenly becomes greater than the output rate, the queue size increases.

if the input rate suddenly drops below the output rate, the queue gets drained.


On one hand, certain parts of the spectrum are heavily used, such as the 2.4GHz band and the 5GHz band, which leads to serious interference and poor performance.

a signi.cant amount of spectrum remains underutilized or not utilized at all, which has been shown by recent studies [1].


In our simulation, we have used a value of timeout to be 1.25 times the phase duration (this value is about 1.6ms).

in our implementation, we have used timeout values ranging from 25ms to 50ms.


Due to the method constraint, we can only obtain at most 7 GSM cellular tower s IDs and signal strengths.

the tower overheard by phone is larger than 7 so that the radio hardware will decide which tower to show based on some unknown algorithms.


Thedesign assumes that most bytes are carried by long-lived .ows, and thus carefulplacementoflonglived.owsshouldbeenoughtoavoid congestion.

if .ow size distribution is more uniformandconsistsmainlyoflarge .ows,theirapproachcould lead to congestionandlossesinnetwork.


a friend in a social network, a link in a web-graph, ...).

an Internet traf.c log contains web traf.c to different destinations, peer-to-peer traf.c, DNS lookups, and a range of other kinds of traf.c with unknown user intentions and varying domains.


The former contains valid code, whereas the latter corresponds to attack code.

inside the security monitor we store instruction addresses only for the valid basic blocks.


In case that there are redundant sensors to heal the holes, the proposed mechanism will maintain spatial full-coverage with low energy consumption.

if there is no redundant sensor to heal the holes, the proposed mechanism is able to maintain the temporal full-coverage as well as balance the energy consumption of sensors in the WSN.


4.1 Results Since the course focuses on network security, audits tended to be network-based.

two full-time system/network/security administrators did server audits at their employer s company.


Each has its own advantages and disadvantages, and we expect both licensed and unlicensed frequencies to be employed in the foreseeable future for network connectivity.

we .nd LTE small cells to have interesting properties distinct from Wi-Fi that warrant deeper investigation at the networking layer as well as at the application layer.


Third, extra messages are also exchanged in order ro guarantee load balancing between RRs and in order to satisfy drivers QoS requirements.

in the LocVSDP, requests are interrupted due to the failure of RRs and links.


3.2 Fairness The normal implementationqueues PSM traf.c at the transmissionqueue s tail andis unfair toPSM clientsbecause theirpackets may be transmitted by the AP after packets to other CAM clients, even if thepackets toCAM clients arrived subsequent to the PSM packets(thePSMpackets mayhavebeen waitinginthePSMbuffer).

power (mW) 850 800 750 700 650 600 550 500 450 400 350 100 200 300 400 500 600 700 800 900 1000 Background Traffic (Kbps) Figure 1: Power drawn by a static PSM client receiving a 128 Kbps radio stream with varying CBRbackground traf.c the high priority implementation can be similarly unfairtoCAM clientsbecausePSMpacketsarescheduled at the head of the queue.


For troubleshooting, the users in the study relied mostly on tools built into the OS and the router as well.

a considerable number of nonexpert users tended to just depend on very simple physical actions such as resetting, unplugging, and replugging of devices.


SmartBridges [10] allows shortest-path forwarding by obtaining the network topology, and monitoring which end host is attached to each switch.

its control-plane overheads and storage requirements are similar to Ethernet, as every end host s information is disseminated to every switch.


Accurate modeling of the beambeam interaction is essential to maximizing the luminosity in existing colliders and critical for building the next generation colliders such as Large Hadron Collider (LHC); any design errors will be enormously costly, or even fatal, for this big science project [1].

due to the extreme computational cost required to accurately and self-consistently model the beam-beam interaction as the beams circulate for millions of turns, previous studies are confined to using simplified models.


Their approach utilizes Markov chain modeling to derive the steady-state probabilities of link detection.

the studies do not consider the drawbacks of using a larger D, i.e., lower throughput when the link remains inactive for long period.


Opportunistic spectrum access and co-existence of several WPANs in the same physical area may be achieved through the so-called dynamic frequency hopping communities in which different groups of users simultaneously hop according to a number of prede.ned, non-overlapping channel sequences [11].

opportunistic spectrum access may also be combined with pseudo-random frequency hopping spread spectrum (FHSS) [13] similar to Bluetooth [2]; such networks will be referred to as Cognitive Personal Area Networks, or CPANs.


Security and robustness of OpenFlow controllers has arguably been an understudied area with some recent notable exceptions [29, 19, 36].

these un.edged research efforts are still very much in .ux and require validation through large scale deployments.


the ability to decode one transmission when multiple transmissions collide.

when the signal from the transmitter T is much stronger than the interference, as shown in Figure 8, the signal from T is always correctly received by R, even when the actual interference level is high, i.e., when there is no attenuation at the receiver R. when the signal from the transmitter T is weaker than the interference, as shown in Figure 6, most of the packets from T are corrupted.


Figure 1: Interaction between MIPv6 and PMIPv6 NETLMM working group presents the draft Proxy Mobile IPv6 indication and discovery [1].

the solutions presented in [1] have problems with fairness or consistency.


Results of the simulation con.rms that this partition size returns one of the least P miss values.

the minimum P miss from the simulation belongs to partition size (1, 250, 349).


This set of rules is by no means complete; indeed, we do not consider issues like scalability or the ability to perform traf.c load balancing via traf.c engineering.

the logic can be used to determine if any techniques used to achieve these goals affect the chosen properties.


The value of a packet counter does not necessarily correspond to the exact number of neighbors from the current host, since some of its neighbours may have suppressed their rebroadcasts according to their local rebroadcast probability.

the decision to rebroadcast is made after a random delay, which increases latency.


Also, it has been widely believed that hierarchical routing is more effective than flat routing [5, 6, 8-10].

common flaws among those topologies are that, the amount of neighbors a node could have is so scarce as to significantly influence their fault-tolerance capabilities.


Such an approach worked .ne when protocol upgrades were relatively slow (several years) and basestations were deployed sparsely and covered large areas.

in current networks, protocol changes are continuous (once every few months) and networks are dense (e.g.


More simply also, the tail exponent a can be associated to the asymptotic slope obtained when performing alinearregression of thedistributioninalog-log plot.

memory consumption and CPU limitations, may prohibitto collectandto analyze everypacketsgoingthrough a high speed link.


The latter is a stronger requirement than the former, i.e., an algorithm that emulates an OQ switch based algorithm usually delivers 100% throughput, but the reverse is not always true.

if 100% throughput is the only objective, an algorithm can be simpler or have less time complexity.


In multipath load balancing, the traf.c load between a source node and a destination/gateway is distributed among a set of alternative paths in order to maximize throughputperformance and minimize the impact of route failure.

[5,6] report that multipath load balancing in single channel wireless networks only provides a negligible improvement in the performance due to route coupling among the alternative paths.


Recent advances in encryption, public key exchange, digital signature, and the development of related standards have set a foundation for network security.

security on a network goes beyond these issues.


A load balancing mechanism was also implemented developing the concepts of cell breathing, as they were adapted by authors in [2] to be used in IEEE 802.11 WLANs.

the chosen solution should also be suitable for the future use of other resource management mechanisms such as power management, fault recovery, etc.


Because AEDP is largely able to avoid false wakeups, it comes within 15.8% of the theoretically optimal duty cycle.

the default and reduced-ACK stacks achieves a duty cycle 41.4% and 112.4% higher than their respective optimal duty cycles.


The methodology to conduct the simulation experiments is similar to that of [17].

the tool used for simulation is a modified version of one developed by the authors of [17], which is freely available at [19].


+46457385876 +46457385833  +46457385804 hussein.aziz@bth.se hakan.grahn@bth.se lars.lundberg@bth.se ABSTRACT The main challenge of real time video streaming over a wireless network is to provide good quality service (QoS) to the mobile viewer.

wireless networks have a limited bandwidth that may not be able to handle the continues video frame sequence and also with the possibility that video frames could be dropped or corrupted during the transmission.


A fair amount of performance improvement is reported.

the use of multiple threads introduces new difficulties since programs may have to be converted.


Furthermore, a theoretically optimal bu.er management policy, along with an e.cient distributed implementation for it have been proposed in [14].

in the majority of these works, the bu.er management and scheduling problem is formulated and solved in the context of end-to-end tra.c sent by one device to another well de.ned device.


RELATED WORK The IETF zeroconf working group already standardized a stateless auto-configuration mechanism for IPv6[9].

this protocol was not designed for mobile ad hoc networks.


NEWS is designed to detect any event impacting the performance of BitTorrent hosts at the edge of the network.

con.rmed events from ISPs are typically restricted to signi.cant outages.


The .rst is to scale the network capacity by building out more cell towers and base stations or upgrading the network to the next generation networks such asLTE (LongTermEvolution) and WiMax.

this is not a winning strategy especially under a .at price structure where revenue is independent of data usage.


Note that when u is 90%, longest bottleneck lifetime is obtained.

broadcast time decreases almost monotonically with lower values of u.


It turns out that for longer connections, CoSAP is slightly less effective in reducing the interference problem.

across all the experimented hop counts, that is up to 8, the throughput enhancements by CoSAP ranges from 10% to 40%, when 4 channels are used.


Vast advances have been made in this .eld, for example, in [2, 19, 11] etc., which claim to catch a majority of junk mail.

one of its main drawbacks is the problem of false negatives and false positives.


3.3 CBFs for Handling Routing Changes When routing changes occur, the switch must update the Bloom .lters with a new set of addresses.

with a standard Bloom .lter (BF) we cannot delete elements from the set.


A striking difference between AODVandSLRis the standard deviation on theRO.AODVmanages to keep the standard deviation low with increasing network size and different network dynamics.

sLRshows an increasing standard deviation with increasing network size.


In this scenario, with aOrgHellomessage listen inter val of one out offour epochs, integration allows an average listen ing time reduction (over non-integrated ReSync) ofmore than 50% [27].

raw energy consumption does not always provide a complete picture.


We argue that straightforward approaches at .rst appear effective, but ultimately suffer from similar scaling and coordination problems that have undermined other multipoint service models for content delivery.

we argue that a digital fountain approach to encoding the content affords a great deal of .exibility to end-systems performing large transfers.


While this performance metric is well de.ned for single-resource systems, extending its de.nition to multiple types of resources leads to a throughput vector, where each component is the throughput of one type of resource (e.g., 10 CPU instruction completions per second and 5 bits transmitted through the output link per second), and different throughput vectors may not be comparable.

another possible ef.ciency measure is resource utilization given non-empty system, or simply resource utilization in the remainder of this paper.1 in a middlebox, different resources may see different levels of utilization.


The DM compares h and h : if h = h , the received R-CFG is accepted.


Faults on the wired network include IP link failures, Border Gateway Protocol (BGP) miscon.guration [23] and network intrusions and DoS attacks [18].

a wide array of tools [21] and architectures [13] have been proposed that help researchers to extract information from the network to detect these faults fault diagnosis for wireless networks has to deal with the inherent spatial and temporal nature of wireless propagation.


Network management (§5,§6): The FireFly controller needs fast and ef.cient topology selection and traf.c engineering algorithms to adapt to changing traf.c conditions.

state-of-art off-the-shelf solvers fail to scale beyond 32-rack DCs.


, the performance is similar to the performance obtained using Pmeas the r values di.er by at most 17% (0.23 Kb/s), and the ON times di.er by at most 7%.

the performance observed using Piid and Pmarkov di.ers greatly from the performance observed using Pmeas .


A client can request different versions of the same resource according to the resource s mediatype, language, etc., or the client s own capabilities.

there is no standard interface for querying a web server according to a resource s properties.


In current network devices, some edge-case packets will have to be to be processed by the control plane.

in OpenFlow, poor rule design can lead to saturating volumes of controller queries, a.ecting all switches that rely on that controller.


Consider a network consisting of four nodes: A, B, C and D with connectivity as: A..B..C..D, where A and D cannot hear from each other.

mapping this topology on a testbed may result in all four nodes falling in a single collision domain.


For packet-level FEC, various schemes are possible [17], including a simple XOR scheme [9].

in this paper we suppose that if a packet has b bits then a codeword is taken from GF(2b) according to RS erasure coding [18][21], assuming 2b is much greater than the number of arriving packets, K. If b y .GF(2 ) is the ith packet data of length b, then FEC i packets are formed from polynomials of the form K -1 F(X ) = y + yX +L + yX (11) 12 K using powers of a, a primitive root of the Galois field GF, as the variable in (11).


For example, an on-going ssh connection would not be a.ected at all by a name modi.cation.

some applications embed names in their playload and, in particular cases, this would require speci.c corrective actions.


For example, we shortened the discussion of certificates from different locations where the results are not surprising.

we disagree with the reviewers in the point that globally distributed scans should not be expected to show differences in the result; therefore, we added a section that outlines interesting differences encountered between our scanning locations.


Then the HiCuts tree will only have 2 + 8 + 2 = 12 pointers.

ifHyperCuts were to combine all the three .elds in a single node, it would require 2 * 8 * 2 = 32 pointers.


In addition, extensions to the routing protocols can allow a router to continue forwarding packets in the data plane while reinstalling or rebooting the control-plane software [29, 8].

these techniques require changes to the logical con.guration or the routing software, respectively.


In such a situation a single wireless network may not provide enough bandwidth to accomplish the desired task.

combining the bandwidth of multiple wireless networks available to the vehicle may provide a su.cient amount of bandwidth.


The distributed backpressure routing protocol is based on managing data queues and exchanging data queue sizes located at the routing layer.

in a real mesh node there are additional data queues located underneath the ns3 routing protocol.


The reliability of estimated graphs is not always 100%, because the augmentation algorithm relies on reliability predictions from signal strength estimates.

random graph augmentation leads to no visible improvement on reliability while Locality-based augmentation is half way between Random and Greedy-Feedback.


Every time a node B is added to the tree, the anchor point s is positioned so as to preserve the joiner s distances to the lever and to its anchor.

distances to all other nodes may be distorted.


Unlike internal, it doesn t use right for the external components ecomm and epath, so their original label types and I functions will be used.

it uses left for the internal components, which means their values will be forgotten and replacedwhen routes crossoverexternal arcs betweenregions; internal routing information never leaks outside a region.


We note here, that in case of large demands D2R2 indeed converge to the global optimum and it is only in low demand case when we cannot ensure the exact convergence.

it would be interesting to obtain a distributed algorithm that converge to the global optimum (rather than O( .


STOF ANALYSIS 3.1 Service Domain Location is surely the most common mashup feature that developers and researchers have considered for the first use cases [11, 13].

it is not the only one, and as Google has demonstrated, mobile operators are not the only actors who can deploy this asset.


The XORP project recognized that Internet research has suffered because router platforms are closed and has proposed an open software router interface to make all aspects of routing and forwarding both open and extensible [22].

we propose making routing open and extensible by separating the routing protocol logic from the routers themselves.


In the absence of any timing relationship between channels in di.erent cells, it is safe to assume that even if one channel on a carrier f is used in cell C1, no other channel on f can be used in a cell C2 E I N (C1).

if we assume that the TDMA slots in all the base stations are synchronized, then it is possible for two cells C1 and C2, such that C2 E I N (C1), to acquire the same carrier f , but use di.erent slots on f without mutual interference.


This phenomena is also observed in [8], node 5 fails to transmit CTS when node 7 is transmitting.

according to our analysis in section 3.2, node 5 s transmission will not interfere with other ongoing transmissions if .>2.45 and S0=6.08 dB.


When the bu.ers are large, this does not a.ect stability.

for small bu.er performance, there is a marked improvement as seen from the plots.


As expected, retransmissions increase reliability.


Theoretical analysis and simulation results show that the proposed method is superior to energy detection in sensing performance for partially correlated signal samples.

it is inferior to energy detection and even fails when signal samples are i.i.d.


Fairness research has concentrated on IP-based, storeand-forward networks with per-.ow fairness [10, 13, 19, 25, 28, 34].

it is not immediately obvious how to apply this kind of fairness schemes to per-protocol fairness.


Given node A and B have measurements to all landmark nodes, we can predict the bandwidth from A to B.

this assumes that: (a) a number of high-bandwidth nodes (landmarks) exist; (b) all measurements have to go through at least one of those nodes; (c) the last-mile bandwidths of A and B are not greater than the bandwidths of the landmarks.


As P is a static value whereas L changes during run-time, increasing values of L may lead to a preference of important frames over urgent frames even if urgent frames would not interfere any important frame transmission.

exchanging P and L would the ant cause to prefer less urgent frame packets even in cases where important packets may run the risk of passing the transmission deadline.


In our case, each node has a .xed degree 2k, therefore the complexity is equivalent to O(n2 log n), with per-node total complexity being O(n log n).

for network .ow based optimization [28], [22], the per-node complexity is equivalent to a max-.ow computation, which is typically on the TABLE I THE STATIC MEDIA FL OW AUCTION ALGORITHM  Initialization .... .


Figure 11 illustrates that the previous scheme with any NFRT value drastically degrades the goodput performance due to the frequent multi-path transmissions, irrespective of the NFRT value.

the goodput achieved by HMR is approximately same with the ideal value.


The leftmost router contains IP addresses solely from AS A s address space, and the rightmost router contains IP addresses solely from AS B s address space.

the router in the center of the .gure may have interfaces with IP addresses from both AS s. Complicating matters, the endpoints of the link between AS A and AS B can come from either A or B s address space.


Energy e.ciency might not be a primary concern for vehicles,giventhat when acaris on,itgenerates enough energy for full-power radio operation.

a vehicle canbeparkedfor severaldays, and thusthepowerfor communicationwoulddrainthebattery.


The remaining messages are the same as the messages of Protocol 1.

after the exchange of message 3 and 4, i and j also verify if the hash value of the received random number and triplet is equal to the received hash values .j and .i, respectively.


Considering subfigure 9 (a) after the detection of the abrupt change at 1250 seconds, the underestimation of BART does not generate residuals large enough within 20 filter iterations to build up the required test statistic for indicating the need of additional system-state compensation.

by increasing the filter bank to M = 80, as in subfigure 9 (d), the gain in performance is evident.


Compared to MUD, SSA uses a similar amount of TCAM memory.

sSA is faster than MUD, since each packet requires either two or four TCAM lookups (depending on whether the original filter set is split into two or four sets), while MUD requires 20 TCAM lookups in the worst case.


This happen because in a scenario where all nodes are within the same carries sensing range, the IEEE 802.11 MAC protocol works well.

tPA*-3 provides a higher throughput than TCP-uc (about 3%) while retransmits about 70% less segments.


Some properties are static, some may change over the lifetime of the network.

we assume that properties are not subject to frequent signi.cant changes.


For vehicular networks, clearly, this is not a concern: one may assume su.cient power and fast processors, largely on par with those on personal computers.

symmetric key authentication remains more suitable, largely due to the necessary burstiness of communication: the window of time suitable for communication between two rapidly approaching vehicles is very short; this severely restricts the available bandwidth in the peer-topeer communication mode.


The format of the digests is very simple: a (0-1) bitmap B indexed by a hash function h. Initially, all entries in the 2Note such a granularity would be an overkill for TM estimation (for which 5 minute interval is good enough), but is necessary for accurate delay estimation.

there is little storage cost difference (in terms of gigabytes per hour) between different time granularities, as will be clear later.


As discussed earlier, typical objectives range from bridging the digital divide to supporting education.

if the goal is digital inclusion, why not just subsidize ISP provisioned (wired) broadband Internet connectivity to the homes of the underprivileged [8]?


So one would expect that the radius necessary to maintain Y3 connected would exceed the radius necessary to maintain Y4 connected.

our results show that an antenna radius equal to v v2< 2 su.ces to maintain Y3 connected.


the additional number of bits used to transmit the data ; f(x)= (x.R) is Gauss function, which denotes the biggest integer that is smaller than or equal to x.

in some industrial control networks, the data field is relatively large.


3, we presented a realistic class of policies that admits incentive-compatible, BGP-compatible computation of routes and payments.

many of our techniques apply to other classes of policies.


(APs) are being deployed, often redundantly, at homes, of.ces, campuses, and across cities [3 5].

such chaotic deployment causes wireless carriers or private network owners to often encounter dif.culties in managing the performance and/or the spectrum usage of their networks [6 10].


If there does not exist any n satisfying both equations, the detection method considered cannot meet the detectability requirements with given TI and RSS.

if the optimal sensing period is found at n = nopt, its sensing overhead is determined as: TI /(nopt · FS).


As such, the feedback on both WiFi and FSO are critical to allow optimal rate allocation between the two channels .

at the present, the feedback capability via the FSO channel is not yet practical due to the cost/power of modulating an LED in a user device.


Most of the time the additional information is not related to communication data like connectivity statistics, throughput or latency values.

exploitation of this information is often useful for the prediction of communication opportunities.


On August 31, 2004, after interval 208, there are failure scenarios where our robust path-based TE/FRR drives the traf.c demand to be almost 3.5 times the bottleneck link capacity.

the .gure also shows that at these severe failure scenarios, even the optimal routing using intradomain links will drive the traf.c demand to be almost 3 times bottleneck link capacity, leaving it impossible for any fast rerouting algorithm to recover without signi.cantly reduced throughput.


Several tools exist to determine the available bandwidth of a network path (see 5 II for a brief outline of related work).

using standard congestion control techniques, a flow may not be able to fully utilize the available bandwidth of the network path.


In a variety of locations, such as in the home or on the road, equipment including sensors, consumer electronics and Kiosk terminals is being installed; these devices can connect directly with networks and have a wide array of functions.

because existing telecommunication devices use independent system that require specific methods to contact each communication partner, using a 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 profit or commercial advantage and that copies bear this notice and the full citation on the first page.


Scheduling: When a link belongs to more than one otherwise non-overlapping contention regions6 (also termed bottleneck link), the total number of transmissions in all those contention regions is limited by the amount of resources at the bottleneck link which is active.

if the bottleneck link is passive, then its resources can be overloaded to increase the number of transmissions in each of those contention regions (if possible), thereby increasing the utilization.


Transcoding: Similar to PC-based users, online video watching is an important activity for mobile device users.

as the bandwidth of a mobile device using 3G/4G network may .uctuate constantly, the available bit-rate varies over time.


Proof: When more than one Sink subscribes to the same event, this implies that the same event noti.cation message willhave tobe sent toward theseSinks.

as wehave already mentioned, due to the DDBMS over the Sinks the event noti.cation message will only have to be sent toward one of the Sinks that subscribed to the event according to the proposed solution.


3.1, especially the proof of Lemmas 5 and 6.

it is unnecessary to explicitly construct them for the implementation of trace-routing.


The key point is that the initiator and responder of any given connection are independent; that is, the probability that a connection s responder is any particular node is independent of the connection s initiator node.

we see that ingress-egress independence for packets is not a valid model.


[5] presented results from the 2x2 MIMO fixed outdoor channel measurement campaign conducted at 2.48 GHz in the suburban residential areas of San Jose, CA.

any studies do not identify the key parameters to estimate the MIMO capacity of OFDMA MIMO systems in simulators for the cell coverage planning.


All the parameters are thus derived in the same way it is derived for a periodic collection.

as we describe later, AEM incurs only a small overhead for this conservative approach: if, when the radio is turned on, AEM observes no activity, it quickly turns the radio o..


Hence, the respective bandwidth by adopting such a phenomena is 28 KHz that shows the bandwidth reduction could also be accomplished by means of dividing into a number of sub-bands.

it can be shown that the bandwidth is further reduced as we carry out quantization by means of non-uniform slicing and consequently allocating a different bit pattern per samples to the signal.


5.2, which causes incorrect HN collision estimations, and wrong path selection.

eTX, WCETT and IRU show 0.61x, 0.52x, and 0.49x lower throughput than HIAM, respectively.


The majority of combined greedy and planar graph routing implementations return into greedy mode as soon as possible.

it was observed that a more elaborate return strategy considering a number of possible nodes before restarting greedy routing can show better performance than returning into greedy mode as soon as possible [15].


newly developed or emerging devices, circuits, and optics technology can be used to realize one-hop links through freespace optical links [20]: VCSELs (vertical cavity surface emitting lasers), PDs (Photodetectors), and collimating microlenses can be implemented in GaAs technologies and combined with a silicon chip, in which the transmitter and receive electronics reside, using 3D integration.


Note that d<bl, otherwise packet loss l kicks in to reduce tra.c throughput dramatically.

increase d. increasing d potentially results in instability according to Theorem 4.


The above analysis leads one to believe that it would be inappropriate to use any routing protocol that uses path-reversal in route discovery, such as AODV, DSR, DD and LAR, in an asymmetric environment, because they would have a very high loss ratio.

the simulation results we present later show that AODV and DSR work reasonably well despite the asymmetric nature of communication.


Note that when using symmetric shared keys to authenticate/encrypt information then deniability is easy to achieve at least as long as the secret key cannot be tied, via third-party veri.able proofs, to the identities of the peers.

when the symmetric keys are established via a KE protocol, which in turn uses public key techniques for authentication (as it is common in today s communications), then the weak link for deniability becomes this KE protocol.


The multi-objective problem then is to minimize the cost of implementing the security policies, as well as the weighted residual vulnerabilities.

the authors .nally scalarize the two objectives into a single objective using relative weights for the objectives.


Indeed, an HTTP request occurs when requested host name is in LDNS s DNS cache but the object is not in its HTTP cache.

proxy in this case will also have this host name in its DNS cache and will send the request directly to the Web server by HTTP.


Thus, a link with a measured signal having a power ratio inferior to the threshold ratio will not be used to forward packets.

if the link connects a relay node to the destination node, packets will be forwarded to destination using this low quality link because no other direct link to this node is available.


These promises have led to SDNs garnering a lot of attention from both researchers and practitioners.

as we gain more experience with this paradigm, a nuanced story is emerging.


This would in- crease the overall traffic in the network leading to higher conges- tion, especially for smaller numbers of nodes.

as the size of the graph grows, there are more and more shortest paths avail- able.


INTRODUCTION Today most video conferencing or surveillance devices such as 2D video cameras are still wired which means that, (a) less cameras might be deployed, and (b) installation causes a lot of inconvenience and cost involved with cabling.

wireless video cameras can be easily mounted and controlled, making them attractive for video surveillance and conferencing systems.


In cellular networks, delayed FIN/RST packets often incur signi.cant energy consumption overhead for handsets.

closing TCP connection immediately after its last data transfer avoids the energy overhead, but can cause performance degradation as doing so makes reusing TCP connections dif.cult.


higher with uniform and exponential distributions than they are with Pareto.

accordion still provides lower lookup latencies than Chord, except when bandwidth is very limited.


1=i=K e=(u,v).E 1=i=K e=(v,u).E Note that this is not a very tight constraint for modeling the number of radios of a node.

we will show later that this results in a relaxation which is not too far from the optimal.


FIFO Results To establish a baseline for evaluating the effects of using RED on interface queues for links carrying only Web traffic, we with short responses that may otherwise complete within first examined the effects of FIFO queues with tail-drop behav200-350 milliseconds.

increasing the ior in our experimental network.


Thus, skyband query can be considered as a data coverage query.

skyband assumed to be a centralized query while ourproposedqueryinvolvesthenotion of neighborhood and it is processed in a fully distributed manner.


The reason is that only one beacons structure is used regardless the network density.

fortheRPE algorithm,the number ofbeaconsincrease with the network density, so that we ensure that 5% of the nodes are beacons.


This signaling may be redundant with existing features in some languages, such as the RefreshScene command in MPEG-4 LASeR.

such signaling would require the client to first download the sample data and then discard it.


Policies allow administrators, that are not experts in embedded system programming, to customise the behaviour of their systems.

managing even a network of a few tens of nodes is a signi.cant e.ort.


reception of the DL control channels is not an issue, one of the natural choices could be to maximize the mean throughput.

catering for the mean throughput can lead to such coordinates that high throughput MSs will have even higher throughput at the expense of low throughput ones.


A provider s costs include both capital expenditures (CAPEX) and operationalexpenditures (OPEX).To reduceCAPEX, the network should use commodity, inexpensive components.

commodity network switches often haveonly limited resources and limited features.


In about 90% of the cases, the estimated rank of the host with the best true rank is among the highest 20%.

there do exist cases when King's choice proves to be a really bad one.


The main design goal of general wireless networks has been to improve network performance such as the average throughput.

wireless medical networks ask for a high level of reliability while requiring moderate data rates.


Both DSR and AODV use these building blocks in their operation.

they still behave differently for a given mobility model.


3 it is clear that to maximize energy savings we need the largest m possible.

this observation is incorrect because we have ignored the cost of the switch chassis and other components.


3.2.2 Data Group Membership Our protocol must guarantee that, at all times, there is at least one member in the Data Group of each client, such that the client will be served by at least one mesh node.

it would be wasteful to allow more than one node in the vicinity of a client (and therefore in the Control Group) to also be in the Data Group most of the time as this creates duplicate packets.


Examples of these methods are based on discrete Fourier transforms (DFT) and fast Fourier transforms (FFT) [16] and the di.erent types of discrete cosine transforms (DCT) [7].

such algorithms su.er from poor performance when used to compress data spatially or when noise is present in the collected readings.


As inaccuracy increases in perimeter mode, dense network shows higher drop rate.

in lower location error, sparse network shows higher drop rate.


To support non-cooperative scheduling, it is currently necessary to use complex operating system solutions (e.g., realtime operating system (RTOS)), which require considerable processing overhead and reduce throughput performance.

our novel Fair Multithreading approach is integrated into the processor hardware and can ensure that threads receive exactly their weighted share of the processor while operating at the level of performance and granularity of existing cooperative thread schedulers.


This, and the manual effort required, means that our .ngerprints lack comprehensive coverage.

we Number of Autonomous Systems Figure 2: Vulnerable Servers by AS.


A large amount of work considered methods for coping with voids, face routing being one of the .rst solutions[1,9].

face routing requires the construction of a planar graph, i.e.


The number of initial bits to be used is called the initial stride, denoted I.A larger I can result in more small subtries, which can help balance the memory distribution when mapping subtries to pipelines.

a large I can result in pre.x duplication, where a pre.x may be copied to multiple subtries.


Using pseudorandom and changing identi.ers have been proposed for MAC addresses [15,18] or for the whole stack [2,23].

these proposals do not solve the access-point discovery problem, but can be complementary for the discovery protocol presented in this paper.


For example, if the network is used for supporting unicast two-way communication between a large number of users, it is indeed true that there will be roughly as many destinations as there are sources.

there are many conceivable applications for which the assumption is inappropriate.


Morpheus allows operators to write their own route-selection algorithm that selects best routes based on the tags set by the import policy modules.

many network operators would prefer not to write a program (e.g., in Cor another higher-level language) every time they change their routing policies.


In this case the obvious solution would be to deploy FACH or HS-DSCH (when the moving UE enters the specific cell), multiple DCHs (while the UE is near the BS) and FACH or HS-DSCH (when the moving UE leaves the specific cell) respectively.

the efficiency of switching transport channels at very short time periods, as in the case where the moving UE is at the edge and leaves the coverage area of BS5 (Figure 8), should be further examined in order to minimise ping-pong phenomena.


This is out of several hundred thousand observed APs all together, the vast majority of which were encrypted.

except where noted otherwise, most results were computed using 124 hours of actual mobility, de.ned as driving periods with a maximum stop of 2 minutes.


In the extreme case, Acould send STORE RPCs simultaneously along several outbound tunnels.

this parallelism may produce a large unnecessary signaling overhead depending on the stability of the network (and thus, the stability of the outbound tunnels).


DATA 3.1 Networks Studied This analysis of OD-pair .ow properties is based on measurements from two different backbone networks.

it is not speci.c to backbone networks and can be applied to different types of networks.


UWB communication sets special challenges for the MAC design because signals are noise-like and traditional carrier sensing methods cannot be applied.

mAC protocol should enable that the number of retransmissions can be minimized and the channel access can be done efficiently.


We performed analysis and simulations for all listed weekly activity periods.

due to the similarity in results from a given phase s weekly periods, we only present results for one week from each phase: we use week 34-2009 as a representative week for the pre-peak phase, week 50-2009 for the peak phase, and week 26-2010 for the post-peak phase.


Thus the time average of the total information transmission rate of the network over the time interval [0,8), say , cannot exceed WmaxU, either.

each bit of information that reaches its destination is transmitted in the network times on average.


For all graphs, the throughput drops as the number of receivers increase.

the throughput of our algorithm drops much more slowlybecause it tries to .nd low degree trees to take care of primarycon.ict.


Typically bursts from di.erent QVPNs tend to be temporally spread out and multiple QVPNs rarely burst simultaneously.

such events do occur and small window sizes are more likely to miss  Figure 9: Number of admitted QVPNs with di.erent CDF measurement windows.


In this work, the transmitter and receiver are designed by assuming a perfect channel state information (CSI) at the receiver.

in real applications, when coherent detection is performed, channel estimation becomes an important issue.


In most existing applications consensus algorithms can be modelled as positive linear systems, which then allows the elegant theory of Nonnegative matrices and Markov chains to be employed to capture the convergence properties of the algorithms.

little is known about implicit nonlinear consensus problems (see [18]moreau) and one of the main contributions of this paper is the proof of global stability for the implicitly given nonlinear systems describing the dynamics of algorithms presented in the next two sections.


OFDM symbols are constructed in a way that both the symbols and their sub-channels are orthogonal, resulting in a zero Inter-Symbol Interference (ISI) and zero Inter-Carrier Interference (ICI) in an ideal case.

in reality, the presence of fading environments and Doppler spread/shift destroys the orthogonality between sub-carriers as well as the orthogonality between OFDM symbols on a single subcarrier.


It is entirely up to the app to use SSL and to (mis)inform the user about the security of the connection.

even when apps present warnings and security indicators, users need to see and interpret them correctly.


The work based on fluid model [9], which takes into account both the random multiplicative decrease and the role of bottleneck buffer, shows that the system can still converges to fairness.

our simulation results (see section 4) reveal that it takes very long time to converge to the long-term fairness (measured at a timescale of connection time), when evaluated by a new fairness metric proposed in section 4.2.


When all communication is symmetric (from the routing perspective), availability of many parent choices implies high rate of overhearing.

only the nodes that actually route traf.c for others need to listen continually for incoming traf.c.


So, we add all the nodes which are in the N-hop communication range of the CH as cluster members.

members of each level have di.erent tasks.


Each context domain maintains its own context type system.

a concept of a domain may be related with a concept of its super-domain, through a sub-typing relationship.


In general, the average packet latency decreases as VCs are increased in the addition algorithm, and decreases as VCs are removed in the deletion algorithm.

the change in packet latency is much smoother in the case of deletion of VCs, compared to addition.


Typically, such APs use 802.11 and are deployed for stationary users.

the range of 802.11 also allows for connectivity for seconds or more at a time from moving vehicles, as several testbeds have demonstrated both in urban [3, 6, 12] and developing regions [14, 16, 9].


In most local clustering algorithms in wireless sensor networks, to prolong the sensor network lifetime, the probability of a sensor node s being selected as a cluster head primarily depends on its own residual energy.

in some special cases, it doesn t help balance the energy load for the proper nodes.


Under higher traffic generation, both schemes are difficult to forward packets thus many generated packets are dropped at the source nodes.

sPEED has higher packet lost because SPEED reduces the rate of packet transmission when congestion occur thus SPEED looses more packets.


Our results con.rm the results from [11] in that routing protocols in a mobile ad hoc network are not scalable with increasing tra.c.

mAPM selection of choosing longer paths may in fact be leading to better network utilization and load balancing in comparison to the shortest path approach taken by AODV.


Clearly, both processes output a random bit, so they are computationally indistinguishable as the distributions are identical.

symbolically there is only one trace for the .rst process, while two for the second, and both traces of the second process (one where the output is 1 and one where the output is 0) can be distinguished from the single trace of the .rst one (where the output is 0 or 1 with probability 1/2).


Let the Market Drive Deployment: A Strategy for Transitioning to BGP Security Phillipa Gill Michael Schapira Sharon Goldberg University of Toronto Princeton University Boston University Abstract With a cryptographic root-of-trust for Internet routing (RPKI [17]) on the horizon, we can .nally start planning the deployment of one of the secure interdomain routing protocols proposed over a decade ago (Secure BGP [22], secure origin BGP [37]).

if experience with IPv6 is any indicator, this will be no easy task.


The value of STE is used in a probabilistic manner to determine whether to transmit the next packet or not.

the authors in [8] present the Linear Integrated Message Rate Control (LIMERIC) algorithm, where the transmission rate for a vehicle is determined such that the total channel load remains below a specific threshold.


Accessibility: It is not uncommon for devices (even when placed side-by-side) to be unable to communicate directly with each other because they might be connected to di.erent access networks (e.g., Wi-Fi vs. Cellular).

the common global cloud is accessible from any interface that has Internet access.


We use the percentage of locally stable nodes to measure the progress towards completing a stable topology.

this measure does not detect if multiple disconnected topologies have formed.


Instead, it relies on a 23 4 56 78 910 Accuracy low level signaling system at the sink that instructs the nodes to transmit their data when required.

the pro ters, and report only the clustering results to the sink.


Consequently, the operator is interested in limiting the access speed of each user and charging him a profitable price.

each user aims to get the highest access speed as possible with the cheapest price.


This initial work we have completed has highlighted interesting areas of consideration for future work speci.cally related to the improvement of our Handover Manager and its functionality.

in addition it has also highlighted some broader ranging concerns related to the challenges of incorporating Mobile Ad Hoc Networks into the Internet and the shortcomings that need to be tackled to better support intelligent handover in this domain.


To achieve this there have been significant additions to the codebase to support the new ontological types and operators.

it must be noted, the operation of the KBN as a nonsemantic Siena CBN has not been compromised in any way.


contention nodes results in the reduction of the collision probability.

as the number of hidden nodes increases, throughput is exponentially degraded.


The advantage of FASA is that it is more stable compared to Q+-Algorithm that su.ers from the estimation s .uctuation [20].

fASA is designed for only one channel, and can not be directly generalized, as demonstrated in the next section.


These false negatives occur when a node illegitimately continues to advertise a MPR selector even after the selector has deselected the node as a MPR.

these false negatives can only occur during the History_Retention_Duration period and thus this optimized rule can detect any sustained TC link spoofing attacks.


If there are only compromised sensors (that is, no compromised CHs), only the last two procedures are performed.

if at least one CH is compromised, then the sensors should first engage in the cluster organization procedure and this requires extra communication overhead.


Once a route is established for a pair of source and destination nodes, it is likely to be valid a long time of period because link failures and link formation is rare in static networks.

this is not the case for dynamic networks.


9 con.rms, the SSH brute force attacks invoked three DNS queries for one SSH login request, so DNS-DHR became higher.

since this Web proxy performed like a prefetch-disabled Web browser after proxy requests as shown in Fig.


In this way, MANNA architecture is able to locate faulty sensor nodes.

this approach require an external manager to perform the centralized diagnosis.


Typical outer loop power control procedures increase or decrease the target bitenergy-to-noise-density ratio in order to achieve this .xed frame error rate.

we have seen that in order to achieve e.ciency, the optimal target bit-energyto-noise-density ratio should depend on the packet success probability as a function of the bit-energy-to-noise-density ratio, and in particular for best-e.ort tra.c should satisfy (11).


Depending on the policies establishedamongASesand ontechnicaldecisions, somedirect connections may not be announced to the route collector.

for the same economic and technical reasons it is possible that the same direct connections hidden from the route collector are announced to other neighbors, propagated on the Internet, and .nally detected by the route collector from another feeder as a side e.ect.


Note how for CR=100m and lower, all messages created by the application are transmitted to the channel.

due to the high values of CBT not all intended messages can be sent to the medium when having a high PGR in case of CR=150m and 200m.


In the following we focus on the WiMAX technology [4], which is built on top of the IEEE 802.16 standard [5] and is one of the candidates for next-generation mobile BWA networks.

the general idea of the energy-aware framework could be applied to other technologies too, like 3GPP LTE.


The optimal matching with the minimum total cost of the edges in the matching can be found by .ow algorithms in O(k3) running time for k events and k resources [16].

implementation of the centralized mincost matching solution is not feasible in the sensor network setting for two reasons.


3.3 Variable traf.c and large time-scale For large threshold T , the HHHs are mostly among pre.xes with shorter length covering many servers, whose traf.c are often more stable due to statistical multiplexing.

when we decrease the threshold T , there are more HHHs with longer pre.xes, whose traf.c may change more frequently (e.g., it is more likely that a single VM sends bursty .ows).


Traceroutes yield path information only at the IP routing layer, i.e., layer 3 of the networking stack.

path in.ation could occur below layer 3, e.g., in MPLS tunnels, and hence may not be explainable by the geographic locations of traceroute hops, as seen in the example presented in Figure 17.


Initially, the reassignment and aggregation had the positive result of maintaining slower growth in FIBs, while at the same time, new address prefixes were assigned to enterprise networks joining the Internet.

the growth in FIBs returned to an exponential rate (and later a high linear rate) due to de-aggregation stemming from adding multi-homed and loadbalanced address assignments [3].


Some routers have built-in Webservers that can be used as an alternate data source.

more specialized in-network caches can also be deployed as bumps-in-the-wire to optimize the tra.c ef.ciency by caching a certain amount of the in-transit tra.c based on the content popularity.


Hence, it appears that there is nothing speci.c about users who enter these hotspots relative to those who do not access them.

on considering the actual applications accessed atthehotspots,things arequitedi.erent(seeFigure8(b)).


Nonetheless, inferring e is not straightforward since it could be an arbitrary number imposed by the application (not necessarily following a sequential order).

sTARR-DCS de.nes a non-secure mechanism (named Meta-Information Service) to easily retrieve the value e for any application running in the network.


This way, high data rate can be supported by increasing the duration of each symbol, which reduces intersymbol interference (ISI).

multi-carrier transmissions may not be suitable for low-end sensors due to their high complexity.


For rigid geometries and con.gurations without errors, there can only be one pair veri.ed.

for con.gurations with errors, we relax the algorithm slightly to select the pair with the closest inter-distance value to d2,3.


Our work uses a similar decentralized on-line algorithm.

the prior approaches [8, 11, 13] do not consider the event dynamics in the network design.


If the request bandwidth is defined after a new incoming user call for service from a candidate network, the user may choose the interface which is in the high level preference among the available interfaces.

if there is not enough bandwidth for the new incoming user, it will select the interface orderly which is barely in the down level preference.


DRIVER MODIFICATIONS The channel abstraction module has been designed for use with any existing driver.

without making some driver modi.cations, the switching delay could be excessive, and many packets could be lost after a switch (the packets present in the interface driver queue).


When huge traffic injected into the network, the rate of packet reception for both schemes increases significantly until reaching a peak at 1400 Kb for ExtTeGAR and around 900 Kb for SPEED.

at the highest traffic rate (10ms), ExtTeGAR can maintain the rate more than 1000 Kb while SPEED drops almost half of its throughput.


The resulting topology has an average latency of O(ln n/In ~).

the high probability bound no longer holds.


Using a para-virtualization approach and have the VMM vendor supply the para-virtualized driver is technically possible.

given the WLAN management functions are complex and the management interface between host driver and wireless LAN device is often proprietary, the reality is that VMM vendor would only provide the smallest common denominator of many wireless network cards.


The MobiNet Framework Figure 1: MobiNet Architecture We borrowed some basic design principles from the publicly available ModelNet [10], an emulation environment for wired and static networks.

mobi-Net required a complete reimplementation of the system given the inherent differences between wired and wireless networks.


As channel becomes worse, all the achieved system throughput decreases.

the obtained throughput of cooperative scheme decreases slower than the traditional scheme because the spatial diversity obtained from di.erent relay nodes is more evident than the time diversity exploited nels.


From the results, we have identi.ed, to some extent, similarities and di.erences in the regional AS topology structures.

there are still a lot of rooms to improve in the analysis and evaluation methods.


Our results show that AP strategies based on charging are rarely pro.table or are highly sensitive to factors out of the control of the AP.

the AP can obtain substantial additional pro.t by engaging in selective peering with CPs or caching CP content locally.


In a naive approach, this node could examine its packet queue, and select the (channel, seed) pairs that lead to the best opportunity to send the largest number of packets.

this ignores the interest this node has in receiving packets, and in avoiding congested channels.


Compared with the throughput in baseline scenario, node s sel.shness saved energy for its own transmission and improved the throughput.

cooperative nodes must spend more energy to relay packets.


Then, FAPs allocate their subchannels to the linked FUEs aiming at maximize their own payment that guarantees the optimal result of the second step.

the step optimum cannot guarantee global optimal result because in the .rst step, each FUE only concerns its own choice and it doesn t know other FUEs choice which means other FUEs linked to the same FAP may compete for the channel resource.


IVI translation has little overhead for both the Linux and bare PC implementations regardless of the higher layer protocol carried in the payload.

eliminating the operating system overhead would enable more efficient translation.


Little work was found about these aspects and even fewer related to management of multivendor networks.

regarding Tra.c Engineering, a lot of work has been done and can be found.


carried out a similar measurement study on multiple commercial 3G networks [20].

their study is limited to one location (Hong Kong) and a few devices.


The deep research on brain complex networks and the computational neuroscience will have a profound e.ect on arti.cial intelligence methods which models the mechanisms.

the paper only discussed the strategy as time window for complex networks with time varying edges.


We are not aware of any vulnerabilities created by having a long certi.cate chain.

it is worrisome to see leaf certi.cates directly signed by root authorities, because this indicates that the root signing key is being actively used and may be stored in a network-attached system, raising the risk of compromise.


In [17], the authors provided an algorithm that achieves the full capacity region of the wireless network.

their algorithm requires solving a global maximization subproblem at each iteration.


Our traces show several instances in which WiFi dominates 3G.

the traces indicate that this is a simpli.ed view: 3G may also dominate WiFi in many instances; one may offer better uplink bandwidth and worse downlink bandwidth; etc.


The results prove the effectiveness of the genetic operators and show the advantages of a genetic optimization.

these operators have to be con.gured carefully to avoid local optima.


In this case, direct communication with the sink is needed.

the probability of successful transmission is very small and can be omitted.


The trade-o.s should now be clear: by using a more aggressive forwarding policy (i.e., higher ui(t)s and for longer durations), the message propagates at a faster rate and hence there is a greater chance of delivering the message to the destination earlier.

this will lead to lesser overall remaining energy in the nodes upon delivery of the message, and it will potentially push the energy reserves of some nodes toward critically low levels, degrading the future performance of the network.


On the other hand, the same model is also employed to show that Fisheye OLSR can reach the scalability bound.

in practice, the algorithm needed to adapt the behavior of the protocol to a given large MANET, in order to reach the scalability bound while maintaining enough connectivity, is not assessed.


Such rate diversity can drastically reduce network throughput using standard 802.11.

this channel diversity presents a setting where it can be particularly effective for superposition coding.


What is key to note here is that the LD-MW algorithm (similar to the Naive Dijkstra algorithm) does not consider the WMA when .nding paths.

once the paths are found, they are post-processed and any incidental WMA bene.t is realized.


For instance, social networking websites like Facebook and MySpace are good examples of how advancements in information technology can help people to meet online, form and support a much larger number of online relationships than it has ever been possible before.

many researchers and the public at large are finding it practically impossible to keep up with the vast amount of accumulated online data.


After a is informed of the creation of the Business SIG, it sends its peer description to b, and then adds a SIG link to b into its routing table.

after b receives the response description, it adds a SIG link to a into its routing table.


For the maximum energy ef.ciency, an optimum data size limit in the specialized data preamble frame is found out.

any other data size may also be speci.ed from the application.


First, nodes use local intermediaries when establishing path keys in GKE, so only local communication is needed to transmit key establishment messages.

intermediaries in PIKE could be anywhere in the entire target region, so that network-wide communication is required.


This is important for systems that need to keep per .ow state, like stateful .rewalls and .ow meters.

due to their short-lived nature, one-way tra.c corresponds on average only to 3.4% and 0.79% of the total number of packets and bytes, respectively.


Most of the proposed protocols for MANETs rely heavily on broadcasts (e.g., DSR [22] and AODV [28]).

neighbors using a multi-channel MAC could be on di.erent channels, which could cause broadcasts to reach signi.cantly fewer neighbors than in a single-channel MAC.


Further, our use of BDDs has been inspired by [20, 12, 13].

while much work on .rewall analysis deals with issues related to miscon.guration of individual ACLs, our focus is on modeling CoS policies in a networkwide fashion across multiple routers.


Non-exclusive spectrum sharing scheme imposes self-interference.

though exclusive spectrum sharing avoids interference, it incurs high control overhead, hence an optimum tradeo.


One may also impose a constraint on a selected random path so that it contains at most 3 hops.

our simulations indicate that this results in higher average packet latency because it limits the number of available paths (we discuss our simulation infrastructure and methodology in detail in Section V).


5, we con.rm: (1) EDGE and RELAY mostly resemble the upstream and middle-stream since they contain many peers with bandwidth declaration of 1000 and 120 Kbps, respectively, (2) RELAY is likely to be the cluster that contains many in.uential peers for index poisoning since the .le keys distributed to the RELAY spread more and faster.

since the volume of RELAY peers is nearly half of the total peers, we now consider identifying an even smaller set of in.uential peers among RELAY to achieve more effective Key Spread (Normalized) 5 4 3 poisoning.


INTRODUCTION Opportunistic Spectrum Access (OSA) by cognitive radioenabled secondary devices has emerged as one of the promising approaches to increase utilization of underutilized licensed spectrum bands.

oSA approach requires that the secondary users should not violate any acceptable interference bounds speci.ed by the licensed (primary) users.


This traf.c is mainly con.ned to the host s subnet and hence not seen in our inter-subnet traces.

the traces are too low in volume for meaningful generalization.


On the other hand, when Alloy does not ask for the size, it generates all possible models and the space explodes in size.

this problem is inherent in all state-of-theart model checkers and enumerators.


As a result, LUM-Nets are expected to provide very good coverage outdoors.

since the infrastructure is restricted to be outdoor, client nodes within buildings are not well connected.


Our scheme only needs to keep track of quantiles of interest and has no additional memory requirement.

non-SA based algorithm s space requirement depends on which quantile is estimated (more samples are needed for extreme quantiles).


Consequently, RPSP will a.ect RCP-performance (e.g., goodput) because it is a function of parameters such as round-trip time and actual packet corruption rate, which are a.ected by the transferred packet size distribution [7].

in previous work on RCP performance analysis over links with bit-errors, such as studies for TCP [2, 9, 13], the e.ect of RPSP was ignored.


This is actually the way the ns-2 is implemented.

in the latter case, if the first signal is weaker than the receive threshold but larger than CS threshold, the receiver can receive the second signal successfully.


Our results indicate that by using only ~10 % of the spectrum required for infrastructure-based podcasting the system may achieve throughputs of up to 20 % of SRR rate offered by multi-channel radios.

the density of 1000 podcast users per km2 might be hard to achieve, even in dense urban settings.


Ponder2 is policy system that can scale from high complexity, large-scale distributed systems to mobile devices such as smart phones or gumstix as long as a Java runtime environment is supported.

ponder2 still imposes severe overheads for sensor nodes that are not typically capable of running a Java runtime environment.


Also it is imperative that the location being detected be within the triangle.

this requires covering a service area with multiple triangles.


Since all packets buffered in the hardware queue are .ushed during a hardware reset, a queue size of one also prevents multiple packets from getting dropped during a channel switch.

if a MAC does not require frequent channel switching then a small hardware queue size might incur a penalty in the performance of the software MAC.


At the same time network-based local mobility management has been identified as an important cornerstone for an overall mobility management framework and is currently covered by PMIPv6.

local and global mobility management are separated and serve different purposes with little interaction.


After these three phases, a node begins transmitting data on the new path.

the new path includes at least one attacking node with probability 1 - (1 - p)h .


In www-transfers HTTP version 1.0 was used, meaning that a separate TCP-connection was established for each ob ject within a page.

pages used in the measurement contained only a single object.


Under the assumptions made in Section 3.1, the optimal value fusion rule is to compare the following weighted sum of sensors measurements to a threshold(the derivation can be found in Appendix A): X si Yopt = · yi.

s i as sensor measurements contain both noise and signal energy (see (4)), the weight ss i , i.e., the SNR received by sensor i, is unknown.


Theydifferin thatFatTree useslarger quantitiesof lower speed (1Gb/s) links between switches, whereas VL2 uses fewerfaster (10Gb/s) links.

in BCube[6], the hierarchyis abandonedinfavorahypercube-like topology, using hosts themselves to relay traf.c.


Cluster head gather sensing data from sensors in corresponding clusters and forward data to the outside data sink [5], [6].

in such network cluster heads consume much more energy than other sensors.


Thus Flow A has equal probability of capturing the channel after each successful packet transmission by either of the .ows.

the transmitter of Flow A does not hear any packets from Flow B, and continually attempts to gain access to the channel via repeated RTS requests.


Without providing the details about the GPS localization technique, a general comment about the localization accuracy is that it is su.cient for the general use in automotive industry and that it can be su.cient for a variety of robot deployment applications.

it is worth noting that all the GPS localization techniques need a signal from the satellites, which rules out this approach in con.ned and indoor environments.


Another approach is to invalidate that tree and let the tree formation process reassign the nodes to a new tree, which will happen only if the sensor network is connected.

this approach has a maximum hop distance equal to that of the static sink approach.


One explanation for this phenomenon is that once a user exceeds the service plan s download quota, there is a resulting reduction in speed.

websites for the above network operators state that speeds are usually reduced to 128, 256 or 512 kb/s, which we do not see in our results.


While its matching quality is therefore inferior to that of the wavefront-based implementation, its general behavior is otherwise similar.

the separable input-.rst switch allocator eventually becomes limited by the fact that it can only propagate a single request per input port to its second arbitration stage; consequently, it s matching quality starts to .atten out once the probability of at least one VC at a given input port having a .it available in any given cycle becomes high, and is generally lower than the one o.ered by the other two allocator implementations.


Many recent proposals address the performance issue by providing location-independent network bandwidth, either through richer topologies [10,11] or through rate limiting [12 14].

as we discuss later, the former solution may be an overkill while the latter requires tenants to express their demands and results in network fragmentation.


The mobile nodes can locate and hover above the static nodes for data muling, and can perform useful network maintenance functions such as deployment, relocation, and recovery.

due to the limitations of optical transmissions, communication is enabled only when the sensors and the mobile mules are in close proximity.


Upon reception of these n NACKs, the base station would have to retransmit all n data packets.

with rateless coding only one sensor needs to request the transmission of an additional encoded packet (assuming the other nodes can overhear that request).


Because false negatives are inaccuracies in the measurements themselves, we cannot directly measure how often they occur.

we can draw some inferences from the data.


With the network-centric approach, a centralized controller decides which network to access.

this approach comes with signi.cant communication overhead.


Pure probabilistic forwarding is prone to percolation, leading to either network .ooding by redundant copies of the same packet, or too few nodes receiving it [5].

centralized deterministic schemes, designed for mesh networks with static nodes, incur high overhead and are vulnerable to metric misinformation due to use of forwarding lists, which propagate such errors.


Randomization is an e.ective technique for availability against such attacks; for instance, spread spectrum technology randomizes the channel access to counter jamming.

spread spectrum technology assumes dividing the medium into multiple orthogonal channels, only one of which is accessed per time, and thus has an inherent spreading cost.


Consequently, several existing virtual network switch functions [17,21,24,25] provide multi-tenancy based on VLAN tagging.

vLAN-based tenant isolation poses a scalability problem [20]: a limitation on the number of tenants.


TESLA++ prevents such attacks by sending only the MIC of upcoming broadcast frames within the .rst broadcast like in EBEAP.

tESLA++ still requires delaying the second broadcast.


However, this allocation requires more bandwidth in the core of the network and thus could be prone to congestion, as illustrated in Figure 1(b).

to reduce communication through oversubscribed network elements, we can allocate all machines of the application on the same rack or under one aggregation switch, as proposed in [6, 17].


Consequently, in times of normal operation it was able to run at nearly optimal duty cycle.

in case of connection interruptions the interference a.ected all its possible connections resulting in a fallback to bootstrap mode.


This allows for an additional level of spatial reuse where the femto cells reuse resources assigned to macro cell.

the interference between macro and femto cells operating on the same resources must be carefully addressed.


Most existing designs of ad hoc network routing protocols are based on the assumption of non-adversarial environments that every node in the network is cooperative and well behaved.

such assumption usually does not hold in realistic environments.


When two nodes are within the communicating range of each other, they can exchange information directly.

when two nodes are not within each other s communicating range, they can still communicate with each other provided there are nodes in between who can pass the data packets for the communicating nodes.


For a given video pro.le level, a low quality link requires more number of PRBs to achieve the same video quality as compared to a high quality link.

over-allo cating PRBs can lead to the eNodeB running out of resources, or bu.er over.ow at the UE.


In case of a packet collision, only RTS is Slack Distribution Area = c Area = 1 - c Smin Smax Figure 1: Chop partition wasted, not the whole data packet.

this protocol cannot completely provide deterministic access to a node due to inherent message collision.


Like in video streaming experiments, the peak reduction varies signi.cantly among cells, ranging from 6% to 50%.

different from video streaming, CoAST-based web browser helps more than 55% cells achieve more than 30% peak reduction.


When programmed with this support, motes can form a network substrate capable of ondemand hosting of a virtual WPAN composed of newly incarnated virtual motes.

the supported virtual network need not be contained within a single host substrate, but can assume a crossdomain span over neighboring networks with a little coordination between host network gateways.


The asymmetric channel view consideration, is also not taken into account in the quorumbased related work, but in [8, 19].

[8] assumes the knowledge of the largest possible ID being also the network size (here in.uencing the period size).


However, the raw processingperformance of network processors and programmable logic devices is higher.

these systems do not use operating systems and thus require more complex code development.


This means that, when a new packet is sent from the TU, it will replace any existing packet in HTU s bu.er.

it will not a.ect the HTU s bu.er which is reserved for other TUs.


This approach is closer in spirit to approachesin wired networks that have attempted to detect congestionat the ends [18, 22], but with one important difference: inRCRT, a sink has a more extensive view of network performance than, for example, a TCP sender, since the sinkreceives traf.c from many sources.

it would be incorrect to merely borrow congestion detection methods used in wired networks.


(10) n-o If the right-hand side of the inequality in (10) increased everywhere slower as a function of Rk than Rk itself, we could say that the q-quantile of Rk is the unique .xed point of the square-root expression with each n; this is in general not the case.

taking the equivalent squared inequality 2 log n + (k - 1) log(nmR2 k ) - log(k - 1)!


On the one hand, indexing in smaller block sizes improves local availability and consumes less energy by reducing number of Internet downloads.

indexing in smaller block sizes consumes more energy during indexing due to the need for frequent merging of the partial indexes.


The complexity levels of these algorithms span a wide spectrum, ranging from no message passing to constant/polynomial time complexity, or even exponential complexity.

by and large it remains open to quantify the impact of message passing complexity on throughput and delay.


Hybrid ad hoc routing protocols such as zone routing protocol (ZRP) [13] tried to combine local proactive routing and global reactive routing in order to alleviate the large amount of flooding control traffics.

the properties of frequently route breakage and unpredictable topology changes in MANETS still make most of these traditional routing protocols inherently not scalable with respect to number of nodes, control overhead and degree of mobility.


DISCUSSION Most work in this area has focused on raising the level of abstraction of network con.guration by various means of generating routing con.guration .les [1], checking correctness of such con.gurations [4], or centralising the computation of routes [3].

we are attempting to integrate the design ofa con.guration language with an underlying algebraic semantics.


The models can sustain no loss along any branch.

due to the fact that there are no dependencies between siblings in the tree, if a loss occurs, streaming of other branches in the tree may continue without interruption.


The client must then validate the certi.cate [2].

validation checks are not a central part of the SSL and X.509 standards.


In contrast, traceroute measurements provide the ability to infer the data paths that packets take when traversing the Internet.

because theyare activemeasurements, traceroutes can be designed to potentially cover every corner of the Internet given suf.cient numbers of vantage points (VPs).1 all existing traceroute-based projects are restrictedby their limited number of VPs.


There have been generally accepted notions that the public view is good at capturing customerprovider links but may miss peering links.

there has been no systematic effort to provide hard evidence to either con.rm or dismiss these notions.


through the deployment of additional infra-structure, such as distributed antennaarrays,relay nodes, oradditionalbasestations(to reduce cell size).

infra-structure is expensive, and may face many practical and regulatory hurdles, in particular, in connection to antennaplacement.


Under these scenarios, several protocols, which require interfaces to switch frequently, have been proposed.

implementing protocols which require frequent interface switching in existing operating systems is non-trivial.


If traf.c is balanced at the granularity of hosts or subnets, all .ows for a host will traverse the same IDS instance, and the counters can be moved to that instance.

when .ows involving the same host are balanced to different instances, both instances must have the relevant counters.


To determine the AS number corresponding to an IP address, one performs a lookup in BGP routing tables.

it is common that customer routers get upstream-facing IP addresses from their provider s address space.


For compatibility with existing 802.11 compliant networks, our clients would have to transmit an acknowledgment within the SIFS period of the broadcast packet to avoid collision with any other transmissions.

hidden terminals are not immune to this scenario and may cause collision at the client nodes.


This is due to the fact that the busy status in an overlapping channel may not be sensible to the WLAN devices, which in turn prevent the 802.11 MAC based on carrier sensing from working properly.

we observe that when two channels are 20 MHz apart (or channel gap is 4 in terms of the channel number), e.g., channels 1 and 5, the performance loss is rather negligible.


Afree space propagation model assumesthat radio signals emittedfromapoint sourceof energytravelin all directions in a straight line, and .ll the entire spherical volume of space with energy strength varying with 1/r2 rule.

realworld signal propagation cannot be modeled accurately by this model.


This phenomenon can be attributed to the limiting e.ect of the parity slot prescribed by SSCH when the network is close to saturation: nodes using SSCH can only utilize (N - 1) channels speci.ed by (N - 1) seed values in the parity slot.

nodes using the other CH protocols can fully utilize all N channels in any time slot.


Furthermore, it sends periodic keep-alive messages in the connected and idle state, and consumes signi.cant power.

the SE-GC83 utility does not connect unless asked to do so, and stays in a low power state when connected and idle .


If we assume that link bandwidths c1 and c2 are static parameters, they can also be made known to the shapers easily.

the o.ered demand (i1 and i2 )is constantly varying and cannot be accurately measured.


This approach relies on tight time synchronization between sensor nodes and requires each sensor to be in the range of at least four other sensors in order to accurately localize the event, thus restricting the possibilities of dynamic con.gurations of sensor deployments.

sextant can determine the location of events based on their signatures, without time synchronization.


cyclo-stationary is slow at low SNR and one is not able to use it for statistical multiplexing at a packet level.


From any node, placing the next hop node at a distance of dchar on the straight line directing to the base station leads to an energy e.cient hop.

for a random deployment of the nodes in the plane, the next hop node is in general deviated from that optimal position.


3.3 Quality of Service Any communication device of the UCV network does not provide quality of service.

recently, a packet shaper device has been installed as shown in Figure 1.


Given these features, it is natural to think of forming a backhaul network based on IEEE 802.16 WiMAX nodes (Figure 1).

the cost of individual WiMAX base stations is still around $20000 whereas the cost of WiMAX subscriber station is only $300 and is expected to reduce further [3].


When a node v selects a node u to be its neighbor, v sends a JOIN message to u.

u might already have more than d + c neighbors, so u throws one neighbor, chosen uniformly, from u s neighbor list and inserts v instead.


Let a(t) be the percent- age of FEC overhead used to transmit successfully packet i at time t, then C/(t) is at least equal to C/(1 + ~(t)).

this is only a lower bound which may not be tight enough.


As the RREP is routed back along the reverse path, intermediate nodes along this path set up forward path entries to the destination in its route table and when the RREP reaches the source node, a route from source to the destination established.

if the destination or some intermediate node moves, the node upstream of the break remove the routing entry and send route error (RERR) message to the affected active upstream neighbors.


The above observations reveal a behavior with a very interesting structure.

the problem is very tough to deal with analytically, due to the randomness in the placement of nodes.


Our experiments with the WHOI micro-modem [13] suggest that a zero mean Gaussian model is well suited for ranging error, equation (5).

our solution can accommodate any other model.


Multicast in internet or mobile ad hoc networks (MANETs) has been studied for decades [5, 15].

the inherent characteristic of DTNs makes multicast in DTNs considerably di.erent and challenging.


It is not always possible to load all the accelerators required by the application as it has to compete with other applications.

due to the spatial cor- Figure 2: Unbalanced event occurrence.


[17] proposed a procedure to find distributed initial cluster centers based on the comparison of the distances between various data points.

their procedure requires a large amount of computation when the data size or the number of clusters is large enough like the case when clustering wireless signals.


To ensure that the matrix is neither too dense nor too sparse to capture the memory bus behavior, we used 20 columns per million instructions in the x-axis (every 1/20 of the one million instructions is mapped to a column), and the y-axis has 400 rows.

this dimension parameter is not of primary importance because the large matrix is scaled to a smaller matrix before any analysis is performed.


The selection of a single global t would make sense in a setting where all nodes are homogeneous and exhibit the same session duration.

past studies have demonstrated that node lifetimes are highly skewed [34], which in turn renders a single probe frequency far from optimal.


However, nodes around the sink deplete their batteries rapidly, and the network dies.

we can see that the circular strategy consumes signi.cantly more energy than both of our proposals.


Existing infrastructure and middleware systems can be used to construct end-to-end paths between eligible end sites.

such paths can only be established between a single pair of endpoints at a time and, furthermore, require detailed knowledge of the available services/resources along a path.


In the case where the client is a low-power device such as a cellular phone or PDA, this computational savings could result in a signi.cant reduction in latency.

the Java implementation of our algorithm can process blocks at a rate of 7.25 MB/s on a 1 GHz Pentium III, a rate equivalent to the download bandwidth of over 1,000 modern modems; we thus expect the additional per-client computational load on the server to be small enough to allow it to scale to large numbers of clients.


Theoretically, the delay pmf may have in.nite entries.

we can accurately approximate the pmf by including .rst M entries, so that the cumulative probability of the rest entries is less than a small value(i.e.,1%).