To handle such an access con.ict, we need a multi-port queue for each pipeline entrance.

[12] S. Kumar, J. Maschmeyer, and P. Crowley.


The minimum synchronization precision and the maximum attacker impact of L-SGS is the same as SPS, equal to 10µs (3s) and 20µs (6s) respectively.

5.3.5 Extension to Multiple Hops SGS is extendible to the scenario when group nodes are multiple hops away from each other.


d y s f e d e g ) m  Some text in this electronic article is rendered in Type 3 or bitmapped fonts, and may display poorly on screen in Adobe Acrobat v. 4.0 and later.

h F s , n s F  y 1 s d d F l l y , e : o y a n f l m F m y e n k l r r m n e e t F d a s F .


Low Bound of Energy-Latency Trade-Off of Opportunistic Routing in Multi-Hop Networks.

the paper identifies for a two-hop MCN-MR scenario the optimum mobile relay location and the location from which the relay should start forwarding the information to the cellular base station in order to minimize the overall energy consumption.


In order to simplify the simulation and reduce the calculation time, two-ray propagation model is chosen, given by: Pr(d)= Pt + Gt + Gr -Lp(d) (1) where, the path loss in the indoor environment is calculated as Eq.

the mobility of the MS is usually unstable and hence the predicted direction may have an error range as mentioned above.


The goal here differs from theirs as they aim at detecting anomalies in real time by running several detectors in parallel.

by using packet as the traf.c granularity, we observe that Alarm2 and Alarm3 have traf.c in common but no packet is shared with Alarm1.


That is, SUs periodically, or proactively, switch to and sense certain bands to .nd out whether any of them are vacant.

note that state s0 corresponds to when the group is using its HSB b0 (which is always available).


The number of ANs on our testbed and the variety of links they route their packets via, allow for a pragmatic real-world evaluation with live Internet traf.c.

aN1 is a WiFi WPA2 network, AN2 is offering a UMTS link with 7.2Mbps/2Mbps downlink/uplink theoretical capacity and 180 ms roundtrip latency, and .nally, AN3 offers a Satellite link by Inmarsat using an Explorer 500 mobile terminal with 464kbps/128kbps downlink/uplink theoretical capacity and 1 second roundtrip latency.


4 shows the percentage of the query number saved by correlated lookup.

when a new system conditional probability is di.erent from the previous one, the Ps = .... p2,1 p2,2 ··· p2,N .. .. .


Although the execution time for the optimization part of the k-medoids algorithm is better, the execution time for the construction of the pair-wise distance table should be included in overall execution time of the algorithm.

since the hop distances between a set of CC locations and all other nodes in G can be computed in O(n + |E|), the worst-case time complexity of the clustering algorithm is O(k(n + |E|)).


In National Cable and Telecommunications Association(NCTA) 2003 National Show, Chicago, USA, June 2003.

we can observe little attempt is currently made to spread out the load.


Figure3: 24-hourtime seriesforthe number(per minute) of RRC connection setups(Nsetup) and the inferred number of IDLE.DCH transitions(NI2D )on1December2010.

understanding the signaling overhead of a 3G networkbecomescritical.


Given that different volume may lead to different data size, throughout the experiment, we keep thevolumetobethe same.

impact of concurrency: To study the effect of concurrency, we control the maximum number of concurrent TCP connections to a web domain on the server side.


The reason for this improvement is that since some packets are relayed from node to node in the hybrid cases, the interference that is experienced by the UMTS network decreases thus leading to higher throughput for the same number of users.

in the high-density region, H1 is helped by the availability of ad hoc routing capability.


[7] J. Newsome, E. Shi, D. Song, and A. Perrig.

over, this veri.cation technique is vulnerable to fabricated surements by Sybil nodes.


We explained two approaches for PN formation with some requisite changes in the infrastructure (vide a network elements) and without any such changes.

the clusters can merge and split without extra effort.


In our algorithms, the nodes do not have to have any a priori knowledge about the other nodes, not even an estimate on their total number.

and sends a GATEWAY message is =1/c ' D. in each group, Pr[.


The university has only one connection to the internet via the French academic backbone, Renater.

[2] J. Moy, OSPF Version 2, RFC 2328, April 1998.


Each simulated Quartz ring consists of four switches; the size of the ring does not affect performance and only affects the size of the DCN.

the RPC latency is unaffected by cross-traf.c with Quartz.


If an honest node p requests data m where |m| = c 2 log3 N, and if there are at most contention(p, m) concurrently active nodes during the request; then p can get the data in O(|m| · contention(p, m)) time w.h.p.9 PROO F. First, notice Lemma 10 guarantees honest nodes will not be incorrectly removed before their requests are completed.

we will show, with probability at least 1 - 2e, at least one identity in S suffers 81k/512c losing rounds.


PE3 is on due to the update at T =4.7 second in Table 1.

when routes associated with a VRF gets distributed via the MP-BGP session, this RD gets added to each IPv4 pre.x to form a VPNv4 pre.x (i.e., (RD:IPv4-Pre.x)).


6(b) shows that pb has larger in.uence on the Ts of both schemes.

each attribute Aj represents a sensor reading or an aspect of the event such as the weight of an observed object, its location, its speed and moving trajectory, or its appearance or lingering time.


Unfortunately, layer 2 fabrics face scalability and e.ciency challenges because of the need to support broadcast.

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


Second, reliable transmissions provided by TCP remove the need for loss recovery at higher levels.

multiple TCP and HTTP sources are connected to router r0 and their corresponding sinks connected to router r1.


fewer network nodes), di.erent values of ./µ do not make a di.erence, as the sparsity of the network does not allow many events to take place and thus the results appear similar.

{1, 2, ..., N}, and a common recovery rate µ, i.e.


Most of the network is therefore devoid of application tra.c, which, as explained previously, leads to a lack of stable multihop routes in those areas.

sensors within the range of an event region/epicenter (enclosed by the dotted ellipse) generate data events that travel along a propagation funnel (enclosed by dotted line) toward the sink when an event occurs.


It is assumed that the multipath signals are reflected by diverse scatters which distribute uniformly within an elliptical region defined by the maximum multipath delay.

because the foci positions are symmetrical, the multipath scattering near the base station is just as likely as that near mobile terminal.


In this paper, we consider a case where time sensitive multimedia is sent using multiple paths which can make better use of load balancing strategies, increase bandwidth and save node energy.

pVi of path i is initiated at source node as follows: PVi = PVin Path Evaluation  Initiation The source node needs to update the PVi of path i after a share of data has been sent to path i.


Next, we started the data capture using the Wireshark software extension.

we have introduced a new source of interference to measure the variation of the wireless network performance caused by that specific device.


Note that the placement of the RFIDs on the object is typically provided with respect to the object itself, such as one tag at each end of a table leg.

we vary the gripper size among 7.5 cm, 8.5 cm and 10 cm.


The results for the Nash equilibrium when .ows vary their decrease parameters are shown in (b).

1.since CHOKe+ assigns a much higher loss rate to .ows than RED for the same setting of the increase or the decrease parameters of the n .ows (Figures 5(a) and (c)) and since CHOKe+ induces many more bursty packet drops than RED (this is intuitively clear from the CHOKe+ algorithm), TCP SACK .ows tend to time-out occasionally when CHOKe+ bu.ers are used.In fact aggressive TCP SACK .ows will timeout quite frequently under CHOKe+.The goodput equation for Gentle .ows (Equation 24) does not capture this time out behavior.Hence, Figures 6(a) and (b) do not correctly represent the behavior of CHOKe+.Indeed CHOKe+ results in a much less aggressive parameter setting at Nash equilibrium than RED, as our simulations for the TCP Game (described below) show.


The dynamic rate control of SSP is based on the Figure 4 KeyFrame Selection Algorithm packet loss rate reported by the receiver.

the other is extended acknowledgement, which acknowledges only the packet with the specified sequence number is received.


5.3 Power Consumption In this section we propose two novel models for the average power consumption that we need in the optimization problem (1).

the reliability constraint of Smode is less critical than delay constraint, see more results in [21].


In this case, local movements are statistically predominant across all movements of a node.

the power law selection of the modi.ed HCMM model will consider only a subset of  200 500 1000 2000 distance [m] Figure 4: MLE .tting -100 communities all thepossible distances, thus creating what we have called subsampling e.ect.


()n Prob(E1)=Wp(n,W-) W  ()()n-1 Prob(E2)=nW WW Let q(n,W)=Prob(E3).

for ease of analysis, our model assumes no transmission error.


we found the naive approach of replacing 2D convex hulls with 3D convex hulls to be impractical.


This limit may be tweaked to attain the desired yield coverage.

receiver Test For the IEEE 802.11a receivers, various blocking scenarios are de.ned and the receiver is expected to yield a minimum speci.ed SNR (Signal to Noise Ratio) in each case.


To speed-up the experiments, we compile a set of unique pre.xes before starting an experiment.


In Proceedings of the IEEE Globecom, 2003, 362 - 366.

its message complexity has been discovered to reach up to the order of O(n2) recently.


This middleware is focused on the interoperability between popular protocols such as Bluetooth, UPnP, etc.

a sensor network [2] comprises one or more sensor nodes which communicate between each other using wired and wireless means.


Due to the huge dimension of the footprint of a typical satellite link, the analysis of the interference cannot be done by considering a deterministic approach.

an example of such scenario is reported in Fig.


The experimental evaluation reveals that such protocol discovers about 10% more disjoint covers than does the best algorithm of Slijepcevic and Potkonjak [13].

one potential problem here might happen when two neighbor nodes are making the decision of turning themselves off at the same time, so that one thinks that the other can cover for it and both go off-duty this situation leads to blind areas what jeopardizes coverage.


The linkage does create a performance cost; the application uses supercomputer time 45% less effectively than it would otherwise [18].

typically, a feature of such collaborative scientific enterprises is that they will require access to very large data collections, very large scale computing resources and high performance visualization back to the individual user scientists [32].


Li, "An optimal topology-transparent scheduling method in multihop packet radio networks," IEEE Trans.

incre- ment the start and finish tags for flow i*, but not for any of the flows in Si..


The ability to correctly design these power levels will lead to signi.cant advantages in terms of throughput utilization and energy e.ciency.

geometric ad-hoc routing: Of theory and practice.


System Architecture The architecture of our proposed scalable RTPS-based video streaming is shown in Figure 2.

we could use both evaluation tool sets to evaluate our proposed scalable RTPS-based video streaming system.


We assume the scheduling of each packet takes into account the remaining distance in hops, denoted H, from the current location of the packet to its destination, and the remaining lifetime, denoted T , of the packet.

a node periodically inspects the remaining life time of all packets within its transmission queue.


Developing an internal router is more complicated because it relies on DTN2 s internal architecture.

finally, there is no randomization or probabilistic behavior; all outgoing bundles are queued on links in the same order.


The latter is in turn composed of a 46 bytes random .eld, whose value is generated at random, and a 2 bytes client version .eld.

multicast messages sent by different sender nodes may be considered as replayed messages by listener nodes, and get discarded.


Since the hash values Hi do not need to be just 62 bits long but can be e.g.

nS multicasted to the link: Who has 3ff0::4512:46a2:459c:491b?


The latter includes an MD5 (or other) digest of a text password, to address security issues.

the secondary IP addresses shown in Figure 2 are used by the core and its routing protocols, although both customer ports have the same IP address.


Of course, in the case that even if Tx powers off, Tx cannot 21achieve its target with its current transmission power, then it simply offers no reward to Tx .Up to now, we showed how a 2transmitter defines its reward, as well as the percentage reduction of the transmission power that it demands.

fairness has to do with whether, trying to find out a (N-1)-feasible solution, the unsatisfied node varies with the time (and this will always be one of the unsatisfied nodes at the last round of FM).


Visualisation of the codewords are by representing the codewords as N-dimensional hyper-cubic colour image, with each dimension having a colour mapping, for instance comprising 8 bit colour elements.

such small representations allow an adversary to easily generate collisions, since the work factor is only 24 or 28 for each visualised segment.


For the coverage holes, we found that 75% of these sectors had boundary distance of at least 50 meters less than the average boundary distance of 178 meters.

note that the most gain available is at moderate o.ered loads, where there is signi.cant load imbalance on mesh nodes and some nodes have available capacity.


For example, as Alice and Eve are both communicating, there will be a repetition of failures, and Bob may record a history of channel estimates in order to enhance the detection of Eve s intrusion.

for example, by maintaining the transmit-receive channel history between a transmitter and receiver, we can detect scenarios where Eve tries to act as Alice.


Since adjacent vehicles share (partially) identically partitioned vehicle maps, and the same updated location, the D-CUT algorithm will produce the same new partitioned map for each vehicle.

a well-organized piggyback strategy is required, in order to achieve high data throughput by avoiding undesired redundancy of the beacon messages.


In this limit we use uI,m(0) = 1/(m - 1).

the zz average size of a .ow of length less than z is xz =Xz - z - /n- <z.


To encode measurements of nodes we propose to use rotations applied to a vector in a prede.ned sphere to represent distinct measurements of sensor nodes.

when nodes die or are added, this information can not directly be extracted from a vector representing a context classi.cation.


We show via simulations usingrealistic workloads and topologies that this simple design achieves near optimal .ow completion times and network utilization.

we stress that 1 We assume the receiver NICs run at line rate and are not bottlenecks.


Even if nodes do not move, nodes may die if they run out of energy.

al [1], network protocols that min- imize energy consumption are key to the successful usage of wireless sensor networks.


We quantify the degree of the mobility, M, by using SFERf and SFERl, de.ned as follows: M = SFERl - SFERf .

we have implemented MoFA on an o.-the-shelf 802.11 NIC with AR9380 by modifying the ath9k device driver.


397, Institute of Scienti.c Computing, ETH, Zurich, 2003.

the group partitioning is a static process which does not dynamically adjust to the user view and all streams are treated as equally important.


While edges are not particularly useful for complex encoding or modulation schemes such as OFDM, backscatter devices are simple and use OOK modulation.

since nodes transmit via OOK, edges carry important information regarding the bits being transmitted, hence allow us to decode data from di.erent tags.


As we can see in Figure 8, with interrupt coalescing at the device model, CPU utilization is dropped from 50.4% to 34.2% while achieving the same throughput.

different from hardware-assisted virtualized I/O, virtual WiFi approach does not depend on any speci.c I/O virtualization support on device.


This .gure shows that N ' is fairly small for practical value of Rm/Rl.

only the contribution value of the on-duty device is updated in any cycle.


Simultaneously, in PTP mode both HS-DSCH and DCH are used in order to serve the rest of the users.

all the rest outer part UEs (up to Z10) covered by HS-DSCHs.


In order to put things in perspective, we use some data reported in [2] regarding the commercially available Berkley MICA motes to estimate what is possible on a common sensor device.

across an arbitrary link in the network, the route discovery messages generated by a particular sensor will always be the same.


Gary Marsden Michael Pazzani Dept of Computer Science, AdaptiveInfo, University of Cape Town, 111 Innovation Drive, Private Bag RONDEBOSCH,  Suite 200, 7701 South Africa Irvine, CA 92612 gaz@cs.uct.ac.za human-centred perspective.

note, when cursor is moved to a line it changes to display truncated text.


We conclude that there is a large variation in user distinctiveness.

also, as expected, .elds is not able to identify many samples on its own since it only distinguishes wireless cards and drivers.


2.1 Hardware and Software Design Hardware Design:Figure 1 shows the diagram of our GoG board.

the location sensing capability of the mobile phone has triggered the recent blossom of locationbased services (LBS).


Most of the paper s analyses will consider r up to 120, corresponding to an SNR just shy of 3dB, about the minimum for one-megabit 802.11b.

3.2.3 Analytical formulation The model places one sender at the origin and its receiver at any polar coordinates (r, .)


[23] C. Carter and R. Kravets User Devices Cooperating to Support Resource Aggregation In The 4th IEEE Workshop on Mobile Computing Systems and Applications, 2002.

whenever SNR/BER information cannot be collected, MAR relies on past throughput information only.


Similarly, in [10, 12, 15, 19, 23], routing decisions were mainly based on the so-called contact probability of two users (or one user visiting an access point if available).

in the real world, it has been observed that users routinely spend a considerable amount of time at a few speci.c place(s), referred to as hub(s).


Our results show that sensor mobility can be exploited to compensate for the lack of sensors and improve network coverage.

mobiHoc 05, May 25 27, 2005, Urbana-Champaign, Illinois, USA.


When the number of SSs communications and mobile computing (IWCMC), 2006, pp.


A PROPORTIONAL DIFFERENTIATION MODEL FOR WIRELESS LANS The proportional service differentiation model [10] is first introduced as a per-hop-behavior (PHB) for DiffServ [6] in wired networks.

the service differentiation ratio between Class-2 node and Class-1 nodes under varying data rates of Class-2 node is shown in Figure 13.


This would in turn support hypothesis H1, and the next section o.ers additional evidence to that e.ect.

eliminating (S) as a possible cause for performance di.erences between IPv4 and IPv6 relies, therefore, on a mostly indirect approach on which we expand later in this section.


(LST (G)) = (k+1)(1+E)-2k = kE-k+2, k-2 which is negative when E < k .

from now on, we .x d-k and graph G to study the relationship between the minimum ratio of spider centered at vj .


MAD algorithm performs a modi.ed version of a breadth.rst search algorithm to the combinations of di.erent RCs in matrix M to minimize the summation of the area difference values in M. Working with RCs rather than RBs signi.cantly reduces the computational complexity of the MAD algorithm.

among many architectural improvements, 3GPP Release 8 speci.ed that scheduling the uplink channel would take place at the base station, or eNodeB, to enhance the system s response.


In this experiment, each controller needs to compute for each request (according to the source IP address to calculate out which routing path to fetch) and fetch the global network view (reading routing path from cache), so it is reasonable of each controller to process 400,000 requests per second.

4.2.2 Latency Analysis Comparing this powerful logical controller to a single controller deployed in the current OpenFlow network, the time delayed in ASIC is O ( h ) + O( f ( n ) ) which could be accepted by end users based on the analysis as follows: 1) h is the hops of balancers in the balancing system which a request needs to go through before reaching a physical controller.


These clusters are likely to break when cluster-members move out of the communication range of their cluster-heads.

if one node can receive the intra-message from only one of its neighbors, essential information may be missed due to collision and inconsistency problems can occur.


This requires inspecting packets beyond L4 headers.

also, this information is not available in the .rst packet of the request, and so the request routing rule cannot be set up in the switch even after examining the .rst packet of the .ow.


GKMPAN is an efficient group rekeying scheme for secure multicast in ad-hoc networks proposed by Zhu[10].GKMPAN also uses the probabilistic key pre-distribution technique as the underlying means to establish secure channels between nodes.

node c is similar to the case above, except that node c is out of node a s one-hop but in two-hop communication range.


1997 Symposium on Network and Distributed System Security.

the physical layer of the attacker can still despread the signal for the purposes of sensing the start and end of the packet.


Helios: A hybrid electrical/optical switch architecture for modular data centers.

these systems have signi.cant limitations.


It should be noted that when most sizes correspond to a unique packet type as is the case in Table 3 and would be true for any size transformation that is a simple additive offset, the distribution only needs to start to converge on the correct distribution for the MAP classifier to be correct.

further the victim assumes something is wrong with the ARP table and it starts broadcasting ARP requests.


The pull-based scheduler uses an order of magnitude more table entries, on average, than DevoFlow.

these results assume that micro.ows can be split across multiple paths.


In designing the 2-level network, we employed the strategies provided above for solving MDEA-1 and MDEA-2 problems.


By using tilting patterns composed of two concentric squares with di.erent gray levels, the demodulator can decide whether the data bit is 0 or 1 from the di.erential gray level between the inner and outer parts of a tilting patten, without the need of estimating a threshold.

it is not ideal for random bit error correction because one bit error su.ces to cause a multi-bit symbol error.


Activating Net.ow everywhere on the network yields an extensive knowledge of the Origin-Destination (OD) .ows.

in this short paper, we restrain ourselves to the case of a single linear constraint p T w : b, but we point out that we recently extended the model [1] to handle more realistic, per-router constraints (consisting in a set of linear inequalities of the form Rw : b), and to take into accounts the link measurements (SNMP).


interpreted at the sensors, but only handled further to the base station where data evaluation takes place.

with the directional information property, more links are added in the symmetry phase of FETCD graph than the FETC graph which explains these results.


In this manner, many kinds of interesting inferences can be drawn, though they may be statistical and depend on various independence assumptions.

table 3 shows the percentage of clients that use a given number of unique transmission rates in our trace.


For each test, we select at random 0% (X6Ti-0), 30%(X6Ti-30),70%(X6Ti-70) and100%(X6Ti-100) of the routers to be Xcast-aware routers.

x6Ti allows interchange (without any con.gurations) betweenOverlay Multicast mode(end-hostsduplicateandfor- 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 ordistributedforpro.t or commercial advantage and that copies bearthisnoticeand thefull citation onthe .rstpage.Tocopy otherwise,to republish, topost on servers or to redistribute tolists, requiresprior speci.c permissionand/or afee.


Let Dr and Rr be the expected delivery rate and e.ective throughput4 using bit-rate r.Then, the throughput achieved by the lower bit-rate is the same as the current bit-rate if Dr-1 × Rr-1 = Dr × Rr.

[29] Sadeghi, B., Kanodia, V., Sabharwal, A., and Knightly, E. Opportunistic media access for multirate ad hoc networks.


Moreover, the recognition of such differences will help in the design of a more realistic network-enhancing API.

the scale of the applications in number of nodes Network Transport Protocol: The aim of this section is to learn The majority of these Grids (71%) span across 1-10 administrative domains, while 21% have nodes in 10-100 different domains.


Recently, there have been new research attempts of using multiple wireless network interfaces to reduce both handover latency and packet loss in mobility management.

y S In the simulation we only consider a linear movement pattern for i j .


For local residents, other than the benefits mentioned above, the high-speed Intranet enables building of home office, which would improve work efficiency and the quality of life.For local government users, most economic benefits were the same as business users.

the digital convergence project in Qingdao High-Tech Zone reduces the market access threshold for disadvantaged operators, breaks the monopoly of the dominant operator, and provides a platform for fair competition.


4.2 Static SOLAR-KSP Algorithm In this protocol version (referred to as S-SOLAR-KSP), we assume that each user knows of every other user s mobility pro.les and each user distributively does the following: First, every user computes the contact probability with every other user.

in the absence of any knowledge on the user mobility, e.cient routing remains a daunting task.


Due to its nature SDS is very robust against message losses which sets SDS apart from many traditional DCSP solvers which fail if one single message gets lost.

an assignment that does not violate any constraint is called consistent or legal.A complete assignment is one in which every variable is mentioned, and a solution to a CSP is a complete and consistent assignment.


This can be generalized to deal with updates in O(log2 n)timeand reporting points in time O(k+log2 n).

calculation of dR 3,4 Figure 2: Dynamic linear k-connectivity maintenance 3.2 Planar node layout The static algorithm for planar k-strong connectivity in 1.4.2 heavily depends on computing Nt for every node t. for every node we want to be able to .nd its kclosest nodes in the plane.


At the same time mapping real world multi-hop topologies on space constrained wireless testbeds in an e.cient and accurate manner presents a signi.cant challenge.

ability Noise Shielding/Power Control MAC - Filtering PER - F iltering Channel Dependence yes no no no P ER Granularity coarse coarse coarse fine Local Control no no 2 3 yes yes Remote Execution yes no yes yes Node Mapping specific any any any Deployment Cost significant significant free free Emulating RSSI precise coarse no no Figure 10: Summary of comparison of approaches for topology creation.


(z := m) for fresh z and A := S{Lk{z}/Lk{ek}}.

even if we prove the protocol secure, the implementation that is later deployed may contain implementation errors that introduce new vulnerabilities.


In addition, the content should exist to retrieve by the requester, or the Interest will be pended without replying any data.

push Interest, which is not removed after delivering the segment, needs to be added to the network design.


it is also interesting to observe that the best setting for token-based forwarding (as derived from simulations) seems strongly related to the threshold of the optimal algorithm.


In addition, the rapidly changing and sometimes vague OpenFlow speci.cations can result in multiple implementations that behave di.erently.

after the connection setup and exchange of theinitial Hello messages, the testharnessinjects a sequence of several symbolicOpen-Flow messages and/orprobes, one at atime(wediscussthe input sequences in more details in Section 5).


It calculates the new buffering parameters to be reported to the streaming server.

a classification of rate adaptation schemes is possible also depending on when the rate adaptation is performed:  Reactive schemes: here the rate adaptation action is triggered upon the occurrence of an event (e.g., a handover or a sudden drop of network bandwidth).


We .rst describe the deployment pattern and then analyze the number of cameras used under various deployment parameters.

suppose V is full-view covered but the rotation angle from - -.


Refresh-LSA traffic for routers running 1OS 11.

in general, in network related phenomena, synchronization is only a real problem when there are forces driving the sys- tem toward synchronization, which is not the case here.


PCH(PacketClearing House)[18] is a non-pro.t research institute that supports operations and analysis in the areas of Internet tra.c exchange, routing economics and global network development.

between AS-level connectivity discovery and the number of BGP feeders required.


LOCATION INDEPENDENT COSTS This paper advocates that tenant cost should not depend on where a tenant s VMs are allocated within a datacenter.

figure 6: Tenants costs with DRP-100 relative to baseline (log-scale).


[17] G. Bianchi, Performance analysis of the IEEE 802.11 distributed coordination f unction, IEEE Journal on Selected Areas in Communications, vol.

if the contention graph [8] is perfect [9], the above condition is also a suf.cient feasibility condition (see [10], also cited in [7, 6]).


Are there any very common certs that are broken and people keep using them?

in 2007, AES-256, RC4-128 and 3DES were thedefault algorithms chosen by servers,in that order.


In Proceedings of ACM SIGCOMM, pages 235 246, 2012.

at each stage of the pipeline, we further use data partitioning and computation partitioning to increase the processing speed.


7.3 Energy consumption In LETEDthenumberof receiveslotsdependsonthesupported end-to-end delay.


Copyrights for components of this work owned by others than ACM must be honored.

acknowledgments We thank Mohammad Alizadeh and Kai Chen for helpful feedback and suggestions.


Categories andSubject Descriptors C.2 [Computer-Communication Networks]: DistributedSystems  GeneralTerms EnergyPro.ling,EnergyHarvesting  Keywords mPlatform,Ultra-capacitor,TwinStar 1 Introduction and Motivation Energypro.lingmeasures energy consumption of system components running atdiversepower modes and operational settings.


the receiver may not be able to correctly decode the symbol and the data rate sustained by each transmission may decrease.


Cellular operators are rapidly deploying small cells and the number of small cells overtook the number of macro cells in late 2012 [2].

the applications envisioned that need heavy computation on mobile devices also require low latency in interaction with the user.


For each sub-zone, we select the makeup that can bring the maximum minimum PRP for all vehicles in that sub-zone.


The resulting frequency responses in this example and others (not shown) are nearly identical.

in Proceedings of IWQoS 02, Miami, FL, May 2002.


2.1 Secure Routing Protocols Attacks on routing protocols can be classi.ed based on the type of attacks (active, passive and semi-active attacks); the perpetrator (external or internal attacker); and the severity of attacks (for example, a ratio of damage resulting from the attack to the attacker cost or the risk faced by the attacker ) [5], [6].

thus a set of northbound vehicles in Interstate I-95 may form an ad hoc subnet that excludes all southbound vehicles (and vice-versa).


Thus, hierarchical substring caching introduces no signi.cant extra CPU cost to identify the block boundaries, compared to value-based caching.

of course, since we have to retain a hash value for each block, the blocks at level k - 1 will take up a disproportionate amount of the caching space at the proxy.


7 Conclusion Much of the prior work on integrating time synchronization with routing has focused on the ef.ciency gains from doing so.


Various time-synchronization protocols tailored for such networks have been proposed to solve this problem.

given the unattended nature of many sensor network deployments and the importance of the applications and services in which time-synchronization is used, the security of time synchronization should be a central concern at design-time.


However, even such transmissions are possible only between nodes that can actually exchange some message-bits as well.

again, since one cannot yet rule-out the possibility of a super-polynomial lower bound on the complexity of general URMT protocols, a study in that direction may be worthwhile.


To avoid introducing externally visible churn, the hypervisorkeepsa historyofthelastupdatepeers have sent for each pre.x, and replays this for any new instance upon startup of that instance.

code development maybecome morechallenging, sincethisapproach relies on knowingwhich parts of code are functionally equivalent.


sparrow: distributed, low latency scheduling.


Preemption is permitted amongst the sub-classes themselves so that a high-priority sub-class has a better chance of acceptance.

as in Equation (24), if Count(1,n- 1) is less than c , then for every node j, the number of slots used by calls of these sub-classes is =B-c. All the remaining cslots are either free or are used by lower-priority calls which can be preempted by the call belonging to sub-class n. the call of sub-class ncan be accepted.


The main function of the Core device is to classify the packets from the edge device.


In order to use Tor, clients contact publicly known directory servers, a fraction of the Tor network responsible for tracking the topology of the network and node states.

we consider adversarial models similar to anti-censorship solutions such as Telex [49], Cirripede [23] and Decoy Routing [25].


Tarek Bejaoui Institut d Electronique Fondamentale CNRS UMR 8622 Université Paris-Sud 11, France Tel : (33) 1 69 15 41 07 tarek.bejaoui@ief.u-psud.fr spectrum is real-time services requiring strong bandwidth guarantees.

in our framework we provide an adaptability ratio measure which is integrated in the adaptive bandwidth allocation algorithm in order to reduce the CBP in addition to the CDP.


By (5), we can truncate the hierarchy at i " .

let G be a communication graph with given link demands and let GP hy be its corresponding con.ict graph.


We relax these assumptions in Section 4 where we describe our distributed algorithm.

alice will start transmitting data packet somewhere between t = T + 6.35µs and t = T + 8.35µs (See Figure 3).


5.3.2 Rush hours VCP can obviously deal very well with the appearance and removal of nodes.

bidirectionally Coupled Network and Road Tra.c Simulation for Improved IVC Analysis.


We assume a Poisson interprobing pattern, because the asymptotic average of Poisson samples converges to the limiting time average of the sample-path being sampled.

paxon (1999) de.ned and measured a relative available bandwidth metric ß [18], which approached 1 when the path was void of crosstra.c and 0 when the path was close to 100% utilization.


As each hop traversal requires one message, our interest is to minimize the number of hops for the complete traversal.

when the space .lling curve is traversed, each point in the mapped space is traversed only once.


al., FloorNet: Deployment and Evaluation of a Multihop Wireless 802.11 Testbed, EURASIP Journal on Wireless Communications and Networking, 2010.

we execute the experiments at night hours, and the duration of each experiment is of 80 seconds.


[0, 1], and a = 0: DIA SIA DIA SIA DIA,* SIA,* xJ,a (p)= x a (p),y J,a (p)= yJ, a (p),p = pJ, a , J, J,a 1+a 1+a 1+a (24) = ASIA and thus ADIA a .


Such a change infringes the end-to-end principle of not implementing complicated control in a network.

owing to this fairness, bu.er over.ows occur at access points, so many ACK packets are discarded.


The association mechanism between the concentrator and smart meters is implemented using the COSEM-OPEN service which is discussed in more detail in [4].

the PID and LID pair of received packet header is then replaced by the corresponding Outgoing PID and LID pair of the entry and forwarded to the smart meter.


which are illustrated by the dotted ellipse on the NPT in Figure 7.

this means will encounter serious problems.


Given .h,the phase f.h (C) at whichacut C of h intersects h is equal to the largest label of an edge of .h in C. Note that for every hole of girth g there is a trivial phase assignment where every cut of the hole has phase at most g -one need only number the g edges of a minimal length cycle from 1 to g. In fact, in most situations simply using the girth of a hole instead of the phase of a cut under a particular phase assignment makes the analysis considerably simpler without a.ecting too much its accuracy.

once again, we remark that all the results in the previous paragraph are proved for the square or the circle; there is no evidence that they would hold on deployment areas of di.erent topologies -e.g.


Actual crypto performance depends very much on implementation, but own experiments indicate that this hardware will not be able to do more than a few dozens of veri.cations per second using ECDSA-224 and optimized software libraries.

signatures and certi.cates lead to a signi.cant consumption of communication bandwidth and processing power.


,a) indicates the immediate reward received after transition from s to s with transition when a is applied on the system.


We also assume that, hence, intersymbol interference (ISI) and interchannel interference (ICI) are avoided at both the legitimate receiver and the eavesdropper, either because the cyclic pre.x (or zero-padding su.x) is longer than the delay spread of both channels or because the channel coherence bandwidth is larger than the subcarrier spacing.

the loss introduced by using uniformly distributed QAM symbols can be reduced by augmenting the constellation cardinality, but it cannot be completely eliminated.


When the transmit wi.-array is talking to a single radio node, only one of the multiple radios is active.

pERFORMANCE EVALUATION In this section, we present the performance evaluation of Glia on the 12 radio wi.-array testbed.


It also demonstrates the agreement between our idealized energy computation and real TCP behavior.

computer Communication Review, 21(5), Oct. 1991.


In Figure 1 this is shown with dotted lines in the sensor network cloud, with sensor node 1 communicating directly with the gateway whereas nodes 3 and 4 forward link layer fragments via node 2.


Then, simulation results are shown as the Fig.

to copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee.


3.7 PCC Options While the current version of PCC works as described above, there are a number of options and possible improvements that we have investigated.

[4] J. Byers, M. Frumin, G. Horn, M. Luby, M. Mitzenmacher, A. Roetter, and W. Shaver.


rtA The state of the routing-table entry for D D at node A.

if Q is empty, then the lemma trivially true.


The interfering .ow between node 15 and node 21 is sent at rates between 0 and 140 packets per second.

tOM is currently not able to provide measurements of a precision and timeliness to be useful for an APHD like packet scheduling.


Finally, by examining Figure 13, one can infer the performance of a wide range of down-transcaled scalable streams.

transcaling could enable a device which has a bandwidth R >> Rmax_1 to receive a better (or at least similar) quality video while saving some bandwidth.


A related observation is that, given their heterogeneity, some devices may require the adaptation of certain media streams before they can be displayed.

[5] X. Gu, K. Nahrstedt, R. Chang, C. Ward, QoS-assured service composition in managed service overlay networks , ICDCS, 2003.


In this demo, we present a wireless experiment that is remotely executed in NITOS testbed [6] and more speci.cally show how energy e.ciency evaluation can be performed in parallel with experiment execution.

recent studies [1] have highlighted the inability of existing models to accurately estimate energy consumption even in non-composite scenarios, where the operation of a single device is analyzed.


It is dif.cult to predict the appropriate value becuase it depends on a variety of factors such as the number of peers in the P2P network, the bandwidths of peers, and so on.

[8] S. Oechsner, T. Zinner, J. Prokopetz, and T. Hoßfeld.


As such, a .ngerprint at the border of one cluster completely ignores the chance of picking a border .ngerprint from the other cluster, although they may have a small Euclidean distance between them.

hence, the total number of operations with Median clustering is O(NM log M + N log N + KM).


As DFPQ merely allocates bandwidth based on the priority of service classes without considering the delay requirement of rtPS, it cannot effectively control the delay of rtPS.

[11] Tian, Chong; Yuan, Dongfeng; A novel cross-layer scheduling algorithm for IEEE 802.16 WMAN, International Workshop on Cross Layer Design, 2007, Page(s):70 73, 20-21 Sept. 2007.


Focusing on a single congested link (Listing 2), the algorithm goes over all aggregates crossing that link; for each it estimates the gain of moving some or all of the .ows away.

as that path becomes congested, we want to consider of.oading part of the aggregate onto other paths.


remote address (client or victim IP); (ii.)

the servers that return the most packets or bytes for every packet or byte sent are the most powerful weapons for attacks.


This indicates that there is more contention for the available bandwidth while using PSockets with the default TCP window size than while using a single socket with the same TCP window size.

several RFC have been developed and implemented to overcome these issues and achieve maximum performance with the current TCP over LFN.


In [4], a cross layer tree construction protocol that considers both load balance and QoS parameters is proposed.

the goal of this paper is to find an optimum scheduling Sopt such that scheduling Sopt is valid and the number of total required time slots is minimized.


We .nd that the the performance of the machine learning estimator improves as it is trained with diverse set of environments, e.g., indoors vs. outdoors.

this may be possible by using sophisticated physical layer techniques such as RODIN [39] and WiFi-NC [40].


We first show that with probability at least 1 - 2In, the estimate fie [~, 4HI for all nodes.

x + y denotes the point that lies clockwise distance y away from x along the circle.


For example, node 4 cannot acknowledge packets coming from node 8  1 9 2 3 10 4 Figure 4.

the speeds of the nodes are varied between 0.5 and 1 m/s and between 1 and 4 m/s, to simulate slow walking and cycling, respectively.


4.2 Controlling Intrusiveness One strategy to reach the objective of Equation (7) is to use a minimally perturbative stream to reduce bias (e.g., [23]).

similarly, the cross-traf.c is described by a phase z .


Such a failure can be solved by retransmissions.

learning Function: In an earlier section we mentioned that GF has a higher loss ratio than AODV and DSR, because GF tends to choose the same candidate near the border to forward packets to a destination, while AODV and DSR attempt different paths due to the nature of flooding.


2 and mark it with a letter from (a) to (m) on a blue background.

we assume that the data.ow links have equal transmission speeds.For thisexample, wehave oneRC frame, f10 sent by ES1 to ES2, with the transmission duration Cf10 = 100 µs, and 5 TT frames f1 to f5 to be forwarded by NS1 to ES2.


We use a recent model of service quality for realtime wireless applications in which each station s QoS is parametrized by a delivery-ratio, which is the average ratio of blocks desired to the blocks generated [6].

here, the phone unicasts to the AP, which broadcasts to the rest.


If so, it means the energy of the current charging node and its synchronization target have been already synchronized, and thus the mobile charger simply fully charges the node to maximize the charging ef.ciency.

2.1 Prefetching The charging ef.ciency can be signi.cantly improved if the charging requests from individual nodes arrive at the charger with an order resembles their sequence on the TSP tou.


Figure 4 shows few sample results and the nature of the increase in the Gd and decrease in the Gb with the increase in b and v respectively for few combinations of N and µ.

curred per unit increase of b and denote it by d. the rate at which the cost increases should not overshoot therateatwhich Gd increases and so we have the following relationship.


will assign the same injury level colour to the paper triage tag of the victim.

using bluetooth v2.1 + EDR included in most of today s smartphones (with a maximum practical data transfer rate of approximately 2Mbps) would require 1 second to transmit a message under optimal conditions (sender and receiver very close one each other).


Figure 7 shows the goodput versus number of wireless hops h of TCP-GAP as well as TCP NewReno.

in case (1), which is depicted in Figure 14, all FTP flows run from the wireless to the wired domain with the TCP source and destination entities (A1B1), (A2B2), .


To .nd out the number of occurrences of x from the observation T,we use the principle of MLE, i.e., we would like to .nd f that maximizes Pr(F = f|T).In other words, F = argmax Pr(F = f|T).

broder, Summary cache: a scalable wide-area Web cache sharing protocol, IEEE/ACM Transactions on Networking, vol.


We conjecture that these measures work for other probe distributions, and thus in many cases, the mea- sures can be applied in-band, i.e., the probes can be incorporated into the underlying data stream.

instead, we define another ccross-measure that can be computed by end-hosts configured in a Y-topology, and another auto-measure that, when compared to this cross-measure, meet the requirements of the comparison test.


To support the DNS ME, NetAssay installs a forwarding table entry in the switch to divert a copy of all such responses to the DNS ME, which analyzes this traf.c off-path to maintain the corresponding mappings.

acknowledgments This work was supported by NSF awards CNS-1018021, CNS1409076, and a Google Focused Research Award.


A set of contextual graphs can describe different problem solvings, and thus different types of attacks.

in this case, the attack cannot be detected using traditional access control which is based on the subject/object paradigm but rather on the semantic of the access request.


Weemployanadaptive routing scheme such as a variant of face routing [27] with the diagonal XYZ routing.

we measure the number of node pairs that can connect to each other under an increasing number of server failures.


We consider a large value for N, and therefore the size of a sector is very small.

a possible strategy for reducing the completion time of the MoSBoD algorithm is a selective increase of the duty cycles of sensor nodes.


A failed link would be unable to carry any network traffic, and in practice, we can remove that link from network topology.

in our simulation each demand unit was routed separately based on the weighted shortest path algorithm used in [5].


Very often, organizations think that they've outgrown their network, without considering that the real problem is that it's a bottleneck, that is causing the problem [5].

setting up a networking lab can be very expensive.


We start with a description of our interfacing module that helps VeriFlow to intercept all network events in an OpenFlow network in a transparent manner (Section 3.1).

to support other types of queries, it would be straightforward to extend VeriFlow to accept user-provided modules that compute arbitrary properties, given access to the equivalence classes and their forwarding graphs.


Other schemes might need a small server to support fault tolerance.

broadcasting the messages to all the participants in the virtual world is definitely not bandwidth efficient, and wastes the computing power of those nodes that receive irrelevant messages.


Obviously, these estimators can work only after the occurrence of packet delay or loss, when network congestion has happened already.

the set of transmission rates determines the aggregate flow yl(t) at each link l, by the equation: yt( )=.xi (t -t f ) .


Simulations were performed for examining handover latency and signaling cost during the hando.. We simulated both PFMIPv6 and PFMIPv6-PT schemes.

on the performance improvement in MIPv6.


Among the two tasks, routing in system area networks that require dead-lock free and deterministic paths has been extensively studied and is fairly well understood.

the con.guration set is minimal in that there do not exist two con.gurations in the set that can be further merged.


Whereas Discoverer lack of conciseness on binary protocols produces hundred of inferred message formats for a single true format.

indeed, most of the computed clusters contain a single message.


Historically, scans are detected as X events in Y seconds [7, 11, 16].

for streams that terminate in an allowed state other than Closed, the event is denoted as timeout to signify that the stream has ended but the connection has not been closed.


It is designed to reduce the chance of collision among the senders.

this makes assigning slots to all nodes undesirable as it leads to a signi.cant increase in delay to receive .rst message.


Since an ordered packet reception is not guaranteed by Deluge, each receiving sensor node needs to store all packets received out-of-order for a later veri.cation.

{0, 1}n for 1 = j = l/2+ a for a small constant a; 2.


The above mentioned CAWM class of algorithms operate at the carrier level.

a base station exchanges messages with other base stations in its interference region to know about the status in use or not of all the channels in the interference region.


The .lters discard invalid advertisements and routes not compliant with local policies.

when receiving multiple routes to the same destination pre.x from different routing processes, the router uses an inter-protocol route selection procedure to choose one of the routes to put Figure 1: An enterprise with two of.ce branches, each deploying its own routing protocol.


B. Grizzard, V. Sharma, C. Nunnery, and B.

the dynamic method is less accurate at identifying the loop exit conditions, but requires no setup and can be used on any of our samples including MegaD.


2 shows the average numbers of packets per second sent over the two links with respect to the distance between node b and node c. When the distance is below 250m, .ow (c,d) obtains most of the channel s bandwidth.

oursecond simulationscenariois anadhocnetwork shown in Fig.


4.4 Protocol Properties This section contains a description of the main properties of this protocol.

the re-clustering overhead in this case will be equal to zero.


IEEE Communications Magazine, Aug. 2002, pp.

nodes located remotely will be unable to report to the sink, which actually reduces the lifetime of the WSN greatly.


This information is not apparent at the data-link layer, but the transport layer can use the mean transmission rate to determine this.

we de.ne an epoch to have units of packets and is an integer multiple of the total number of nodes in this subtree.


The first experiment suggested GWMAC can increase network lifetime by at least 63%.

4.2.2 Basic Scheme The basic scheme is shown in Figure 5.


In our implementation of DIP, we had2 summary elementsper summary message, and2key/version tuples pervector messages.

disseminating new data withTrickleis comparativelyfast.


It has been shown earlier that the use of directional antenna can largely reduce radio interference, thereby improving the utilization of wireless medium and consequently the network throughput [4-6].

this maximum SINR value is affinity of m with respect to n and this is obtainable when the antenna at n is directed towards m at an angle w with respect to n. Based on this, a NeighborhoodLink-State Table (NLST) at each node is formed In our MAC protocol, initially, when node n wants to communicate with m, it sends omni-directional RTS to inform all the neighbors of n, including m, that a communication from n to m has been requested.


We present in the next section the main principles of the Autonomous Decentralized Management Architecture Figure 1: Autonomic Control Loop (ADMA) that we proposed to provide MANETs with autonomic principles.

we assume that the network administrator has a good level of experience allowing him to de.ne what decisions should be taken in certain well-de.ned circumstances and possible environment variations.


When an End to End service will involve several different ASs, in order to avoid the heavy SIP message exchanges between S-CSCF and ASs, SCIM (IMS Service Capability Interaction Manager) is proposed to orchestrate different ASs as a service composer.

our following works will be concentrated on how to make the Peer-to-Peer possible in the proposed NGN Middleware.


We need a new generation of MANETs with a radically new architecture.

we are very likely to find one- or two-segment paths (going around and between sentinels) for the majority of the sessions in all but very heavily loaded networks, in which case it will be no worse than hop-centric access (segment length of 1).


Simulation results presented in the next section con.rm the profound impact that setbased routing (RSP+sequential coordination) has on the network throughput.

the transmission cycle becomes 3 slots, the average slot throughput 3 4 transmissions per slot and the E2E throughput increases to d 3 packets, i.e.


cONCLUSION This paper presents an experimental evaluation of three complementary congestion control strategies for wireless sensor networks.


MOBILITY WITH RENDEZVOUS POINT 3.1 User side mobility User side mobility for the stored contents in CCN is supported by simple retransmission of interests as we mentioned above.

client sets a specialized bit in the sending interests.


AEGIS contains two mechanisms, namely AEGIS-SG and AEGIS-MP.


In dynamic systems, attractors describe the states to which the system evolves over time.

since biological systems are often described as dynamic systems, they rely on a mathematical formulation given as di.erential equations.


This is useful when the hardware platform offers bigger onchip distributed memories and a lot of memory may be wasted when separate small memory blocks are needed.

b.7.1 [Integrated Circuits]: Types and Design Styles algorithms implemented in hardware.


REFERENCES [1] D. A. Maltz, G. Xie, J. Zhan, H. Zhang, G. Hjalmtysson, and A. Greenberg, Routing design in operational networks: A look from the inside, in Proc.

first, we have formulated the key issues of the con.guration anonymization problem, including the requirements for an acceptable anonymization method, major areas of challenges, a methodology for validating anonymized data, and potential security vulnerabilities.


IEEE Transactions on knowledge and data engineering, Vol.

some discuss a storage alternative, the flash memory, which consumes less power, has low latency and has high throughput for read accesses [7].


As indicated in Figure 3, there would be enough time for the MN to prepare for link layer handoff and link switch while shorter time is required at oAR for this operation.

this metric was used to compare an optimized integration of FMIPv6 and IEEE802.21 with FMIPv6 in [5].


[34] International Technology Roadmap for Semiconductors, 2007.

whenthereis alot ofburstiness of aggregated tra.cdemandbetweendi.erentpairs ofpods, the number of circuits required to support this bursty communication in the data center would be prohibitive.


In the edge networks, the paths usually have a long link chain without branches.

such errors cannot converge to zero even with in.nite amount of measurements.


Netlnf Mobile Node Architecture and Mobility Management Based on Lisp Mobile Node.

in order to analyze its performance, the two possible methods are the analytical and the simulation approaches.


Service characteristics are defined whenever new service is created at server.

necessary security measures are often available on other protocol layers, even if the basic network technology doesn t support them.


{0, 1} (14) Optimization Problem: Let eij be a {0, 1} variable that speci.es if rule Ci is enabled on node Rj .

for modules such as HTTP, IRC, andLogin, we add the checksin the event engine, and for modules suchasScan,TFTP,Blaster, andSYNFlood we add the checksin thepolicy scripts.


goal of a synchronization1 algorithm: coordinating the execution of a common periodic task or event among a group of wireless devices.

this suggests that this may be a dis [9] R. Mirollo and S. Strogatz.


The idea of a ranking function combined with a communication model was .rst introduced by Branch et al [2].

if f(x, D) >f (y, D), then x is more likely an outlier than y.


Gamers are rather impatient and would prefer not to spend much time in the matchmaking lobby waiting for a match to happen.

qT clustering .rst builds a candidate cluster for each player by progressively including the player closest to the candidate cluster (according to a distance measure), until the candidate cluster diameter exceeds the latency constraint.


For the requirements, in this paper, we.re going to focus on users.

the LID of a user will be hidden to the correspondent user, by which the location privacy could be supported in the MOFI architecture.


The spatial packet loss correlation stands for the amount of packet loss experienced simultaneously by a group of receiving stations.

we believe that it is crucial to check if these assumptions are realistic with measurements made on current 802.11 devices.


When designing for totally new use situations, the risk of making wrong design decisions is high.

this paper builds upon the Luff and Heath paper cited above, and the research done by the Mobile Informatics group, a cooperation between researchers from the Norwegian Computing Centre in Oslo and Viktoria Institute in Gothenburg, Sweden [3, 22, 23, 10].


[14], for short term media workloads, the object reference rank distribution in log-log scale does not signi.cantly deviate from a straight line except the initial part.

to characterize the dynamics of a media system, we con sider the birth rate of new objects (denoted as .obj)and the request rate of all objects (denoted as .req).rst.


in International Workshop on Algorithmic Aspects of Wireless Sensor Networks, 2004, Turku.

the routing protocol presented in this work is a good alternative for networks presenting high node density in its totality or in parts.


At time t2, the nodes, now at positions (x1, y1) and (x3, y3), calculate their inter-distance d2 and exchange vi and ai information.

since our algorithm calculates distances within each round and does not use any cumulative data, the er  Movement Noise Our alg.


FHCF is composed of two schedulers, the QAP scheduler and the node scheduler.

that can be obtained also reducing SI but that implies an increasing number of polling and an increasing overhead.


If the noise level of a channel is larger than a threshold, then AFH registers the channel as bad and excludes it from the hopping sequence.

iNTRODUCTION Wi-Fi and Bluetooth are two of the most widely used wireless Figure 1: Canceller mechanism and our testbed.


(3) Note that H = 0.6km, which is much smaller than .r, so we have p.2 r 2 + 4.rH = T(.2 r 2).

.2r2 Using the concept of bit-meter introduced in [7] we could estimate the tra.c occurring under the tra.c pattern assumption.


A Regional Cell Routing in Wireless Sensor Networks Dae-Young Kim and Jinsung Cho Department of Computer Engineering Kyung Hee University, Korea {kimdy,chojs}@khu.ac.kr ABSTRACT Among routing protocols of wireless sensor networks, hierarchical routing protocols are more e.cient, in general, because they involve less sensor nodes for data transmission.

(2) Ei Ni residual neighbor NRC THRCH = ·· (p · ).


Many DVR speci.cations include over-the-air or Internet-based software update mechanisms [23, 2]; these can be used to roll out the functionality of SCORE to existing DVRs.

3.2 TV content access in the UK TV content can be delivered in many ways.


We group traceroute source and IP addresses of the 15 hops along the path into 7 clusters.

we derive a cluster path from traceroute source to 130.75.2.24 (Figure 1).


Comparing (6) with (3), it is clear that they have the same format.

similar to traditional MIMO beamforming, we can maximize the current induced in the receiver s coil, IL, by scaling the current .owing in the transmitter s coils Is with a magnetic-beamforming vector (ß1,ß2), such that: over the far-.eld propagating waves.


However, in the case of low correlation, the neighbor has more transmission options.

opportunistic overhearing bene.ts more from low correlated channels.


However, its implementation is complex since every node along a path (i.e., the source, routers or switches and destination) needs to be involved in congestion control.

it is seldom really deployed in widearea networks.


The 100 runs with the highest di.erences are those of di.ering type (A-B or B-A).

the metric is able to distinguish runs with and without interference solely based on layer two information.


Further, there are frequent issues with wrong timezone con.gurations or zeroinitialized clocks starting on 01/01/1970 or another .xed initial value.

synchronized clocks are very important and a simple and scalable approach is required here.


According to (3.4), this structure is on the outside of P (Pj).

the petals form a ring of connected cycles, with the seed on either the inside or the outside of the structure.


Requests (and grants) are routed to (and by) the credit schedulers through the Clos fabric using inverse multiplexing (Section 3).

the new scheduling architecture alleviates the bandwidth and area constraints of the central (ingress) VOQs cred.


Moreover, with the hot potato approach, nodes do not have to buffer messages (which can cause long latency and message drop because of the limited buffer space) and nodes with high degree suffer less from becoming routing hot spots and running out of energy.

we consider the hot potato approach in the rest of the paper.


Requirement S2 is satis.ed via line 6 of LSA, which excludes any link from being scheduled if its distance from a scheduled link is less than d(n).

a minimum space d(n) is guaranteed between any two active links in the same schedule.


A centralized architecture is infeasible in an emergency due to variations of traf.c pattern and the level of congestion.

we need an architecture which is fully-distributed, selforganizing, and adaptive to dynamically changing conditions.


To achieve higher goodput, it is necessary to operate in higher level of modulation with fewer redundant bits in coding, thereby requiring higher transmission power to maintain acceptable bit error rate (BER) performance.


However, routing packets in VANETs is a challenging task, since there is no central manager entity in charge of .nding the routing paths among the nodes.

a great deal of e.ort is dedicated to design e.cient routing protocols [18, 21, 22].


However, each emitter is blocked from time to time by its neighbors.

we cannot focus on a particular emitter but rather do we have to elect the reference pair de.ning transitions dynamically, as shown on Figure 2.


If we allow parallel transmissions, regardless whether cooperative communication is used or not, .nding a minimum latency broadcast is no longer equivalent to .nding a broadcast with a minimum number of nodes.

both the simpli.ed and the extended broadcast problem formulation considered in this work are no generalizations of the problems described in [22] and, to the best of our knowledge, an obvious reduction doesn t seem to exist either.


Although further segmentation of intervals possibly improves the tracking precision for the VT-LANDMARC, the increase of the number of the virtual reference tags would potentially impose extra computation burden and deteriorate the system performance on the other side.

an optimum range of the Interval among virtual reference tags is of 0.5m to 2.5m for this arrangement.


2 illustrates the relationship between e, intensity and probe traffic intensity.

when e tends to increase (linearly), then at that time, we can determine an available bandwidth.


Thus, all events with l(111) will be the highest-priority events, then all events labeled as l(110), and after this, the events with l(011) etc.

if an IDS analyst has to decide to investigate a report where only y1 and y2 output an alarm, versus an event where only y2 and y3 output alarms, the higher score of l(110) over l(011) should indicate that investigating the .rst report should take precedence over the second.


However, only the consumer nodes that posses the private key will be able to decrypt the information gathered from de rendezvous node.

a malicious node can retrieve the data for a particular application but it will be unable to decrypt it.


There are at most 99,900/900=111 such buckets out of the 1,000 at each stage.

the probability of passing one stage is at most 11.1%.


This should be the case even if Alice herself is trying to prove the existence of the conversation to such third party!

while in the traditional secure channels setting one is not defending against misbehavior by the (authorized) peer to the communication, in the deniability setting the potential attackers include the authorized (identi.ed and authenticated) peer.


This is an unrealistic assumption in practice because the availability of an authenticated channel implies that Alice and Bob already share a secret key to begin with!

the purpose of generating a common secret key is defeated.


speed, location, time) and contain no personal information.

the most bene.cial attack is the tracing of identities.


As a result, data aggregation is a well researched area in WSNs in contrary to VANETs.

in this section we .rst give an overview over data aggregation in WSNs before presenting related work in vehicular networks.


The result shows that the accuracy tends towards stability when more than 120 reads are collected.

it is reasonable to output a position result after received 120 reads.


Tra.c priority: Today s mesh networks are supposed to provide QoS to the .ows (for example, EDCA [1] is used in the MAC layer for di.erentiated services) by supporting di.erent classes of tra.c.

packets of the .ows have di.erent priorities depending on the tra.c class, and consequently, forwarding time of a packet varies with the tra.c class.


The basic idea is to optimize the transmission power criteria so that each node sends data packets to another some proper distance away that will maximize the network lifetime and achieve a balanced traffic load from the view of the network.

two key issues need to be addressed: 1) Issue 1: how to find the global optimized power criteria in a squared network case and a circular network case?


is max p scheduling rate and at (cp ) is number of active child node of node i s parent node.

scheduling rate of node i will never exceed the maximum allowable rate.


Adding new control requires a careful understanding of the latencies of all the modules in the pipeline.

we use a different solution: data-driven control.


VoIP calls generate small sized packets and so, even with lower data rate, they do not cause any signi.cant increasein end-to-enddelay ofhighdatarate links.

we compare the performance of the .rst and the third case.


Indeed, Lemma 1 indicates that the user s best response must obey Hm(q m)= .¯m, where .¯m = .m.

l (1-pl(ql)) =m we shall henceforth use the latter transformation for the best-response characterization.


Recently, the number of public WiFi APs is rapidly growing to accommodate more users in di.erent areas, and those APs may compete for the limited number of 2.4GHz/5.2GHz channels.

e.cient and global channel utilization policy depending on location is more preferable than relying only on channel adaptation mechanisms of local stations.


BN i+1 analyzes the messages received from BN i indicating v1 as the next node in the chain.

bN i+1 stopsbroadcasting(lines10 13 ofAlg.2).


A social network where users cannot .nd other users is, by nature, not viable.

while names must be visible to all, their automatic extraction must be hindered, as we propose in Section 7.


with highest priority in node B s two-hop neighborhood in a given time slot and let A be the highest 2-hop priority node in node A s two-hop neighborhood.

both A and D could transmit in the time slot because they are Absolute Winners;the Absolute Winner to node B is node D. if B looks at its schedule information for D and .nds out that it is not D s intended receiver for the current slot,it will decide to switch to SL mode.


However, users of Ubicarse cannot be expected to move their devices along precise trajectories.

ubicarse must rely on the device s motion sensors to infer its position and orientation over time.


K>8 ), the second item will be a Gaussian random variable according to the central limit theorem.

on rkp is a Gaussian random variable with the mean of S. , Similarly, the expression of the correlation value when mismatched (called off time ) can be derived as KS (7) off r = hc + nj s j 2 2() () , kp kk k k=1 j=1 off From (7) we can know rkpconsists of two items: the first is MAI , item from all users (including user-k itself) and the second is the noise item.


As a result, DCTCP reduces the 99th percentile of network latency in OLDIs by 29%.

dCTCP frees up more time for computation in OLDIs.


However, the node with second least n value, for convenience called the successor, realizes that the leader has moved out, because the successor fails to receive an ACK message.

the successor, upon receiving a packet drop noti.cation for its AReM sent to the leader, assumes the role of the leader.


In the con.guration generation, the order of the slots is determined so as to minimize the probability of collision with clusters using con.gurations of lower ranks.

in the case of random tra.c, an overloaded cluster (in terms of tra.c) may want to use an additional slot that its neighbors might not use.


The possibility of forming nested mobile networks is not well considered in NEMOBSP.

although several advantages could be achieved by using NEMOBSP, such as reducing handoff overhead and power consuming, it still has several drawbacks.


Since each backbone node is accessed by at most by some constant number of periph v eral nodes, there are at most O( n) peripheral nodes that relays packets to each backbone node.

the throughput rate at each backbone-backbone-backbone link divided by the number of peripheral nodes that relay packets to it is T( v1n ).


While the MFE and RLI estimator (both variants) do not care about the packet sampling rate directly, it affects the set of .ows created; typically, random packet sampling leads to the creation of .ow records for relatively large .ows or elephants .

to make the accuracy comparison consistent (on the same set of .ows), we subject our RLI to the same sampling rate as both trajectory and MFE.


Our ultimate goal is to design an auction scheme that motivates the participation of relay nodes and source nodes in cooperative communications while preventing any agent from rigging its bid or ask to manipulate the market at the same time.

designing an auction scheme with the .rst three properties has the highest priority, even at the cost of sacri.cing the system e.ciency.


But since turning on SACK does not degrade performance, we recommend turning it on whenever possible.

our recommendation based on the experimental and statistical analysis is treatment 1.


This is defined as st(F) = max{0, ~ r i - v} (4) /~F  3.1 Prefetch Only In this section, we shall derive a formula for access improvement when the cache is empty (or its current content can be disregarded).

any access improvement will be solely due to prefetching.


Here, the di.culty is that protocolscanusedi.erentelementsto mark the.eldboundary such as 1) direction .elds, that store information about the location of another target .eld in the message, for examplelength .eldsandpointer .elds,and2) separators, i.e., constant values that mark the boundary of the .eld.


Note that collisions of ACK frames can only happen among links which succeed in the previous DATA transmissions.

the relationship can be represented by the linklink con.ict graph, in which each link is represented by a vertex.


Recall that the distance between the two antennas on a device is .xed, regardless of how the user moves her device.

whenever the user translates her device, the relative position vector of both its antennas remains the same.


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

the topic of selecting an optimal data rate is highly relevant for vehicle safety communications research.


In these cases, even the slightest contention for the use of the resources leads to packet dropping.

congestion zones are neither formed nor spread.


With no loss of generality, we assume that all the signi.cant source of delay is generated at the bottleneck link encountered along the path and consider any constant propagation delay negligible either in the upstream and downstream.

the average delay between user and node i, R(i), R(i)= PDup + PDdown + P/.


Liu, Tsai and Ko [7] described that the network devices could be defined as two different types: Boundary node and Un-boundary node in the ad hoc multicast network.

three different connection types are defined in our proposed scheme.


Accuracies differ signi.cantly for1 and4 training instances, though.

in the following we will use 4 training instances, which seems to be a good compromise between necessary resources and achievable accuracy.


(14) i 1-t i However, to maintain consistency in the model, a minimum bound is introduced: A p * i b p = min(1, p + ) .

(15)i i 1 -t i starvation occurs when pi * = 1in Eq.


The reason why LB is not synchronized is intuitive: every node in GI only hears its left neighbor to decide when to transmit next.

due to the ring topology, two separate paths of delay propagation form and they never intersect.


It can be shown that LVor (si)nAl must be a .nite convex polygon.

the second case can be transformed into the .rst case by introducing dummy nodes into Neig(si).


4.2 Adaptive Multi-Step Prediction If the moving distance is short enough and the one-hop neighbors of each node do not change signi.cantly, the collected information should be complete enough to predict multiple steps ahead.

each node may adjust its prediction steps according to its last moving distance to reduce prediction error and, hence, reduce the energy consumption.


However, a building .oor plan rarely changes.

ray tracing can be processed once and ray information can be stored in advance.


Indeed, abrupt changes in the DNS requests count can be considered as a symptom of such anomalies.

we use the DNS requests count as the main symptomatic signal of the approach.


This situation is indistinguishable from a loss of the response on the server to client path: in both cases, the client receives no response (Figure 4).

a recovery mechanism for response losses also suf.ces to recover from request packet losses, simplifying the protocol.


However, in this condition no modification is permitted to be exerted on the primary system.

cognitive users must suppress the high power interference from the primary base station (PBS) to improve their achieved capacities.


From [4], the capacity of the delivery scheme through v the percolation highway is 1/m.

the overall pernode capacity is v T2-dim(n, b)= f/ n +(1 -f)min{b/n, 1/ log b} (2) The scaling behavior of the per-node capacity depends on the number of base stations relative to the number of nodes.


By comparing (4) and (5), one can see that the optimal solution space of (4) is a subset of the feasible solution space of (5) and W * = W p* .

the critical bid for a buyer (or a seller) in (4) is not smaller (or not larger) than that in (5) since otherwise W * > W p* would hold according to Lemmas 1 and 2.


In particular,suppose we have almost reached our goal of covering U(1-) ·(1-d) nodes; at this point,we have U(1-)-Mt U(1-)d.Since the Ut closely track their means,we only get something like Ut+1/U =(1 -)d ·(1 -exp(-rß ·(Ut/U)).

(4) if Ut/U becomes small,the successive values Ut+i/U can get much smaller,very fast.


Adding the ZCC function, time duration is extended while network congestion occurred.

the network congestion is minimized to reduce the ratio of data loss retransmitting.


Nevertheless, the re21:05 hrs, the link reliability is 95%, which means that on an average 9.5 out of 10 beacon frames were received per second.

we can say that at 21:05 hrs the link between the sniffer and AP2 was reliable and the network was relatively devoid of congestion.


its structure shares many properties with J-Sim s. The basic entity in OMNeT++ is a module.


The contributions from high speed core links even with modest overprovisioning are negligible compared with the contributions due to the access networks.

detailed .ow-level dimensioning is required only for access networks, such as realized by WMNs.


5.1 Simple Scenarios 5.1.1 Trees and Forests Consider trees with single-path underlay routes PSP for ab every pair of nodes a and b.

a tree is loop free, and thus each path PSP is the unique acyclic path from node a to b. ab the all-paths condition is automatically satis.ed, and .G(Ø)=.G(N).


That is, if the message is generated by a node at a frequency messages per second, the node should be able to transmit at least  data per second.

to do that, we need to determine the maximum value of  .We assume that the PHY layer raw data rate is (bits per second) Then the time needed to transmit a message using the base tacit communication scheme is the throughput constraint is  (1) We can see that CtS is a special case when throughput constraint is and its (2) which puts a heavy limit on the data reading frequency allowed in the sensor nodes.


In the extreme case, if two nodes switch to a wider channel on which they are no longer within each other s range, they will disconnect and the subsequent reconnection may require signi.cant time.

sampling all widths is not practical, especially if more widths are available in the future.


According to Corollary 4.1, the exterior links cannot be identi.ed even if all the interior link metrics are known; allowing cycles in the interior graph H provides no additional information regarding the exterior links.

the answer to that question in [19] is that monitoring (simple or non-simple) paths between two monitors is not su.cient to identify all link metrics.


Even a normal certi.cate with an extended DN and a high bit-length public key would exceed the allowed payload of a TCP segment.

neither the certi.cate nor the proxy-certi.cate chain can be integrated into the .rst TCP segment.


However, as long as the distribution of multipath components (MPCs) does not change, time-varying characteristics of the wireless channel due to Doppler spread within a longer duration perform more clearly to the observer.

a larger observation window results in better estimation on the time-varying channel and BEM coe.cients.


In the MMFOP, if for some m, Qm( a) >J *within the feasible region, J *can be increased by decreasing the value of am or increasing the value of an or both, for n m, until it = reaches the maximal value, say J, leading to the contradic tion.


After apacketconsisting of2bytes of preamble, a 4-byte synchronisation word, 2 bytes payload and 2 bytes CRC has been received successfully using 2-FSK modulation at a datarate of 2.4 kBaud, the CC2500 transceiver switchesfrom the receive state(RX state) to the IDLE state.

power consumptiondrops to4.5 mW(at 1.0792s).


Based on Table 1, when RS operates in time-division model, a two-hop link achieve maximal end-to-end rate 11.439Mbps.

if direct transmission between BS and user is larger than 5.719(11.439/2)Mbps, there is no capacity gain when applying two-hop cooperative communication.


High values for the counter would indicate that this domain contains information useful for classifying endpoints.

when the counter for number of IP addresses goes over a threshold (we currently use a threshold of 2), we retrieve the webpage based on the last URL.2 Then, we search the webpage for the keywords from the keyword set and extract the ones which can be found.


However, it is unclear how often such opportunities arise in practice, and whether they can be detected using only local information.

in this section, we run experiments on our 20-node testbed to gauge the throughput increase provided by COPE in an ad hoc network.


From the usage of two different video qualities, we can also comment that there is a maximum of 50 nodes.

the limiting factor is not directly related with the amount of traffic, but with the number of nodes.


Finally, let us de.ne Ci(t) {ci(t)=1} and Ci(t) {ci(t)=0} the primary-secondary collision event and the collision-free event, respectively.


Sensor node activation events occur at random times prescribed by the temporally and spatially correlated statistical processes used to characterize ambient energy sources.


Using the method of Lagrange multiplier, we know that the maximum value is achieved when fi = z ni .This is j=1 nj exactly the renormalization step in our program (lines 19 to 23) shown in Figure 4.

our algorithm is indeed an EM algorithm.


It is easy to see that if we write the previous interference constraint for an interference link e, then only the data links incident on either endpoints can be included.

we have the following interference constraints for the general graph, where this distinction is made clear.


For the same reason, we also prefer to cover new sample packets with the topmost evolving rules.

we go through the RHL and check each evolving rule to see if it can be expanded to match the new sample packet while preserving properties I, II and IV.


This scenario di.ers from the ones traditionally explored in distributed systems research [2] in that monitoring applications are continuous and never .nish.

in such an environment, the principal scheduling mechanism is task migration.


However, they have an impact on the network-level clustering, and thus their presence cannot be neglected;  lane changes do not have any noticeable effect on the network topology: urban scenarios, with roads whose length is in the order of the hundreds of meters, do not leave a lot of chances to perform overtakings, as it would instead happen in highway traf.c.

the way mobility is modeled has a major impact on the topological properties of a vehicular network, and, apart from overtakings, all of the motion features (.ows merging and the car-to-car interaction it is build upon, traf.c light management, multiple lanes) proved to generate unique cluster-and link-level effects, motivating the employment of realistic motion representations instead of approximate ones.


As a user implements the transform() method, he may query other layers using the current location as the key to determine the state of any other layers.

a layer modelling the wireless transmission range of a wi-fi card, may query the layer representing the precipitation using the location of the wi-fi card to retrieve the correct precipitation level at its location.


Thus the total optimal link utilization is 1.

the di.erence between the solution that merely satis.es the necessary conditions and the optimum solution is O(m ' ), which can be unbounded as m increases.


From the results shown in Table 1, the minimum utility value, minm {Qm(a)}, increases and hence the max-min fairness performance improves with J, as expected.

note that the fairness performance measure of V and that of W are di.erent (i.e., V for the worst-link fairness performance while W for the network-wise fairness performance); however, the general trend of both curves agrees with each other, though more .uctuations are observed in the curve of W. both fairness measures match with the max-min fairness performance, as both V and W increase with minm {Qm(a)}, in general.


Clearly, using one queue for every possible concurrent .ow is impossible because the number of concurrent .ows is in the order of millions [14], and this amount of high speed SRAM is infeasible.

some form of .ow aggregation is required.


One objective of WACA is to avoid network communication overhead during the clusterhead election and clustering process.

the election of a clusterhead is based solely on information available locally.


Thus if data are missing from a single edge link we may estimate the corresponding traf.c using measurements of the traf.c between the ER and the backbone.

except in the One major bene.t of adopting the information theoretic approach describe here is that it provides a natural framework for including additional information.


over 34% of sources seen were transition addresses.


The users of future communication systems will likely subscribe to both CS and IP based services.

it is essential that a single database be deployed that copes with user pro.les across both domains.


Whateverbytes are savedin thisfashion contributetohighgoodput andthe small number of cache misses that result(for theinter-client traf.c) canbe easily recovered through retransmissions.

when intraclient redundancy is predominant the redundancy pattern canbedeterminedbypro.ling traf.conthe .y itisbestto turn off model-drivenRE and encode alldata.


For each source node, the number of possible capacities is (Nr +1).

the total number of possible capacities (i.e., objective values) among all the source nodes in the network is O(Ns(Nr +1)).


However, when vehicles from Group 2 enter in the communication range of vehicles in the Group 1 (see Figure 2(b)), such vehicle is recognized as a new neighbor by the vehicles in Group 1.

they check whether they can transmit the data to such vehicle in order to continue with the dissemination process, thus delivering the data even in the presence of network disconnections.


In the case of co.ee leaves, a rehydration period of a few hundred seconds can increase the water content up to 20%.

in a crop monitoring nano-network application it is crucial to identify at which of the dehydration/rehydration stage nano-devices are triggered to transmit their information.


where the last transition holds since .kN = 1 for all k. Next, recall that nonlinear system (30) is locally stable if and only if all eigenvalues of its Jacobian matrix J are within the unit circle [12].

we get the following necessary and su.cient local stability conditions: |a - b| < 1 .


The actual number of modules at one stage is .exible and con.gurable, depending on the computational load a function of the MU-MIMO con.guration and the signal processing algorithms used as well as the processing capability of the hardware running these modules.

the architecture is highly scalable and agnostic to implementation choices.


Previous work on peer-to-peer reputation, however, focuses mainly on the freeloader problem, where some peers do not contribute a fair share of resources.

most previous work relies on peer reputation, rather than ob ject reputation as we advocate.


T v k=argmaxI(X -Xv iv i)v I IvI=1i=1 By a similar argument, computing the k -th principal component is equivalent to .nding the k -th eigenvector of X TX .

in this manner, computing the set of all principal components, {v i}f i=1is equivalent to computing the eigenvectors of X TX .


Table 4: Reduction of fuel consumption vehicles/hour 1800 s 3600 s 5400 s 7200 s 1000 17.67% 27.42% 35.06% 41.28% 2000 17.49% 27.30% 35.01% 41.25% 4000 16.65% 26.65% 34.50% 40.84% 8000 14.55% 24.99% 33.56% 40.08%  These results show that the tra.c congestion does not affect the trip time, CO2 emission and fuel consumption for our proposal, mostly because the alternative routes used by vehicles lead to a smooth tra.c condition.

it decreases idling time, unnecessary stops, and alternating accelerations and braking actions.


Due to the construction of GCr [P], this implies that d(p1,p2)> (max(a,ß)+2)r.Therefore, according to Lemma 1, any parallel transmissions to p1,p2 are non-con.icting.

they can receive the message at the same time slot from any of their respective neighbors in Q.


After getting the value of s2 from the TTP, Bob can recover Alice s signature sA according to the recovery algorithm speci.ed in section 3.2.

in case (b) where Bob is honest but Alice is dishonest, Alice cannot get Bob s signature such that Bob does not obtain her signature.


Similarly, the commonly used two-ray ground radio propagation model ignores e.ects such as RF attenuation due to buildings and other obstacles.

the simulation results are unlikely to re.ect the protocol performance in the real world.


Thus, we can show that a¯r = 0 for all paths r .Ru.

any .xed point x satis.es xr =0 mg or xp =1/rttr2/pr.


Initially, we check cluster c5 but .nd that no single cell can cover it.

we check its two children, u1 and c4.For u1,wecan use a micro-cell to cover it.


that is fast node u (at the expense of v), and one which is fast for v (at the expense of u).

the minimum solution does not exist, and we must instead look for a minimal solution in which no node can improve its dependencies without some other node getting worse.


T4 can also add a hundred milliseconds to the total handoff delay depending on the distance between participants.

t2 and T4 delays need to be shortened to support real-time communication.


= .Ta = .t Ta = psa.Now, for the system to be stable it must be that .< 1.

the .rst constraint is that we cannot oversample at will: ps < a 1 .


Applications of this type include military and civilian networks.

we focus our attention in this paper on obtaining performance bounds for small to moderate-size networks although our results on information complexity apply to general networks.


In the particular case of QMRB-AODV, a low mobility might even be beneficial to overall network performance since node mobility redistributes resources within the network while giving our mobility support mechanisms time to adapt.

if we analyze the results shown in Figure 6 (a) and (b) we observe that QMRB-AODV reduces the number of RREQs on average by 7.92% when compared to AODV when the maximum speed of mobile nodes is 10 m/s.


Otherwise (i.e., if the maximum CTAP duration is not enough for all the requests), the PNC reduces channel time requests to .t them in the CTAP.

there will be no resources for asynchronous tra.c in the channel time allocation period.


Traditional ways to share information between computers, therefore, are not suitable for the unique environments of smartphones.

an object oriented method is proposed in our system prototype Uno.


The duration of T is de.ned as the sum of the duration of the sleep and awake periods.

it is ensured that the sleep-awake transitions do not occur simultaneously, but rather in a ran- Ts dom manner.


The reason why we considered mutation rate so high is that most of mutated trees does not lead to feasible ones.


In this way, all the tags in a group will reply at the same slot, acting as a single tag.

we can count the number of empty slots and use O to estimate the number of distinct categories.


A sensor node is a device usually equipped with a non-rechargeable battery, and it might not be possible or desirable to have physical access to the nodes after deployment.

energy-e.cient algorithms and protocols are 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.


The reason for the low observed entropy is that during a torrent startup, available pieces are replicated with an exponential capacity of service [26], but rare pieces are served by the initial seed at a constant rate.

available pieces are all pieces may not be interested in the local peer.


run taxi assignment algorithm; A. create new model description; B. obtain a numerical solution for the model; C. create an assignment matrix; iv.

assign taxis to mobile users; v. assign routes to each taxi;  8. end while 9. generate taxi movement; 10. create output .le; 11. end simulation  each new request is stored until the next time window is reached.


Under the same power allocations and channel conditions, it is interesting to investigate the necessary conditions that the expected distortion function, E[d], of a system with the proposed cross-layer framework can always achieve a lower distortion than a system without any protection (i.e., k1 = n and k2 = n).

a lemma is derived as follows to show that .E[ > 0 and .E[ > 0 are the necessary conditions.


Deployment threshold .. Ourupdaterule(3) is such that ISPs change their actions if they can increases utility by at least ..

to gain insight into how di.cult it is to convince ISPs to deploy S*BGP, we assume that each ISP uses the same threshold ., and sweep through di.erent values of .


Finally, the cost of error free routing, CRs is determined by the route length EL and the cost of successful link transmission, CLS: CRs = ELCLs.

we have: C a = qZ(CLs + CLF) + ELCLs, and using Lemma 6 and Lemma 5 the result is straightforward.


Note that the service di.erentiation is implemented in the MAC layer while the data rate selection is implemented in physical layer.

the motivation of this paper is to develop a new framework of dynamic RCA strategy for WLANs with multimedia tra.c support by integrating the power control and rate adaptation mechanisms in physical layer with the service di.erentiation schemes in MAC layer.


We report this kind of problem just for the sake of completeness, as in this case we are not experiencing one-way media .ows since RTP packets .ow in both directions.


XX minimizedG(i,j)*Bj*xij+M*ze(1) i2Vj2Pe2E subjecttothefollowingconstraints X 8j2P:xij?1 i2V 8i2V,j2P:yi;xij?0 XX ^^ 8VcV,v26V,j2P:ze;xij?0 ^^ e2S(V)i2V xij,yi,ze2f0,1g ThefrsttwoconstraintsstatethateachVPNendpointj mustbeassignedtoatleastonenodeinS.ThethirdconstraintensuresthatnodesinSareconnectedbyaSteiner tree.ItachievesthisbyrequiringthatifaVPNendpoint jisassignedtoanodei(causingnodeitobelongtoS), theniisconnectedtovbySteinertreeedges.Theobjective functionthatweminimizeisthecostofthesetofnodesS.


Furthermore, if nodes are added or removed, the system self-adjusts to reequalize the event intervals.

desync implements a self-maintaining desynchronization primitive.


average localization accuracy of MaLoc is 2.8m which is also ning MaLoc is about 220mA.

we conclude that MaLmuch better than Wi-Fi .ngerprinting.


De.nition 1 (support of pattern X in W): The support of a pattern X in a W, denoted as SupW(X) is the number of epochs in W that contain X.

a pattern is called frequent in W if its support is no less than the minimum support threshold min sup, d, with 0 = d = |W |given by the user.


We would like to increase the slope of the curve (i.e., proportional to m) as much as possible without signi.cantly increasing the collision percentage, choosing the highest slope point on the .at portion, to reduce alerts for far away events.

we choose m =0.016 for the linear and m =0.032 for the cumulative approach.


=1200, this maximum point is found to be around (PTX =0.2, Preserve =0.8).

for processing the highest amount of traf.c and achieving the maximum throughput, one has to rely on a high probability of reserving receivers in the ACK transmission phase and on a low probability that an idle node decides to initiate a transmission.


As VMs of a tenant which are consolidated in a server of Incubator run similar services, they are managed as a chunk.

although the number of VMs consolidated in a server is at least larger than one, only one tra.c information can be obtained.


The OFST mechanism can find the sensor node closer to the share point when the number of sensor is increased.

the OFST outperforms the other mechanisms in terms of the total length.


Assume, each window W, contains a number of equal-size non-overlapping epoch batches.

if there are M epochs and N batches in a W, then each batch consists M/N epochs, hence, the size of each is |M/N |.


Therefore, every path Pab on graph G ' is also in the set of paths P(V).

p(V)= PG ' , and the all-paths condition is satis.ed.


If the size of a region for a POI is large, a data item which related to the region might be di.erent from what the driver has requested to the POI.

the size of regions for POIs should not be large.