The binomial distributions BN(p) are often used to approximate a normal distribution of the pro.tability vi, or quality sensitivity ßi, where pdetermines the mean value.

under Assumption 2, each AP needs to choose a TP even it cannot afford to use any of the TPs, so a market equilibrium might not exist under this assumption.


Then, p dilates the spheres of all other players to a radius equal to the di.erence with its new frame clock.

in Ghost, player p checks the delay pro.le it has measured of q s performance in the game over the last n rounds.


OLSR (Optimized Link State Routing) protocol is a well-known proactive routing protocol for MANETs, which has been broadly tested and implemented [3, 4].

tC messages advertise the links between MPRs and MPR Selectors.


We found that it is caused by the default MAC parameter setting suggested by the 802.15.4 standard.

we varied macMaxFrameRetries in the range [0,7] (0 means that the retransmission mechanism is disabled), while setting all other MAC parameters to their default values.


The exception is interval 50-58 seconds, when the destination node moves to (50, 0).

if the intended recipient does not receive the packet, other nodes may receive the packet and then become candidate senders for that packet.


This ranking indicates that those hosts are suspicious.

for example, botnets, which are a groups of hosts that can be controlled by a malicious user, recently become a critical security threat to the Internet [4].


Hence, a large number of coe.cients will make the decoding process CPU-intensive and time consuming.

[15] L. S. L. Briesemeister and G. Hommel.


A class-k-customer who arrives exogenously is allocated to an idle server in Jk and starts his service immediately, if he .nds any idle server in Jk upon the arrival.

¯Choose d> 0 such that ¯ Derivation of (28): Suppose that Zk(t) > 0 and CnCk = f. Zk(t) ¯ Zk(u) > for all u .


A recent work is proposed in [5] to study two competition problems between service providers with asymmetric information by applying the signaling game approach.

how should be player II s reaction to the infor si and sj are computed as function of player I s belief, namely {{ 1, if b1 E [0, th1] and H1 = HG; 2, if b1 E [th1, 1] and H1 = HG.


Figure 3: Changing the value of c, budget = 16 pkts, and k =logc 1000. value of c and decrease more.

it is highly desirable to de.ne the amount of energy we can spend in the energy map construction, thus leaving the remaining energy to be used by other network activities.


Using propagation depth constrained by a breadth threshold of 2 (f =0,b =2), TreeCount produces 64 signatures.

but it also detected email worms, such as Swen, as well as several hosts controlled by a backdoor and used to send spam.


3.1 Middleware architecture OppStore is structured as a federation of clusters, with each cluster containing a Cluster Data Repository Manager (CDRM), which manages several Autonomous Data Repositories (ADR), one on each cluster node.

if the system organized all grid machines in a single peer-to-peer overlay network, the constant changes in machine availability, which typically occur in opportunistic environments, would have to be treated as node joining and departure operations, which are expensive operations.


the transmission probabilities from the server at node 0 to the clients at nodes 2 and 3 are the products p2 = f1f2 and p3 = f1f3 respectively.


Fabian Khun and the anonymous referees provided helpful comments.

); that is, the set of lattice points in Lk(t.id) within distance 2. from x.


We present these results in order to demonstrate the feasibility and utility of the testbed, and to highlight challenges that arise and will need to be solved in the future, in a full-scale deployment.

our testbed deployment is uniquely di.erent from these testbeds in multiple ways.


It views the network as a single entity, that is a middleware operating at all levels of the network i.e.

categories and Subject Descriptors C.2.1 [Network Architecture and Design]: Wireless Communication.


A promising privacy system that overcomes these drawbacks is the Mist.

a MSIP server is able to forward packets apart from its ancestor, to its siblings.


We then calculate PER for the backbone links using F/(T + F ).

the scale of the study allowed us to make many important observations that are critical in planning and using WiFi meshes as an Internet access technology.


Each source initiates a session with a heavy-tailed distribution, in particular a Pareto distribution whose density is given by -d-1 g(r) =dbdr , r > b where d is related to the Hurst parameter by H = (3 - d) / 2 .

we 1234 1234 will analyze only the first one in detail; the others follow similarly.


The default operation today is that each user with a cellular connection downloads the video independently from the server.

& CalIT2 UC Irvine athina@uci.edu  Figure 2: Architecture of MicroCast.


cial RANs and sensitive information about federal missions and transmitters.

the disparate business models for deploying these networks have made federated authentication and data path anchoring needed for seamless handoff rather challenging in practice.


These probabilities must be multiplied by the probability P(ci)that a node is currently in its home cell and the probability P(cj)that a node is currently in cell cj, respectively: pij = P(cj|ci)* P(ci)+P(ci|cj)* P(cj).

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


A number of tracking techniques estimate a vehicle s position from nonconcurrent distance estimates [8][14].

our goal is to extend GPS like localization for systems where beacon transmissions do not occur concurrently and submersibles are not capable of two-way communication.


In our model, we used a number of techniques to limit the size of the state space.

identical assumptions have been made in many similar stud- ies [11, 12, 13, 15, 18, 24, 25, 27, 28] so, for the sake of comparison, we make them here as well.


select the Cost factor to minimize link cost of communication link from Broker to Cloud.


Simulation results have shown that the proposed approach exhibits a better performance both in terms of coverage and the total moving distance compared with one of the best e.ective techniques in the literature [7].

the movement-validation scheme guarantees that any sensor relocation only takes place when the resulted improvement in coverage is greater than or equal to the threshold value ..


Approaches for extending this core component must therefore be broadly applicable and be of general usefulness.

in the current Internet, many of these assumptions are no longer universally true, and the rate at which such assumptions do not hold is increasing.


Suppose that the SA estimates for the K quantiles w.r.t.

st - e converges in distribution to a random variable with mean 0 and .xed variance, as t -..


QoS settings), which may prove advantageous compared to separately managed overlays.

finally, we thank the reviewers for their thoughtful and constructive comments on the paper.


use statistics to estimate the main and side lobes values for size and position, while in [7], Gharavi and Bin propose a 2D model, consisting of a pie-wedge pattern shape with circular constantgain forsideandbacklobes.

the ChannelAccess mustprovide meansforthe radiotoaccessthatinformation, since it is the entity that connects both sides.


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

algorithm HT presents our method that decides whether an incoming request ei will be granted.


The objective is to determine how well LoadSense can be used to detect the presence or absence of synthetic background traf.c at different locations inside a cell.

loadSense uses a support vector machine generated classi.er that works with a set of readily-available features, including link quality, power ratio, and the observed variation in the power ratio, to make a binary prediction of the availability of low or high throughput for the cellular client.


In the view of network management, the aim of credit scoring is to label a group of users who are in need of close watching.

the final accuracy is calculated as a Acc.


In each window we have target number m of .ow reports to be selected.

events in Bi are due to ties encompassing the (m+1)st place in the decreasing order of the zj, with .ow i being amongst those selected after tie breaking.


the International Conference on Mobile Technology, Applications & Systems 2008 (Mobility Conference), 10-12 September, 2008, Ilan, Taiwan.


For this class of users, what is relevant is the perceived QoS: as long as the QoS is satisfactory, there is no reason to move to another location.

figure 5-right reports the number of registered users vs. time for the same three APs.


Aqua adopts an infrastructure based architecture, because dedicated mixes are likely to be more reliable and can be placed in well-known locations and jurisdictions.

when a peer in the trace initiates a .ow, we simulate the protocols described in the previous section.


Non-discarding networks rely on topological constraints and virtual channels to avoid deadlock [7, 8].

otherwise the continuation is stored in the join capability data structure and invoked when the corresponding Join is called (Figure 8).


To overcome this and other limitations, we plan to collaborate with the University of Oregon in the design of a next generation Route Views project which should greatly alleviate measure-ment problems by putting measurement probes di- rectly at a few critical peenng points (to remove the eBGP multi-hop problem), and collecting full, as opposed to partial, views from their peers.

they still constitute less than 3% of the routing ta- ble and contributed to 61.8% of the total DPATH implicit withdrawals.


; r) e. d., (3) 0 where e. is the unit vector in direction .. Wenotethatforagivendestinationr thed-.owintensityJ(x, r) correspondstoavector.eldinR2.Moreover,e.g.,inameshnetworkwithasinglegatewaynodethereisessentiallyonlyonedestinationinthenetwork,andthusitissuf.cienttoconsiderd-.owintensitytowardsthelocationofthegateway.Fromtheloadbalancingpointofview,thisscenario,however,istrivial.

heat.owinaunitdiskcanbesolvedbythewell-knownmethodsofcomplexanalysis,see,e.g.,[13].Letthepositionofapoint(x, y) onthediskberepresentedbythecomplexnumberz = x + iy.Letw(z)= f(z)+ i.


Multicarrier CDMA for Future Generation Mobile Communication.

hence, these Ogold codes are also worth consideration for CDMA based next generation mobile systems.


Most prominently di.erence is RTSP is suitable for only Tree topology.

ieee 1588-based synchronization system for a displacement sensor network.


[26] A. Perrig, R. Canetti, D. Song, and D. Tygar.

a SHA-1 hash veri.cation operation takes about 15ms.


There are some outliners to the left, for which the reason is most likely the missing noise component within the e.ective RSSI.

unless stated otherwise, the driver processed packets with CRC and PHY errors and regularly calibrated the hardware.


[12] E. Stevens-Navarro, Y. Lin, and V. W. Wong.

basic Besper has an obvious problem, which is the time spent for all the calculations.


On the other hand, USB transmission protocol guarantees and allocates specific bandwidth to different types of service applications, and transmits them in a time-division approach.

the advanced proposed scheme can guarantee the highest performance as it can monitor the level of Wi-Fi MAC queue and prevent buffer overflow.


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

whenever a packet loss is reported, we use these pro.les to perform a thorough analysis to determine the cause of the packet loss.


Figure 12 shows the number of authority switches needed under vary   0 2 4 6 8 10 1 1.5 2 3 4 5 No.

with wildcard rule caching in DIFANE, the cache miss rate is only 0.1% 0.001 0.0001 Cache size per switch (TCAM entries) Figure 14: Cache miss rate.


Till now there is no standard for IP addressing to vehicles [10], normuchpublishedpapersaboutthat subject.We canbrief two of these works.

by the way,temporaryaddressesgivenbyDHCP-like serversonthe Road Side Unit are su.cient.


These challenges generally lead to an environment in which end-to-end paths may not exist and end-to-end interactions may take extended periods of time to complete.

false positives are still possible if the detectors are too sensitive given the conditions of the underlying network paths.


DIFFERENTIAL CHANNEL SENSING The number of sensing nodes Xshould ideally be equal to, or larger than, the number of channels Nin the working set, so that the channel map may be kept accurate.

both policies exhibit similar values of detection delays for the end of channel activity, as could be expected.


Journal of Hydrology, 298:112 135, October 2004.

current Operational Systems for Flood Detection While not speci.cally sensor network installations, understanding the current operational systems helps clarify the problem space in which we are working.


However, with our Bloom .lter mechanism, we cannot be sure the hit in BF 17(B)is nota false positive.

their basic idea is to use small fast memory to assist packet address lookup by reducing the number of accesses to the slow memory.


This gives a rough estimate of the average query-response message size to be 0.00006MBytes.

unsecured local updates and storage imply that the servent2 software may be easily modi.ed by malicious peers.


We divide time into intervals (a few seconds) for which we are interested in obtaining performance measures.

at a minimum, there are two types of measurements network operators typically need.


Fortunately, a popular ROM for the community (Cyanogenmod) incorporated early features into its active build allowing us to leverage the in.nite Bluetooth discoverability at the cost of installing a custom ROM on each handset in the study.

we would like to thank Sandy Pentland from the MIT Reality Mining group for his invaluable insight while we were beginning our study, Trish Smithwick and Kara Worman from Sprint for their invaluable support, Christine Broadbent for assisting with the day-to-day operations of managing the study, Margaret Pickard for serving as the undergraduate contact, numerous participants in the ERWiN REU site, and .nally Dirk Van Bruggen, Chris Miller, Nikhil Yadhav, and Salvador Aguinaga for their technical expertise in development.


(For the remaining users we did not have the data for the entire 30 days but the results are similar.)

the mechanisms disenfranchise key stakeholders including end users and the mobile ISPs.


We have presented results on the reconfigurable WCDMA Rake core and its supporting compiler that prove that C-programmable coarse-grained reconfigurable processors with a computational efficiency approaching that of ASICs at a modest area cost have finally become reality.

each finger stores symbol dumps in a deskew buffer (random access FIFo buffer) from which they can be accessed for channel correction and maximum ratio combining after all multipath symbol dumps are available [3, 4].


MEASUREMENT RESULTS In terms of performance, the 3G UMTS standard is positioned in between the 2.5G standards GPRS and EDGE and advanced 3G standards like HSDPA and HSUPA.

we have measured UMTS uplink and downlink one-way delay for IPv4 ICMP packets, con.guring the loss limit which discriminates between losses and delay singletons according to RFC 2679 to be 5 seconds.


Let us denote the data rate of carrier c for user i in time slot t with r(i, c, t).

for instance, MLOS is NPcomplete even when only one non-real time tra.c class has to be scheduled.


3.2 Design of Dynamic-TEDI ( D-TEDI) TEDIwas originallyproposedfor webgraphs anddoes notwork with weighted ordynamicgraphs.Prior work[4]presents an algorithmdesigntohandle edge weight updates onatreedecomposition, but no preexisting algorithm can handle edge insertions and deletions.

2.2 Interface Design There are two main functionalities that NetGraph will need to implement: a)query networktopologyincluding node andlink status to maintain an updated network graph, and b) compute graph queries andreturnquery resultsin aformthat canbe consumedby otherNaaS modules.


The TCP .ow is generated by a .le transfer (ftp) for the duration of the simulation.

we are interested in knowing how much headroom we have for the topologies generated by our algorithm.


have also observed the variation in degree of nodes in contact graphs [4].

routing in mobile opportunistic networks becomes a challenging task.


The clustering coe.cient of the Dispersy overlay is higher, although this does not have a big impact on the average path length.

in Proceedings of the 19th ACM international conference on Multimedia, MM 11, pages 739 742, New York, NY, USA, 2011.


6.2 SRAM Size Storing NH pointers instead of the complete NHs in the associated SRAM saves memory.

we present in Figure 14, the complementary cumulative distribution of the update overhead over the 12 hours, in FIB completion (Figure 14(a)) and FIB splitting (Figure 14(b)).


Queue size and ICMP-SQ in Standard TCP -Scenario 1 Other different scenarios were simulated presenting, approximately, the same results as the one described previously.

otherwise, the slow-start would not have .nished.


[14] TS C H U D I N , C., GO L D , R., RE N S F E LT, O., A N D WI B L I N G , O. LUNAR: a Lightweight Underlay Network Ad-hoc Routing Protocol and Implementation.

before a selector can be sent back to the destination, the XRP resolution request has to be processed.


Because of the non-invertible nature of hash functions, it is hard to determine the values of those .elds so as to make the packet follow a speci.c path in the network.

first, as the maximum di.erence value never reaches 3%, the distribution is almost equal.


802.11r 2(TRSU + TAAA) + 4TOBU HOKEY 2TAAA + 2TRSU + 2TOBU CAPWAP 4(TOBU + TRSU ) + TRSU .


At low density the simulation performs similarly to the experiments on the motes; rateless Deluge has near optimal performance while ACKless and original Deluge perform similarly.

we chose a .eld of size q =28 (corresponding to byte-length elements), which requires 256 bytes of memory to store inverses and has a probability of decoding failure of ~ 0.00392.


We showed that the last pieces problem is overestimated.

their results provide information on peers behavior, and show a correlation between uploaded and downloaded amount of data.


In each iteration, one informed node is adopted into the backbone; GK greedily chooses that informed node for adoption with the most uninformed neighbors (variations of that have as well been described in Guha and Khuller [8]).

whether or not a message is correctly received depends on the instantaneous SNR at the receiver (assumed to be constant per packet).


Categories and Subject Descriptors C.2.1[Computer-CommunicationsNetworks]: Network Architecture and Design-Wireless Communications * Thisworkwascarried out whenH.Cui wasa researchintern at Microsoft Research Asia.

we transmit 720 bit blocks in parallel pipeline style and need to maintain a 36KB bu.er at both sender and receiver end.


n nodes are placed uniformly at random in a region, e.g.

as explained in the following Sections 4 and 5, this assumes a level of com- Copyright is held by the author/owner(s).


The nodes which have a short lifetime are not found by PPM.

the percentage of nodes found by the crawler that were also found by PPM over the whole time period (8 days) is 87%.


For example, in Figure 1(a) mobile hosts aand bare within communication range (R), i.e., they are able to talk to each other directly.

any feasible solution to this problem requires one to make some reasonable assumptions about host movement and network delays, to de.ne a group membership policy, and to develop a protocol that serializes all con.guration changes.


The cell-based grouping strategy is particularly suitable on VE that can easily be partitioned into virtual areas (e.g.

the main difficulty in this partitioning is to find the appropriated cell-size.


They generally try to sustain performance by applying heuristics to reduce wireless errors.

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


The size of the Bloom .lter for simulation is chosen 2.log2 (NT ).

binary search on pre.x lengths for ip address lookup.


The BCE at the LMA contains a unique HNP per HIT_MN, which is notified to all MN s interfaces, resulting in a per-MN-prefix scheme and not a per-interface-prefix approach as in PMIPv6.

i1 is routed by LMA to the correct MAG using the information in the BCE as in the PMIPv6 scheme.


Algorithm Run1 Run2 Run3 Average DFS 100 15.06 19.88 16.86 17.27 DFS 500 9.64 8.43 12.05 10.04 SLF 2.4 4.82 4.82 4.01  Table 1: Missed Contact Percentage in VMT from DOME Scenario InTable1,thepercentage of contact misses,fortheVMT results, are shown.

we use two traces:  gps logs : These logs contain time stamped GPS locations for every bus and for each day during the collection period.


Because of the double role of a cluster head, coordinating its functions within the cluster and among the cluster heads is di.cult.

as APs are relatively static, the connectivity among the APs can be considered relatively stable and reliable.


Shortly after removing the address mapping from the table, a device broadcasts an ARP request for the recently removed address mapping, removing another entry prematurely when storing the result in the already full ARP table and triggering yet another ARP request.

unbound/unallocated addresses and pre.xes), and that drops, as well as possibly logs, any tra.c it receives.


Another need we addressed is how to make the results available to multiple researchers who are distributed.

one example scenario is the following: suppose a patient is being monitored in an assistive care environment and the sensor motes have been deployed.


@cs.umanitoba.ca Vojislav B. Mi .sic´ Department of Computer Science University of Manitoba Winnipeg, Manitoba, Canada  vmisic@cs.umanitoba.ca ABSTRACT The problem of admission control at the sensor cluster coordinator is considered in a beacon enabled 802.15.4 network.

we will focus on calculating or approximating the packet service time as the main indicator of the cluster operating regime.


The exact value of Ti is dependent on the channel model, SNR, TK and K, etc.


Based on those aspects, we introduce also the system architecture of our solution approach focusing on its communication layers that support shared connectivity for ubiquitous services.

one may have to register a special data package at the personal mobile service provider, which will offer then the possibility to use e.g., the Wireless Application Protocol (WAP) or Enhanced Data Rates for GSM Evolution (EDGE).


produces a symmetric delay space matrix, which lends itself to a study of the stationary delay space characteristics.

the intensity Figure 12: Average local density vs local cluster (star) size for different data sample sizes.


When invalidating routing table entries, destination sequence numbers should be copied from the incoming RERR [19, Sect.

cMC: a pragmatic approach to model checking real code.


Our .rst set of results identi.es which ASes are bestpositioned to perform TM completion.

figure 16: Success rate of targeted completion: fraction oftarget-visible unknowns that can be recovered in the predictor.


Besides that, the system follows conversational recommenders concepts, carrying out a conversation with the user to progressively narrow down his/her preferences.

this research investigates a novel approach for traffic monitoring in view of the context information used to provide network performance recommendations in the most productive way.


{0, 1}l0 satis.es that the random variable (µ, H(µ, w)) has .1 statistical distance from (µ, u) that is uniformly distributed over R×{0, 1}l0 and w distributed according to RA conditioned on RC .

we introduce two methods for key generation based on: (1) errorcorrection and key-veri.cation-information, and (2) the new primitive of fuzzy information reconciliators that we introduce.


(b) Camera I: Uncertainty of P when d increases in the worst scenario: 0.5 probability that P is an attacker and all V sarefarfrom P , and (c) Camera II: Uncertainty of P when d increases in the worst scenario: 0.5 probability that P is an attacker and all V s are far from P distance to the authority, the veri.er can rescan the declared position.

security vulnerabilities must be considered when the system infers rights based on the UAV s location.


1) VADD chooses the best currently available path at each intersection.


such that there is a partition of V into .

a radio station that acts both as a local radio node and as 1Since the objective according to the de.nition of our weight function is to maximize the spanning tree weight, we will assume our MST calculates a Maximum Spanning Tree, instead of the conventional minimum.


The first element of each couple is the identifier of the petitioning site of the token, Sk.

the page is turned over and the rejected site is isolated.


We did not use sophisticated techniques to resolve these aliases.

in addition, our system is robust to measurement node failures and node changes by providing bounds on the estimated loss rates.


New Transmission range for new neighborhood size  3.3 Fitness Routing Algorithm The routing algorithm performs adaptation of route selection according to different data traffic.

under certain conditions, nodes with lower hop count may not have enough energy for data transmission thus the algorithm computes the fitness level of the nodes having equal hop with the sender for relaying non-real time packets.


Decreasing consistency results in a correspond- ing increase in overall availability.

[11] K. Diks, E. Kranakis, D. Krizanc, B. Mans, and A. Pelc.


4.2 Mobility models analysis Mobility models determine the way nodes move in a vehiclebased network and, as a consequence, the connectivity properties of the resulting system.

for very low link durations (less than 5 s, as evidenced by the black line in the .gure), the two major contribu Probability Density Function 0.6 0.5 0.4 0.3 0.2 0.1 0 5 10 40 35.v (m/s) 15 30 20 2520 1525 10 5Link duration (s) 30 0 Figure 12: Speed difference PDF evolution over link duration 11 11 00 11 00 1 1 00 1 1 1 00 11 11 11 00 00 00 00 11111 1 11111 1 11111 1 11111 1 11 11 (a) (b) (c) Figure 13: Driving situations in.uencing the link duration tions come from neighbors traveling at relative speeds around 15 m/s and 5 m/s, corresponding to the driving situations depicted in Fig.


This bit rate is approximately 180kbps since on average there are 2.5 I-frames per second in the encoded video sequence and each I-frame is on average 8990B.

figure 5 shows the measured BWLOAD at the client for each test case.


The following publish to a certain distance without updating LP t i .

8(1 + max(ß, ßT )) j=0 v <T1 + d.2.+2 8(1 + max(ß, ßT )) v v = d ·.2.+2(3 2(1 + max(ß, ßT )) + 8 5) .O(d) constant  8.2 Maximum Node Speed While proving the lemmas in the previous section, we for node mulated constraints on the value of vmax and TTLi.In this section, we collect all of these constraints and present the maximum node speed for which MLS is proven to work.


MOSPF is a fairly incremental extension and builds ef.cient trees but is limited to networks that run link-state protocols.

while application layer solutions are less constrained by the operational concerns of ISPs, scaling these to a global user population with even modest per-user bandwidth requirements represents a serious investment in bandwidth, server resources, and management.


1 Hop 2 Hops 4 Hops 20 vehicles/km 0.00 4.32 9.57 60 vehicles/km 0.00 6.44 19.38 Table 5: Average number of retransmission per beacon message for single-hop and multi-hopbeaconing, a payload size of 172 Bytes and di.erent vehicle densities.

unlike TM, each reachable node is a relay in TC.


Accurately determining remaining energy capacity is essential to properly allocating energy to system resources.

we show the bene.ts of untethered CRFID operation using Intel WISP tags augmented with small indoor-optimized solar panels.


INTRODUCTION Wireless ad hoc networks have been traditionally modeled as connected graphs with stable end-to-end paths.

p m is the transition probability matrix of the embedded Markov chain for node m. Figure 3 shows an example transition probability matrix for node m that visits four landmarks: Classroom, Gym, Dormitory, and Lab.


The algorithm also has the advantage that it requires no prior knowledge of the traffic arrival rates as it is often the case that the precise arrival rates are not known.

in our model we do not consider the case when both the caller and receiver are in the same sector, which would require the simultaneous allocation of two slots to complete the call.


It restricts the number of replications to be equal to about 10%-15% of all n nodes.

since the expected time to enter in absorbing state j from transient state i is equal to the expected time spent in all transient states before enters in state j from transient state i, we can get HT as Figure 1: RENA overview Dij (x, y), which includes the routing time Rij (x)from current region i of node x to candidate region j and the waiting time Wj (y) of the relay node before encountering node y inside the region j : Dij (x, y)= Rij (x)+ Wj (y), (5) where Rij (x)and Wj (y) are both derived from the transition matrix (see Sec.


is designed to meet the requirement of a certain intersection property e in a replication system with n servers.

we observe that Pan performs in a 8Although the clustering algorithm is a popular way to elect some representatives of the network, introducing such an algorithm into our simulation may only bring more overhead to this task, without any help to show the essence of our system.


In principle, we can further reduce the transmitter s interference in these two scenarios by leveraging techniques like full-duplex [7] and interference nulling [16].

if the ratio between this average energy and the noise level is greater than 3 dB, the receiver detects the beginning of a segment.


CHANTS 09, September 25, 2009, Beijing, China.

the past measurements tells us that all the time RSSI is not always as high as one can expect it to be.


For example, in AODV, the RREQ ID and Originator IP Address in an RREQ form a unique identi.er; in DSR, the Target Address and Identi.er .elds from a ROUTE REQUEST, together with the IP Source Address, form a unique identi.er.

any signature used should be able to keep up with veri.cation at line speed, to avoid a denial-of-service attack where an attacker overwhelms the victim by .ooding it with bogus messages.


This is due to the success of inter-vehicle communication and omitting DRS.

if the slave vehicle receives information showing that other master vehicles exist, it performs synchronization between master vehicles.


Most of the additions are trivial, but introduce additional complexity into the logic and possibly also the execution model.

14th IEEE Computer Security Foundations Workshop (CSFW), pages 241 272, 2001.


Some of the possible explanations for the heterogeneity of the implemented security levels can be captured by more elaborate equilibrium models.

hence, in the context of the security game we just described, a Nash equilibrium does not seem to accurately describe observed behavior.


In order to maintain a large number of online players it is becoming essential for the game service providers to estimate game player perception and performance for their games.

in order to validate and calibrate the proposed metric a subjective game quality assessment is also proposed.


Focusing on the ISPs, we can identify two groups.

we again observe exceptions to these general observations in almost all categories.


First, when a new node N would join the group centered at node C, N will use its public key PKN as its own authentication evidence and send PKN to C. And then, C will generate a secret key SK(C, N) as the proof of C s identity, and encrypt it using PKN.

in a network, many attacks are initiated by intermediate nodes due to the need of node cooperation, as during the process of message relay, the intermediate nodes may drop, tamper, impersonate, or modify the transferred messages, so that the receiver cannot obtain the transferred messages successfully and influence the performance of the whole network.


This means that only the nodes which lie closer to the destination are taken into account and thus the packets still have a chance to reach the destination, but are routed only depending on the load.

the load is already represented by a value between 0 and 1 which denotes the percentage of the time in which the medium was not idle during the last sampling period.


Frontdoors use the MRIP to forward packets across the middle realm.

the source IPNL address tells the host who the packet came from, and the Used .elds provide a new overloaded address that should be used subsequently.


When client tra.c needs to traverse from one island to another, OEO conversion is needed at the border of these islands.


That is to say the MNs in a certain MANET often gather temporarily for certain purpose.

the cache boundaries when using compound caching sheme.


In Proceedings of the International Symposium on Object/Component/Service-Oriented Real-Time Distributed ComputingWorkshops, pages 11 18, 2011.

in the worst-case scenario, the TT frame will have to wait for the time needed to transmit the largest Ethernet frame, which is 1542Bytes.


Botnets commonly scan large segments of Internet address space, either seeking hosts to infect or compromise, or for the purpose of network mapping and service discovery.

the bot properly manages the endianness of the target IP addresses, e.g., when converting the ASCII string into binary and then when contacting the target.


The parameters for the curve were generated using a program written in C++, that makes use of the Number Theoretic Library (NTL).

[2] Kobayashi, T., Morita, H., Kobayashi, K.and Hoshino, Fast elliptic curve algorithm combining frobenius map and table reference to adapt to higher characteristic , Advances in Cryptology EUROCRYPT '99, Lecture Notes in Computer Science 1592, pp.176-189, Springer, 1999.


due to its infancy, there is a signi.cant amount of future work that could focus on adult video streaming.


Acknowledgement This project isbeing carried out under the IU-ATC project fundedbythe Department of Science andTechnology (DST), Government of India and the UK EPSRC Digital Economy Programme.

voice call request), it sends a .ow request to the root.


When n is small, the performance of LCD (LLCD) is very close to LGD (LLGD) and LRD (LLRD).

non-cooperative multi-radio channel allocation in wireless networks.


Simulation results show that such a system could increase the network performance in terms of throughput, delivery time, as well as power efficiency when used in a CSMA style MAC layer.

after this, Channel Clear Assessment (CCA) will be performed for one backoff unit.


Authors would like to thank Mickael Maman (CEA 0.6 0.5 0.4 0.3 0.2 0.1 0 Data Payload [Bytes] Packet Loss Rate Figure 6: PLR for a three nodes-network with the same UP and di.erent number of retransmissions.

the PLR is determined by the probability that at least two devices each one with the same UP value.


This behavior tends to match perfectly one of the founding characteristics of wireless networks, since sending data over the air channel is by nature a form of broadcast.

for instance, additionally to the data caching capabilities, they may be able to keep track of passing by Interest Packets, so that subsequent requests may be satis.ed more quickly by directly forwarding the said request to the correct face.


Another property exhibited by RaWMS is a self healing from partitions.

with mobility, the cost of routing becomes considerable, which accounts for the dramatic affect on the overall performance of lpbcast in terms of network messages.


The nist de.nition of cloud computing (draft).

the controller installs a default rule that drops all incoming packets to the instance (we will refer to this as the DROP rule).


On the contrary, clock calibra t tion only guarantees a consistent clock rate for 0 r(t)dt despite of different node starting times.

as a result, FLIGHT only occupies 23% of the total buffer and the remaining space is available for other applications.


[19] V. Srinivasan, C.-F. Chiasserini, P. S. Nuggehalli, and R. R. Rao.

in our case, we use the logarithmic function as utility function of sensor node s source rate, and observe that in general situation, where the source rate of each sensor node exceeds 1b/s, the network lifetime is asymptotically inverse proportional to the system parameter ..


Technical Report MSU-CSE-04-18, Michigan State University, May 2004.

we explore such effects in more detail below.


Average BER performance for MRC of Rx1 and Rx3 with PPM scheme    1.E+00 1.E-01 Average BER at Rx1, Rx3 1.E-02 1.E-03 1.E-04 0 10 20 30 40 Method B Method A  PMR C(. )

a theoretical derivation of bit error probability with OOK modulation and noncoherent envelope detection is also necessary and useful for evaluating the average BER performance.


On the one hand, 3G connectivity was deployed for reasons of greed, but admittedly gives the opportunity of some sort of connectivity to mobile users.


This means that the service is available even though some of the DENS nodes are temporarily turned off or out of communication range, and hence not a single point of failure.

it should be possible within the subscription to specify the event source by the name or ID of the source node, wild cards, like all sources or any source of a certain type, or by describing certain properties of the source node, like its location.


Without the secret trapdoor keys, it is hard to inverse the cryptographic functions to obtain protected plaintexts or signatures.

aNODR separates routing from node s identity pseudonyms.


As s = i=1 xi, the announced result follows.

u, V, W correspond to any suitable choice of t. P(X1(8)>A)= P(U >A)+P(V -W = 0).


We observe that the distribution of the number of unique IP addresses that each IP address contacts is heavy-tailed.

fastTrack data set for September 14, 2001 - top 1% IP addresses ranked by volume of data sent out.


These schedules are shared with neighboring nodes and are normally asynchronous in order to reduce information redundancy among temporal-correlation sensing data[9,42].

the neighbor table of each node would containbothincoming and outgoinglinkqualities for all neighboring nodes.


3 for example; assume that ETX priority is S < R2 < R1 < D. When R1 hears transmission from D (D sends acknowledgement), R1 schedules to start transmission after D is done.

throughput of traditional routing is better than that of OR when route length is small (route length=1).


Figure7shows the pseudo-codeof the adaptive Cmax adjustment algorithms.

in summary,this paper makes the following contributions.


The modem includes the main processor and the co-processor, which perform the signal processing functions needed at the physical layer and the MAC layer in the current implementation.

methods that build paths on-demand also are not ideal.


Meeting such constraints requires the implementation of access control for the pervasive devices and environments.

they are orthogonal, since RBAC de.nes roles in terms of the organisation managing the service, whilst our groups de.ne the identities and memberships that the user wishes to present.


We choose to perform second stage arbitration but using unweighted round-robin scheme in order to reduce the design complexity.

the north port of the white node serves 32 nodes above, the east port serves 2 nodes on the right, the west port serves 5 nodes on the left, and the south port serves 24 nodes below.


[2] H. Balakrishnan, H. S. Rahul, and S. Seshan.

is the transmission attempt rate and d is the slot length.


As a result, the value of e is dependent of f, and only f is required by our algorism.

the whole generation process is divided into 7 time slots, each representing one day.


Coding+MAC Gain The expected throughput gain with COPE when an 802.11 MAC is used, and all nodes are backlogged.

assuming perfect overhearing (n4 and n5 can overhear n1 and n3, and vice versa), n2 can XOR 4 packets in each transmission, thus reducing the number of transmissions from 8 to 5, producing a coding gain of 85 = 1.6.


Performance of Distributed Algorithm and Price of Anarchy.

typically a single channel and no interference among multiple concurrent communication links is assumed.


Under normal circumstances, as long as the host remains up, its IP address will not change.

the userdriven dynamics of peer participation must be taken into account in both the design and evaluation of any P2P application.


Note that, from above discussion, the LCT table translation scheme is an end-to-end solution for mobility management.

the current connection information is changed each time the node or its peer changes IP address.


At any time unit i, the state of the battery is represented by the tuple , where Ni and Ti correspond to the current nominal and current theoretical capacities.

since DWOP does not take battery into consideration, as shown in Figure 6, the remaining battery capacity at the end of the simulation remains very small.


it is often used by computer attackers to characterize hosts or networks which they are considering hostile activity against.


We assume that there is a probability p that a given tag would fail to reply to a query.

the number of queries sent by the reader to iden- tify n tags equals the size of the corresponding query tree, which has exactly n black leaves.


For example, type two degree in Wi-Fi networks has a direct relation to the amount of contention experienced by the node, and thus indicates 2Strictly speaking the degree distribution is, of course, de.ned on the integers.

for our purposes the more intuitive de.nition su.ces, and we refer the reader interested in the rigorous mathematical framework of point processes to [16, 17].


2. sends the HELLO packets and collects the HELLO packets from its neighbors.


SD: activate sender detection only (i.e., no D2), but take both reactions R1 and R2.

the moving speed of each node was randomly set between zero and 10m/s.


In [11], it is emphasized that the throughput gain achieved by opportunistic routing protocols is not clearly attributed to the opportunistic selection of next hops but also partly due to their acknowledgement and scheduling features which can also be implemented by traditional routing.

figure 4(a) illustrates the footprint for a .ow with back-o.


If di.erent FIBs do not have a substantial share of common pre.xes, but there is similarity among di.erent portions of pre.x sets, some solutions, such as multiroot [8], can be adopted in our approaches to merge VPN FIBs in TCAMs.

the TCAM shown in Table 2 should be con.gured into the following organization: 128K×160 bit, which is supported by the NL9512 TCAM [2].


From the model, network operators can identify network factors that may have the most impact on user engagement and make decisions to prioritize certain infrastructure upgrades.

since our collected data contains tra.c records for all types of content, we .rst need to separate video streaming tra.c from the rest.


Most theoretical operations in this network assumed a simpli.ed radio range model, in which the transmission range is represented by a perfect circle centered at the sensor location.

the Radio Irregularity Model (RIM) [16], extended from the DOI model, considers the radio interference among devices.


International Journal of Sensor Networks, 1(3/4):117 124, 2006.

lowering the energy consumption induces extra end-to-end delay, i.e., sleep delay [11].


Existing works proposed in literature use sensor association rules measured in terms of occurrence frequency of patterns.

5.2 Memory Ef.ciency Availability of main memory space is no longer a big concern; it has been shown in pre.x-tree-based frequent pattern mining techniques [18, 30] that the memory requirement for the pre.x trees is low enough to use the gigabyte-range memory now available.


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

streaming applications typically transmit a constant stream of packets arriving periodically.


In future extensions to the FP2 concept, we would like to focus on the integration and ef.cient support of further technologies, such as WiMAX IEEE 802.16 access.

most IP paging protocols focus on the speci.cation of architecture components and optimization of signaling costs without taking a mobile terminal s reduced activity into account.


Because in traditional wireless fixed adjacent channels are available at each node.

dynamic spectrum allocation has been proposed to enable unlicensed spectrum users (secondary users) to use licensed spectrum (or white space) conditioned on the interference guarantee at the licensed user.


This means that magnetic .elds are not attenuated di.erently by these media and hence can be used for communication through rock.

unlike prior work [16] using a single loop antenna, to make the network operation invariant to node placement and orientation, each node is equipped with a triaxial loop antenna (which is used both as a transmitter and receiver).


Intelligent routers [18, 15] are also capable of controlling outgoing packets by modifying received BGP information based on a given policy description, but they do not provide cooperative actions among multiple ASes and they assume special devices are available.

the scope of meta-controlled targets of MIRO and one of AISLE / VR are not the same, they do not con.ict with each other.


In this paper, we propose to use intelligent mobile agents to detect intrusion in a P2P network.

the movement of the agent can be done in two ways.


Lastly, the conclusions of the paper are presented in section 6.

the matching algorithm looks at only one level of cells round the hotspot cell.


Hence, a general purpose solution for this problem as well as other sources of uncertainty is needed.

let the sensors SlS2...Smbe described by their pdfs ps.


The number of uniquely localizable nodes swept by our algorithm is labeled as Swept.

we run Sweeps and keep track of the maximum number 0.8 of possibilities kept at any time for any node over the course of the algorithm, the mean number of possibilities kept for all nodes, and 0.7 Ratio the 95th percentile number of possibilities.


[12] Mehran Abolhasan, Tadeusz Wysocki, and Eryk Dutkiewicz.

in this strategy, each forwarding node determines a probability function to selectively drop RREQ packets based on the reachability metric at each node (i.e.


5.5 Plan Executor Once the planner chooses a mitigation action, the plan executor is engaged to take the action.

these technologies are widely available in off-the-shelf devices from major switch vendors.


Speci.cally, the issue is how to maintain a.nity when native IP anycast causes a di.erent IAP to be selected during a given client connection.

furthermore, if NAT is being used to forward packets to the target, then the proxy with the NAT state should be the proxy that handles the return packets.


Acknowledgment We would like to thank IABG GmbH and RWTH Aachen University for the .nancial support.

as is common in WSN research, solutions described so far in the literature have been very bespoke, heavily optimized for a particular application.


interval, this scheme avoids the priority reversal problem mentioned earlier.

in order for the reservation scheme to work, the size of high priority packets must be pre-speci.ed for each connection, and the size of low priority packets must be bounded so as not to interfere with the reservation constraints.


Sincetheguided tra.c is only generated by the requests of guided peers, the reports of guided peers are enough to calculate the guided tra.c volume.

asastartingpoint of our research,wetry tosolvethesecondproblem(i.e., minimizing MLU) .rst since we need to check how bilateral cooperation worksin asmall network(i.e.,intradomain) andthen can extend it to a larger network (i.e., interconnected multiple network domains).


In order to support the transmission of real-time traffic, a polling-based scheme called the point coordination function (PCF) was introduced in IEEE 802.11.

the resulting scheme guarantees priority to real-time traffic, and provides bounded access delays to real-time stations.


Notice that Equation 2 does not include T due to the dependence of our measurement reference period on the transmission/reception events for each AP (Section 3).

4.1 Experiment 1 -RSSI Summary of setup: One AP is closer to the new client but has an associated client along with co-channel interference.


The start point and the goal point were fixed and were located at (20,8) and (20,32), respectively, in all of the maps.

it is out of the scope of this paper and a topic for a further study to determine out how to predict the real available bandwidth in a bottleneck node.


Use of previous state: While learning with only system calls worked wellfor simple applications, wefoundthatthelearning was noisy for more complex applications such as Outlook and Lync, even with stacktraces.

while fast dormancy has been helpful in reducing energy consumption of background applications on mobile devices, existing approaches of employing aggressive timers can cause signi.cant increase in the signaling load in the operator s network, even for networks that supportPCH state.


For the k-downstream neighbor example, the delivery probability is the probability that s is connected to d in G(A).

each downstream user only forwards a copy of the data packet to a maximum of k neighbors who have higher probabilities to visit the destination hub selected by the upstream user (either most visited or second most visited ).


With our approach, we can compute the latency measurements with all 100 packets, except each packet s latency is estimated using the reference stream (inducing a small amount of approximation error) yielding more accurate results.

in Figure 6(b), we plot the average relative error for .ows binned by their sizes.


[14] Garay, J., Jakobsson, M., and P. MacKenzie.

in the NegotiationRequest message or in the NegotiationStep sent by Alice, the ContractDoc field will be the new ODRL Request expression.


the rest of this paper is structured as follows.


If the RL succeded to enter this phase, the network condition is considered stable and the probability for the RL to cause network congestion is small.

25 20 15 40 Flow Completion Time [ms] 80 80 CoV QueryAverage Query Completion TimeCompletion Time [ms] 20 Average Background 1560 60 PFC gain [%] CoV Background PFC gain [%] 40 10 10 2020 5 0 5 0 -20 10 0 -20 100 Flow Completion Time 3 3 2 2 5 5 1 1 0 0 0 0 REDQCN BaseQCN BaseREDQCN QCN REDQCN BaseQCN REDBaseQCN QCN REDBaseQCN QCN QCNQCNBaseRED66 20 6620 66 206620 6620 6620 (a) Query Completion Time.


bringing requested objects into main memory so they can be broadcast to clients.

information recency for low access latencies, e.g., some clients may disconnect or leave their cell, and thus may be willing to accept stale information if it can be delivered to them quickly.


A viterbi algorithm with soft-decision outputs and its applications.

the standard VA is meant for a single user system rather than PNC in which the goal is to extract the XOR of the packets.


Another rule must drive traffic through the right gateway depending on the source address.

if the client runs directly over native OS, their applications should be able to select a proper outgoing network interface, among all virtualized devices.


Figure 3 shows that the decrease of the continuity rate is slower than for the interactive service due to discontinuity issues.

after T expiry, consumers retrieve their results from PCH.


Around the 29.7th second, no ACKs are received for the packet with sequence number 44636389.

these studies mainly focus on wireless data, whereas we examine interactions between voice and data.


This highlights the importance of careful channel width assignment in 802.11 networks by accurately modeling the amount of interference introduced due to variable channel widths.

analyzing thepacketlogs fromourexperiments,we were able to identify three scenarios which would result in varying gains from antenna diversity.


k(n) k(n) 2 k (n) O has size at most n ' in networks with at 2 k ' (n) most n nodes.


)-fair allocation which is almost optimum.

j dt  1 phase 2i - 1 ends in .nite time.


VIRALNET: A WAY TO MAKE SHORT-RANGE MESSAGES INSTANTLY VIRAL Eiman Kanjo Elisabeth Platzer Christian Kittl King Saud University Evolaris, Evolaris Saudia Arabia Graz, Austria Graz, Austria ekanjo.c@ksu.edu.sa elisabeth.paltzer@evolaris.co christian.kittl@evolris.com ABSTRACT Bluetooth, WiFi, and NFC are considered to be low power, affordable and available on most mobile handsets.

the expert interviews and the discussion will lead to several new requirements for the acceptance of viral short-range broadcast services.


It further constructs a model of the foreground based on the absolute difference of the instantaneous image and constructed background.

in the second case, cameras from tier 1 should perform dutycycled monitoring over the area that they sense.


First, the secondary nodes should be able to identify the white spaces in the spectrum and utilize them.

the scheme should ensure that the SN transmissions do not cause interference to any PU beyond a certain limit and that channel sensing (to determine idle periods) is minimized to conserve energy.


This is reasonable, since we must wait longer and longer to capture the few uncommon strings that we haven t seen yet.

the principal shortcoming of existing IDS technology is the inability to handle attacks for which no known signature applies.


1http://gnuradio.org/redmine/projects/gnuradio/ wiki/Volk System A is an Intel Next Unit of Computing (NUC) platform with an Ivy-Bridge processor consisting of dual 1.8 GHz cores.

these blocks are also usually the ones which are most processor intensive.


These frequency pilots are used to correct for a residual frequency o.set.

this overhead can be made considerably small when channel coherence is very large (compared to an OFDM frame) or by adjusting the number of IA transmitter-receiver pairs.


Note that we can run multiple instances of the WiFi PHY and MAC one for each slice on the device.

it is non-trivial to design such a radio.


Intuitively, the .rst termP(X) captures the frequency of X, while the second term is the well-known cross-entropy and captures the average mutual informationbetween therandomvariables X and Y.


A natural question is if this method is any better than using a 2x2 MIMO system, which can also potentially double throughput using 2 RF chains per node.

the transmit signal is fed to the noise cancellation chip as a noise reference, which subtracts it from the received signal, after adjusting for phase and amplitude.


As mentioned above, EnHANTs fall between RFIDs [40] and sensor networks.

enHANTs necessitate rethinking of communication and networking principles, and require careful examination of the particularities of ultra-low-power and energy harvesting technologies.


from Western Michigan University, and post-graduate training at University of Illinois and Northwestern University.

he directs the Scientific Computing and Imaging Institute at the University of Utah.


In active scanning, MNs broadcast a probe-request management frame in each channel and wait for probe responses generated by APs, as illustrated by messages 1 and 2 in Figure 3.

it does require effective mechanisms for discovery of appropriate domains and for reliable exchange of configuration information across domain borders.


From(8), we concludethatlack ofknowledge of n results in no more than a factor of two slowdown.

6.2 Collision Detection-based Neighbor Discovery We next present an asynchronous version of the collision detection-based neighbor discovery algorithm.


Priority sampling is able to constrain the number of samples taken, at the cost of maintaining a buffer of k candidate samples during selection.

variance estimates can be aggregated along with the estimates themselves, even if the underlying sam pling parameters change during the period of aggregation.


With the development of recent high performance routers, this performance objective has disappeared and MPLS stays attractive mainly for tra.c engineering in the network core.

similarly to the previously cited proposals (Routing Bridge, Ananas, Lunar), we think that the right place for the interconnection architecture is at layer 2.5, because we want to organize all hosts into one IP subnetwork.


If E[BL]>tr, the value of D is set to 1 so that the next time the link is in error or enterstheE state ofFig.2,thelink willbedeclared down.

communications, IEEE Transactions on 45,6(June1997),660 667.


We set all other variables to .xed values except the map type.


If the capacity is not enough to support the tra.c load, we need to extend the amount of time the ferry spends in the vicinity of this node.

the ferry carries the tra.c to and from clusters which is an aggregation from multiple nodes.


So, the IDs belonging to di.erent models, or having di.erent designers, are within speci.c, non-consecutive ranges.

the time is assumed to be slotted and all tags have a local clock for synchronization.


As we only gathered information from people installing and .nishing the game, the results presented here do not provide any direct insight as to why some persons did not play or .nish the game.

for this user study it was required that participants come to our institute at prede.ned times to get their reward and do the questionnaire.


INTRODUCTION The availability of e.ective evaluation platforms is key to the development of high performance, reliable and energy e.cient wireless network systems.

rEFERENCES [1] sQualNet Download and Documentation Website.


POST-PROCESSING This section describes some of the post-processing applied to the traces to extract metrics of interest, including how clock skew is removed from the traces, how one-way delay is calculated, how the logs of TTL-limited packets and received ICMP messages are processed to produce round-trip times, and how the packet-pair measurements are used to estimate capacity.

since we have only the measured timestamps t ri and t si and don t know the o.set or skew, we must use the measured end-to-end delay d i.


[10] is based on a isobar mapping, which allows to build a topographic map of a space populated by sensors and data aggregation with nodes similarity depending on collected data.


UbiComp 10, September 26-29, 2010, Copenhagen, Denmark.

only three of the six were closed by proximity interactions, and are thus suitable for for the FOAF protocol.


Section 6.3 studies the effects of multiple, simultaneous forwarding loops.

workload in event of havingaforwardingloop.


After the boot process platform monitoring is conducted by CM.

same sessionID and a state change extensionS indicating that its state has changed using ServerHello.


It is natural to think of the top 2 locations as home and work for a large fraction of the population, but more generally the number N of top preferential locations determines the power of an adversary and the safety of a user s privacy.

the spatial domain approach is essentially a generalization approach which replaces a data value with a less precise one or a range to maintain a larger k for k-anonymity.


2 Mbps links with a higher transmission delay.

to satisfy the above theorem, the di.erence between Eq.


Clearly, the above theorem yields a competitive ratio of O(.a + ß log µ).

since the algorithm is truthtelling, we have bi = vi, and one feasible solution to the problem involves accepting the set P and obtaining in .


This is achieved while allowing collided packets to be recovered and inspected.

we have yet to .nd research on e.cient key agreement schemes for interaction with intrusion detection sensors; indeed, the monitoring sensors de.ned in [10] and [3] by design cannot communicate with the meters.


In this paper, we present the .rst protocol that mitigates interference from both legitimate users and jammers.

correlated jamming on MIMO Gaussian fading channels.


3.3 Training the grasper To properly grasp with the Meka hand, .rst, we have to design an input and output layers of our target neural network, as well as a .tness function to allow a gradual climb toward an e.cient grasp.

the neural networks employed in neuroevolution can disambiguate the state based on their sequence memory.


Users requests follow a Zipf probability distribution with Zipf s skewness parameter a.

keeping network tra.c load moderate is desirable without compromising the e.ciency of content delivery in CCN.


We call the set of those overhearing nodes the salvation army.

nodes in CSi would not attempt to cause interference to the communication between nodes i and j.


A naive approach would consist of handling the two problems in sequence i.e., first mapping the virtual nodes to physical nodes and, once this is complete, finding the best path for the virtual links.


Generally, the per capita birth rate of a species increases as the population of the species becomes larger.

this equation means that the bottleneck link bandwidth is shared proportionally to the physical bandwidth of each TCP connection.


ANALYZING USER ACTIVITIES Recall that our objective is to de.ne a mathematical process thatmimics the activities of IPTV users and thus can produce realisticevent series for tasks such as system performance evaluation.

we will also integrate this into our workload generator in Section 4.4.


CodeBlue [5] is another similar platform being developed at the University of Harvard.

they are identi.ed by unique identi.er number and can be sent by one sensor (relationship R6).


1) The source node, N , generates Session Key, K and sess encrypts it with Shared key, K , between the source shared and the destination.

only the node with which the link key LK is shared can decrypt the packet and hence see the packet type.


We send Probe Request frames with one or both of these bits set.

it is noisy by de.nition and thus more likely to draw the attention of a wireless IDS with its stimulus frames and might even crash some vulnerable devices.


Speci.cally, the di.erences of wireless channel characteristics are used to distinguish locations or identify location changes.

security with .ne-grained physical-layer information, in Proc.


RELATED WORK The database research community have long studied the issue of e.cient processing of top-k queries [13, 9, 14, 3, 10, 1], since they are prevalent in handling heterogeneous data such as multimedia data.

second, it calculates the sum of the bottom values on the lists sent by the nodes; let s call it t;.


In Proceedings of the IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Tokyo, Japan, pp 1 5, September 2009.

figure 1: Propagation of location packets.


Source veri.cation will generally require some state that is shared between the two ends of an association and established by the handshake that creates the association.

every FD will have a network part and a local-delivery (slot ID) part.


Sense of direction in distributed computing.

once the node ~, + 1 receives the message, it reads its content, modifies the header by replacing ~, + 1 by u + 2, and forwards it toward the node labeled u + 2.


Due to WSN s limited and non-renewable energy budget, considerable research has been conducted on sensor energy management.


The latter is often plotted as a reception probability vs. distance from the sender curve.

perhaps an even more important contribution from this paper is the methodology introduced for such vehicular communications studies.


C1 and C2 are 64 samples long and the 32-sample long CP1 is the cyclic pre.x which protects against intersymbol interference (ISI) from the short training symbols.

also traditional 2-D Jake s spectrum [36] is a special case of this 3-D model.


Unfortunately, existing Ethernet switches cannot ef.ciently route on multipathed networks, so many researchers have proposed using programmable switches (e.g., withOpenFlow)toimplementhigh-performance routing and forwarding.Unfortunately,mostOpenFlow .rmwareimplementations and other architectures do not exploit the full capabilities of modernEthernet switch chips.

the PAST algorithm performs better than the NM-PAST algorithm on an EGFT topology.


The Changing Usage of a Mature Campus-Wide Wireless Network.

hence there is already a weak tendency to upload content, most likely due to both frustration and a lack of a content-generation culture.


A possible explanation is that taxi drivers have rich experiences that help them select the area to maximize the probability of picking up, and that the location of already served passengers offers a strong indication to the location of potential passengers.

we assume that the mobile device is equipped with a radio (such as WiMax) that has a large communication radius.


For instance, an S frame transmitted at 11 Mbps is named S-11 and an XL frame transmitted at 1 Mbps is named XL-1.

the radios were con.gured to capture packets in a special operating mode called the RFMon mode.


However, the information value of repeated non-observations decreases quickly.

in Proceedings of the 19th USENIX conference on Security (USENIX Security 10), pages 21 21, 2010.


In the present paper, we show that taking a = 51r/6 is necessary and sufficient to preserve connectivity.

if node u gets a message after many messages having been lost, there will be a join event corresponding to the earlier leave event.


Of course, the statistical nature of tra.c is always changing as new applications emerge and older ones fade away; so, this e.ort would have to be ongoing.

this is generally not something that service providers have accepted in other businesses, unless required by law.


Section 5 presents the validation methodology and experimental results.

washington, DC, USA: IEEE Computer Society, 2009, pp.


the faster or the slower one), which we called master_alg_ and must be specified in the following OTcl invocation: #01= To the mean, 10= To the slower, 11= To the faster $session_name master-algorithm 11 The master receiver playout point will be taken as the reference to determine the playout point state (advanced or delayed from that one) in the other receivers (slave receivers).

rTP Rec e i v e r 1  In our simulation case, we forced a random deviation or drift in the receivers playout rate limited by ±p.


Given that most SSH applications use a speci.c encryption algorithm, this factor increases the correct detection of SSH.

the summary for AdaBoost is not as straight-forward and will therefore be limited to the total set of attributes utilized, independent of class.


a few design challenges in such hybrid networks remain open.


ARP suppression can be accomplished under Linux on a per-interface basis by setting the noarp flag on any network interface.

the TCP buffer need to be enlarged to reduce the packet loss by buffer overrun when passing the packets to upper layer, because the speed of Ethernet is much faster than the DVP network.


Otherwise, upon a packet discard, the RLC would start the signalling procedure required to synchronize RLC sender and receiver sides [2].

if thn is reached before the expiration of the timer, the current filling rate surpasses rc and therefore a packet will be discarded.


an average frequency of greater than once per .ve minutes in any eight hour period.

even small training sets give good accuracy, and additional training data give diminishing returns on accuracy.


Depending on the interface, the energy cost can be added as a deterrent for using a particular interface.

the key challenge is to not just design a scalable, dynamic and seamless traf.c management solution, but to also build an end-end system that can be easily deployed in any operator s core network (i.e.


These manifests are generated based on RFID tags on each item in the container.

these motes sense motion and light using attached MTS310 sensor boards.


One possible approach would be to include the absence of all three tuples; this would be useful, for instance, if our goal was recovery i.e., if we wanted to .nd a way make A appear.

our implementation is based on an NDlog encoding of a general path vector protocol provided by the authors of [30]; since this code was generic and contained no spe ci.c policies, we extended it by adding simple routing policies that respect the Gao-Rexford guidelines and import/export .lters that implements the valley-free constraint.


In addition to our samples, two campaigns were publicly released by the Electronic Frontier Foundation (EFF) in December 2010, allowing us to extend the data to analyse, since they employed a similar methodology to contact the servers and record the answers [13].

spanning our measures over several weeks has an impact on the picture of the internet we are seeing.


Note that by de.nition, for Eloc the horizon is always 1 since we are only considering the direct neighbours of node i.

we show that since static graphs treat all links as appearing at the same time, they do not capture key temporal characteristics such as duration of contacts1, inter-contact time, recurrent contacts and time order of contacts along a path.


This is followed by the MAC address of the native packet s Nexthop.


SIMULATION-BASED EVALUATION To demonstrate the effectiveness of RF chain management, we have implemented it in both simulation and experiment.

(a) Rayleigh fading channel (b) Ricean fading channel  Figure 3.


Instead of a computer simulation, MoteView [2], operates on a PC platform, uses actual measurements of deployed sensor networks to show a network topology and helping save time taken to check the wireless connectivity.

in Proceedings of the 6th ACMinternational symposium on Mobile ad hoc networking and computing, (2005), 309-319.


By applying the image synthesis technique, spectrum map is constructed and it is shown in Fig.

moreover, the relationship between the spectrum map and visibility is a F Fourier transformation pair, which is If (l, m) .


As far as Portolan is concerned, the main activities to be carried out are network measurement and monitoring.

since smartphones are characterized by scarce resources (battery, bandwidth, computing power), measurement campaigns submitted to the server are divided into smaller tasks.


Flow measurements comprise summary statistics that aggregate information derived from a .ow s packet headers (including the key, aggregate packet and byte counts for the .ow, and timing information) that are exported as IP .ow records to a collector.

implementation of the two-step model.Both f0 and f1 are trained using Adaboost algorithm with decision stumps as the weak learners4.


Intermediate checksum schemes in the presence of deadlines.

the message is fragmented into small blocks, several of which can .t into a frame.


For the Chelsio RNICs, RDMA con sumes less power except for 64 byte messages.

[32] J. Liu, B. Chandrasekaran, W. Yu, J. Wu, D. Buntinas, S. Kini, D. Panda, and P. Wycko.. Microbenchmark Performance Comparison of High-Speed Cluster Interconnects.


The likely loss of one s connection to established network services renders centralized repository concepts useless.

connectivity, context, and consistency are tied together.


); ... }} Figure 4: Loop nests Figure 5: Prediction accuracycomparison registrations.

the helper thread removes this information and computes its signature, which it uses to extract information from the call site hash table.


3.3 Effective Capacity of Our Proposed Scheme As described above, the e.ective capacity is the dual problem of the e.ective bandwidth.

7 plots the average energy consumption comparisons between the above three schemes, where the power is normalized by the central power-level (0 dB).


During the WSA interval, service providers broadcast WSA packets and piggyback service information and the identities of SCHs to be used.

finally, we assume that the application generating beacons schedules its beacon transmission randomly based on a continuous random variable which is uniformly distributed between 0 and Lsafety.


DTN Routing in Urban Public Transport Systems Michael Doering, Tobias Pögel, Lars Wolf Institute of Operating Systems and Computer Networks Technische Universität Braunschweig Braunschweig, Germany [mdoering|poegel|wolf]@ibr.cs.tu-bs.de  ABSTRACT Communication is crucial to the coordination and e.cient operation of public transport systems.

choosing the right sequence of next hops to minimize delay and maximize reliability is the routing algorithm s task.


ii) A new field authorized-data is added, which is a similar field to the authorized-data field of the ticket in the TGS-REP message (precisely in the enc-part of the ticket).

ad hoc nodes having Kadhocauth keys corresponding to the same intervals of time can communicate together in an authenticated manner.


2.2 Robustness and Isolation The underlying architecture of our system is a general purpose computer with an OC-48(2.5Gbps) DAG capture card [30], as shown in Figure 1.

a clear win of merged tables is that we have to perform only four table lookups per packet instead of twelve, signi.cantly reducing CPU usage.


UPDATE commands can also be used when a short address was obtained via 6LoWPAN-ND.

tESLA++ still requires delaying the second broadcast.


It is assumed that we have to monitor an area inaccessible for humans, such as a highly polluted site containing toxic or radioactive materials.

in order to compute tedgeNode for TM-MoSBoD we assume that the response schedule (used to avoid message collision in Module-I) issued by an edge node to its neighbor nodes is {n1(0), n2(.005), n3(.01), }.


We assume that the contacts between the nodes follow a product form: each node i has a total contact rate .i,and therateofcontact between nodes i and j is simply equal to the product .i.j/j .j.


The potential value of various o.oading strategies to address these concerns have been demonstrated [6, 12].

the .rst two are available in Create Session Response control message from the SGW, and the third is available in Initial Context Setup Response control message from the eNodeB.


While heterogeneous communication systems have been considered before (e.g., in some satellite networks), our solution explores some unique opportunities that arise in vehicular systems.

more importantly, when less than k coded packets are received, the receiver can scavenge whatever packets received in D to reduce the penalty of decoding failure.


[6] M. Adnan, J.-L. Scharbarg, J. Ermont, andC.

in addition, for the TT and RC frames we know their periods and deadlines, fi.


Additionally, the lack of memory of previous events indicates that the limiting probabilities of finding the system in any given state will converge to a certain value once it has been operating for a long time.

results for the 100-host MANET experiments (not shown) are similar.


Volley: automated data placement for geodistributed cloud services.

psychic and Cafe caches perform more accurately in approving cache-.ll for the right content.


[18] S. Zander, D. Kennedy, G. Armitage.

a better solution is proper authentication of the ANGEL client manager.


Bound by this constraint, mobile network operators control the traffic by restricting the users' communication demands (calls) uniformly so as to prevent too high a load on the network equipment from occurring and stopping services, and to give priority to emergency calls to police, ambulance or fire stations.

we can consider three ways of controlling traffic: 1) balancing the distribution of traffic inflow between locations in the network (geographical balancing), 2) balancing the time that traffic flows into the network (time balancing), and 3) reducing the volume of traffic.


A new field, Anycast Group ID , was added to the RREQ to represent the group of anycast servers.

how to communicate with the nearest service provider such that transmission latency, message overhead, and power consumption can be minimized becomes an important issue.


The results in this PDR section show that a channel-hopping MAC protocol achieves performances which are better than a single-channel solution operating over any of the 16 channels.

the physical layer features 79 1-MHz channels in the 2.4GHz ISM band.


Figure 10 shows that the bandwidth used more closely follows the bandwidth settings than do the encoded bitrates.


If a gene variation confers an advantage for bacteria .tness under the QSI treatment, then the natural selection would favor the spread of QSI resistance.

more speci.cally, similar to Fig.5, we add the QSI combinations every 33 mins (to allow drugs to degrade and di.use away) to the pathogen population.


We also know from (16) that if ß = 0, the CS threshold is always 0.

in virtual carrier sensing, the channel is reserved by including a network allocation vector (NAV) in the packet format.


First, we propose a remedy that will initiate another o.oading request to clouds, if the user s subsequent locations do not .t in the predicted track during speci.ed tolerating time.

in ENDA, smartphones are required only to communicate very few data with clouds, including application information and geographical locations, thus preserving more energy than previous approaches of placing the whole decision making on smartphones.


For example, eNom sets special prices for resellers, GoDaddy offers cheaper prices for bulk registration, and INTERNET.bs provides free private WHOIS protection.

to avoid mis-classifying registration events for this range of probabilities, we propose de.ning a spike as a registration size with probability = 10-4 .


4The CDMA2000 1xRTT is an example of a commercial system with such features.


In this way, the client is still able to keep most of its cache even after a long disconnection and save wireless bandwidth and battery energy.

although the cache ratio of the TS algorithm is more than doubled from T~pd~t~= 10s to Tupdate = 33S, the query delay of the TS algorithm does not drop too much (from 18.7s to 16.1s).


TRANSLATING PROXY An overview of our protocol translating proxy is shown in .gure 1.

moreover, .gure 5 is a plot of the received packets interarrival time.


It is thus a good opportunity to study the computational cost of using pseudo-realistic radio models in term of simulation complexity.

this connectivity decreases signi.cantly (i.e, high number of connex components) when increasing the interference model accuracy, from 1 to n slots, from a limited to a full model with modulation support.


ACM Internet Measurement Conference 2003, October 2003.

by de.nition, the signature query gets the highest scores, while other queries have similarly high scores.


DOI= http://dx.doi.org/10.1023/A:1013715909417  [13] Lindsey, S. and Raghavendra, C.S.

distance between a sensor and its neighbor sensor can be calculated.


In Figures 11 and 12 the probability of dropping currently connected calls are shown for policy 3.

this also might include other QoS parameters so that the degradation would go beyond simply adding increased packet delay.


As expected, the .xed-delay approach transmits the lowest number of bytes and can be seen as the baseline here.

the sender sends out a frame towards the receiver.


3.2 Layer 4 Awareness In light of the above problems the solution developed by the authors, and made available in the HPN-SSH patch8, was to make SSH aware of the transport protocol layer (OSI Layer 4).

5.4 Final Thoughts SSH, SCP, and SFTP are a set of flexible, robust, and eminently useful applications which are unfortunately hamstrung in high BDP environments.


Inputs are supplied once per cycle to a machine.

we argue that it is too coarse grain in that it does not model the combined operational objectives of multiple controller functions.


Resource sharing in advance reservation agents.

unlike BGP, in which each router has just one routing table, in SCRP, a scheduler maintains as many routing tables as neighbors plus one for its own zone.


Further reduction of the data sent to the clients may be done by the actual game code that runs on the game server.

for the worst case it degenerates into a system similar to RING [13], as each state change messages is passed from the client to the .rst server on to the second server and then forwarded again to the receiving client.


IF may appear better suited to CAIA than IR since de- tailed profiles are often available enabling high precision to be achieved.


[26] focuses on mapping IDS workloads to a set of distributed network nodes.

access to the state of the detector must be mediated by locks ( lock_element() in the example) to avoid data races.


Both [7, 12] assume orthogonal transmissions from the source and relay.

iEEE/ACM Transactions on Networking, 99 (2013).


DESIGN: IMPROVEDRONROUTING To evaluate the effectiveness of our new approach for full-mesh routing, we implemented a stand-alone version of the probing and routing mechanisms fromRON[3], using both the original link-state algorithm and our quorum routing algorithm.

(how long the system takes to .nd the optimal path to any destination.)


As a result, there has been a growing interest in the study of the capacity of ad hoc wireless networks and methods that can be used to improve the order capacity of such networks.

(7) 2 The constraint to guarantee that Eq.


Section 4 describes the datasets we use.

betweenness -The betweenness ßv of node v is the fraction of shortest paths connecting all pairs of nodes that pass through v.let s(j,k) represent the number of shortest paths between nodes j and k, and s(j,k)(v)the number of those paths that traverse node v.The betweenness of v is thus de.ned as: X s(j,k)(v) ßv = · (2) j s(j,k) =v=k.V 3.


Figure 4 illustrates the current number of nodes L with depleted energy reserves as a function of time.

tHEOPTIMALTOTALANDRESIDUAL ENERGYMULTICOSTMULTICASTAL-GORITHM The objective of the Optimal Total and Residual Energy Multicost Multicasting (OTREMM) algorithm is to .nd, for a given source node and desired multicast group M,anoptimal sequence of nodes for transmitting, so as to implement multicasting in an energy-e.cient way.


REUNITE: A Recur- sive Unicast Approach to Multicast.


performsthefollowing functions:1) obtain .lesizeinformation.

end system performance can be signi.cantly improved by optimizing the data processing path, including network interface, the fabric bus, device-speci.c protocol stacks, the operating system and user applications, Using network content download usage as an example, we have shownthatthedataprocessingpathinsidethe mobileplatform quickly becomes the bottleneck and severely limits the extentto which applications cantakeadvantageofimprovementsin network speed(seethe exampleinSection2.3).


Report Generator to produce an account of di.erences across several runs of the same control program and network tra.c scenario.


IEEE Wireless Communications Magazine, 9(4):28 39, Aug. 2002.

[17] K. Kalpakis, K. Dasgupta, and P. Namjoshi.


Otherwise, the content is not cached at this time.


Analyzing the Transitional Region in Low Power Wireless Links.

all other parameters are the same as in TECA.


When we do not know the jammer s strategy or the distribution for the number of jammers, the optimal set may be any set, because the attacker may choose to cease all jamming activities when a particular recipient list is chosen.

4 Theoretical Framework 4.1 Overview We design SimpleMAC from the ground up without making any MAC-layer assumptions.


A typical OBU with a 400MHzprocessor requires 20 milliseconds to verify one ECDSA signature.

[2] BAI,F., KRISHNAN,H., SADEKAR,V., HOLLAND,G., AND ELBATT, T. Towards characterizing and classifying communication-based automotive applications from a wireless networking perspective.


As previous work has shown both UDP and TCP are both used for streaming [4], each of the four video instances was streamed using TCP and repeated using UDP to capture the e.ect of transport protocol choice on streaming performance.

weather predictors will di.er in their e.ectiveness in mapping to distinct prediction levels that yield a reliable forecast.


Secondary intra-frame concurrent transmissions Further intra-frame concurrent transmissions can also be enabled, depending on the number of existing nodes, the FOVs of their LEDs and their positions.

if this is not the case, the primary transmission is stopped due to detected collisions.


FindAll provides a strategy for creating partial indexes of  tuples and merging the indexes in a constrained environment.

we .nd that FindAll signi.cantly improves web search performance by increasing local availability of web pages by 40%.


This meansthatthereis not enough spaceinthe chordlesscycle to place all independent nodes of D inside of it.

this limits the maximum number of chordless 2 cyclesin apattern and restricts the searchdepth.


In our deployment, TransCom clients are Intel Celeron 1GHz machines, each with 128 MB DDR 133 RAM and 100 Mps onboard network card.

they also introduce additional performance overhead, and need to rely on some form of local storages (e.g., a USB disk) for supporting the launch of virtual machines.


Each time slot is dedicated to one channel for control signal exchange.

3.2.1 RENDEZVOUS PROBLEM IN CRNS: Rendezvous problem in multi channel domain arises when source and destination have to decide the channel on which they can communicate.


Moreover, the quality of reconstructed signal is not compromised.

in the proposed data compression scheme, one frame has two types of rounds as follows: x Wavelet round x Difference round During wavelet round, the sensor nodes communicate locally among themselves to compute wavelet coefficients and minimize spatial correlation.


Moreover, Figure 3c shows that Suppressed Probing becomes more useful as the number of concurrent .ows increases.

our default topology is a two-level 12-server single-rooted tree topology with 1 Gbps link rate (Figure 2a), the same as used in D3 .


[1] proposed MMAC, a new MAC protocol that exploits communication range extension by forwarding RTS over multiple hops.

the directional reception does not affect other communication links because the signal power levels sensed by other nodes do not change.


the following two equations must be satis.ed for any ni .


5.4.3 Deallocating a Collision Slot Theobviousnext question ishow aslot marked ascausing a collision is garbage collected and converted into a free slot available to be reused.

by a mobile host knowing the cell that it is in, it can then infer the correct radio channel to use.


Furthermore, the All, SD,and RD charts show that the di.erent T1 and T2 selections did not make much di.erence as well.

wireless networks posses unignorably high link error rate and TCP often misinterprets packet losses caused by link errors as congestion.


If one of the hosts is an IPv4-only host, then the nl-router must, of course, perform NAT, which is stateful).

1A site is de.ned loosely as a private IP network that connects to Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


By following the framework, we find that the IPbased dataplane protocols over DVBH broadcast networks of the two specifications are almost the same, and could be easily harmonized.

we also observe that the XML schema definition of the current version of DVBIPDC ESG [11] has reserved the space for supporting other kinds of purchasable items in the future version of DVBIPDC ESG.


The number of users of each type (TCP/UDP) that are active at any point in a day is taken from a .ow data time series.

in Proceedings of ACM SIGMETRICS 98, pages 151 160, Madison, WI, June 1998.


We present the BVR routing algorithm in Section 3 and use high-level simulations to investigate scaling and design tradeoffs in Section 4.

a growing number of recent proposed uses require more sophisticated point-to-point routing support.


In Proceedings of IEEE International Parallel and Distributed Processing Symposium, Rhodes Island, Greece, 2006.

this unshared core distribution allows each helper thread to explore registered memory reduction opportunities fully.We show in Section 6.3 how helper threads reduce the registered memory size for each MPI task under this distribution.


As a result, the quality of this route can be easily monitored.

one important use of path monitoring is to detect when the path quality has degraded, and hence a route update should be performed.


General Terms Performance, Design, Experimentation, Security, Human Factors, Standardization.

then, AP1 sends a secure integrity check message to the supplicant in order to check the previously received data integrity.


Cases S1 and S2 are as previously de.ned (except they exclude the situation handled by S0).

'' Setting 5(sVt)to be just 5(sV)Æ5(Vt)completes the de.nition.


the example considers a network of two nodes on which the same process is running.


generally more than one, the bandwidth used in each adjacent AP will be less than the reservation at the BAP.

this is due to the possibility of not forcing enough HHOs to secure the required bandwidth, Gtransient , whereas in vho the static approach, the bandwidth reservation is guaranteed.


Hence, the computed routes canbe verylong(in number ofhops) and very expensive in energy consumption.

this is because it does not take into account the energy cost when computing routes.


In periodic hello protocol, each node emits a hello beacon at regular intervals (say every t seconds).

we do not deal with routing in this paper.


Without an I frame, the entire GoP cannot be decoded at the receiver side and the error propagates until the beginning of the next GoP, upon the reception of a new I frame.

besides the adopted approach, a basic requirement for multimedia content dissemination in VANETs, where the tra.c pattern is very dynamic and unstable, is to create a dynamic relay nodes backbone, like in [13].


Moreover, P2P and encrypted applications such as Skype not only use the port numbers dynamically, but also use the same port number for multiple applications.

conversely, C4.5 uses the largest set of attributes as a whole or class-wise.


For instance, they exploit knowledge about the human senses but also user populations, profiles and interests in traffic management.

in the delivery and network management can be used to improve not only the service but also will help managing network resources better and hence will form the basis for growth and improved services in the Future Internet.


By changing the STDMA schedule we may transfer capacity from one part of the network to another within certain limits.

.i The following parameter values are assumed: dAB =2 km, dBC =3 km, W=3.84 MHz, .i=1.5287 · 10-11 mW.


As illustrated in Figure 1, a (logical) node is the application-level representation of a physical node, and de.nes which portion of a node s data and characteristics is made available by the programmer to the de.nition of any logical neighborhood.

this construct must be mapped appropriately on the target language.


The mobile host opens the RCP-1/RCP-2 pipe between network address A/B and the address of Server-I/Server-II respectively.

upon receiving the transmission request from any RCP pipe, if there is no available space for more data in the receive buffer, R2CP returns with FREEZE to freeze the concerned RCP pipe, and puts it in the active data structure.


although the platform implements several applications, this paper mainly presents its core functionality: user-Cell-ID association tracking andCell-ID localization.


IEEE 802.11 [5] or IEEE 802.16 [7], and we denote the link CL1.

we will show in a case study in Section 3 that even if an EAP method provides all security claims, we can launch attacks such that some of the claims fail.


The heuristic merges identical siblings into one node by simply forcing the corresponding child pointers in the parent node to point to just one child node.

starting at the root which covers the entire rule space, HiCuts cuts the space in a single dimension to create a set of equi-sized subspaces which separate the rules as evenly as possible.


UDDI version 2.03 data structure reference, July 2002.

the capabilities of these tools doesn t extend very well for streaming applications.


We intend to look further into similarities between the hotspot network data and previously-collected campus datasets.

a device s association with Verizon s WLAN poorly correlates with the likelihood Figure 8: Log-log CCDF (Complementary Cumulative Distribution Function) of valid session durations.


In Section 3, we provided several examples of application logic that depends on the orderings of events, i.e., an event depending on some events that happened before it, and demonstrated how the one-to-many mapping could violate those orderings, and consequently the correctness of applications.

(b) Address translation: Ideally, each virtual network should operate in a virtual address space that is decoupled from the physical network address space and the virtual address spaces of other virtual networks [15].


14 improvement is an order of magnitude, 12.5x.

an interesting metric is the optimal time window calculated as the product of optimal window size and sampling period.


In addition to the static map, DAS also provides historical routing replay animation.

a suite of tools to help analyze complex sensor network system is desirable.


To illustrate, we present one particular example of sub-channel convergence as a function of time in Fig.9.

the BS spends a large fraction of its P frames operating on an ef.cient allocation with its probing and adaptation mechanism constituting only a small portion of it.


The total amount of memory needed for all pre.xes and 100 groups is 2.2 GB, a fairly modest amount of memory by today s standards.

of backbone routers, but is independent of the number of 5.2 BGP Processing access routers.


As D = h · ( ph )a , we have D · ( ph )-a = h. .Nß .Nß Therefore, the receiver and another sender shouldbe atleast ·(.Nß 1 D)a cells away, and anytwo senders shouldbe atleast ph () 1 () 1 () 1 aa-2 a .Nß ph ·2p .Nß Hh = D· +1 = · +1 ph N(.-1)(a-2)ph cells apart.


In order to satisfy the third conditionof ourlocation privacyrequirement, that A cannot guess the AP with probability greater than 1 , ui would |S| have to perform GenToken on all s .


If m > 1, each client edge router has to cover m times.

we pick one hub at a time; the selected hub covers (connect clients and servers through the hub) the maximum number of uncovered client edge routers.


The .gure shows the standard deviation logically varies depending on the fraction of clusters used.

of the ACM CoNEXT Student Workshop (2010).


we demonstrate that a .nite-state Markov process can adequately be used for this purpose.


Moreover, we deliberately analyzed the false negatives (i.e., the percentage of attacks our detection method missed).

supervised anomaly detection methods require a set of purely normal data from which they train their models.


We assume that destination nodes already know source nodes and source nodes also know destination nodes.

video Streaming over Overlaid Bluetooth Piconets (OBP) Sewook Jung Department of Computer Science University of California, Los Angeles 3771B Boelter Hall +1-310-206-8589  sewookj@cs.ucla.edu Alexander Chang Department of Computer Science University of California, Los Angeles 3771B Boelter Hall +1-310-206-8589  acmchang@cs.ucla.edu Mario Gerla Department of Computer Science University of California, Los Angeles 3732F Boelter Hall +1-310-825-4367  gerla@cs.ucla.edu ABSTRACT In a large scale Bluetooth network, scatternet has been regarded as the only interconnection method among piconets.


Joint Channel Assignment and Routing for Throughput Optimization in Multi-radio Wireless Mesh Networks.

ch fj rij (fj ) = argk max Tk|Bk <B c (5) We recall that, if the coherence bandwidth of the channel fj (Bc ) is greater than the bandwidth used for the signal (Bk), then the channel is .at fading.


As these false interferers are removed from consideration, the interference relationship between F1 and F2 becomes more and more evident.

when all the seven .ows are taken into account together, the beta values in Table 1 suggest that all the other six .ows are the interferers to .ow 1.


Like many telecommunications protocols, LAESP is de.ned using ASN.1 [18] notation, allowing a humanreadable description to be compiled into routines for unambiguously marshalling of messages across a network.

the scope and severity of the vulnerabilities embedded in the standard is both surprising and disturbing.


Both these systems operate in the 2.4GHz Industrial, Scientific, and Medical (ISM) radio frequency band (i.e., 2.400-2.4835GHz).

ation.org Bluetooth specifications define ways for which each device can set up multiple connections with neighboring devices so that communication can be established.


Furthermore, sensors are likely to fail due to hardware faults or energy depletion caused by excessive communication.

we observe that as x increases, P x increases rapidly.


Second, we study the cache interference by running the SPEC CPU2000 suite on the first core and dedicating the second core for Iperf.

eINIC ARCHITECTURE The highlevel architecture of the EINIC system is illustrated in Figure 1.


If a vehicle or roadside entity transmits a safety message (i.e.

section 7 describes an implementation of the protocol in NS-2 [3] and the simulation results.


In this paper, we take a deeper look into service composition in a converged Web 2.0 Telecom ecosystem, consisting of Telecom functionality, 3rd party o.erings and several categories of developers and users.

some enterprises have taken a step in this direction.