This solution is fully backward compatible with the existing APs, both the 802.1x and the earlier non-802.1x ones.

the operators of the APs can no longer keep their traditional network names.


From Figure 13, we can easily observe that when fs is greater than 7.06KHz, the error increases dramatically.

due to the extra computation burden from the period delimiter searching and the interruptions of the MCP to other tasks, the 7.06KHz sam  1000 800 600 400 200 Light Intensity (mV) CDF -600 200 -800 0 -1000 Calibration Interval (min) Figure 15: Logic time error v.s.


This type of static assignment is fully distributed, since there is no need to exchange information between nodes.

it only preserves the connectivity of the network if the number of available channels is less than two times the number of interfaces.


Several bu.er management strategies can be used: (a) (b)   Wireless Transmission Figure 3: In-road Geographic Forwarding (1) FIFO (First In First Out), where the packets that stay the longest in the bu.er are eliminated .rst.

this is not a good strategy because these packets may have more chance of being forwarded along the optimal path after waiting for quite a long time in the static node.


Because of sensor noise and the need to limit the communication costs, we will only be able to generate approximate coe.cients {d l} at each actuator, which will generate the approximate actuation .eld y.

in [24] we showed that the MSE in the actuated .eld is upper bounded by a term proportional to the total MSE in the actuation coe.cients, f 2 ||y - y||2 = Ba dl - d l. l.L it is intuitive to think that relative to an individual actuator s behavior, some sensor measurements will be more important than others.


It applies the CAC process, the best-effort rate control and the active queue management.

in MANETs, network congestion can still occur frequently under mobility.


This would militate for bringing brokers close to publishers and subscribers, leading to a dense overlay.

over a wireless channel, all frames are broadcasted and filtered by the receivers based on the MAC addresses.


In this case, the transcalar has the option of performing only one decoding process (on the base-layer only versus decoding both the base and enhancement layers).

using the base-layer only to generate a new scalable stream limits the range of bandwidth that can be covered by the new scalable stream with an acceptable quality.


This .gure clearlyillustrates that the throughputis determined by the service disciplines for small buffers, and by the .ow control mechanism for large buffers.

the transition from the small buffer regime to the large buffer regime does not occur monotonously; the throughput of some packet types .rst increases and later decreases.


However, in order to obtain a route to the target pre.x, the import .lter at the second hop neighbor needs to be recon.gured as well, calling for a second round of argumentation.

there exist scenarios where in the argumentation may not converge at all.


The second constraint decreases the chance of the tree becoming deeper due to the fusion.

there is no guarantee on the tree depth because the resultant node could have a different set of rules than the original nodes which may lead to a deeper tree.


By emulating the requested SSID, we can encourage the device to attempt to associate with us.

the association process initiates at the station, which will only attempt association if it recognizes the emulated AP as one that it has connected to in the past.


Our belief propagation algorithm is similar to a bit .ipping algorithm introduced in [33].

the algorithmic novelty ofBuzz lies in distributedly coding the bits of mutiple transmitters, on the air.


These four top ASes belong to commercial web-hosting companies; it is possible that this behavior is instead due to their customers creating such records pointing to the hosted address.

if this were the case we would expect to see the same behavior in many more ASes.


3) If both the attack and the peacetime captures are real, the system s attack detection rate is most likely to be very close or equal to the estimated detection rate of the manual analysis.

as can be seen in tests 4 and 8 for example, a synthetic peacetime capture may cause a system detection rate which is higher than the manual estimation.


Due to single channel virtualization, the client no longer experiences disconnections as it moves between APs.

despite VoIP prioritization, the client still suffers interference from co-located APs and thus fails to achieve the target reception rate of 50pps.


One possible solution is to attach each uw-sensor node to a surface buoy, by means of wires whose length can be regulated to adjust the depth of each sensor node.

the .oating buoys may obstruct ships navigating on the surface, or they can be easily detected and deactivated by enemies in military settings.


can be established before a disaster happens.

once connectivity is lost and the disaster mode is running, the protocols have to work in a completely distributed fashion.


RELATED WORK Our approach is in some ways similar in spirit to dataoriented architectural notions [4, 7].

while previous work has considered such a concept in general our goal is to build better security within the data delivery architecture that is currently deployed.


Similar to the INIC [1], we redesign a NIC and integrate it onto a multicore CPU.

our paper makes the following contributions compared to [1]: 1) Receive Side Scaling (RSS) [4], a technique for multicore systems to map each TCP session to a specific core and balance workload across multiple cores, is deployed in the integrated NIC to leverage multiple execution cores; 2) we examine the behaviors of the integrated NIC with network receiving optimizations; 3) by leveraging the integration, we design an I/Oaware last level shared cache (LLC).


It does not support automatic channel selection.

channel switching can be con.gured manually by the user.


Some connections show higher approximation error due to the independence assumptions used in the model.

the capacity for the overall network and longer connections is approximated well.


Woo and Newman-Wolfe [12] used a fixed tree based on a Huffman code.

this tree was not adapted to the dynamic requests in the system.


Special application behavior: P2P applications try to reconnect to systems they have been in contact before as such systems are often preferred peers by application design.

the dynamic nature of P2P networks and in particular nodes unexpectedly leaving a network result in one-way reconnection attempts.


However, when connectivity is not assured, as in networks where some of the nodes are equipped with only one single interface, this channel assignment strategy degrades the performance due to network partitioning.

the CCS-based channel assignment obtains the worst results in all the considered scenarios.


The shortcuts are created using the communication between H-sensors and between H-sensors and L-sensors.

the communicationbetweenH-sensors andL-sensorsisdirectional when the communication range is greater then L-range.


Because the perturbation polynomials added to nodes u and v are di.erent, this addition changes the original match key at both nodes into new values that do not match anymore.

we can throw away the least signi.cant r bits of the results after the addition, and thus, we only have to deal with the most signi.cant l -r bits of the results.


As expected, the MAC Collision Risk decreases when increasing the CW size.

this in turn increases the average MAC access delay (de.ned by Equation 11), thus producing higher values of the PUR index.


Recently, several QoS signaling schemes for MANETs have been proposed in the research literature [4, 6].

these schemes were not designed with security in mind and are highly vulnerable to attacks, in particular, denial-of-service (DoS) attacks.


Thus if the IPS received P1,P2,P3,P4,P5 in order where packets P1,P4, and P5are small and P2and P3 are large, then P1and P4 are consecutive small packets, and so are P4and P5.

p1and P5 are not consecutive small packets because of the presence of P4 in between.


Being limited to two antennas (two spatial dimensions) at the clients and assuming no transmitter cooperation, only two of the streams can be delivered in this network without IA.

with IA all three streams can be delivered.


This is an interesting result in terms of showing that rough sorting is almost as good as exact sorting.

the implementation requires a complicated data structure such as a Van Emde Boas tree that typically would have higher constants, and is not suited to a hardware implementation.


This might be attributed to the fact that the spectra of OFDM subcarriers overlap with each other in the frequency domain, such that narrowband interference a.ects several subcarriers.

bestdmax , fairsmin and fairdmin perform very well under conditions of narrowband interference with respect to error rates.


The threshold method is a simple mechanism for line code selection.

the threshold method may not be applied to various reader-tag con.gurations.


As canbeobserved from Figure16, thedi.erence in weights w(P2) - w(P1) decreases with N. However, the di.erence in weights w(Pl) - w(P1) increases, which makes the di.erence in weights between the link-disjoint paths a less suitable upper bound in sparse networks that have a large expected hopcount.

since w(P2) - w(P1) gives us a conservative estimate, this is the more important measure to predict the stability of a path in worst case.


To reduce the traffic volume, constructing a share tree that explores the data aggregation potential is an important issue.

a share tree might be disconnected due to the existence of unpredicted obstacle.


Redondo Beach, CA, USA been drawing special attention these days because the .ngerprint based localization is capable of achieving much better accuracy than trilaterations can.

high accuracy cannot be achieved easily even if we adopt the .ngerprintbased approach.


We observe that most of the screen-off traf.c (in terms of the energy impact) is less delay-sensitive, e.g., push noti.cation, since user interaction is not involved.

there are also some exceptions for screen-off applications which requires real-time data transfer, e.g., when the user is making a VoIP call with the screen off.


The gain includes not only very high FRR coverage for failure protection but also minimized possibility of experiencing post-failure network congestion.

imprudent tunnel endpoint selection can cause severe congestion after the affected traffic is diverted onto the randomly selected tunnel endpoint.


7.2 EpochbasedScheduling The notion of epochs itself is not new, and has been used in other schedulingproblems,includingfor wireless networks[18].

such prior work used epochs to aggregate knowledge about traf.c demands in a distributed environment, while we use epochs tohideinaccuraciesin schedulingdue to variablelatencies onthepathfordownlink schedulinginenterpriseWLANs.


Readjusting step in scheduling algorithm is performed at every scheduling loop.

it can be performed once per several scheduling loops to reduce the computation com- plexity of scheduling algorithm.


When applications request a service or data, they care only about the identity (for service) or content (for data) of the object they requested; the particular end-host servicing a request is immaterial.

today s DNS-based names for services and data (e.g., URLs like http ://abc.org/dog.jpg) force applications to resolve service and data names down to an IP address (e.g., to fetch the data named by the URL above, the Web browser itself, rather than a lower level software module, has to learn the IP address represented by abc.org), thereby binding the application request to a particular network location, as expressed by an IP address.


Other means of grouping pre.xes could also prove to be useful, e.g., all pre.xes served by a common intermediate shared AS or AS path.

we are still exploring the incorporation of these other techniques for grouping pre.xes, while ensuring that the fraction of in.ated pre.xes in a group remains high.


At each ADC output, timestamps are inserted to digital samples based on this shared hardware clock.

this hardware clock will be checked when digital waveform is going to DAC inputs.


clean does not support named tracked types and is thus unable to express alias relationships.


Furthermore, the ability to provide end-to-end QoS control as well as to allow ubiquitous services to mobile users are the keys to the success of the next generation IP wireless systems [3].

to allow the distribution of published multi-user sessions throughout heterogeneous wireless networks with end-to-end QoS control, it seems to be mandatory the control of session quality level mapping in receiver-driven and source-initiation approach, taking into consideration the QoS characteristics and network conditions of the path from the publisher to subscribers, allowing the control of QoS in environments with inter-domain/cluster asymmetric routing.


The .gure shows that the feedback channel sees bit errors as we approach 2 meters between the transmitter and receiver.

we do not see any bit errors even at distances greater than 1.7 meters.


We demonstrate that: From the set of hammers, data-caches generally not supported in today s NPs outperform such mechanisms as wideword accesses, special-purpose result-caches, and exposed multi-level memory hierarchy.

because packet processing applications are memory-access-intensive, data-cache misses can cause signi.cant processor stalls.


Numerous protocols have been proposed and systems been built [1, 14, 2, 16, 13].

the ability to scale up to thousands of nodes remains a challenge.


First, RAKE can use certi.cates that have been already pre-shared between the partner networks.

this solution cannot be applied at a wide scale.


In each round, players send messages, receive messages, and perform some local computation.

in asynchronous networks there is no global clock, and the adversary is also allowed to schedule the arriw~l time of a message sent to every nonfaulty player; of course, corrupted players may not send any message(s).


It is anticipated that IR scheme can provide a larger gain over HARQ CC and ARQ [5].

as presented in [8, 7], theIR schemeprovidesasigni.cant gain only with themoderately varying channel; in the worst case it can have even a negative gain.


In order to capture the investigated packets we have used the libpcap packet capturing ability of snort .

in some of the good packets, we could see patterns very similar to the ones possible in packets containing malicious code.


If the mobile computer has a fully-charged battery and the user intends to operate on battery power for only a short time, then energy conservation is unnecessary, and the user should choose a power management strategy that maximizes performance.

if the mobile computer s battery is nearly exhausted, then energy conservation is of primary importance.


Then the procedure repeats, dividing the remaining budget amongst the unsatis.ed SPs, and so on, until either all SPs are satis.ed or the budget is used up.

the MMF allocation is not generally integral.


FC-2P of which has .ow controls to prevent data loss when the service class 2 of FC is used.

the .ow control is not provided because FCoE includes only FC-2V.


Static priority assignment is rather simple and easy to implement.

statically assigned priorities might not be practical to adapt to the changes in the network con 1In Section 4.2 we present the values for the mentioned parameters used in Di.-MAC.


Using the Pollaczek-Khinchin mean formula to estimate the average backlog of an M/G/1 queue at a random observation point, .2 E[S2]/R2 we would have .i E [Sp] /R + i p as initial backlog.

2(1-.i) we are interested in the conditional initial backlog Z(i) , given that the observed queue is not empty (otherwise there is no busy period), which happens with probability .i.


While we are notaware of works studyingthe allocation of reliablevirtual networks,[22]consideredtheuseof shadow VNet , namely a parallel virtualized slice, to study the reliability of a network.

such slice is not used as a back-up, but as a monitoring tool, and as a way to debug the network in the case of failure.


Extensive simulation results show that PI controller outperforms RED in regulating steady state of queue length at a desired target value at different congestion levels.

with a small buffer size or under heavy traffic, the transition period before the queue converges to the target value is considerable long [10, 11].


In theory, simple random sampling will perform well as it has minimal impact on the result of entropy of each host.

in our experiment, it shows that the results of the two methods are almost the same.


Due to congestion in network, PDR decreases as shown in Figure 6 and EED increases as shown 0.2 0.15 0.1 0.05 in Figure 5.

in RA-AODV, the EED is 50 100 150 200 250 300 low due to the controlled transmission rate at source nodes.


Due to the upper triangular structure of R,the k-th element of a is given by ak1,l = Q(z2,l/r22,l) (18) ak2,l = Q((z1,l -(r12,l ·ak1,l))/r22,l).

if the .rst detected SM symbols are in errors in the process of DFE, the errors will be propagated into the next layers , which is shown as the increasing of the interference of the next layers.


As we discussed in the last subsection of section 3.3, the attack can be probably slowed down in practice if some modi.cations are employed in the process of choosing the update group O, to make it harder for the adversary to corrupt this group, or, equivalently, to make it harder for the adversary to have whatever players he does corrupt be chosen as the O group.

summing up the discussion from that section, it is not clear how to modify the protocol in order to make the adversary s success signi.cantly harder, and at the same time not to severely limit the applicability of the URSA scheme.


Research has focused on enabling technologies, such as networking, data management, security, and user interfaces [1].

privacy for UBICOMP has been a contentious issue and the privacy concerns that have been raised suggest that privacy may be the greatest barrier to the long-term success of UBICOMP [2].


Two nodes with a different s are guaranteed to meet on one of the channels in at most Nc hops.

if the channel is busy the nodes stay silent, thus they do not discover each other despite being on the same channel.


This is performed by adapting the source video bit rate to the channel bit rate.

at the receiver side, if frames packet loss occurs due to unavoidable channel error, many literatures have proposed error concealment and resilience mechanisms for preventing decoders from discarding the entire frame and breaking of the continuity of the video streams.


Figure 10(b) also shows that the count to in.nity is detected fairly quickly in the loop topologies.

the termination of the count to in.nity takes longer.


They form the routing structure F. Note that Tk rooted at gk may include nodes not in Dk, and in that case, the number of descendants of gk, |VDk |, will exceed c(gk).

gk is still able to ful.ll the data relay task since it is only supposed to store data generated from sensors in Dk and upload them to the MS when the MS moves within its transmission range.


INTRODUCTION In rural areas, mainly in developing countries, it is often not feasible to deploy the interactive and high capacity connectivity that the Internet allows specialists.

it is easy to achieve a lower quality connectivity, often intermittent, for example, using solar powered energy hungry VHF orHF radios or wireless routers, or traditional and expensive modemphonecalls.


The signal in_crtl tells when a module header is coming; when in_crtl is high, it indicates that incoming data is part of the packet header.

when data is a part of the IP packet load, in_ctrl is set to zero.


Similar to the construction for connectivity from [3] that we brie.y summarized in Section 5.1, we will construct a backbone for each node.

since our concern is not merely connectivity but also capacity, these backbones need to be constructed carefully, to ensure that no bottlenecks are formed.


Rule 1 extends the basic failure recovery protocol as follows: When a node, x, locates a quali.ed substitute for a hole in x.table using step (a), (b), (c), or (d) of the failure recovery protocol, if the quali.ed substitute is an S-node, then x .lls the hole with it and terminates the recovery process.

if the quali.ed substitute is a T-node, x saves the T-node in a waiting list for the entry and continues the recovery process.


and are focused on different performance metrics (e.g., throughput).

it is possible to show that our algorithm outperforms signi.cantly the results in [15] [17], since these results are based on the use of ACK feedback, which has a low update frequency with respect to the channel and network variations.


As shown in Fig.5, the latency is increasing as the fluctuation ratio increases for all three scheduling Figure 5: Average Data Latency under Di.erent Fluctuation Condition Figure 6: On-Time Data Arrival Ratio under Di.erent Fluctuation Conditions algorithm.

by scheduling in our algorithm, peers send the data which is needed by most number of descendant peers .rst.


This case, throughout referred to as data inhibition, cannot be distinguished by the sender TPA from a real route failure.

an intermediate node may fail in relaying ACK segments.


We are currently working on extending our model to account for bandwidth limitation for links inside the network.

the adaptation is not straightforward as it requires to track the path followed by the di.erent iFlows that might be partially shared with the default path.


When neighbor selection is based on brute-force network measurements, the quality of the selected neighbor cannot be affected by delay TIVs.

as the number of nodes in the system scales up, brute-force measurements become unattractive due to the communication overhead and the time it takes to collect the measurements.


However, they typically require extensive training against a known ground truth, such as a GPS.

we 10 5 0 Data size (KB) (c) Simulated 20% Wi-Fi availability Figure 11.


In this case, the sender will retransmit the RTB message in order to divide the farthest segment into sub-segments.

this RTB/CTB retransmission procedure often costs a signi.cant amount of time especially when several CTB collisions occur.


For example, instead of using a range-based location descriptor, we may also use range-free localization results for E-V matching.

we need a new error model for each di.erent localization method.


Similarly, a lot of domain specific user path prediction approaches [6-8-9-10] can be coupled with network coverage maps or more sophisticated QoS maps as in [7], to find availability of networks in future.

these models are based on assumptions such as constant user speed, fixed cell size and shape which are not realistic.


It might lose some information due to hidden terminal effect.

these parameters (Number of groups (Ng) and heading group number (Nh)) are determined by PC (could also be determined by the station itself, that is depending on its MAC address) in our scheme, and these parameters could be determined accurately.


to provide instant compensation to the filter s state estimate.


This shift between the number of failures and the total downtime may be attributed to software errors being alleviated by tasks that take less time to complete, such as power cycling, patching or upgrading software.

hardware errors may require a device to be replaced resulting in longer repair times.


The opensource Nessus scanner [3] was identified as the best among vulnerability scanners based on these criteria (Figure 1).

it lacks an automated scan feature, which can be implemented on the client s system.


The concern of adaptation is more focused on the 3D video processing and encoding part to make it a.ordable within resource limitations.

the issue of QoS adaptation according to the user requirement and available bandwidth, and the related spatial and temporal quality loss have not been addressed.


Obviously, in a full system for optimizing network routing there would be careful consideration given to weights for new links, and some kind of readjustment when the topology of the network is otherwise changed.

we shall consider the very simple case where we assign maximal possible weights to new links (cost them out), which results in routing only over the previously existing network.


lGS decreases the largest queue length (if the o.ered load is within the capacity region of GMS) and increases other queue lengths smaller than the largest, which results in that all queues will eventually remain near the largest length.


[20]), which make use of ontologies combined with other techniques of modeling and processing, in a attempt combine the bene.ts of each model.

those approaches are application-speci.c or context-speci.c.


If it is not from an MN, a packet is processed with conventional IP packet routing.

if the identification result shows that a packet is from an MN, the IP header extension scheme is used for routing.


This paper focused mainly on the presentation of the idea behind the coupling of the DiffServ architecture with the MPC.

several points deserving a deeper study have not been introduced to simplify the explanation.


The integrated system has a consistently low frame loss rate (lower than 0.8%).

the loss rate for the single path system ranges from 8 ~ 14% as the background traffic arrival rate grows from 10 to 80 packets per second.


Adaptive Streaming On Heterogeneous Networks Massimo Bernaschi National Research Council Filippo Cacace, Raffaele Clementelli Luca Vollero Consorzio Nazionale CINI massimo@iac.cnr.it Universit `a Campus Bio-Medico vollero@ieee.org f.cacace@unicampus.it raffaele@raffasoft.it ABSTRACT Speci.c network protocols, like MobileIP, o.er seamless connectivity to mobile systems.

the QoS requirements of streaming applications and video conferencing systems require an approach that spans across di.erent layers of the network stack.


can be used to optimize and speedup the learning towards the minimum of the objective function, which is some form of error evaluation.

recurrent networks conduct on-line incremental learning, which means there is no full set of stored training data, no iterative learning is allowed, the inputs are constantly updated with the feedback from the output, and the learning proceeds indefinitely.


IETF proposed route optimization in Mobile IP [7] to solve this triangle routing problem, with which binding cache built in each correspondent node is offered to achieve the routing optimization.

it is impossible to build a binding cache in every correspondent node within the entire Internet.


The reason is that when mobile network M roams to the UMTS network, time-consuming GPRS Attach and the PDP Context Activation procedures should be executed.


The basic idea for geographic routing is greedily forwarding data packets to the neighbor geographically closest to the destination [1].

several recent studies [2] have stressed that the realistic link conditions in wireless networks can be highly unreliable due to many factors such as interference, attenuation, and fading.


3.2 Queues with lifetimes Even though some of the ICN research appears to assume that network queues are not needed with ICN because of the networkbased content storage model [12], we believe that for scheduling purposes queues are inevitable in any network, including information 1In the text we use the terms lifetime and deadline interchangeably.

our implementation assumes deadlines as absolutetimestamps.


Let us assume that the number of nodes and their locations in a given area are .xed.

consider the following two cases of transmission range; In case 1, all nodes have the same transmission range R. in case 2, 50% of nodes has a transmission range of R1 = 32 · R and 50% of nodes have a transmission range of R2 =2R1.


A Message Ferrying Approach to Low-Cost Backhaul in Cellular Networks Sayed Amir Hoseini1,2 , Azade Fotouhi1,2 , Mahbub Hassan1,2 , Chun Tung Chou1, *  Mostafa H. Ammar3 1University of New South Wales (UNSW), Sydney 2052, NSW, Australia 2National ICT Australia (NICTA) 3Georgia Institute of Technology, Atlanta, GA, USA {amirhoseini, azadef, mahbub, ctchou}@cse.unsw.edu.au, ammar@cc.gatech.edu ABSTRACT Cellular operators are considering large-scale small cell deployment in urban tra.c hot spots to combat the looming capacity crisis in their networks.

connecting a large number of small cells to the network core using current backhaul technology is costly.


analyzed 1,100 Android apps for malicious activity and detected widespread use of privacy-related information such as IMEI, IMSI, and ICC-ID for cookie-esque tracking.

no other malicious activities were found, in particular no exploitable vulnerabilities that could have lead to malicious control of a smartphone were observed [8].


Thus, TCP-Newreno overcomes the problem of multiple reduction of CWND from one window data by avoiding expiration of RTO multiple times, which was seen in TCP-Reno.

both Reno and Newreno are able to retransmit only one lost packet within one RTO when the sender is in fast recovery phase.


We suggest two possible reasons: (i) In the past, network operators were motivated to share their BGP feeds to the route collectors in order to advertise their rich connectivity and dominance (especially Tier-1 s) in the Internet [22].

they may not need to do that any more as maintaining an LG server serves that purpose too.


The last condition holds for most experiments that run su.ciently long.

we observe thatin opportunistic adhoc networks, the condition is not always true due to huge bu.er sizes deployed in the network leading to large system capacities.


In particular, to handle scaling issues, many schemes use a link-state like routing protocol to provide end systems with a map of the network [27, 15, 28, 6, 4, 3].

we build on the existing shortest-path machinery to capture ISP policy and eliminate the need for sources to obtain any map.


Thus, we consider a given d and compute E[z]for all nodes within daswellas thefractionofthesenodes which reliablyreceive the message.

as expected, the reliability is very close to one whenever dissmall.aswekeepincreasing d, E[z].attens out withaconsequent(and substantial)decreaseofthereliability.This operating regionshouldbeavoided asthebroadcastprotocol isno longer effectivehere.


These schemes, like the ones we present in this paper, are univer-sal, meaning they apply to any n-node (weighted) network.

the previous results all apply only to undirected networks.


This solution requires almost negligible infrastructure, can allow seamless handovers between different networks and thus almost completely fulfills our aforementioned requirements.

it strongly relies on other layers as far as the location management is concerned (despite the fact that this imperfection can be bypassed in higher layers) [14].


In a discrete event simulation environment, we cannot easily implement the behavior of blocking system calls, and thus we use upcalls to achieve similar results.

with GTNetS, applications do receive noti.cations of incoming connection requests, connection refusals from peers, connection closure from peers, and failed connections.


S4 [34] adapts one of the Thorup and Zwick [44] compact routing schemes to a distributed wireless setting.

their adaptation breaks the per-node state bound of [44]; we show in §5 that S4 can indeed have high per-node state.


Since ron oid1 utilizes IP for routing, rule b1 takes as input netAddress(0,U), based on theexecuting node s default IP address.

ron oid2 routes over i3, hence its underlay tuple stores the address of the underlying i3 oid node retrieved from the local netAddress table.


When the packet size is small, the throughput gain from the two-hop transmission is cancelled by the extra overhead.

when the packet size increases, the gain from two-hop transmission increases, leading to an increase in throughput.


Hence all the results in Section 3 naturally apply.

when v r0 » t0 , the node will almost never hit the boundary and we can say that the node is moving around practically in an unbounded space.


Compared to a DFQ scheduler whose quantum size is the same as the packet size in the input traf.c, the FIFO scheduler actually shows a lower byte throughput because at the receiver end of a network link, DFQ only needs to perform a single DMA transaction for a batch of quanta whereas FIFO requires one DMA transaction for each independent packet.

fIFO can continue to exploit the increasing packet size to improve the DMA transactions ef.ciency at the sender end and eventually out-perform all DFQ instances with a .xed quantum size, in terms of byte throughput.


The advantage of transitioning to high-power mode and pulling all available packets from the access point is that packet bu.ering delay is reduced.

the disadvantage is that it may add extra delay to some packets.


As with muling, data delivery is likely to have a higher average delay with opportunistic delegation than a static network using direct responsibility for data collection.

delegation in the collection process may enable collection where it is otherwise impossible (e.g., an isolated sensor).


Our algorithm converges to a function that is approximated well by the following polynomial: u(r) = 1.8*r3 3.1*r2 + 2.3 3.4 Routing on Optimal Paths Unfortunately, we cannot compute a closed form formula for the optimal trajectories because the path integral can be symbolically computed only for a few particular cost functions.

we can still route along approximately optimal paths by computing numerical approximations at nodes in the network.


Dynamic ASF Filter is more flexible when n varies according to the distribution of the output data.

the intervals where n is less than 5 are not used in creating the range of min, max average of the ASF Filter, as the short intervals typically are not reliable.


It is easy to see that starting from any state in {0, 1}n {X0,X1}, the time needed to hit X0 or X1 is thesamein thesetwo chains.

themodi.ed chain is irreducible which makes the analysis easier.


In contrast, deny rules do not have such a compact representation because upward inheritance prevents us from describing all affected elements by means of a single element.

we can describe a deny rule for an element (u, d, p, a)  Figure 1: Hierarchies.


This helps for emulating large networks.

for experiments in real environments, the only way of having scaling experiments deals with involving more machines.


Channels IEEE 802.15.4 standard has 16 channels in the 2.4GHz range.

due to energy spill over and imperfect .ltering, one cannot use all 16 channels simultaneously without interference.


We could in principle apply a similar process for non-IP traf.c, too.

doing so is complicated by the need to understand the speci.c inter-subnet forwarding/routing employed by what are sometimes fairly obscure link-layer protocols.


If variance of the noise is di.erent than one, the threshold be ß comes Tß = s.Q-1(N ), N(0,s2 ).

we are more n interested in the expected maximum bispectral values under the null hypothesis.


Akeychallengethatwehadto overcometorealizethis architectureis todesign a small wearable radio that simultaneouslyjams the IMD s signal and receives it.

we build on prior work in the area of full-duplex radio design, which enables a single node to transmitandreceivesimultaneously[3,7].priorworkrequireslarge antenna separation andhenceyieldslargedevices unsuitableforourapplication.Inparticular,thestate-of-the-artdesign forfull-duplexradios[3]exploitsthepropertythatasignalreverses itsphase everyhalfa wavelength;ittransmitsthe same signalfrom two antennas andputs a receive antenna exactly halfa wavelength closer to one of the transmit antennas than the other.An antenna separation ofhalfa wavelength,however,isunsuitableforour con-text:theIMDs we consider operateinthe400MHzband[13]with a wavelength ofabout75 cm.Ashieldthatrequiresthe antennasto be rigidly separatedby exactlyhalf a wavelength(37.5 cm) challengesthe notion ofwearability andthereforepatient acceptability.


should correspond to that maximizing the Signal-to-Noise Ratio, i.e., should be tuned to the typical durationofthe targeted anomaly.

thecorresponding obvious di.culty stems from anomaly diversities in size, nature, volume, .


2A non random association to the particular areas of the simulation area can be devised, for example by deciding pre-de.ned areas of interest corresponding for instance to real geographical space.

this aspect is orthogonal to the work discussed in this paper.


The new frames to be executed are estimated to have size as in Equation 3.

when the .rst of these sibling frames is completed, the knowledge on the number of tags that werefoundin such framecanbeexploitedto re.netags estimation and accordingly adapt the size of sibling frames to be executed.


In the case of having one target AP, the MN still knows the AP to switch to despite missing the CARD Request message.

after reassociation, the MN will still need to send a Router Solicitation message to discover whether it has moved to a new AR.


At this point, there is no virtual machine present in the RF-controller.

thanks to the proposed framework, the VMs are created and the routing protocol is enabled within a very short time, and the video clip reaches (after around 4 minutes) at the remote client.


Our GSS flow controller achieves slightly better averagememory utilization and latency than [1].

the GSS flow controller shows slightly worse latency of demand packets compared to [1].


in our datasets, ISC appears with ASN 3557 at only 4 IXPs and with 18 other ASNs at other IXPs (showing up at a di.erent x-value in the Fig.


ACM 978-1-60558-748-6 cause capacitors can sustain virtually unlimited charge cycles and are more environmentally friendly, a CRFID isolated from the elements has no components requiring regular service or replacement.

a key limitation of CRFIDs is the reliance on a dense deployment of RFID readers.


When there are multiple sink nodes, the search cost of LSDD is also linearly proportional to the number of sink nodes and at least one order of magnitude lower than SIDD and GBDD.

lSDD is very robust against unreliable sensor nodes, which may fail in operation and change the topology of a WSN.


For example, if in Figure 6 requests RF1d, RF2d, and RF4d were always set, RF4d would be granted half of the time and RF1d and RF2d one quarter of the time each.

we expect this unfairness to have little impact under low load.


Moreover, it may suggest that sending the FCW warning messages more frequently (say every 50ms) is a favorable design choice from the perspective of minimizing IRT.

broadcasting more frequently increases the temporal network load which potentially leads to increasing the maximum number of consecutive packet losses.


If C and k are large, many messages may be retransmitted multiple times, leading to more channel load but also leading to better delivery success.

if C and d are small, the successful forwarding may be assumed too early.


Regarding the e.ect of di.erent reliability values of the wireless channel on the value of tmin, we observe the following: a considerable increase in the channel reliability (from p =0.5 to p =0.9), results in a percentage reduction of tmin which decreases with distance, and varies from 37.8% (d¯= 12) to32.3% ( d¯= 55) with ImGlobal dissemination, and from 29.9% ( d¯= 12)to25.1% ( d¯= 55) with Global dissemination.

given the same channel reliability, the message dissemination strategy has a considerable in.uence on tmin: at distance d¯= 55, using ImGlobal dissemination reduces tmin of 50.39% with respect to the case of Global dissemination with low channel reliability, while the percentage reduction becomes 54.9% in case of high channel reliability.


update rounds, and lg(t+1) t signature protocol instances within each update interval as described above, to complete the attack.

there are several ways in which A can speed up this search.


Since most smart devices provide the ability to open an IEEE 802.11 access point, a proximity based approach for P2P networks is possible in such a way that device-to-device (D2D) connections are utilized for data dissemination.

this paradigm should be analyzed further to consider the battery drainage of mobile devices.


5.2.3 Peak Rate Recall that the minimal-rate DoS streams studied in Section 4 induce outages without any help from background traf.c and under the assumption that the initial buffer size Bois zero.

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


In other words, considering that several BANs are often co-located and that packet error rate for relatively low number of interferes becomes very high these non-coherent detection techniques are rendered impractical.

receivers with coherent detection are able to withstand considerable MAI interference.


In this stage, we can evaluate the implementation including bugs and disturbances on the small testbed using actual nodes.

the di.erence between the laboratory-level testbed and the real environment is often large.


For large captures this not only takes a signi.cant amount of processing time but also consumes vast amounts of system memory negatively impacting other running applications and slowing overall system performance.

captureFoundry does not rely on system memory but instead stores all performed index processing in persistent .les which have a strict and predictable structure that supports rapid access to packet data.


With thisin mind weproposetheideaofpushing some classi.cation to thephone and some to thebackend servers.

some classi.ers require data that is only available at the server (e.g., for multiple users in the case of the social context classi.cation discussed in Section 4.2).


Intuitively, use of SGMB should lower the congestion of the medium relative to SGM by a factor of the average number of neighbors.

the effect of this bene.t is lost, since SGMB is much more susceptible to congestive losses.


For example, VANETs may rely on multiple vehicles voting to generate a traf.c status report.

if some of the voters are Sybil vehicles, the report may be deviated from the fact, depending on the bene.ts of the malicious.


ARAM clearly matches the depth ratio of each instance of the routing table, but this is not surprising since ARAM is implicitly engineered (given its split and spawn parameters) to generate a number of pre.xes at depth zero and depth one that is comparable to those in a real routing table.

it is important to note that scatter gets the depth distribution completely wrong, and it is not hard to see why.


Note that the fij (k) gives the probability that a user is in state j after kh time from the time instant when he/she just made a transition (from somewhere) to state i.


Onepossibilityis to ask an upper-levelprovider toinformits customers the bidding charges of their traf.c.

an upper-level provider must break down the charges to the granularity of individual subscribers.


PREVIOUS WORK 3.1 Call Admission Control in Cellular Networks The simplest admission control discipline is first come first served.


Hence for most messages vehicles can forward them without veri.cation to preserve their limited computational resources.

such a verify-on-demandapproach is vulnerable to communication-based denial of serviceattacks where the attacker sends a large number of bogus signatures to exhaust the available bandwidth, because a single invalidsignature is likely to be relayed and duplicated many times beforebeing detected at the destination(s).


The number of chordless cycle combinationsthatformapatterninUDE and d-QUDE is limited by the maximum pattern cardinality.

it is generally cheaper to check for a potential pattern consisting of fewer cycles.


This gateshrink modality improves circuit speed and reduces power budgets, and is relatively straightforward from the layout perspective since the application of phase shifters is sparse .

for true sub-130nm processes the full poly layer (and possibly local interconnect (salicide) layers as well) will need to be phase-shifted in order to maintain the transistor densities prescribed by the Roadmap [24].2 In other words, AltPSM will become a lever for die area and die cost, in addition to speed and power.


By the right-hand rule, node 2 initially chooses node 4 as its next hop.

as link (2,4) is intersected by line (1,7) and |A7| < |17|, node 2 performs a face change, records location(A) in the packet s Lf .eld (which records the point at which the packet .rst encountered a local minimum), and then forwards the packet to node 3.


All approaches have in common that they attempt to conceal the implications of mobility from the applications.

since disconnections may be arbitrary, completely mimicking .xed Internet connectivity in the mobile domain is bound to fail, albeit mobility support at many layers may provide improvements.


Shock s definitions have the advantage of being simple and intuitively comprehensible.

going on one step further in detail, ambiguities may arise with regard to interpretation [2].


3.3 Caveats Obtaining several independent inexpensive Internet accesses seems trivial at .rst glance; Simply checking the o.ering in the desired geographic area and obtaining two or more connections from local Internet Service Providers.

several issues might cause these connections to be dependent on each other, especially in the last-mile section.


Also, the GC is indicated as primarily responsible for providing the GSA to group members.

the actual establishment of a GSA is not addressed in [17], and will be part of a future IETF activity dedicated to the design of a generic key management scheme, preferably based on requirements and recommendations de.ned in [9][13][19].


This leads to a socially optimal solution which maximizes the receiving bandwidth to all peers.

with the prevalence of freeriding [1], it is not clear whether peers would always behave with complete altruism.


here, the time difference for with and without traffic does not improve as much as the 10MB of data.


(c) uses the proxy to bu.er and transmit optimized bursts of video along with control information to the device.

even though packets are transmitted in bursts by the proxy, the device receives packets that are skewed over time Fig.


Once the winning node completes transmission, all the losing nodes (AP1, AP2, and AP3) contend for the next opportunity to access the channel.

instead of choosing a new backoff, they revise their prior backoff (as mentioned earlier).


For instance, Sun recently announced a 3,456-port In.niBand switch built from 720 24-port In.niBand switches arranged in a 5-stage fat-tree [4].

in.niBand imposes its own layer 1-4 protocols, making Ethernet/IP/TCP more attractive in certain settings especially as the price of 10Gbps Ethernet continues to drop.


First, increased transmission power means increased transmission range to cover more nodes, which can possibly achieve more coding gains.

transmission with higher power will also consume more space resource.


Figure 1: Two Flow Example  higher probability those links associated with lower costs (or higher pheromone values ) results in a form of automatic balancing of the data load over the network.

the autonomy that each node enjoys in deciding to which neighboring node to forward packets gives rise to a different form of load balancing.


Therefore, the piece selection strategy is fundamental to reach good system capacity.

the e.ciency of the piece selection strategy cannot be measured in terms of system capacity, because the system capacity is the result of both the piece and peer selection strategies.


The range of the RFM transceivers used in the dongles is nominally thirty metres indoors.

this relies upon the use of a certain length antenna, and no nearby obstructions which may cause RF attenuation or multipath.


Another approach is caching at wireless access points (APs), which relieves the limitations of handsets.

aP caching often faces the challenge of limited storage capacity.


[2] shows that the myopic sensing policy has a simple robust structure that reduces the channel selection to a round-robin procedure and obviate the need for knowing the accurate channel transition probabilities, which makes the myopic sensing policy more applicable.

in the design of myopic sensing strategy, the interaction among secondary users is not taken into account when there are multiple SUs in the same network.


Using these wireless interfaces, users enjoy a variety of real-time Internet protocol (IP)-based mobile multimedia services such as mobile voice over Internet protocol (VoIP) and mobile Internet protocol television (IPTV).

as users are moving across heterogeneous wireless networks, such as between Wi-Fi and 3G, and between various Internet service provider (ISP) mobile networks, the real-time communication sessions usually 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.


This is because longer EVCs can only be used by packets with larger hop-counts and will remain unutilized if the tra.c pattern has shorter distances to travel.

by allocating more VCs to shorter paths, BW VA SA ST LT Body /tail flit BW SA ST LT Head Head Head flit flit  flit  Body /tail /tail flit flit  (a) Non-express pipeline (b) Express pipeline (c) Aggressive express pipeline Figure 5: EVC router pipelines (b) VCs acquired from nodes 01 to 56 Figure 6: Dynamic EVC network long-distance tra.c always has the option to switch to a combination of shorter EVCs if contention for longer EVCs is high.


The throughput of a downstream E2E path may be higher than that of a upstream E2E path because the data rate of the downstream-link of mobile data network is a relatively high.

a short contact duration time between the relay node and the machine is still problematic.


BGP and ISIS sessions run across the data plane using B4 hardware ports.

quagga runs on an NCS with no data-plane connectivity.


When a node joins the network, it keeps its radio on.

at this point it does not know anything about the schedules active in the network.


It would be possible to specify arbitrary transmission costs tij explicitly.

by using the above de.nition it is possible to show that the sensorupgrade problem (and, thus, the .nite problem) remains computationally hard even if the transmission costs are de.ned by a simple model of radio propagation.


The Con.guration Manager decides to load the con.guration based on FIR and AES during the experiment and save 7.77% and 22.07% of current consumption compared with the default con.guration and the one without acceleration, respectively.

since the PIR event rarely occurs on node 1, the Con.guration Manager chooses AES and RS based con.guration and has 10.22% and 11.42% savings compared to the default con.guration and software implementation, respectively.


Smaller values of this threshold reduce the possibility of hidden terminals, since the sender defers transmission even when thereis a weak signal sensed on the channel.

this high sensitivity may increase exposed terminals by needlessly preventing non-colliding concurrent transmissions.


2.1 Perceptual Distortion Model Video distortion modeling has been a topic of several studies.

video distortion in these models was measured by pure mathematical metrics, such as mean square error (MSE).


We only have preliminary results on the AF that showed improvement on the accuracy of orientation-aware path loss prediction model with the actual measurements.

based on our findings fingerprint algorithm still stands as the better algorithm even for the orientation-aware location tracking system.


Power outages did not typically last long, and accounted for a total of only 92 sensor-days of down time across all 4 homes.

these outages often caused software and con.guration errors that resulted in much longer down times.


Thismeansthattheclientin ourpro TFRC 0.0% packet lossTCP 0.0% packet loss TFRC 0.50% packet lossTCP 0.50% packet loss TFRC 1.00% packet lossTCP 1.00% packet loss 50 50 40 40 30 30 20 20   Average interarrival delay (ms) Average interarrival delay (ms) Average interarrival delay (ms) 10 10 10  0 0 0 0 40 80 120 160 200 0 40 80 120 160 200 0 40 80 120 160 200 Round-trip time (ms) Round-trip time (ms) Round-trip time (ms) (a) 0% drop rate(b)0.5% drop rate(c)1.0% drop rate Figure 5: Average interarrival delay and variation with proxy-client loss totype does not receive all data, and some artifacts may be displayed.

in case of live and interactive streaming scenarios,delaysdue to retransmission mayintroduce dropped frames and delayed play out.


Now, v4 receives both messages and computes a new multisignature as s1 .s2 .s3.

if v2 and v3 had directly computed their multisignatures as s1 .s2 and s1 .s3, then v4 would have computed (s1 .


CONCLUSIONS The delay in upgrading domestic telecommunications networks and the shortage of skilled server maintenance personnel are the likely background to the need to install even government servers o.shore.

o.shore servers not only reduce the speed of access to these servers from the population within the country but also heighten the risk that domestic laws and regulations cannot be applied to network management for these servers.


As can be seen, if we miss the correct grating lobe, the reconstruction can still be accurately recognized as the letter q .

the distortion in the trajectory shape reconstructed using this algorithm increases as the chosen grating lobe gets further from the correct grating lobe.


With OLSR-ETT the video was received at the destination as a smooth watchable stream.

using the OLSR-ETX rendered the stream unwatchable.


As such, it shows better performance than other verification technologies in terms of simulation speed, as the number of simulations increase.

pattern-Based emulation has inherent limitations.


For these ensembles, the half-width represents a measure of the response delay to input packets evenly spaced in time.

the stream with the highest packet rate experiences negligible broadening of its distribution (see upper-right inset of Figure 6(f)); in this case, the input packets already arrive with minimum-allowed IPG.


P2P applications could also in principle use HTTP for data download, thus hiding among the bulk of HTTP traf.c and increasing the signi.cance of P2P traf.c volume.

our indepth analysis of HTTP traf.c (Section 5) .nds that this is not the case.


Our traffic pattern consists of ON periods of 2-4 ms (and OFF periods of similar duration) and ran for a total time of 25 ms. During the ON period, the network load is at 90%.

at 90% network load, the flattened butterfly network was found to saturate.


Hence, information transmission has to be inherently sequentialized as long as the links in question are contending links.

when using CtS, even if the links are contending, such information transfer can be performed in parallel, by multiplexing the start and stop signals appropriately.


1), all protocols achieve high level of fairness, except Vegas.

figure 2 reveals that random multiplicative decrease can not guarantee worst-case fairness, compared to the synchronized window adjustments of Reno + .. 0.0 Figure 4.


In some scenarios involving multiple devices, SVM-based classi.er performed slightly better (§4.1.5).

we elected to use a decision tree based classi.er, as it has very low memory and processing requirements, thus making it feasible to embed non-WiFi device detection functionality in commodity wireless APs and clients.


RE w/ size detected RE detected RE hash shipping 32 0.31 0.27 0.41 0.22 0.03 64 0.28 0.26 0.38 0.29 0.19 128 0.23 0.22 0.31 0.27 0.22 Table3: Comparison ofeffective redundancy removalforREfactor and aSHAhash scheme each at the rate of 18Mbps.

sHA hash based encoding is 8× slower(118Mbps);SHA1hash computationis a major performance bottleneck in this scheme.


In the absence of any information about the instances, this lemma could be proved using techniques similar to those in, e.g., [14] and [15].

the presence of an oracle changes the setting radically.


custom H/W on FPGA) which make them efficient for a certain class of applications.

a single node platform alone is not efficiently scalable to the large dynamic range of the computational complexity of the sensor network applications.


Informally, by simulating the behavior of deleted nodes by existing ones, we can implement an ancestry labeling on a dynamic tree, supporting insertions and removals of both leaves and internal nodes.

the label size of such a scheme is asymptotically optimal with respect to N, where N is the total number of vertices existing in the scenario, including deleted vertices.


This is whyboth carriers share and act on the error messages regarding location update failures in 3G and 4G.

this error-handlingprocess should be con.ned between 3G MSC and 4G MME insidethe network infrastructure.


In fact under ideal conditions even a one stage cancellation should provide a perfect null.

gain imbalance or a slight phase o.set between the signals may prevent one from achieving a perfect null, wherein a residue of the self-interference signal remains.


To .gure out its corona, a sensor uses two (Llog kJ + 1)-bit registers, named min and max.The min register keeps track of the largest corona, discovered so far, smaller than the corona which the sensor belongs to.

the max register keeps track of the smallest corona, discovered so far, which the sensor can belong to.


It will take at most tprop for the signal to arrive at node B.

it may take B at least tcca time to reliably sense thebusy channel.


Different proprietary protocols and industry standards for building automation have been proposed over the years, e.g., CEBus, EIB, BACnet or Local Control Network (LCN).

integration of different services based on the Internet protocol (IP) suite has become an important trend during recent years.


Such systems preserve location privacy when users do not emit any detectable signals.

in the course of transmitting their location or receiving the location-based service, mobile nodes will transmit wireless network packets, and these systems do not protect against privacy compromise inherent in such transmissions.


The model deals with an additional problem, which is that of the multi-rate STA.

this work was carried out within the framework of an ideal channel, and does not take into account several signi.cant characteristics of the DCF such as frozen time, ie when the channel is busy.


It is a useful measure since in an extreme case, all discovered IP addresses might be contained in a single subnet.

for the true positives, we would rather discover IP addresses from different subnets since some of the community members own several subnets which are dif.cult to identify otherwise.


We can reduce T , or increase p, or do both.

it turns out that reducing the ratio T /p is not trivial.


Nodes in the proximity of the BS carrying more data decrease their transmission range.

nodes which are far away from the BS increase their transmission radius.


1.1 Incentives Incentives are important independently of implementation issues.

they are particularly important in contexts that do not allow for local veri.cation of data, as is the case in symmetric models in which one does not establish pairwise keys between all peers.


The capacity limit is also higher than earlier due to a higher max/rmin scheduling gain (e.g., the ratio r 60).

the approximate capacity limit is in this case .


AODV and DSR perform well because they use multi-round discovery, exploring alterative paths to find a symmetric connection.

they achieve a low loss ratio at the cost of increasing overhead in control packets shown in Figure 15 (c).


As the working set is stored in the server, a worm apparently cannot access the working set from a client machine.

as an advanced attack, a worm might wait (e.g.


As it di.cult to map the input pi to all the network tra.c used in the simulations, analytical results are not presented with the simulation results in the same .g    o ure.

simulation results obtained for the case of the highest tra.c rate can be used as saturation throughput for comparison with analytical saturation throughput.


7The same ranking value is also inherited by every element in I that is related to an element in P due to their interchangeability.

only one of them is required to be connected.


In IEEE 802.11, carrier sensing range for RTS-CTS is the same as that of DATA-ACK since transmit power does not change.

in BASIC, carrier sensing range for RTS-CTS and DATA-ACK may vary because the transmit power can be di.erent for those packets.


In these topologies, packets sent at base rate (e.g., control packets) by the sender with high SNR capture over packets sent by the sender with low SNR.

because of our choice of the data modulation rate as the highest that can be supported by the link in the absence of interference, data packets always collide for both senders.


Integrating Secure Route Discovery with AODV In AODV [33], as well as other secure protocols based on AODV [6, 39, 45], Route Request (RREQ) packets do not carry a node list.

in order to .lter excessive malicious RREQs, we require each RREQ to carry a node list.


To guarantee the quality of service required, service providers opt to multicast all TV channels at all times to everywhere.

a signi.cant number of channels are rarely watched, so this method is provably resource-and energy-ine.cient.


Hence, there are cases in which two nodes cannot transmit simultaneously even though they do not interfere with each other.

using a one-hop interference region leads to higher throughput, but at the cost of hurting the fairness.


A typical storage system has a provider-de.ned quota for each user, and the user is responsible for allocating resources within the quota.

this is not suf.cient for content distribution applications.


We show that a protocol designed to overcome the misinterpretation of collision-based losses and fading-based losses with out-of-range senders (the hidden terminal scenario) [18] is e.ective (i.e., high aggregate throughput and equal sharing) when the competing links are statistically equal in quality.

we .nd that the protocol has a severe throughput sharing imbalance whenever even slight di.erences in average link quality exist between competing transmitters.1 We show that this is due to the slight di.erence in channel quality driving the system to a state in which only one transmitter uses the four-way handshake signi.cantly more often, thereby giving it increased protection from hidden terminal collisions.


If this were happened, our proposed SSFD could not detect.

we do not adopt the other characteristics such as ASN and TTL time.


When the robot receives several suggestions, it integrates them and selects the best direction for patrol and/or sensor deployment.

the CED can not guarantee full coverage if the robot encounters obstacles.


Inwhatfollows,weshowtherelationshipbetweenthesignalingostandthenumberofellsinapagingarea.Most parametersusedinthisevaluationaresettotypialvalues foundintheliteratureforanalyzingellularsystems[14]: Rw 8 Rore 0.5 Rzoaz 0.5 dHA,FA 16(hops) dFA,FA i(hops) v 65(mph)i.e.28.9(m/s) p 200(useTs/km2)i.e.0.0002(useTs/m2) a 5%[6] Aa 3(1/hr)i.e.0.0008(1/se) Ad 3(1/hr)i.e.0.0008(1/se) Theaveragenumberofhopsbetweenforeignagents,dFA,FA, isdependentonthenetworktopologyofthepagingarea.


This would allow us to recover all N original frames from any N encoded frames.

recovering the original frames requires solving a simultaneous linear system, and the computational complexity increases quickly with N. Therefore, we opt for a simpler, suboptimal coding scheme.


7.2.1 Probing delay It is obvious that the higher the probability parameter p used to determine whether a path is probed or not in a given timestep, the more frequently network links will be probed and the shorter the amount of time between probes of that link (i.e., the link s probing delay).

because a given link may appear on any number of the potential probing paths, depending on the underlying routing system, the exact relationship between probability and link probing delay is less clear.


Independent from the TCP variant, the TCP throughput is more than double in Urban-X compared to traditional WMNs.

the aggregated throughput was not higher than that of a single .ow in Figure 6 because of the shared bottleneck links.


This can be handled by APs triggering a spectrum re-allocation when they detect wireless microphones.

we believe that the time-scale of operation of wireless microphones is of the order of few minutes and thus, this would only marginally increase the overhead due to spectrum re-allocation.


Multipath: Generally speaking, with higher degree of multipath, the e.ectiveness of directional antennas will be reduced,because thelevel of directionalityis decreased[7].

the availablity of multiple paths also makeitpossible for multiplesenders and receivers to not interfere with each other (Figure 1).


Clearly, Dispersy is performing worse than would be expected from theory.


ments, and maximal matching equates to maximizing participation in PeerWise.

the problem of choosing relays in Peer-Wise is vastly more complex than the stable roommates problem.


Observe that the algorithm is only secure against known-ciphertext attacks.

we assume that such guarantee is su.cient for RFID systems.


The sensor system simply reports the acceleration readings to the processing centerovertheBusNet.Thedataareprocessed attheprocessing center.

the sensor units on the BusNet must be given the threshold value of acceleration that indicates signi.cant deterioration of the road surface so that the data collection can be triggeredby that value.


Since these two requirements are not contradictory, it may seem like the optimal choice is to use large Tmin and Tmax values.

end-to-end delay goes up as Tmin and Tmax are increased, and large values may not be appropriate with delay-sensitive tra.c.


Spare capacity: If all links in the network are fully utilized, DIBS will not work, since there will be no capacity to handle the extra load caused by detoured packets.

in DCNs, congestion is usually transient and local [5].


In more realistic networks, a path with several links (and intermediate nodes) would connect the source and destination.

to analyze congestion control mechanisms, one often ignores the existence of all the intermediate links, except for the bottleneck, i.e., the most congested link.


Thankfully, no accidents resulted from these incidents.

that does not reduce the seriousness of the potential safety implications caused by these IT network level problems.


Using the hybrid bound only provides negligible improvement.

when the queue size becomes large, the .rst bound can become better than the second one gradually.


These included (i) devices like microwaves that are activated for short durations and (ii) device instances with low signal strengths (.-75 dBm) that appeared intermittently at the locations where the signal analyzer was placed.

for 25% of the cases, the devices were active for more than 5 minutes and in some traces, devices like game controllers (e.g., Xbox) were active for durations of up to 1.8 hours.


In this speci.c test, 4Mbps seems to be a good balancing point.

such static setting of the shaping parameters could su.er from the same problem as the static setting of tcp rmem max.


Inrelated work, there have been solutions proposed to deal with hidden terminals using coding[13,12], and exposed terminalsbydisabling carrier sensing [26].

as we describe in Section 7 all these solutionstendto require changes atbothAPs and clients.


traffic lights and stop signs, which are used to avoid collisions at hot spots, such as crossroads and merging roads.

more sophisticated algorithms are not feasible because the local sensor information that is available to car drivers provides only a coarse estimation of the current situation.


The actual end-to-end email dissemination time took less than 700 seconds.

even for large requests, the two-server configuration with two JMS queues has similar performance as the one server case.


TR also distributes the large number of packets to 11b, but distributes the larger number of packets than RR to 11a and 16, which of packet loss probability is much lower than 11b, i.e., the TCP retransmissions in TR is caused mainly by out-of-order packets and it reduces the upward trend of TCP retransmissions in comparison with SL and TR.

the TCP retransmissions of the proposal is low stable in comparison with the others.


By comparing graphs for di.erent runs, the similarity of the average quality change in the runs can be visually assessed.

our metric only requires layer two information.


Finally, sink energy consumption per data packet is depicted in Figure 2c and as expected, the protocols without the CTS overhead have the lowest energy consumption.

since the sink has to transmit an acknowledgement back, the di.erence between these protocols and the ones with CTS is reduced.


It is expected that the accuracy is reasonably high if the PDP Context age is less than 1 minute.

the sector-level accuracy decreases very fast as the PDP Context age increases, which veri.es our previous inference from Figures 2 3.


Security is a must, and for that we need a secure architecture in which all device interactions are protected, from joining an IoT network to the secure management of keying materials.

this is challenging because existing IP security protocols do not o.er all required functionalities and typical Internet solutions do not lead to the best performance.


INTRODUCTION Internet streaming is becoming increasingly important in the Internet.

since multimedia data are highly sensitivetodelay andpacketloss onnetworkpaths,streamingapplications usuallyrequire special mechanisms that can overcomepacketlosswithout utilizing retransmission.


In RAMOS, each sensor transfers acquired data to the sink node by changing its mode autonomously.

since each sensor has to move to the sink node every time in order to transfer acquired data, moving cost increases when the area is large.


One of the few standardized, cross-platform interfaces to transport-and network-layer information is through the Simple Network Management Protocol (SNMP) [16], which allows applications to access standardized sets of information about network-and transport-layer information, such as TCP statistics [7].

sNMP is not typically available on most hosts, and requiring its use for applications to acquire information about their own transport connections is an extremely cumbersome solution.


[16] developed polynomial time approximation algorithms for this problem.

the approximation bounds of these algorithms grow linearly with the product of maximum number of antennas at individual nodes,maximum number of links incident to a node,and maximum number of links con.icting with individual links.


We see this in Figure 9: the fraction of completions does not drop and the transfer time does not increase.

the results for SIFF are similar to those for legacy packets .oods, as SIFF treats both requests and legacy traf.c as low priority traf.c.


Because the session key does not appear in messages but independent negotiated with two clients, the KAAP is secure than the KTAP.

the KTAP is suitable to save computing power on client side, and provides lawful interception support for servers.


The positions of the nodes is in general assumed to be stationary.

their frequent breakdowns and the always changing nature of the wireless channel results in a variable network topology.


For example, Click [22] provides the ability to write and con.gure network processing elements easily.

such systems do not address the issues that arise in designing the PHY and MAC layers of the network stack, which are more computationally intensive.


(6) the probability of false alarm of each node is given by .


Without any additional bandwidth, a targeted BER of was achieved by the proposed system at approximately 7.35 and 3.9 dB for full and single user load, respectively.

an equivalent system using MMSE equalization achieved that targeted error rate at higher power demands of 8.7 and 5.17 dB for full and single user load, respectively.


For the GDI data, we only collected metadata for a subset of the readings.

a di.erent application may want additional metadata.


For example, when there is a single background traffic source, , that is generated with a packet size of 1400B , the video client fails at time 1310sec which corresponds to a traffic load of 2.2Mbps.

for the same number of background traffic sources but using a packet size of 512B , the video client fails at 860sec and corresponds to a background traffic load of 1.45Mbps.


As a further notice, the Interest size may increase when the Exclude .eld is conveyed.

bloom .lters can be used to keep the incurred overhead under control3 .


This scheme allows each node to increase or decrease its power level dynamically.

di.erent power levels among nodes result in asymmetric links, causing collisions.


In our dataset, almost all the anomalies detected by these distributions are alpha .ows [10].

host degree distributions and FSD identify anomalous scan, DoS, and P2P activity that are not detected by the port and address distributions.


They can be efficient, flexible and transparent transport bursty IP and Ethernet traffic over optical WDM networks and provide statistical multiplexing gains.

under the current and foreseeable limitations of optical technology, especially the absence of optical buffer and optical logic devices, performance of these networks is mainly hampered at the node by resource contention.


Therefore, packets heading to the same destination are transferred at certain intervals, resulting in the reduced intra-.ow interference.

case II-like solutions are not always the best approach.


For example, researchers [26, 27, 38] presented mechanisms to bundle multiple, highly predictable, wired ATM links to construct a high bandwidth link.

in Multifacet, the WiFi links have signi.cant variability and unpredictable changes in channel conditions and our solution is stylized to the various properties of two hop wireless networks.


RELATED WORK In-network processing approaches [9, 11,17] typically focus on node-based function computation to reduce the amount of communication needed.

the processing in this paper exploits collaborative communication to reduce the overall complexity of (counter) function computation on the nodes.


In our proposal, it is similar to current handover process in latest LTE.

after sending handover preparing message, new eNB sends a packet-in-message to SDN controller in MME instead of sending various messages for x2 handover in current LTE [9].


In the .rst and third condition, since the collision probability is independent of the sampling rate, it remains a constant value that equals 0.22 and 0.68 when the sampling rate ranges between 0.92 and 0.94Mbps and 0.51 and 0.78Mbps, respectively.

in the second and fourth conditions where the sampling rate ranges between 0.78 and 0.9Mbps; and 0 and 0.5Mbps, the collision probability behaves as a curve instead of a straight line parallel to the rate axis.


SYSTEMATIC COMPARISON Data from previous experiments described in Section 3 suggested that algorithm choice can make a large difference in performance.

the mechanics of doing .eld experiments are too cumbersome to allow a thorough comparison of algorithms.


On the other hand SNMP data is easy to collect, and almost ubiquitous.

sNMP data only provides link load measurements, not TM measurements.


In addition to extending the range that can be covered by using multiple hops, mesh networks provide the opportunity of using alternative routes, thus increasing resilience to radio environment changes.

mesh networks are expensive in terms of energy consumption due to a higher overhead at each node for additional activities, namely relaying messages for other nodes and, in systems with distributed planning, calculating new routes.


The authors consider the same con.guration of interfering WLAN APs.

they consider uplink tra.c only,generalizing themodelofBianchi[3]foranetwork of two APs with so-called critical inter-AP spacing.


However, with increased mobility, D-Sync signi.cantly outperforms MU-Sync and has consistent performance across di.erent speeds.

the accuracy of D-Sync is a.ected by the relative acceleration of nodes.


Since there are few well-known multipath profiles at the 2.3 GHz frequency band, many researchers have used simulated channel environment.

we adopted k actually measured data with 6 different environments [6].


As depicted in Figure 4, at arrival rate of 1 job/s and packet size of 500 Bytes, the average buffer size required is about 100 and 200 Bytes using the proposed handoff with i-ARD method and FMIPv6, respectively.

the buffer size increases dramatically with FMIPv6 method by increase of arrival rate, while the buffer size in the proposed method merely reaches 2 packets (1000 Bytes) at the rate of 25 job/s.


This increases search times only slightly (less than 0.5ms per metadata structure scanned) because it takes longer to read it from Flash, so we do not consider it to be an issue with this implementation.

in a di.erent implementation in which the metadata needs to be transmitted to allow other nodes to search the data, there would be an energy penalty associated with larger metadata structures.


and packet dropping probability p. is always better in terms of energy e.ciency.

for unreliable channel model, energy e.ciency of Topology Control is lower when the tra.c pattern is to destinations far away (.> 0).


Thus, if the packets are scheduled every 3 OFDM frames, the result is schedule 1 in figure 5.

if the packets are scheduled every 8 OFDM frames, the result is as schedule 2 in figure 5.


AP: The same to that in traditional WLANs, APs in WMAPNs periodically broadcast beacon frames to inform their physical and MAC con.gurations to the user terminals in their transmit ranges.

after receiving the association requests sent by user terminals, the APs will not solely decide whether to admits the user terminals or not.


Every inter mediate node on the selected route will process the RREP message and, in most cases, forwards it towards the origina tor node.

there is a possibility that the RREP mes sage is discarded at an intermediate node and hence results in the originator node not receiving a reply.


MRC may increase effective SNR and therefore the wireless capacity, since one could transmit using a higher modulation rate.

the result from Information Theory has shown that the capacity only increases logarithmically with SNR.


Note that Gen-Algo as de.ned in Section 3 may change the schedule every time slot.

the running time of the New-Sch and the Mix algorithms may be a few time slots.


If, however, the stations are not uniformly distributed, it is still the case that stations in the smallest ball with sum of probabilities at least C1 could receive many message after probabilities pv are scaled up to cepv.

the situation in a (very) sparse e-ball B is as follows (by sparse e-ball we mean a ball with sum of probabilities much smaller than the average): The probability that v .


4.4 Correlation Analysis The algorithms discussed so far generate a ranked list of links and devices suspected to have caused ping failures.

it is possible for a small set of links or devices to share the same failure score due to network redundancy and multipath routing.


Because tokens are encrypted, we can assume malicious peers cannotfake tokens, and tokens can  2500 1 0.7 0.6 2000 0.8 0.5 1500 0.6 0.4   Number of peers 0.3 1000 0.4 0.2 500 0.2 0.1 0 0 0 Time uploading bandwidth (kbps) uploading ratio (%) Figure 3: Population of peers viewing Figure 4: average fi,p for peers with Figure 5: average fi,p for peers with streaming data in the PPLive systemdifferent uploading bandwidthdifferent uploading ratio parameter default value k 10 n 10 d 500kb ti,p 10min Max(f) 1 Def(f) 0.3 Min(f) 0.1 Table 2: Default values of parameters peersdownloadadvertisements,they arekeptinthe local cache.If the amount of downloaded advertisement is more than the amount of advertisement a peer has to view, some downloaded advertisements would not be displayed.

if the amount of downloaded advertisement is less than the amount of advertisement a peer has to view, some downloaded advertisements would be repeated.


In particular, since we know the TEMP IP before the actual handoff, we can think of a scenario where we can update the SIP session before performing the L2 handoff thus further reducing the total L3 handoff time.

a few considerations are needed in regards to this last scenario.


For the RSP problem, the authors in [6] proposed a similar approximation algorithm that dynami-cally adjusts the values of cr and ft.

the compu- tational complexity of their algorithm grows exponentially with the size of the network.


Systems that protect identities are always vulnerable to pollution attacks through content injection and fake identities [7].

it has repeatedly been shown that properties of large systems can be used to detect manipulation [30, 29, 27].


The existing Internet architecture has been very successful in providing end-to-end connectivity using highspeed routers that provide a bare minimum of functionality to move packets from one node to another [8].

this architecture shows shortcomings in the context of emerging technologies: sensor networks cannot communicate using standard Internet abstractions due to their inherent processing and power limitations, security protocols (e.g., to protect from DoS attacks) are di.cult to deploy inside the network, new networking concepts that deviate from client-server paradigms Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Song and Li [24,25] proposed a framework for subcarrier assignment and power allocation in OFDM wireless networks and designed various optimization algorithms based on this framework.

their framework did not consider the channel variations in time domain.


These are a lot less than the archived data allowing near real time reports to be produced.

the amount of data collected depends on the count of different VNE and observed domains that participate in the detection process introducing an upper limit on the frequency of reports that can be produced.


1 shows how nodes A and C can see each other, therefore the value b associated to this combination must be 1.

nodes A and B have an obstacle between them, so they cannot establish a communication.


Authors in [16] explain it is because their algorithms assume that the queue buffer is always saturated.

there exists more possibility of queue buffers being empty when traffic load is low.


Their results show that for minimal neighborhood size larger than 15, the localization error is small enough compared to the communication range.

their localization system is based on hop counts and focus on the localization for sensors.


Obviously, these range estimates are not consistent with the path measurement.

if the performance ranges areboth[0.4%-0.6%],thenthey are consistentwith the measured path loss rate.


It has not turned out to be the QoS panacea that some proponents may have hoped for, and there is more work to be done to see it widely deployed in the public Internet.

we believe that it is an effective starting point for QoS in large service provider networks that is likely to see increasing deployment in the future.


The root cause for such failures is that metric-based routings rely on monitoring data traf.c or probe packets to derive the probability of transmission success over a certain link.

a simple experiment on MoteLab using the MintRoute component provided by TinyOS shows that such a Copyright is held by the author/owner.


A node in the inquiry state continuously sends inquiry messages during the entire interval.

a node in the inquiry scan state does not need to be continuously listening to inquiry messages, and so it can alternate between the standby and the inquiry scan state in order to save power.


For the cases considered, laser chirps of 125 and 150 MHz/mA can be tolerated, for 3.86 MHz and 10 MHz electrical filters, respectively.

it can be noticed that an increase of ~3× in the bandwidth of the filter only results in a maximum CER increase of ~20%, showing also the dependence on the coding used.


In the original set of DHT proposals, some algorithms made this choice of neighbors purely deterministic (i.e., given the set of identi.ers in the system, the neighbor tables were completely determined), and others allowed some freedom to choose neighbors based on other criteria in addition to the identi.ers; most notably, proximity (i.e., latencies) have been used to select neighbors.

the question is not whether the initial proposal included this feature, but whether the basic routing geometry precludes it.


GTP is separated into a control plane protocol (GTP-C) and bearer plane protocol (GTP-U) with the GTP-U providing tunneling.

when considering only the GTP parts of the protocol, GPRS provides a kind of IP localized mobility management that requires minimal host involvement.


1000 0001 0100 0001 1000 1000 violates the packet-mode constraints: Contiguous transmission of packet a1,1 requires that the .rst three permutations are scheduled contiguously.


=1, which means PS = PR = 21 Ptot, shows a performance degradation compared to the dual-RX antenna system while the DF cooperative diversity system with PS = PR = Ptot shows a performance improvement over the entire range of co-channel reuse factor, D/R.

the total power of the latter system is double that of the dual-RX antenna system.


those research works focused on the analysis for one-hop wireless LANs and can not be directly applied to multihop networks due to the hidden terminal problem and asynchronous operations of MAC protocols.


Our proposed statistical model is simple and can incorporate multiple tiers of different time granularity.

in more complex scenarios, we need to investigate more sophisticated predictive models and apply intelligent self-tuning of system parameters to improve prediction accuracy.


In these cases PacketOPP can take advantage of multiple forwarding nodes and more opportunities to use long links providing throughput gains of a factor of two or more.

due to its selfadaptive characteristics, Hybrid protocol is able to select the routing option most suitable for both particularly disadvantaged .ows and .ows with the highest throughputs.


The time bound before a mobile host in an empty cell has a CFP slot allocated to it equals CFP + CP + CFP + CP.

the mobile host will not have a consistent view of the allocation of CFP slots until M CFPs later.


At last, it is possible to use a single bit to convey the information of QoE degradation with need for QoS upgrade.

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


Admittedly, it is technically impossible to completely prevent all possible attacks.

we are convinced that Figure 1: Histogram of VirusTotal Labels per Sample For our analysis we de.ned the following set of samples.


This is better than the oblivious ratio of 1.853 for the Abilene network.

a 30% performance penalty could still be large, especially if the network is heavily loaded.


The greedy swapping procedure stated above uses AssignedBenefits instead.

observe that the As-signedBenefit represents the benefit of a copy just before it gets swapped out, and that the benefit of a copy is at most equal to its AssignedBenefit.


10000 e ¢ i / sooo c~ eooo N E 4OOO d d~ 2000 ,jw .... -.i .......... ::-: ............ ; ............ ;-: .......... ;-......... ; .... 10 20 30 40 50 60 Picture (c) Cellular connectivity - CDPD Figure 8: Energy consumed by digital camera using Rangelan 2 and CDPD network 80  A number of systems [13, 31, 32, 33] have used transcoding to fit images to the current operating environment.

there has been little formal work in conducting a systematic study to mea- sure the information loss associated with a given transcoding, so previous systems performed ad hoe transcoding without an explicit understanding of the tradeoffs and potential gains.


Despite the difference in mean, evolution of the CPU is very similar and related to video encoding.

there is a peak of traffic observed at the beginning of the experiment, around second 8.


A great challenge to these networks is to provide a fast and reliable channel for events diffusion.

the order in which events are received can interfere directly with the correct interpretation of what is going on in the physical environment being monitored.


To solve the problem of learning from dis (a) d on energy (LP=2) (b) d on accuracy (LP=2) tributed data sets, people have designed methods that can 35 80 learn multiple classi.ers from local data sets in a distributed  1 1/2 1/3 1/4 1/2 1/3 1/4 25 environment and then combine local classi.ers into a global model [32, 33, 34].

these methods still focus on Energy (Joule) Accuracy 20 15 learning from a training set with suf.cient labeled examples.


Speci.cally we used the inexpensive oscillators[21]that comestandard withtheUniversalSoftware Radio Peripherals (USRP); these have frequency o.sets on the order of ±10 parts per million.

high quality ovenized oscillators with frequency tolerance of around 20 parts per billion are now available [25] for around 400 dollars.


In [4], the authors provide a P-S algorithm that tolerates up to d crash failures.

as far as we know, BFT event brokers have not been addressed in the literature.


5.2 Comparison Methods Methods for the multiple bit rate video delivery explained in Section 2.3 reduce interruption times by controlling qualities according to peers bandwidths at each time.

in our assumed environment, H peers continue to watch high-quality videos to the ends even though their bandwidths are small.


In our experience with MicaZ, we can only push one packet (45 bytes in total including 26 byes 2This anomaly also exists for other nodes using CC2420 radio, such as TelosB motes.

we will not report results for other platforms due to the space limit.


1 rate starts to increase sub-linearly till instant 28 seconds where the congestion vanishes resulting consequently in an increase ofitsrate.

theeclipse ofthecongestionis short and a congestion reoccurs around instant 30 seconds, resulting again in a decrease of its rate.


As the pilot-tone signal is highly stable, it could be used as a global time reference, as .rst demonstrated in [10].

to the best of our knowledge, no commercial FM chipsets can extract this signal from FM broadcast.


Earlier protocols for asynchronously discovering neighbors were all implemented on sensor nodes, allowing them to use small slots on the order of milliseconds[25] or even microseconds[11].

unlike sensor radios,Wi-Fi radioshave a non-negligible transition latency from sleep to transmit/receive.


However, even with that improvement, the 4-Way Handshake might be still vulnerable to replay attacks.

once some mechanism is implemented to defend against the replay attack, our repairs in Section 5.2 can already make the handshake secure.


While it is anticipated that ongoing data may suffer from reduced throughput during the call, there is little beyond this expected performance degradation.


The .gure indicates that the simpli.ed model which considers path length to be constant overestimates the number of intercepted .ows.

by using the path length distribution as obtained from simulations together with Equation (6), the curve labeled Model (general) provides a close match with simulation.


[21] presented a VoD system design namely MobiVoD for mobile ad hoc clients, using periodic broadcast toincreasethe scalability of theVoD system.

mobiVoD did not explore collocated APs bandwidth, and reported results only for a single video, which is not our case.


This is because nodes even pro.t from short associations which occur frequently with high mobility.

as the setup time increases, the achieved bit rates decrease to a similar value for all four pause times (between 9s and 10s).


Minimize latency: By exploiting the tradeoff between the sleep time and the latency, we can achieve minimized average latency as 0.

the child node ch6 needs to sacrifice one unit of its Smax making the overall sleep time 22.


In this work we do not analyze the stability issue related to the closed loop control neither the feasibility of the MIQP problem.

the present formulation can be written in a form where stability results exist (e.g.


At run-time, nodes could move around to maintain evenness in sizes of hash table partitions.


By looking at (1) we .nd that when the bu.er length q(t) matches the target bu.er length qT (t), the throttle percentage T (t) is equal to 100% and r(t) matches l(t).

when the error qT (t) - q(t) increases, T (t) increases accordingly in order to allow r(t) to increase so that the bu.er can be .lled quickly.


Upon election, the new root node can bootstrap a new key-chain for µTESLA using pair wise keys with the other nodes.

we see no way to prevent a corrupted node from being elected as the root node under the FTSP scheme.


Connecting such a spontaneous network to the global Internet can be done by establishing a default route to the border router.

the reachability of hosts from the Internet requires either address translation at the border or the advertisement of all pre.xes existing in the network.


Finally, it is essential for users to be proactive, such as turning the device to non-discoverable mode in unknown areas and only 'pair' with know devices.

this does not assist with the vulnerability of WPANs to DOS attacks, which could render the network unusable for a period of time although use of scatternets can assisting in defeating DOS attacks.


Multiple spanning trees construction algorithms for these topologies are already known (e.g., [7, 22]), and these spanning trees have good qualities, e.g., small tree depths.

network failures (e.g., link failures) are common in real networks.


The volume of measurements can be reduced by traf.c sampling, and researchers attempt to use realistic topology models.

topology modeling is still in its infancy realistic models that include notions of capacity and latency are some years away.


results depicted in Figures 5 and 6 clearly show that the contextbased opportunistic proposal can closely follow the energy consumption levels obtained with the optimum configuration and the Full Knowledge technique, independently of the location of the source node.

the energy consumption levels of opportunistic MCN-MR communications increase if the MR is not adequately selected ( MR close BS and MR close SN schemes).


DISCUSSIONS Multicast .ows: Our diversity solutions also apply to multicast .ows with the same performance guarantees as for unicast .ows.

the scheduling model must be appropriately adapted to multicast groups (sessions) with the instantaneous session rate determined by the bottleneck user in the group.


Note that when the two-lobe beam pattern is formed, due to the power split across the lobes (explained in Section 3), the RSSI of the weaker client A falls by 3 dB, resulting in a maximum rate of 2 Mbps.

in topology 2, the optimal schedule consists of two transmissions, one to clients A and C using a twolobe beam pattern at 2 Mbps, and the other to clients B and D using another two-lobe beam pattern at 11 Mbps rate.


The coding of these signals is done by convention in a simple, yet e.cient binary form.

mOST, a technology aiming at in-car digital audio transmission introduced in the 1990s, comes with a more sophisticated middleware solution based on function blocks .


The topology of information exchange forms a star topology with the coordinating entity in the center in the WRN.

topology in WMN is totally different, see Fig.


(11) as follows: p = Fmac, N = Nv, Tslot = Tv.

(14) Nv may have fractional value rather than integer value from Eq.


KKT conditions suggest that based on complimentary slackness property for strong duality, we have .1 (ki * Ei + xi * (Ei - a)) = 0, (15) .2 (ni - ki * + xi * )=0, (16) where ki * and x * i are the optimal transmitted amount of data and parity symbols.

with the channel is in state Si, and maximum network utilization of ni symbols, the amount of transmitted data symbols is bounded above by ki = |Ci|Ri = ki * , where Ri is a channel coding rate.


RDMA traditionally has been used as a highperformance networking technology in supercomputers, but they are costly and require special hardware which makes them di.cult to be adopted by commodity data centers.

we believe that the main advantages of RDMA can be provided in pure software inside commodity data centers.


The goal of TPC schemes is to hold transmit power to the lowest possible productive level to minimize imposed interference and to save energy.

because a signal emitted from a mobile station exposes its location, the TPC problem for location privacy has an additional requirement: a mobile station must perform TPC silently, without exchanging any messages.


The latency augments as the wakeup interval increases, as long preamble needs to be transmit before the forwarder wakes up.

compared with the benchmark protocols, DLT has a much slower increasing speed, since it achieves short data frame transmissions and bene.ts more from the distant forwarders enabled by distanceless transmissions.


The optimal CW value differs with respect to the amount of nodes and their offered load to the medium.

an adaptive strategy tailored to one-hop broadcast communications is out of the scope of this document and is left to future work.