By doing so, we extend and validate the analysis of [7] that characterized the content age in terms of the social network s edge expansion.

in this paper we show that, instead of focusing on the content age, one can compare di.erent strategies for limiting the bandwidth usage by investigating their e.ect in the edge expansion.


Thus, the question is how far can we get if we simply .x the one place Epidemic Routing is weak in when it is forced to drop packets due to storage or bandwidth considerations.

if we can determine which of the copies of a packet in various nodes in the network are more droppable than others, we can signi.cantly reduce the burden on resources without compromising too much on delivery.


Correspondingly, the probability of successful decoding of ni is equivalent to the probability that Ui = 0.

axi .d -.ei Ei P (Ui = 0) = FEi (axi)=L e. (4) (d)!


Let us introduce two new variables Sdist and D R which are respectively one less than Stability ratioR and dist MERIT ratioR.

r = Stability ratioR 1 (4) Sdist D R = MERIT ratioR 1 (5) dist In a two-dimensional plot of Stability ratio Vs.


RANDOMIZED DEFICIT ROUND ROBIN The standard DRR scheduler [10] assigns a quantum to each queue in proportion to the service rate guaranteed for that queue.

if a .ow is assigned a quantum Q, a .ow that has been assigned twice the bandwidth is assigned a quantum of 2Q.


The signi.cant increase in AAAA queries re.ects wide adoption of IPv6 capable operating systems and browsers which issue AAAA queries along with A queries for requested names, as well as IPv6 capable resolvers which also issue AAAA queries for seen NS names by default.

the top 3 domains that are looked up by AAAA queries are akamai.net, amazonaws.com and akadns.net.


With this sudden growth there has been concern in the research community about how well BGP is scaling.

it has been noted that there is signi.cant growth in the volume of BGP route announcements (or route .apping) [9] and in the number of BGP route entries in the routers of various ASes [8].


Finally, YPi has expected value E(YPi )= P(YPi = 1), equal to the fraction of snapshots during which Pi is congested.

if, during the experiment, we observe that Pi is congested during half of the snapshots, we model this by saying that P(YPi =1) =0.5.


Another possible answer to our question, and one that we confront in this paper, is that there is no known solution that provides enough functionality to justify a standard approach to all P2P connectivity establishment.

there is a widespread perception that it is impossible in the vast majority of cases to establish direct TCP connections through NAT, and that there are too many cases where even UDP cannot be established through NAT because of the dif.culty of knowing what port number the NAT box will assign.


In this paper, we consider discovery of competitive physical resources in a vehicular ad-hoc network (VANET).

we examine a peer-to-peer broadcast (PPB) paradigm, in which each vehicle periodically broadcasts the M most relevant reports it carries to neighboring vehicles.


The smaller period also does not contain some of the channels of the larger periods.

the channel mapping algorithm must have logic relations in grids with di.erent sizes.


Such effect depends on the relative position of the FTP flows within the grid.

fTP 1 experiences less contention than FTP 2 and FTP 3 due to its FT P 4 FTP5 FTP6  FTP3 FTP2 FTP1 Figure 19: Grid topology  400 350 300  more goodput than FTP 3 and FTP 4, respectively.


In addition to its agricultural impact, a (CPS)2 can also signi.cantly reduce the losses in such scenarios by generating warnings and alerts to the farmer in case of problems.

emergence maintenance of the CP structure and errors in the irrigation plan can be promptly addressed without any delay.


and (in the adversarial model) the window size w. The other properties depend on the algorithm the protocol was derived from.

the amount of feedback the protocol needs is identical to the one of the static algorithm.


However, the edge expansion is closely related to the graph s spectral gap, which can be computed in polynomial time.

let L =[li,j]i,j.V , where 1, if i = jlij =qij v o.w.


e is the complex number: 2rn ´` ´` n H1, 2 +1 =2m ´ ` 2p 2p P rrn For 1 = k = n, de.ne a number: n-2 j=1 E = cos + i sin 2pj(k-1) 1 - 1 nn k=2 cos 2 X k=0 1 - 1 2 k-1(n-1)(k-1) .k = a1 + a2E+ ··· + anE(4) =  P rrn T n-2 j=1 2pj(2k+1) cosand a column vector: 1 Ek-1 E2(k-1) E(n-1)(k-1) 1, , , ..., ` X 2 4r n = p(2k+1)(2r+1) v (5) vk = ´ sin `´ k=0 (2r + 1) - n By substitution, we obtain: p(2k+1) sin n 0 BBBBB@ a1 a2 ... an-1 an an a1 ... an-2 an-1 .. .. .


Next, we show that small sub-intervals do not have high densities.

we will show that w.h.p., no small sub-interval has more than O(ln 2 n~ lng) nodes.


Our new asymmetric model is based on the observation that the level of asymmetry is closely related to RTT variations.

for the case that one wants to get one-way delays from the active measurements, one can also estimate the level of accuracy of the resultant one-way delays using knowledge of the RTT values measured.


The .gure also presents the 3GPP interfaces that are more relevant for this paper.

the communication between the core and the NoS is done through the S1-MME (control) and S1-U (data) interfaces.


If no collision among SSs occurs, the reporting packet is successfully transmitted.

no channel error in the dedicated control channel exists.


In Section 5, we develop IFA and evaluate its perfor .

the targeted service granularity is per-customer (residence, hot spot, etc.)


Hence, a prerequisite for dependability of a PN is continuous connectivity of its nodes.

there always must be a communication path between nodes of a speci.c PN.


Second, if it is indeed heavily used, should it be implemented on top of an on-demand content delivery service or provided as a native feature of a more general information-centric network service?

is publish/subscribe event noti.cation di.erent enough from on-demand content delivery that its implementation should be based on specialized networklevel primitives?


As P 2h =2k - 1, 0=h<k summing newly reached peers across these m + 1 rounds yields that eachunit c t reaches the wholepopulationin m+1 rounds.

the whole peer set is covered at the end of round t+m, as20 +20 +21 +··· +2m-1 =20 +2m -1 =2m .


In the case of changing communication place (move), the system encourages the user to move to a location which has spare capacity and is not far from the place where the user is.

the system encourages the user to move to the sector with the maximum value of "amount of spare resource divided by the distance".


In all our experiments we maintain that Prx is equal to 2.5Ptx (since the receiver has more circuitry than transmitter).

whenever Ptx is modified, Prx is also modified accordingly to satisfy Prx=2.5Ptx.


Uncontrollable Probing (UP): P is the set of paths between monitors determined by the routing protocol used by the network, not controllable by the monitors.

although CAP allows probes to traverse each node/link an arbitrary number of times, it su.ces for probes to traverse each link at most once in either direction for the sake of localizing node failures.


However,theseprotocols are guaranteed to work only if the models assumptions are ful.lled, which is hardly the case in practice.

the UDG model assumes isotropic propagation of the radio signal with distance, which is unlikely to happen in the real world due to phenomena such as scattering, re.ection, and di.raction of the radio signal.


..{send} I As earlier, a fairness constraint is needed to restrict the behavior of the intruder.

the intruder has to be fair when it comes to send actions and to sending messages (stored in set Y ) that it received earlier but did not yet deliver to their intended recipient (see section 3).


The observed di.erences between the physical and network-layer maps suggest opportunities for using one to reinforce the other.

networks observed in Ark that do not appear in Atlas o.er clues for searching for new maps to expand Atlas.


The average roundtrip time in the experimental network is smaller than that in the simulation.

there are fewer packets staying at the access point bu.er.


In order to model the AKE-security of the end-to-end key KM,H we .rst specify the auxiliary notion of e2e-freshness for the instances of M and H, which de.nes the conditions under which A can be treated as an outsider with respect to the test session for which it has to distinguish KM,H.

these conditions prevent active participation of A on behalf of either M or H by restricting A from respective corruptions, and capture known-key attacks allowing A to reveal end-to-end keys computed in sessions that are different from the test session.


Blacklisting: no packets with header h=0 traverse link (s2, s3).

(h = 0) -> AG (switch = s2 -> ~(EX switch = s3)) if a packet header matches h=0, then on all paths where the packet reaches switch s2, it will not reach switch s3 on the next hop i.e.


These games are a special case of congestion games that have been studied in the economics literature.

pure strategy Nash equilibria for this set of games exist.


The buffers are located between the mac layer and the forward engine.

a packet is stored in a queue after the next hop IP and mac address is retrieved from the routing table and ARP table.


These .elds are tightly coupled to the Dest MRIP and Source MRIP .elds respectively.

the realm number in the Global Dest Realm .eld is always the realm number assigned by the frontdoor de.ned by the Dest MRIP .eld.


It is important to note that, although our model allows for monetary transfers, in every resulting agreement between major players no monetary transaction is performed.

our model predicts that the major players clique will form a settlementfree interconnection subgraph, while in major player -minor player contracts transactions will occur, and they will be of a transit contract type.


Despite decades of power and rate control research, few systems exist that jointly adapt transmit power and rate for WLANs on a per-link basis (partly due to the lack of hardware support for .ne-grained power control until recently [36, 48]).

while rate control is performed onaper-link basis, current solutions either use static or coarsely dynamic transmitpower con.gurations onaper-AP or per-cell basis[2,31].These approachesforegoper-link power control s bene.ts in a mobile environment.


We select the two IP addresses from the beginning and the middle of the block.

for a block with address Q and mask length N, we select IP addresses Q +1 and 32-N-1 Q +2+1 (e.g., 8.0.0.1 and 8.64.0.1).


We now consider balancing the energy consumption across all the rings.

we require that e=efor i+1 i i=1, 2, L, K-1 .


Quantifying Maximal Loss of Anonymity in Protocols Han Chen Queen Mary University of London School of Electronic Engineering and Computer Science hanchen@dcs.qmul.ac.uk ABSTRACT There is a natural intuitive match between anonymity and information theory.

the maximal anonymity loss in anonymity protocols can be matched to the information theoretical notion of channel capacity.


From equation 1, the only way to reach such objective is to change the number Nk of tasks that i,j node ni executes during time slot k. Of course, the goal is not to decrease Nk for each node (which is suitable from i,j thepoint of view of each node),buttobalancetasks among nodes in function of their available energy.


Therefore, when , becomes the same value independent of the value of  .

the best storage load balancing would be obtained when .


The complete characterizations are produced automatically by the Scyther tool.

using the graphical user interface of Scyther, the characterization graphs can be reproduced by simply loading the .le ns3.spdl (shown in the left of Figure 3) and pressing the Characterize roles button found in the Verify menu.


This example illustrates our emulator s ability to directly control channel conditions without the need to worry about the physical environment.

in this experiment there is no physical environment, just a manually speci.ed signal propagation environment.


5 suggests, boosting the transmission power shifts the neutrality-curve to the right.

for a .xed cell size, more relays are required to have OR = T OT when P is higher.


It should be noted that this accumulation of di.culty is based on a very important condition: attackers e.ort on compromising one node cannot save their e.orts on compromising another node.

if an attacker has spent 10 hours getting the secrets from one node, he/she might have to spend another 10 hours to do the same thing for another node.


described in §6.11 These experiments were conducted both in lineof-sight (LOS) and non-line-of-sight (NLOS) settings during peak library hours with pedestrian foot traf.c.

we classify locations as non-line-of-sight (NLOS) only when the predominant (highest power) peak in the multipath pro.le is not the direct path to at least one neighboring AP.


Thus, system administrators must deal with namic bandwidth allocation technique.

we argue that such a technique should (i) provide control over the time-scale of *This research was supported in part by a NSF Career award CCR  allocation and over the allocation itself, (ii) provide stable behavior 9984030, NSF grants AN1 9977635, CDA-9502639, EIA-0080119, Intel, IBM, EMC, Sprint, and the University of Massachusetts.


We concentrate on practical issues that are of current interest within the research community.

we are concerned with the use of ILNP across existing network infrastructure.


If these transmissions are o.set, as in an asynchronous setting, then necessarily the second hears the .rst and thereby has received information.

the second node knows that i) the transmitting node has received the message, and ii) all of their mutual neighbors have now received the message.


geometry can be extracted from maps of real world or generated randomly.


by both the active user community and professional developers, there remain far more challenges associated with mobile applications compared to their desktop counterparts.

application developers are usually unaware of cellular speci.c characteristics that incur potentially complex interaction with the application behavior.


This property trivializes the analysis of detecting miscon.gurations for link-state protocols.

in fact, we have that G ' =G.imagine if node i were to enumerate the set of possible network graphs which, after correctly running the link-state protocol would produce its state Si.


One way to understand this result is to link this problem to the well known birthday paradox.

the probability of having at least two persons share the same birthday out of a few dozens people is surprisingly high.


INTRODUCTION To provide high throughput and high quality of services in outdoor environment, the IEEE 802.16 wireless metropolitan area network (WMAN) has been standardized for fixed broadband wireless access system [1][2].

it defines a common Medium Access Control (MAC) protocol over several physical layer specifications and is designed to cover wide geographical areas.


By introducing the mechanism of key splitting, these operations need to be adapted accordingly.

these operations are now split between HN and FN using distributed decryption or distributed signature generation.


Inductive step: Now suppose that Theorem 2 is valid for some Using the above definitions and the Markovian model in Fig.

2, value of t= (m-1)..t. for t= (m-1)..t, the average we write down an iterative equation for pq( mk)( k 2) , as: ,...1... ....1 .... ..... ... ....... ........ .


(1) Pi is a subsequence of S, (2) the concatenation of P1 through Pm yields S and (3) no two nodes in each partition Pi(1 = i = m), con.ict with each other.


; that relation is called simulatability) if for each possible H and A there exists an adversary S, such that the view of H in the con.guration with Str and A is computationally indistinguishable [23] from its view in the con.guration with Str .

and S. anything that can happen to H using the functionality provided by Str can also happen to it if it uses the functionality of Str .


A simple variant of Algorithm 2 can be used to solve strong validity consensus in O(log|V |) rounds with a collision detector in AC.

unrestricted message loss poses a problem only for the prepare phase of Algorithm 2.


The iSCSI Extensions for RDMA (iSER) protocol is borne out of a desire to take advantage of this convergence.

the iSER protocol design is motivated by the following D To have the generic data movement needs of iSCSI be met with the iWARP protocol suite so that the advances in the RDMA technology can continue to naturally improve iSCSI in most efficiently delivering data.


Some existing schemes trade o. some entropy in the tags for easy path reconstruction; but they underperform in effectiveness.

we will show that the use of hop count to indicate distance from markers to the victim results in lower entropy than uniformly random bits.


6.1 Accurate Reporting of Loss Episodes byProbes An important component of our probe process is dealing with instances where individual probes (where a probe consists of a series of Npackets) do not report loss accurately.

ideally, a given probe Pi should report the following: 0: if a loss episode is not encountered Pi = 1: if a loss episode is encountered It should be noted that this requirement is only for a probe, not necessarily the individualpackets withina probe.


which the standard VA decoder is used, with the di.erence being the soft information being fed to the the VA decoder as input.

our scheme extracts soft information on the XOR bits.


But once multiple related packet transmissions are introduced, we now need to consider some sort of reliable delivery of consumer-supplied information.

the client must re-transmit its Interests in the absence of any timely response or acknowledgement that they have been delivered.


1 The actual gossiping strategy is then encapsulated in the gossip() function, more precisely in function f(x), which encapsulates the distribution function.

the structure of Algorithm 1 is used for both the traditional gossiping protocol, where f(x) returns a constant transmission range, and our power-law gossiping protocol, where f(x) returns a transmission range following the power-law distribution pictured in Fig.


VOIP PROTOCOLS VoIP protocols fall into two general categories: centralized and distributed [1].

the distributed architecture of VoIP networks is associated mainly with H.323, SIP and IAX recently.


what aspects of these algorithms are responsible for their remaining TCPcompatible under dynamic conditions?


there has been a focus on leveraging existing infrastructure (e.g.,WiFi access points) to enable indoor localization, the advantage being that the cost of deploying a specialized infrastructure for localization is avoided.


Based on these insights, we design a new circumvention framework for web browsing, which uses asymmetric communication with separate upstream/downstream channels.

a user who requires circumvention service .rst starts or pretends to start a legitimate communication session (e.g., a VoIP call) with a dummy host residing outside the censor s network, and the proxy (called spoofer) injects censored data into the downstream .ow towards the user by spoo.ng the dummy host s IP, so that the censor believes the user is legitimately communicating with the dummy host only.


This stage yielded a survey that served as the theoretical framework for the analysis of vulnerability scan services; it also provided a basis for the second stage, which involved the design and development of a system that addresses the weaknesses in currently available scan services.

it addressed the problem of lack of transparency in existing vulnerability scan services, and the necessity of user initiative to start the monitoring service.


To compare the performance of the PBTA algorithm to the standard shortest path algorithm, we ran the simulations after setting the maximum queue size at each network node to in.nity.

the queues at each node were allowed to grow without bounds.


In our LiT MAC implementation [12], we have a TDMA frame of 60 ms and currently we use this frame length as the repeating pattern for the TDMA schedule.

the time slot and channel allocation repeats across the 60 ms frames and a handset and a gateway is allocated slots every 60 ms. Now, before encoding,we sample60msofvoiceat8khzfrequency (480 samples per 60 ms, 1 byte each).


All the derived models and the implementation of SIMULWATCH have been validated using real traces collected from a large nationwide IPTVprovider in the United States.

we demonstrate thatwhile not explicitly modeled, the estimation of unicast and multicast traf.c demand based on SIMULWATCH trace closely matchestheactualvaluesfromtherealtrace.


For this reason, we expect that the overhead in energy consumption of the coresec_driver is dominated by the transmission of additional security-related data.

the transmission of the additional broadcast frames in EBEAP will be energy consuming.


Second, we show that the two complementary performance measures are dependent on the properties of the underlying AS graph.

we show that the power-law structure of Internet AS topology leads to connectivity properties which are crucial in facilitating the observed performance effects.


Thus, in an average case, where the topology is evenly distributed over the region A, the number of zones in area A in which update packets could migrate between nodes simultaneously, without mutual interference, equals (A / ( pR2 )).

now since the nodes are evenly distributed, the number of nodes (and consequently the number of update packets P) confined in a zone will be 2 N N (pR ) P = = A 2 A (pR ) P number of update packets has to migrate from one node to another sequentially.


One of the challenges of deniability in the digital world is that deniability is at odds, at least without careful design, with remote authentication.

alice needs to be able to get a digital proof that she is talking to Bob but that proof should not leave any trace that will convince a third party that Bob talked (or said something speci.c) to Alice.


In this case OD-DOG will exactly simulate the of.ine greedy algorithm run on each round.

if we let G(f) be the result of running the of.ine greedy algorithm on the problem arg max {f(S): S .


In this paper, we revisit the issue of whether multicast re-lated functionality should be implemented at the IP layer or at the end systems.

we consider a model in which muiticast related features, such as group membership, multicast routing and packet duplication, are implemented at end systems, assuming only unicast IP service.


Second, * Wi , 0 the geometric sum 1- (1- qi ) (Wi,0 qi * ) describes the probability of not receiving any packets in the transmission queue while performing the complete empty-queue post-backoff.

this expresses the probability of finally ending in the Li +1 1- pi state (i,0,0, e) , instead of transitioning to any of the regular post .


On the Scalability and Capacity of Wireless Networks with Omnidirectional Antennas  Onur Arpacioglu and Zygmunt J. Haas School of Electrical and Computer Engineering Cornell University Ithaca, NY 14853, USA o.arpacioglu@cornell.edu, haas@ece.cornell.edu http://wnl.ece.cornell.edu  ABSTRACT* We consider a wireless network of N nodes equipped with omnidirectional antennas, and we extend the capacity results of some previous works by finding bounds on the maximum achievable per-node end-to-end throughput, .e, while using a general network model and a bounded propagation model.

we show that when the network domain has a fixed area, .e is T(1/N) even when the mobility pattern of the nodes, the temporal variation of transmission powers, the source-destination pairs, and the possibly multi-path routes between them are optimally chosen.


Note that the open nature of wireless channels couples the address privacy of MANET principals tightly with their location privacy.

if knowing the address of a target principal, attackers can locate him by overhearing and analyzing radio messages, thus breaching his location privacy.


Note that (6) to (8) imply that a path is feasible if and only if all its sub-paths are feasible.

the routing protocol will discard a candidate partial path if it fails in the feasibility test (since it leads to an infeasible path ultimately).


The idea is to compute the RTT estimate by taking the weighted median of the last K estimates and last J observations.

[] KJ r[n]=WM r[n -k]|k=1, r[n -j]|j=1, W, (4) where W is the weight vector.


Please also note that our scheme only requires that base stations are sparsely deployed along the roadside.

most sections of the road are not covered within the signal range of base stations.


Thus, the set of simultaneously active links form a matching in the graph G.Let .

(G)denote the set of all feasible matchings (not necessarily maximal) in the graph G. let p =[pij , (i, j) .


Our power-aware scheduler presented in the following section makes use of a function to measure the energy consumption of each admitted message.

let PCi be the energy consumption of message mi.


Again, we make the assumption that the conditioning on neighbours to be negligible: if v is a neighbour of u, we assume the edges of v are independent of those of u.

given a node u pointing to a neighbour v, we can consider the edges out-going a random node x instead of the ones out-going v. Note: in the model, when pulling, an element is updated by selecting some element from the array and copying its value.


Various primary systems should use the band compatibly.

primary systems operating in the same unlicensed band shall coexist with each other while considering that the interference to each other.


P (s|l) is the probability of the sni.ers to receive s from a tx located at l. P (l) is the probability a priori of .nding a tx in the position l.It provides an easy manner to incorporate to the location system, background information about mobility pattern and tracking.

it is possible to suppose that a wireless device is more likely to be found next to tables and inside o.ces than inside bathrooms.


NACK originating from FIN node y1:If node x had previously observed at the MAC layer that node y1 correctly forwarded packet p,thennode x assumes that node y2 failed to forward the packet correctly.

the FIN property of y1 implies that xcan monitor the forwarding behavior of y1 at the MAC layer and this allows it to narrow the fault to y2.


In order to evaluate the performance the management solution, we analyze the impact of management functions over the network and also its e.ectiveness in detecting failures.

we analyze the fault management aspect for this kind of network supposing di.erent scenarios.


The ef.ciency gain comes at the price of relaxed accuracy guarantees.

the presented methods yield approximations of lower & upper bounds, instead of approximation of the actual number of distinct elements.


Therefore, pipe i corresponds to the provider on which the i-th upload completes, starting from the point in time when the request is issued at the seeker.


In this paper, we propose a .ne-grained batch authentication scheme, INformative Counting (INC), which provides a scalable and reliable batch authentication solution for largescale RFID system.

we geometrically divide the tag set and construct its Authentication Synopsis (AS).


The methods we use are very general and experiments with a variety of robot localization applications have proven the approach very adaptable.

the framework can be used with other sensors.


Solution methodology: Corresponding to the goals, we (i)useasmall numberofhashfunctions,(ii)braid thecounters,and(iii) usealinear-complexity message-passing algorithm to reconstruct .ow sizes.

by using a small number of hash functions, we eliminate the need for storing a .ow-to-counter association rule.


This particular overhearing differs from the classical one in the sense that silence is considered suspicious only in the presence of a node which has showed recent regular activity.

a node which shows no recent activity is not blamed when one does not overhear its forwarding.


First, we argue that from a practical viewpoint, Epidemic Routing2 [18] is essentially unbeatable in terms of delivery ratio when the load relative to resources (bandwidth and storage) is low, or when the network is very sparse (highly disconnected).

it is only when the relative load is high in stable networks that Epidemic underperforms both MANET protocols and sophisticated disruption tolerant protocols that intelligently route using a single copy.


these cameras to produce 3D pointclouds, or relative 3D positions, for imaged objects [29].

these vision toolkits use multiple snapshots taken of a single scene from different vantage points in order to reconstruct the 3D positions of objects in the image as a point cloud.


In addition, none of the aforementioned studies considers the run-time adaptation on both computation and communication mechanisms as a means of achieving high performance and energy e.ciency.

there is no existing work which has an overall consideration of an e.cient run-time adaptive sensor node based on a practical platform and applications.


Although di.erent bots may communicate with di.erent peers, we show that for P2P botnets with an unstructured topology, where bots randomly pick peers to communicate with, there is a surprisingly high probability that any given pair of P2P bots communicate with at least one common external bot during a given time window.

there is a signi.cant probability a pair of bots within a network have a mutual contact.


4, this can be partially compensated by the bene.ts of the aggregation state.

an aggregation con.guration can be reached both from a start-up con.guration and from a speed-up con.guration.


As previously discussed, for a server to simulate game state in a fair manner it must wait until all the action data from all the clients in the session to arrive.

a server sj must wait for maxi.C Du(i, j) before game simulation.


Longterm Internet evolution: Some other studies have looked at global properties of the AS-level Internet over multi-year timescales.

[13] explores a dataset composed of AS paths collected from 2005 to 2009, in order to show that the Internet is .attening.


In the absence of speci.c constraints, the entropy is maximum for a source whose symbols are equiprobable.

the more redundant the source is, the less it contains information.


The sensingoverhead of a sensing algorithm is de.ned as the fraction of time in which sensing is performed.

tI sensing-overhead = TP for periodic sensing.


Tequal : A routing event is classi.ed as Tequal if its pstart= e, pend= e and pref (pend)= pref (pstart).

a reachable destination has changed the path by the end of the event, but the starting and 1e+07 ending paths have the same preference.


Taking advantage of this, we can make the OBU inform the old RSU about its intention to handover before breaking its connection with the old RSU, such that the rest of data destined to the OBU can be forwarded by the old RSU and proactively cached by the new RSU even before the OBU receives a WSA message from the new RSU in order to mitigate frame losses.

it is possible to use a proactive scheme in the handover procedure of the IEEE 802.11p-based networks rather than a reactive scheme as in the IEEE 802.11 networks.


We combine techniques for community detection in dynamicgraphs[9,26] to identifyclustersof nodes that meet morefrequentlyandforlongerperiodsoftime,that wename temporal communities.

we identify temporal communities that appear multiple times during an experiment.


To overcome the non-current location problem, we perform a de-noising processing of the extracted geotags.

we extract geotags from a keyword-based regular expression matching process as the .rst step of identifying user location reports.


In addition, the target infrastructure consists of dual channels, and slots are synchronized across the channels.

two channels simultaneously start their slots in phase[8].


Unfortunately, practical considerations such as mobility, bandwidth and energy constraints, .rewalls and Network Address Translators (NATs) pose interesting challenges in the realization of this ideal vision.


The non-progressive algorithm is implemented by simply removing the progressive feature from SPIHT.

the non-progressive SPIHT encoder .rst estimates how much bandwidth is highly likely to be available until the deadline of the stream, and would compresses data to that size before transmission.


In a dynamic computational environment, the congestion experienced by the foreground application will vary over time.


Impacto Relativo da Posic¸ ao dos Clientes no Desempenho de Sistemas de VoD Baseados em APs Co-localizados Leonardo Bidese de Pinho Claudio Luis de Amorim leopinho@cos.ufrj.br amorim@cos.ufrj.br Laborat ´orio de Computac ¸ao Paralela Programa de Engenharia de Sistemas e Computac¸ ao COPPE -Universidade Federal do Rio de Janeiro Caixa Postal 68511 21941-972 Rio de Janeiro -RJ -Brasil ABSTRACT This paper investigates the impact of clients position in scalable wireless VoD systems, based on collocated access points.

it evaluates the use of several transmission modes provided by the 802.11a standard, aiming to service di.erent area sizes, using the CINAPS (Cluster of Inexpensive Access Points) system, which was extended with a novel distance-aware association control heuristic.


As a consequence, a backbone router needs to have a routing entry for each anycast address.

route aggregation cannot be done for anycast addresses since di.erent anycast addresses share the same network pre.x may have di.erent next hop at each backbone router.


Otherwise, it should just delete the message and ignore it.

the CMs play only the role of an intermediate node for other CMs.


(Slot Allocation Problem) Given a set of voice connections, M = {Mi = (1,Di) | 1 : i : n}, allocate the slots in such a way that each connection Mi is guaranteed to transmit each of its messages before the message deadline Di.

if a message of Mi arrives at time t, enough slots must be allocated for Mi during time interval [t, t + Di) for the timely transmission of the message.


We denote bij for the benefit that peer i receives from peer j contribution.

bij is measuring how much the contribution made by peer j is worth to peer i.


Then, to &OXVWHU &OXVWHU  7LPH 7LPH D ,Q FDVH RI WZR FOXVWHUV RYHUODSSLQJ &OXVWHU 3DXVH &OXVWHU 8S&+8S&+ 'Z&+'Z&+ 8S&+ 'Z&+ 8S&+ 'Z&+ &OXVWHU SHULRG  7LPH 7LPH E ,Q FDVH RI WKUHH FOXVWHUV RYHUODSSLQJ Figure 3: A crossing-synchronous up/down transmission scheduling with di.erent frequencies in contiguous clusters avoid collisions in any overlapping area, contiguous clusters schedule the UpCH and DwCH in a synchronous manner, such that they cross each other, as shown in Figure 3.

the same frequency channel is never used at the same time in contiguous clusters.


The transmis- sion of packet data over 3G cellular systems requires new algorithms and protocols.

the issues of re- source allocation and quality of service (QoS) management for wireless packet data on CDMA are both interesting and important.


However, real experiments conducted over production networks (e.g., GPRS, CDMA2000) indicate that such links are currently plagued with several problems such as high and variable round trip times, patterns of burst packet loss, frequent link outages, and signi.cantly lower bandwidths than originally claimed [11],[15].

it seems that there is currently no wireless technology in the wide-area, that can o.er the level of reliability desired.


We use the .rst 15 days of the logs to calculate the attributes for each STB.

we use the data in these days as the training set.


To measure the frequency of triangle inequality violations, we ask how many two-hop paths are shorter than the corresponding one-hop path.

for all combinations of i, j, k, we count how many times d(i, k)+ d(k, j) <d(i, j).


While these heavy-tailed distributions may contribute to self-similarity, we will illustrate that TCP itself is the primary source of self-similarity and that this behavior may have dire consequences in computational grids as WAN speeds increase into the gigabit-per-second (Gb/s) range.

we show that even when application traf.c is rigged to produce a Hurst parameter H of 0.5, TCP adversely modulates this application traf.c and produces H =1.0(i.e., self-similar traf.c).


Contribution of the paper The .rst contribution of this paper, is the clear identi.cation of the main techniques characterising DTN routing protocols in order to better understand and classify the solutions proposed in the literature.

we consider forwarding, replication and queue management as the main techniques for DTN protocols and we show how each protocol can be classi.ed according to the techniques it adopts.


|C||N | Theorem 1 shows that an ISP s Shapley value is inversely proportional to the number of ISPs of the same type, and proportional to the number of ISPs of the opposite type.

the aggregate Shapley value revenue of both types of ISPs are inverse proportional to the number of ISPs of each type, i.e.


/24 /27 /28 /29 /30 /31 Ø n/o /24 2 1 1 /25 1 1 /27 2 2 /28 18 4 5 4 4 1 /29 25 8 9 1 4 3 /30 86 4 1 67 7 7 /31 16 2 13 1  Table 1: Comparison of genuine and inferred Inter-Figure 4: Sample network net2 subnets 12 subnets smaller than they were due to the lack of other IP addresses.

all observed IP addresses of those subnets were accurately clustered but they formed smaller /x subnets, i.e., longer same x bit pre.xes, than the actual.


However, if the packet is destined for a VM co-located on the same machine, then the packet has to be copied (via DMA) back to the main memory on the host side of the I/O bus.

every internal packet is forced to traverse the I/O bus twice, before and after the packetis switchedinhardware.


design than with the current, at times con.icting, claims about the real Internet topology.

given the current emphasis on the presence of power laws in the connectivity of the router-level Internet, it is important to understand whether such variability is plausible, and if so, where it might be found within the overall topology.


It is important to observe that, after macro-mobility handoff, the concept of COR will also be applicable in the foreign network.

the home TLCR will only be involved when another macro-mobility handoff occurs.


It is assumed that every player can recognize other players and recollect the past experience with them.

a player knows whether the opponent in the current exchange cooperated or defected in the previous exchanges.


This is the upper bound of the resolution that iProxy should provide to the end user.

we may reduce the resolution of a video requested by a client if her screen cannot support high-resolution videos.


We denote Pn =(Xn,Fn) as the problem after the nth iteration completes execution.

p0 =(X,F), which is the original speci.cation of the problem; Pm =(Ø,{(ai,Ø),ai ./C}), the empty problem and GreedySetCover(Pm)= Ø.


Deploying the initial consequence detectors guarantees that all the attack paths, from the initial state so to one of the goal states s .

ss in the AGT, is cut (de dp tected) in at least one detection point exploit e. if an attacker tries to compromise the machine while it is operating with the initial IDS set turned on, he or she would be detected and stopped by at least one of the deployed intrusion detectors.


Special thanks are also due for the help we received in getting access to AS PATH data from routers close to monitoring vantage-points.

we would like to thank C. Chung (Comcast), M. Eagles (UPCB), S. Huque (Penn), and O. Maennel (Loughborough U.).


Other works have also looked at the design of routing protocols as a feedback control problem.

work by Boel [8] showed that in order to improve both short-and long-term routing performance, it is necessary to disseminate failure information quickly and repair information slowly.


An action pair (x,y) * is a Nash equilibrium if and only if each of the actions x * and yis a maxminimizer [25].

* minyEA2 u1(x,y) 2 minyEA2 u1 (x, y) for all x E A1, and * minxEA1 u2 (x, y) 2 minxEA1 u2 (x, y) for all y E A2.


The main take away from this study is that the event and query rates must scale suf.ciently slowly with the network size if scalable performance is desired.

an important scaling condition is ensuring that 1/2 2/3 q · m be O(N1/4)for unstructured networks, and that q · m be O(N1/2)for structured networks.


We then perform another set of experiments after disabling carrier sensing, from which we seek to understand whether the heavy degradation seen above comes from ampli.cation by protocol features like carrier sense.

when sensing some energy spilled from orthogonal channels, a link could backoff unnecessarily.


On the other hand, the capture effect causes the WS nonempty that has been reserved via carrier sensing but does not need to be protected.

wS = (CSi .TRj ) - CPj , which is marked as the shaded area on the left in Fig.


It is not dif.cult to see that we only need two colors while the degree of l1,1 is n-1.

compared with previous poly-logarithmic time methods with O(n) approximation ratios, our method has a constant approximation ratio using larger worst-case running time.


On the other hand, in MAI noncoherent detection methods perform too poor for practical BAN applications.

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


Closing this gap requires a massive densi.cation of the cellular infrastructure.

this means a generalization of an heterogeneous architecture in which traditional macrocells, eNodeBs in the context of 4G LTE networks, are strengthen by the deployment of microcells, depicted in Fig.


On the other hand, the mobile device traf.c contains long period of inactive phase.

in high speed 3G networks pack 6 6 5 5  1 1 0 80 10 20 30 40 50 60 70 Figure 3: Modeling for end-to-end delay analysis: (a) IPP withon-off period for network source simulation, (b) a sequence ofqueuing system for network route simulation, (c) M/M/1/K .nite storage system for bottleneck hop buffer simulation.


Once some of these nodes are adopted, they start extending adoption invitations to their parents which were not adopted.

the adoption process will react to temporary network disconnections caused by rough conditions and/or high mobility and will seek any available route to the sink.


For a neighbor w2nbr(v), we can de.ne the force Fv!was the discrete derivative of Vwith respect to the link metric as (V(v);V(w)) Fv!w=(1) c vw The packet pis now directed to the neighbor x2nbr(v)for which the force Fv!xis maximum and positive.

each packet follows the direction of the steepest gradient downhill to reach its destination.


Reducing the tail timer or the HTTP keep-alive timer mitigates the resource overhead issue.

setting the keepalive timer to be smaller than the radio-layer tail timer helps avoid the signaling overhead caused by delayed FIN/RST.


Because of these factors, satellite networks have attracted much attention.

we focus on the satellite networks using mass storage devices [1].


!/4593/6827/HTTP 1.1 The major advantage of such a design is to convert user- friendly names to routing-friendly names.

the fixed-length and formalized names are easier for request muting mechanism to process.


Hence, it may be possible to achieve the lion s share of the bene.t with only a small set of alternate routes.

for our testbed, Figure 12 (found in Section 6) shows that exploiting just .ve alternate routes at each replica yields 60% of the possible improvement across the hundreds of alternate routes that we consider in our evaluation.


Further work will enhance the simulation scenarios and implement more sensors.

our main focus for the future will be the investigation of cooperative position veri.cation approaches.


Recall that z * (t) can be either a Brownian motion or stable Levy motion, depending on the tail behavior of Vi.

we need to introduce Skorohod M1 topology to establish the convergence to stable Levy motions, in order to handle the jumps in the limiting processes.


If object movement is constrained by the presence of infrastructure, e.g., lakes, park areas, etc., the technique is capable of exploiting this to reduce the range query, the purpose being to obtain better query performance.

an algorithm is proposed that segments the original range query based on the infrastructure contained in its range.


Finally, we provide new insights into the rarest .rst piece selection and on the choke algorithm peer selection.

we argue that the choke algorithm in its latest version is fair.


Categories and Subject Descriptors C2.0 [Computer-Communication Networks]: Data communications General Terms Design, Economics, Experimentation Keywords Proximity sensing, Relative location-based services, Proximity networking, FM Radio, Social gaming 1 Introduction Mobile phones, thanks to their ever increasing computing power, sensing capabilities, and rich networking interfaces, have become the primary information device that one uses regularly.

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


Assumption 1 For any cross-traf.c .ow jthat enters the path from link Li, the cumulative traf.c arrival process {Vi(fj,t)} has ergodic stationary increments.

for any d> 0, the d-interval traf.c intensity process {Yi,d (fj,t)}is a mean-square ergodic process with timeinvariant distribution and ensemble mean xj.


It applies to a class of protocols that use authentication mechanisms to prevent the adversary from modifying network tra.c.

the methodology applies to protocols whose authentication mechanisms correspond to the de.nition of MT-authenticators [2].


We use the minimum of the last H spare times as an estimator of the spare time of future packets.

future network latencies are estimated as the largest network latency of the last H packets.


This analysis shows that, in expectation, a k-tree can approximate the optimal routing paths quite well, even with just a few trees.

with only 8 trees, path lengths are extended on average by between 1 and 2 hops and, in the worst case, between about 2.5 and 5.5 hops.


With regard to the asserted properties, the inter-contact time is qualitatively the same as the return time to a site for a single simple random walk on a circuit considered in Theorem 1.

item2asserts the same asymptotic CCDF as for the return time in Theorem1 except only for different multiplicative constant.


each node is approximately equally likely to encounter any other node in its neighborhood.


A necessary condition for a successful GPS group spoofing attack is that .Vj ,Vk, .si, bj ijk =|Pj - Pk| .

the difference bj ijk of the perceived pseudoranges of each signal s A at any two spoofed victim locations Ljj and Lj ik must be smaller than or equal to the distance between the victims physical locations Pj and Pk.


In the Greedy cache update, the algorithm attempts to keep most of the hot objects in the local cache of the mobile device.

we set a threshold G , so that if the cache block s weight is bigger than the threshold, it will not be updated.


¾ Neighborhood Active Node List (NANLn): NANL at node n contains the communication-activity-status of its neighbors.

if any of the neighbors of node n is actively participating in a communication process or inactive, node n records that information in a list called Neighborhood Active Node List [NANLn(t)].


A k-active .oodingprotocolis a .oodingprotocolinwhich each nodeforwardsthesource message only during the k time steps immediately following the step at which the node receives the message for the .rst time.

by setting It (k) as the set of all nodes which hold the message at time t of the execution of the k-active .ood (k)(k)(k)(k) ing protocol, we have I= I.Nwhere Nis the t+1 tt t set of all nodes that are neighbors in Gt of at least one node (k) (k) in It It-k.


The potential bene.t of overlay routing for a pair of nodes ij and the utility of the pair for overlay routing can be predicted by the clusters that i and j belong to.

it is hardest to .nd better overlay routes for paths within the Asia cluster, but it is easiest to .nd better overlay routes for paths across the Asia and Europe clusters.


In this work we advocate that future WSNs should not develop on a premise of black-box deployments.

given a set of resources in a given node, it should be able to cope with changes in application requirements, and neighboring networks with common goals should be able to solicit the utility of local resources to improve performance; for a fee.


Two nodes just transitorily were in communication ranges of each other cannot be seen as neighbors, since they cannot be discovered by each other.

a neighbor will be discovered by Acc in advance or by a underlying scheme eventually.


Since practically the number of radios at each node is always much smaller compared to that of orthogonal channels due to reasons such as cost and small form factors, it may be prohibitive to assign one .xed channel to each radio.

a radio may need to switch to different channels as time goes for better performance.


By adopting a pricing mechanism, we .rst characterize the interactions between the primary and secondary users using a buyer/seller model.

the price is .rst determined by the primary network, and on the buyer side, the secondary users competitively access the spectrum and employ the primary relay node to forward their packets, and correspondingly, make payments to the primary network based on the receive signal to interference plus noise ratio (SINR) and the the speci.ed price.


The disadvantage of these technologies is the need for additional hardware and wires as well as a low grade of .exibility.

partial networking can only be realized by using one additional wire for each subnet.


Observe now that &O (Q)is precisely equal to the fair sharing factor, expressing an absence of multi-ra diversity gain.

the gain from having multiple ras merely stems from summing capacity, not from intelligent access selections.


Furthermore, because our focus is network-intensive applications, it is straightforward to ask the similar question: Does the base power phenomenon also exist in networking component?

does power consumption from communications components also reveal a large base?


Path Disturbance (Tpdist): A routing event is classi.ed as Tpdist if its pstart = pend, and at least one update in the event carries a di.erent AS path.

the ASpathis the same before and after the event, with some transient change(s) during the event.


First, both the accelerometer and the compass are prone to hardware noise.

the compass can be easily interfered by electromagnetic activities nearby, including those by the host device.


before, we also test Wi-Vi in a second building in our university campus, where the walls are different.

we experiment with 4 types of building materials: 8"" concrete wall, 6"" hollow wall supported by steel frames with sheet rock on top, 1.75"" solid wood door, and tinted glass.


End-to-end bandwidth limits and packet losses can only increase this latency.

if we know the RTT and response size, then we can predict a lower bound for thetransfer latency.


A total of N/2 communication connections is established, one for each pair of nodes.

every node is assigned to be either a source or a destination.


As we mentioned in the Introduction, this paper is a workin-progress paper.

we have presented neither a new secure routing protocol designed with the help of our formal model, nor a detailed security proof carried out within our model.


Extending this idea, a network is multi covered or multi connected if it has multiple sensors within its coverage or connectivity.

a network is k-covered if it has exactly k sensors within its coverage or kconnected if it has precisely k sensors with which it can communicate reliably.


Based on [11], the downlink power consumption of user i in the cellular network is: (i) (i,lte) Wlte = ßlte + arx Rrx , (12) where ßlte is the baseline power, arx is the downlink power (i,lte) consumption per M bps, and Rrx is the average data rate received by user i over the LTE interface: (i, lte) M (i) (i) Rrx =pbkt, (13) k=1 k k where bktk (i) is the average data rate of user i when its MSC is k, bk is the per-symbol throughput achieved with that MCS, and the value of tk (i) represents resources allocated to user i, which depend on the scheduling policy adopted (see Section 4).

under cluster-based schedulers, only cluster heads receive packets from the base station, so that the power consumption of user i strongly depends on the probability of that user being the cluster head when it can use (i|k) MCS k, namely Ph .


The symmetric Dirichlet distribution is the most common distribution over probability vectors and has the property that Dirichlet(a) will tend to be close to uniform when a is large and sparse when a is small.

a decideswhether all or onlya few componentsof the drawn probability vector get probability mass.


Therefore, with CRKIT, users should concentrate more on the creative aspects of the wireless problem, less on the complex engineering problems associated with building a radio.

focus on creativity rather than engineering complexity.


The graphs not only have small diameter (to model the six degrees of separation ) but also allow short routes to be discovered on the basis of local information alone (to model Milgram s observation that messages can be routed to unknown individuals e.ciently ).

kleinberg considered a 2D n × n grid with n 2 nodes.


Since there is no flooding message in GLS, we do not explicitly protect against packet injection in this paper.

doS attack in network layer is infeasible in GLS.


Since the problem is unsolvable in the worst case, they look instead for heuristics that work well on common rule sets.

after surveying a large number of rule sets [9], they .nd that rule intersection is very rare.


Proposed requirement of strong DAD is de.ned more formally below: Strong DAD: Let Ai(t) be the address assigned (tentatively or otherwise) to node i at time t. Ai(t)is unde.ned when node i has not chosen any address at time t.For each address a =unde.ned, de.ne set Sa(t)= {j | Aj(t)= a}.

sa(t) is the set of nodes that are assigned address a at time t. A strong DAD algorithm must ensure that, within 1By repeated application of this requirement, when more than two nodes have chosen the same address, eventually all but one (if not all) nodes that have chosen the duplicate address will detect the duplication.


In many sensornetwork applications, sensors do know and trust each other before the deployment.

before their deployment, sensors are in a benign environment where they can exchange information in plaintext and thus establish trust relationships among themselves.


We have extended the one dimensional array by adding the second dimension to indicate how far services might be away.

the filter has now changed into a vector v of m elements of d bits to hold a directory node hop counter to services in question.


More concretely, when we are setting up random shortcuts between nodes, both their lattice distance in the torus and their physical distance between servers/racks are considered.

as long as the shortcuts are uniformly distributed in the lattice, we can choose the ones with the least physical distances for the convenience of wireless links.


We use the new capabilities, offered by 802.11e, and design an algorithm and framework that is able to provide per flow service guarantees (given ideal channel conditions) in the MAC layer of an 802.11e WLAN.

our solution is based on the HCCA features of the upcoming 802.11e standard.


Furtherinvestigationis needed to ensure that the msocket API is the most e.ective we can make it.

additional investigation is needed with regard to our overloading the msocket call to de.ne process speci.c default networking stacks.


Yet, a small increase in the distance and .exibility of wireless charging would translate to a big improvement in the user experience.

many people are of.ce workers who spend multiple hours a day sitting at their desks [9].


However, we believe that information that has a speci.c function at the network or transport level should be represented with speci.c headers.

at the network level we propose to use cachecontrol headers, as well as a content identi.er to refer to a speci.c data block.


The VPN operator authenticates users and takes logs, and connections are encrypted, thus nonrepudiation is ensured.However, there might be large overhead in case that a user connect MIAKO network from a distance, because the user can access to the network only via the VPN server, even if users are side by side in real environment.

in MI-AKO network, the connection of users are always via the VPN server.


At present, central repositories are used to deposit information for others to see, however, visibility, awareness and accountability is missing because these are not socially translucent systems [6].

users do not know who is or has been around and cannot see what they are doing or have done.


1.2 Rent s Rule Locality Fortunately, we have empirical evidence, in the form of Rent s Rule [9], for example, which suggests there is additional structure to typical computations which we can exploit to avoid this limit.

the evidence from Rent s Rule suggests that the bisection bandwidth for a design does not need to be O(N), but rather, can be O(Np)with p< 1 for typical designs.


Then we de.ne sbfPyx (t) as the supply bound function associated to the parent component of Gyx that computes the minimum bandwidth supply provided to its children at instant t. As referred, one important aspect that we are considering in this analysis, that was not considered in [12], is that preemption is allowed between packets, only, i.e., packets transmission is non-preemptive.

any higher priority components that become ready during the transmission of the last packet (of a stream or server instance) will not be able to preempt it and thus will not impact on the component response time.


Therefore, a great pressure will be put on the underlying networks to support the raising tra.c load from M2M.

if we focus on cellular networks, as the main target for deploying M2M devices due to their availability, supporting this enormous number of devices would be very challenging.


Handshaking procedures become slightly more involved when a sender must contact multiple receivers within a single session.

the following aspects must be taken into account: i) whether a sender should transmit a single RTS for all receivers, or rather multiple RTSs, one for each receiver; ii) how many CTSs should be received before a handshake is considered complete; iii) how to handle the case where no CTSs are received.


Therefore, there are at most 2·din ' ) adjacent neighbors of li,j in i,j (G FP G that have already been processed.

the smallest din ' time-slot assigned to li,j is at most 2· i,j (G )+1, which is at most din .in(FP 2· G )+1.


Therefore, IP address auto-configuration schemes have been developed to remove the overhead of manual configuration.

the IETF [5] Autoconf working group has been created to address this issue.


This demonstrates that a particular communication density value associated with a particular message size can be normalized and mapped to such measures associated with a different message size.

we show that it is feasible to use a single value to describe the channel load of very complex vehicle communications scenarios, which consist of non-homogenous configurations of vehicle density, message size, messaging frequency, and transmission power.


Another interesting observation is that TCP throughput is only about 1/4 of UDP throughput at saturation.

tCP can exercise congestion control and keep the network lightly loaded, but at a high performance cost.


4.2 Implementation Details In this section, we provide some of the important details of our prototype.

we will focus on the localproxy and geoproxy implementations, and discuss a crucial security issue.


We use the indexing data structure developed by Yan and Garcia-Molina as a starting point.

we adopt their scheme for maintaining a global index of attribute constraints whose selection, based on the attributes of the input message, leads to the rapid identi.cation of matching conjunctions.


We also observe that LRT users use the network in more locations.

we .nd that the activities of LRT users span 2.2 miles (difference between the medians) more than that of non-LRT users during a week-long observation period.


Notice that the mean absolute prediction error is only 0.47 megabits/second at 500 minutes.

using the new forecasting technique, the NWS can predict 16MB transfer bandwidth using 64K measurements with a mean error of 0.47 megabits/second.


While our architecture does not generalize to all SDNs or to all WANs, we believe there are a number of important lessons that can be applied to a range of deployments.

we believe that our hybrid approach for simultaneous support of existing routing protocols and novel traffic engineering services demonstrates an effective technique for gradually introducing SDN infrastructure into existing deployments.


160 (a) Geant false-positive rate geant Figure 6 provides further support for the conclusion that the relative properties of tra.c aggregation formalisms ap-140 pear to hold across networks.

for a given topk 120 value but across all thresholds and both networks, the input links aggregation generally detects more potential anoma lies than OD-.ows, which detects more potential anomalies than ingress routers (see .gures 6(b) and 6(d)).


Perhaps the most naive assumption is that if for player j, .C(j, ij ) > 0, then the price it will ask player i to pay is Pij = max{.C(j, ij), 0}.

if it is bene.cial for player j to establish a link, it will not ask for a payment in order to do so.


ware, this can increase the possibility of bugs in the overall system.

our goals for the design are that (i)the design is simple, implementing only a minimal set of functionality, reducing the set of components that may contain bugs, and (ii) the design is small, opening the possibility of formal veri.cationof thehypervisor a more realistic task than verifying an entire routing software implementation.


[9]: E[N]isasymptotically bounded by O(log M), where N is the number of collisions a node encounters between its two consecutive suc cessful transmission.

we estimate M by keeping track of the number of collisions and using the following equation: E[N] M=10 K ' , (47) where K ' is the same value of K in Eq.


For instance, our results show that our gifting UAGs exhibit degree structures that are more complex than for friendship graphs.

out-degree distributions in our UAGs cannot be explained simply by power-laws, and are not summarized by any known parameterized distribution.


To achieve this, the service implements a polling strategy.

the service on the client periodically sends requests to the server.


This example illustrates that, in the RWP model, the mobility metric speed and the size and shape of the area directly in.uence the mobility metric direction change.

the two metrics speed and direction change cannot be treated as independent input parameters in this model.


In this paper, we highlight our thought process in architecting a scalable and robust inter-cloud messaging protocol.

we structure the protocol into three components: i) message vehicle for transporting messages among different clouds, ii) message format that encodes message, and iii) message content that carries information.


i,j   quality, and further that it strictly increases with the trans-i=1 j=1 mission power.

the collision-free data-rate Hm(q m), which stands for R1m,j <Rm 2,j < ··· <RmIm,j , (1) the average data-rate of successful transmissions, namely JM j .


In cellular networks, the fact that the transmissions of the various base stations are not coordinated leads to non-convex rate regions [3].

when the achievable transmission power levels of a base station form a countable set, the rate region is discrete [7].


Also, if some devices volunteer, according to some protocol, to occasionally forward messages for other devices, then the result is an ad-hoc network [24].

two common types of ad-hoc networks include wireless sensor networks (WSN) and mobile ad-hoc networks (MANET).


Also Table 2 excludes all TCP retransmissions which are network-dependent.

we compute the fractions of aforementioned traf.c components within (raw - tcp_rt).


Path Convergence on Randomized DHTs 21 , 22,  2d-1, which corresponds to a poorly balanced tree.

it is precisely this imbalance what makes passive replication, such as path replication, no effective.


Feasible rate In a wireless ad hoc network with n nodes in which each source transmits its packets to m destinations, a throughput of .m(n) bits per second for each multicast session is feasible if there is a spatial and temporal scheme for scheduling and network coding transmissions, such that, by operating the network in a multi-hop fashion and bu.ering at intermediate nodes when awaiting transmission, every source node can send .m(n) bits per second on average to its m chosen destination nodes.

there is a T< 8 such that in every time interval [(i - 1)T, iT ] every node can send T.m(n) bits to its corresponding destination nodes.


Next, we present the RAndom Walk based Membership Service (RaWMS), which provides a random uniformly chosen partial membership view based on random walks.

the peers in the view of every node look like they were picked from random uniformly chosen locations in the network.


Another easy extension concerns dynamically changing networks.

the set of available edges may change over time, and we assume that it is also controlled by the adversary.


Each property in the dK-series provides information on connectivity within groups of d nodes with degrees k1, ..., kd,where d takes values from 0to the total number of nodes, n, in the graph.

the dK-series describes correlations amongst degrees of nodes in subgraphs of size d,for d =0, 1, ..., n. Each element in the dK-series allows us to generate dK-graphs that reproduce the speci.c correlation among the degrees in all d-sized subgraphs of the given graph.


This paper aims to answer the above questions.

this paper makes the following contributions: A complete set of deployment patterns: We propose new patterns for 3 and 5-connectivity.


They have found that in all these networks, a small percentage of popular nodes are connected to most of the other nodes.

the degree distribution follows a power-law.


This is because we need distribute a packet to k destinations during MotionCast.

if k = T(1) we .nd the results of unicast is a special case of our paper.


Formally, ac-tivating a speaker applies the export policies of the BGP 'speakers in neighboring ASes, the speaker's import policies, and the BGP path-selection process [9].

if the BGP speaker resides in ASd, the route to d is a route (denoted as r0) that contains a null AS path.


At each time step, the reward function speci.es the instantaneous reward obtained by taking a given action in a given state while f represents the state transition triggered by the action.

the f function returns the state xt that the system reaches from state xt-1 after applying action at-1.


In stochastic detection, positive detection decisions may be false alarms caused by the noise in sensor measurements.

although the detection probability can be improved by setting lower detection thresholds, the .delity of detection results may be unacceptable because of high false alarm rates.


The paper demonstrates a method for applying these models to the evaluation of global network metrics.

it describes a model of network connectivity.


Essential to answering all these questions is the ability to classify samples by the user who generated them.

given a validation sample, the adversary needs to answer the following question for one or more users U : Question 1 Did this traf.c sample come from user U ?


Moreover, in existing ad hoc wireless systems such as IEEE 802.11b WLAN and IEEE 802.15 (Bluetooth) WPAN, there is no provision for dynamic power control [2, 1].

power levels cannot be changed on the .y.


This indicates that the convergence to very few certi.cation paths is much more expressedfortheglobalIPv4spacethanforthepopularAlexa hosts.

there is more relative variance in Root CAs in the top1 million thanin the wholeIPv4 space.


We do not consider minimum guaranteed rates for the users.

such minimum rates are zero for each user.


While there exists anycast solutionsfor connected environments[3,14], these solutions all rely on stable end-to-end connectivity.

they work under the assumption that the network allows for select group members to be reliably contacted and cannot be easily adapted to the disconnected and heavily partitioned environmentsfoundinDTNs.


The impact on caches was negligible while ISA support is limited to specific effects on certain algorithms.

we were surprised to find that RC4 outperforms RC5 on encryption for the 8 and 16-bit architectures.


The GBP should place as few constraints as possible on the metarouters it hosts.

it should not place any constraints on data formats or limit the ways in which metanetworks provide various capabilities, or constrain the way in which they use their assigned processing resources.


In this section, we assess the performance and suitability of the proposed scheme.

we concentrate on three aspects: the reliability of the scheme in terms of the false positive rate, oscillations of the seen distance, and the effect of node mobility.


We present an extensive empirical study performed in an o.ce building and provide key insights on the design of robust topology control algorithms in such environments.

we analyze the correlation between RSSI/LQI and PRR and show that RSSI and LQI are not always robust indicators of PRR in indoor environments with signi.cant multi-path e.ects.


However, the Data Pendulum phenomenon exactly emerges in simulations only when RTTs are unequal.

the understanding based on Data Pendulum is not completed, which can be considered as another description of the interacting phenomenon.


It is interested that with the increasing of number of deployed sensors, even without any compensation process the coverage rate of a POND can reach 85% for 1-cover and 53% for 2-cover.

base on an existed optimized node distribution we can reach a certain coverage level without any extra work.


In our protocol, nodes exchange coded frames instead of .le pieces.

we de.ne a coded frame c to be a linear combi- Pn nation of .le piece pk s. c = k=1 ek pk where ek is a certain element in a certain .nite .eld F over which every arithmetic operation is.


Thus consider that we are trying to generate synthetic traces for a cluster C. The equations can be used to .nd out which values go into the transition probability matrix M for C. Unfortunately they do not tell us where in the matrix these values go, i.e., they do not tell us M(u, v) for some speci.c u, v .

c. simply populating the rows of the transition probability matrix in a skewed manner, as described above, is not su.cient.


(2)A symmetry assumption requires that the value function v(·) contains all the data relevant for the allocation problem.

this assumption rules out biased methods that allocate by using some outside information.


Mobile carriers deploy in-network middleboxes or proxies for various purposes.

the carrier from which we collected the DS1 dataset deploys a proxy in the cellular core network for HTTP traf.c (server port 80/8080).


To avoid continuous polling on resources and also to enable near real-time applications, we support HTTP callbacks (also known as Webhooks5) for resources representing sensor readings.

as soon as the value of a sensor changes, an HTTP POST request is sent by the node to a pre-speci.ed URL, containing the updated value, i.e., the current sensor reading, in the message body.


However, it does not try to produce independently coded packets.

the packets from di.erent relays could be correlated as they are generated from the same set of packets with a re.nement objective that tries to equalize the number of native packets in the re-encoded packets.


The unresolved terminals are randomly split into approximately n groups and each group is resolved by using the basic tree algorithms.

the partial resolution algorithm from [4] can asymptotically (n -.


However, the fusion model is more e.ective for achieving high coverage.

the fusion model withafusionrangeof200msaves morethan50%sensors whenthe coverageisgreaterthan0.75.


Selection of the angle a 3.3.2 Classification of Concentric Circular Bands Because the proposed protocol trades off energy savings with source-to-sink delay, we propose to classify the different CCBs of the transmission range of a sensor node based on the values of their exterior radii.

the set of CCBs will be divided into three categories as shown in Figure 1.


[4, 6, 9, 10, 14, 15, 22, 25] and the surveys of [11, 30]) have been in a model where the routing scheme designer may assign his/her own O(log n)-bit or sometimes O(log 2 n)-bit node la- bels, dependent on network topology.

when a packet destined for i arrives, 'T' has been renamed, not by some ar- bitrary permutation P but by the routing scheme designer, *Supported in part by NSF grant IIS-0099446.


We observe that more LRT messages are observed from LRT users than the number of customer tickets submitted by the mobile users.

more than 20% of the LRT users send more than 5 LRT messages in a month, where only less than 3% of the users generate more than 5 customer tickets.


Note that the gain increases as the PUs tra.c load increases.

q-OSA performs even better under heavy loaded systems.


The small sT values show that the four queues with di.erent arrival rates have similar delay.

the optimal power allocations do not adversely a.ect the delay fairness.


When the increased ratio of transmission ef.ciency was set as 98%, the current of the ith mode was multiplied by (98%)(5-i).

the transmission ef.ciency increased with the decreasing of the ratio.


For the comparison we choose the topology presented in Figure 16 because it incorporates multiple issues and sub-topologies studied throughout the paper.

the topology is a combination of symmetric, asymmetric, and .ow-in-the-middle topologies.


We replicate less but we try to control the replication in an intelligent way by predicting the future evolution of the system.

data are replicated R times, with R that may be order(s) of magnitude less than the number of sensors composing the system.


These environments experience intermittent connectivity due to a variety of reasons, yet the topology often has an underlying stability.

the set of neighbors for anynode is usually small and does not change frequently; network dynamics result from linkfailures rather than unpredictable node mobility.


Theorem 5 (k-identifiability under CAP).

network G is k-identi.able under CAP: a) if for any set V ' of up to k non-monitors, each connected component in G - V ' contains a monitor; 3for any subset of k column indices S and any other column index j /.


If no major topology change or no remarkable weight change, no update will be performed until some pre-set timer expires.

we perform our algorithm periodically with a pre-set time.


Equation (1) can be re-written as, 1 d Imin maxGmin = - 1 - (3) q nq We note that code constructions that produce codes with larger d n ratio for a given dimension q and I will have min / max larger guarantees.

larger are Gmin Gmin possible for codes with more relative minimum distance.


Instead, we leverage understanding of the PHY layer to bypass the challenges that hinder device identi.cation using transients, and attain signi.cantly higher accuracy.

we introduce an approach, called PARADIS, which stands for Passive RAdiometric Device Identi.cation System.


Quite often, the "bedside" medical treatments are out of it.

checking the various treatments, prescription and delivery of chemicals, notes taken by doctors and the like still do not receive networked computing support, unless hand~itten notes are later on copied to electronic supports.


With an uncertainty relationship of the form of (18), the inherent measurement noise(see equation 6), unknown mobile user acceleration/driving command and the uncertainty in the initial condition are considered as bounded deterministic uncertain inputs.

the measurement equation with the standard norm bounded uncertainty can be written as (equation 6) y = C(x)+ dC(x)+ v0 where |d|=.


In contrast, Internal-BGP [10, 11] (or I-BGP) is used for exchanging this external routing information among routers within the same AS.1 It has been observed in practice that persistent route oscillations can occur when using I-BGP [16, 19] with route re.ection [1] or confederations [20].

some subset of the routers within an AS may exchange routing information forever without being able to settle on a stable routing con.guration.


If one can ensure that one angle is highly acute, the overhead of the inequality goes down accordingly.

the overhead in switching the reference from a receiver to a sender of a link goes down if the length of the link relative to the other distances is small.


for the radios, except for con.guring ad hoc mode and channel 36 (5.18 GHz).

the cards all performed auto-speed selection.


So our basic approach is to solve this problem piece-wise.

we focus on a small region in the variable space dt , da, d., approximate the sinc functions in that region by straight lines, and solve the resulting convex optimization problem.


Nevertheless, 1901 di.ers from 802.11 in that its CSMA/CA mechanism is more complex, which makes its theoretical analysis challenging.


Second, this past work assumes that the NIDS analysis occurring at a network node is self-contained.

the NIDS nodes act as standalone entities and provide equivalent monitoring capabilities without needing to interact with other nodes.


Nevertheless, it has good fairness and delay properties that we demonstrate through both analysis and simulation.

strati.ed Round Robin provides a single packet delay bound that is independent of the number of .ows.


Policy 3 achieves equality in the fairness index among all PFGS video streams.

the reconstructed qualities of each video stream are degraded fairly (i.e., the same quality degradation ratios) with the employment of policy 3 for rate regulation.


Even minimizing the makespan without regard to fairness a special case of fairness-ef.ciency tradeoff is NP-hard.

we note that minimizing the makespan of a packet schedule can be modeled as a multi-stage .ow shop problem [6, 20, 23] studied in operations research, where the equivalent of a packet is a job, and the equivalent of a type of resource is a machine.


In addition, AS X needs to ensure that the packets, upon reaching router R2, are decapsulated and forwarded via the egress link to Provider 1, even if R2 normally forwards packets via Provider 2 to reach this destination.

r2 needs to decapsulate the packet and still forward the packet based on the tunnel identi.er2.The customer, in turn, must install the necessary state to ensure that packets entering the network are diverted to the appropriate tunnel.


The results depicted in Table 3 show that the differences in energy consumption levels between the context-based opportunistic and the optimum configurations are dependent on the density of mobile nodes within the cell and the probability with which the presence of a MR is guaranteed within the search area.

the results reported in Table 3 show that the 3 The upper limit of the distances shown in Figure 4 coincides with the radius of the search area (9).


From there, the lookuprequest canbe routedtowards the smaller levels, as described in the previous section.

using this approach, we .nd t quickly if it is close to s.we prove that the lookup time is linear in the distance between s and t. As for the search areas, we use an extended version of the levels of node s, who issued the lookup request.


We also describe such pairs of trajectories by presenting a constructive method for producing them.

we show that two trajectories which always have parallel velocities obeying a given constraint and are always a constant distance apart cannot be di.erentiated under the binary sensor model.


Although such approaches are not new, the proposed hybrid method of combining the two ideas is novel.

we propose to exploit content replication to bridge the gap between the user and the mobile social networking friends who are not in the vicinity of the user, thereby reducing the content delivery latency and increasing the delivery success rate.


In the next day however paths are more dispersed; some pass through AS3549 (Global Crossing), some through AS3257, some only through AS174 (Cogent), and some pass only through other ASes, not in the .gure, which connect directly to AS29632.

aSes are switching from AS6939 to other ways to reach AS29632.


due to a routing change that forced packets from the path through A to the one through B in the middle of a traceroute.

this occurs if the routing change happens between the time S receives the response to its probe with TTL 8 and the time that it emits the probe with TTL 9.


A Cellular IP (CIP) [5] derived protocol is used to take care of micro-movements management.

an hysteresis-based strategy has been conceived for horizontal handovers triggering.


In follow-on work [2], we proposed enhancements to the basic ESP service that enabled its use for network monitoring and management;we call the resulting service ESP-NM.The primary enhancement enables access to the network management information base (MIB) at each node in the network.

in addition to providing access to ephemeral state values at a node, ESP instructions can reference MIB variables at a node.


TheresultsinFigure2forOpen-Flow without Attendre are expected to become much worse if Type 2 race is accounted for.

the actual bene.t of Attendre is even larger than Figure 2 shows.


Tegola Tiered Mesh Network Testbed in Rural Scotland Giacomo Bernardi Peter Buneman Mahesh K. Marina g.bernardi@sms.ed.ac.uk opb@inf.ed.ac.uk mmarina@inf.ed.ac.uk School of Informatics The University of Edinburgh, UK ABSTRACT Many rural and remote communities around the world see themselves on the wrong side of the digital divide.

there is evidence to suggest that there is a growing digital divide between urban and rural areas in terms of broadband Internet access with people living in rural areas having fewer choices and pay higher prices for slower speeds.


PERFORMANCE EVALUATION In this section, analytical simulation results for the evaluation of the mechanism are presented.

through two different scenarios we examine the following aspects of the mechanism: Enhancements through MIMO technology support, Comparison with current 3GPP approaches, Managing multiple parallel MBMS sessions.


Investing time in conversation and resolving social issues provides the community with its resilience and is framed within social relationships that extend across life-times and social networks that extend over centuries.

the value of time spent communicating for a close knit rural community di.ers from the values that emerge in societies that have many weak and dynamic social ties.


It can be measured as a fraction of the shortest paths between pairs of vertices in a network that pass through the node.

the betweenness can quantify the importance of a vertex to the network, which can be de.ned as follows: .. s(i, u, j) Bu = , (8) s(i, j) ij where s(i, u, j) is the number of shortest paths between vertices i and j that pass through vertex u, s(i, j) is the total number of shortest paths between i and j, and the sum is over all pairs i, j of distinct vertices [6].


For a receiver to correctly recover the broadcasted bits, the receiver ADC must be symbol-synchronized to the transmitter DAC.

the receiver must perform analog-to-digital conversion of the received audio at the right instant.


We require the semantic security for both encryptions.

the encryption is randomized, and a polynomial time adversary cannot distinguish the encryptions of two input messages.


A two-way .ow suggests a successful connection and refers to outgoing traf.c (as perceived by the border routers), matched with the corresponding incoming tra.c.

the outgoing and incoming tra.c include the same 5-tuple (e.g.


in the lemma when setting H = m 2J, a =(mJ)-4 , b =(mJ)-1, and q = (2em)-1 .

thus the lemma shows that Pr [F(t) = k] = 1 - m1 2J -k at any time t. we have E [F(t)] = m 2J at any time t. As F is an upper bound on the lengths of queues for failed packets, this completes our proof of Theorem 3.


In regard to the former aspect, i.e., understanding how humans move, many papers in the last few years have tried to statistically describe the features of mobility from different points of view.

there has been a long discussion on the nature of contact and inter-contact times [8] [16] [9] [20].


3.2 Results In this section, we focus on the node degree distribution considering two points of view: the logical L3 graph and the underlying L2 graph.

we would like to know how L2 devices might impact the degree distribution.


In ALPHA-C and ALPHA-M, the necessary period of stability extends to all packets belonging to the same signature process.

the number of parallel transmissions and the size of the MT should be adapted to the network dynamics for best performance.


5.2 Direct Implementation of FluidScheduling Based on the packet pro.ling results, the .uid schedule is constructed and is maintained by the .uid scheduler.

we need to determine the next packet that starts in the .uid schedule.


In carefully crafted measurements, the dispersion reported by ping can be up to 40% of the RTT experienced by the .ow with lowest latency.

when we observe high variability in the delay measurements of ping, it is likely a measurement artifact of the tool itself.


Note that although TCP-AP achieves benefit of the remaining flows.

none of the ten FTP flows experiences starvation.


We use the last bit of the SFD byte as the reference point for time synchronization.

the sender takes the transmission (completion) time of the last bit of SFD as the MAC layer transmission timestamp, and the receiver marks the receiving time of the same bit as the receiving timestamp.


The key message is that error patterns .uctuate widely depending on several parameters, e.g., time of the day, choice of channel, location of the measurements, distance between the sender and the receiver, behavior of other users, etc.

unlike other technologies, e.g., GSM-based systems, where the quality of the channel is more or less stable, one cannot make statements of the form the average 802.11b channel has an LTER of X%and an EBLof Y packets.


The implementation of the facilities network must scale to large data centers.

protocols for the facilities network must incur minimal overhead and scale gracefully to a large number of .ows.


In particular, Helmy [2] showed if long-range connections are established in a spatial ad hoc network, then it is likely to become a small-world.

there is an incentive to create remote connections to decrease the diameter of the network for ef.cient searching.


Since ROMA uses 3 802.11b/g and 3 802.11a channels among 3 gateways, as opposed to only 1 802.11a channel in the common channel con.guration, it achieves the highest aggregate throughput.

rOMA s median aggregate throughput is 1.4× and 2.1× that of the common and identical channel con.gurations, respectively.


An option to even further reduce crossover switches is to use a single switch for each sibling connection.

we number each channel coming in from the two siblings from top to bottom and provide a switch only between the channels numbered in the same manner.


4.3 The Nucleolus If the stability or consistency of the allocation are of primary importance the core plays a fundamental role.

if the core of the game is non-empty, the nucleolus is always in the core.


The evaluations show that Nexat is able to predict the next steps of attackers with very high accuracy.

nexat achieves a 94% accuracy in predicting the next actions of the attackers in our prototype implementation.


Simulation results show that the proposed protocol provides high delivery ratio, low number of forwarding nodes and high broadcast speed for broadcast operation in highly mobile and denser network scenarios.


We argue that such novel paradigm must also consider how to support services in general, where service requests are issued by (mobile) users and trigger processing in service elements as well as responses to those re-quests.

with the recent advent and growth of cloud computing it is necessary to support dynamic services in any Fu-ture Internet paradigm.


There exists strong correlationsbetween session size(i.e., the number of bytes of a session) and state machine characteristics.

figure 13 indicates that large sessions tend to have high fraction of DCH occupation time (PDCH)as well as low PFACH and PPROMO = PIDLE.DCH + PFACH.DCH values.


Further notice that the total number of metal layers is asymptotically optimal.

for p> 0.5, the number N(p-0.5) of layers required is T .


Although the scheduling of [10] can work more efficiently than [3] and [7], sleep cycle changes from periodic to aperiodic.

the scheduling of [10] still causes the issue of state transitions.


The user of a MN will expect the same seamless QoS that he would receive if he were using a wired network.

he does not expect to experience time-periods where he does not receive QoS, nor does he expect to experience a different level of QoS once the reservation is re-established.


Given the RSSI and loss vectors, the classi.er chooses the closest bitrate cluster among those shown in Figure 7.

it chooses cluster i using the following expression: .i .


A key observation that motivates this work is that the performance of a path depends not only on the number of links on the path and their qualities, but also on the relative positions of the links on the path.

the closer a lossy link to the destination, the higher is its impact on the performance of that path.


However, we notice that current systems implement this approach in such a way that senders and receivers share this responsibility.

both senders and receivers must make an e.ort to reach a midway point of contact.


Figure 9: Nearest neighbors in square-grid space Calibration-based algorithms are most effective when RSSI values acquired at center grid positions and their nearest neighbors exhibit clearly distinguished statistical patterns.

if mean RSSI values of a center position and its primary nearest neighbors are the same, measurements at such grid alone contribute errors up to g. This inclusion of errors is known as aliasing in signal space, where RF properties of grid positions are blurred by physically different grid positions.


However, notice from Table 7 that the SNs are offset by Off and 2× Off respectively, where Off is a small value.

both messages contain unexpected but acceptable SN (out-of-order segments).


the new flow is The main weakness of ETXOP is the possibility given to a high automatically rejected.

the requested bandwidth priority flow to send a burst which is depending on the number of cannot be fulfilled due the current network state.


WTs generate elastic traffic and are interested in maximizing their received throughput whatever its magnitude.

stage utility simply equals received throughput.


Since energy efficiency is crucial to achieving satisfactory network lifetime, it is of utmost importance that both computation and communication should be performed in an energy-efficient manner.

prior research [17] indicates that, in a wireless sensor network environment,  M. Kandemir Dept.


To provide a precise forensics analysis, we in fact need to traverse the time dimension back and forth.

we are interested in time instances when attack steps happened, e.g., tei ,tej , ...,ted p in the example above.


With the differentiated mechanism of packet-forwarding, the bandwidth utilization and service quality will be substantially improved.

the QoS problem has become important while multimedia services are involved.


The entire observed sphere has area S. Assumption 2: In (1), we ignore that the electric .eld is a vector quantity.


In this work, we used the physical model to show that the order throughput gain derived from NC for multicasting and broadcasting in wireless networks is bounded by a constant.

as the network size increases, NC renders the same order throughput as traditional store-and-forward routing.


MoS Figure 3 shows the routing overhead of AODV, DSR as well as HWMP.

how many routing packets for route discovery and route maintenance need to be sent in order to deliver the data packets from source to destination.


(S (ch ) - Mod (S (ch ), S (PA i ))) max i max j max j max j=1 The equation (12) states that if and only if the accumulated values of Mod function equals to 0, the optimal value can be achieved.

the synchronization of PA and Ch are maintained.


since each RB experiences its own SNR vector, the optimization problem in (1) should be re-optimized for each RB.


Solutions to these problems are described both in the MIP protocol speci.cation [14] and further investigated in [13].

in [14] the problem represented by .rewalling policies is also considered, and solved thanks to the introduction of reverse tunneling.


This means that if two clients associated to di.erent WMRs wish to communicate, the set of WMRs will forward the tra.c at the IP level.

on the client sub-network interface, the WMR acts in such a way to let local clients think that remote clients are in the local WLAN.


After the execution of the query on the local data set and the collection of local results, the Query Routing Module is activated.

the Routing Management sub-module analyzes the received query and accesses the peer s SRI in order to select the neighbor (P .


As depicted in Figure 12, the data delivery ratio rapidly decreases from about 90% to less than 10% when the number of pairwise wormholes increases from 0 to 8.

data reports are delivered with lower than 50% probability when there are more than 2 pairwise wormholes.


The WAVE multi-channel MAC internal architecture is shown in Figure 3.

it describes the following transmit operations: channel routing, data queuing and prioritization, and channel selection.


Among the assumptions made by the SINR model is that interference is additive.

if multiple senders transmit simultaneously, the RSS at the receiver can be estimated as the sum of the individual signals.


Table 1 summarizes the parameters set tings for all measurement trials.

we varied the RF channel (CH), the transmission power (PW), the processing of CRC corrupted frames, whether the channel clear assessment (CCA) and calibration (CA) was activated, and whether the measurements took place at a weekend (WE) or during daytime (DT).


We present a management system that can efficiently support a configurable and high-performance server system that uses layer-7 routing mechanism.

we search for the answer to the following three questions: *What kind of content-related information do we need for layer-7 muting?


Our research is of the .rst few that assume that both the sink and sensors to be mobile.

sensors are assumed to be moving in a dynamic and a highly diverse way.


We now elaborate how the individual components of the system showninFigure 2 interact with each otherinthe context of a typical tracking application.

we discuss the design decisions that make the target system energye.cient and illustrate trade-o.s between performance and energy-awareness.


Symbol zn denotes a delay element of n cycles.

we take the .rst halves of each of the K repetitions of the preamble (lightly shaded squares in Figure 3), and sum them.


We consider a sequence of such graphs indexed by n. The maximum expected degree m and the average expected degree d may, andindeed typically will,depend on n. In models of real networks, we can typically expect d to remain bounded or to grow slowly with n, saylogarithmically,while m growsmorequickly,say assomefractionalpowerof n. In this paper, we only assume the following: .. v m 1 d = d> 0,d = o(m),m = nd, = on.-1 .

(7) d Here, d is a constant that does not depend on n. the average expected degree is uniformly bounded away from zero.


As our interest in this paper is the stationary distribution that emerges after a long time, the resulting stationary distribution might not satisfy the node conservation condition.

this means that some proportion of the nodes are not participating in the merge split process because they are captured in a giant component, or because they have been withdrawn from the interaction medium.


Therefore, in this section we reduce EEC under the constraint that EDR of the forwarding sequence is above threshold R. Unlike optimizing EED, in Equation 5, where i represents the index of forwarding node in the forwarding sequence, the i value changes for each already selected forwarding node as we backwardly add early nodes.

the decisions made to include or exclude an early node in the forwarding sequence does affectthe expected energy of laternodes.


(12) If the ratios of the successive two one-way delays at both sides are equal, the ratio of one-way delays and the ratio of jitters at both sides are equal.

if we know the measurable RTTs, we can also know the unknown one-way delays.


personal devices add a large degree of uncertainty to the .nal composition of the network, both software and hardware.


Its activity is split into o.ine activity at .ow lifetime timescale which performs the more complex activity and online activity at the frame transmission timescale.

the online activity executes the enforcement policy with a periodic scheduler based on Earliest Deadline First (EDF) algorithm [20] plus Stack Resource Policy (SRP) [6] in order to take into account the non-preemptability of frame transmissions that are considered critical sections.