An optimal schedule can always be constructed that uses (at most) L + 1 transmission groups, but this is only true if the system can support variable-length time slots.

the cross decomposition approach allows us to incrementally construct a schedule with .xed time slot lengths.


By construction, this would allow multiple faults to be bypassed without loops, whereas most local repair schemes [25, 8, 19] target the common case of a single failure and may form transient loops in other cases.

de.ections are not a complete solution as they do not address transient loops due to inconsistent forwarding tables.


Primary radio nodes are the legacy users and they have the high priority to use the channels for communication.

cognitive radio nodes can only use the channels when they are idle i.e.


Figure 2: DFNC performed at an intermediate node Now, we have an alternate approach to re-encode packets at the intermediate nodes.

this alternate approach could be complex, as performing complete degree-reduction is not easy.


(B(k)(R)), to emphasize the dependence of the objective function, the SIR, the extended gain matrix and its spectral radius on R. In what follows, we also assume that (A.10) V(R)is irreducible for any choice of R. Thealternating optimizationprinciple mentionedabovewas also applied in [9] to .nd an optimal allocation of transmit powersand receivebeamformers.

as thealgorithm of [9] is not amenable to distributed implementation, we limit ourselves to pointing out the following: It seems that the algorithm can be extended to include the background noise and the individual power constraints by considering ¯ the principal left and right eigenvectors of B(k)(R),k .


In fact, at NERSC the volume required with Te = 1h is no more than two times that with Te =1m, due to its intermittent bursts.

with a cutoff we do not see any signi.cant spikes in the volumes.


We can extract the data from the tcpdumps that we already collect.

due totime constraints, wehave notyetperformed this analysis.


proved this in [2], and although their work is not based on WSNs, the trend is still same.

the use of a multi-hop network is the main advantage of sensor network, e.g.


For example, if the output video stream has lower bandwidth than the input stream, then the program should be run on a gateway that is close to the sender.

if the program outputs a higher bandwidth stream, the program should be run close to the receiver.


We observe that when K<S theBS sharing techniqueperformsbetter thanBS selection.

when KS, the performance of the BS selection is strongly superior to BS sharing.


In summary, in a single channel random network, the transmission range is chosen to be large enough to ensure connectivity.

in the case of multi-channel networks, the transmission range has to be chosen such that it is su.ciently large to ensure that all channels are utilized, in addition to guaranteeing connectivity.


When the BGP-controller worked with no given policy, which means it acted like a route re.ector [6] of these three routers except the inference and con.rmation actions, the initialization phase requires additional 77 [s].

the BGP-controller took only about 6 [s] for receiving all data from a single quagga router.


This signi.cantly decreases network scalability.

when the width is too wide, the cost to store/forward messages and to scan the rail nodes to .nd relevant data will signi.cantly increase.


Observe that at 500 kbps, the video can be transferred from one vehicle to another much faster than at 100 kbps, which increases the chances for more frame deliveries.


As expected, the results presented in the two tables show that the highest energy expenditure is obtained with the FLD scheme, while the highest access latency is given by the NC scheme.

it is interesting to notice that the FLD and the NC scheme have almost the same total cost in both the scenarios.


Such approaches may change an object s original appearance, and easily distract user s attention as the user has to intentionally look around for the tags.

computer vision based object recognition must overcome the variability in textures, lighting conditions, etc, that normally exists in user s environment.


From Figure 7(b) we see that in some cases fairness was improved at the expense of total rate.

in the runs on the right side of Figure 7(b) we see that we have improved both the total rate (mean rate) and the fairness (the rate of weakest .ow).


It would be interesting to investigate the impact that a truly dynamic network would have on those approaches and how a presence detection system can improve the situation.

for some applications it may be possible to compress presence information even further using a more aggressive aggregation strategy.


For any node i, if its next transmission failure occurs during the fast recovery period of its previous failure, ri follows the AIMD rate control.

if no transmission failure occurs during the fast recovery period, the sample path of ri can be represented with an effective decrease of ei for the previous transmission failure (as shown in Figure 2).


6.3 Impact of Step-counting Accuracy From our experiment, we .nd that the pedometer accuracy is below 97.8% when the smartphone is inside the user s front pocket.

the step-counting errors can cause poor estimation in the step length and make the underlying Dead-reckoning system miscalculate the turning time.


In 2009, our identi.cation of Websense in Yemen led to the vendor discontinuing support of their product for the Yemen government [35].

netsweeper stated that is not against their company policies to aid foreign governments in implementing Internet censorship.


Such an idea of the cloud as a sort of computing utility has become a reality owing to the recent advances in Data Center (DC) technologies.

in order to cope with the exponentially increasing number of cloud service subscribers especially mobile cloud users more advanced networking infrastructures and technologies are expected to be deployed for both intra-DC and inter-DC communications [2].


The concerns in this scenario differ from what we consider in IMP s current long-term budget approach, because of the added goal of saving the user money, the smaller units of data for which money is spent, and the fact that less money spent is always favorable.

this scenario can still bene.t from IMP s .xedbudget adaptation strategy for each allotted unit of data.


Since in Massouli´e s model each packet leaving a link must that this .uid system is the the same as our proportionally have the same routing behavior, it is not immediately clear fair .uid model: that the result extends to multiclass queueing networks where xrj- (t) r routing depends on a packet s route-class.

the fol lowing lemma makes this possible Lemma 1.


We also observe that this measure converges for all methods as the number of targets increases.

from Figure 7(b), we see that while the execution time for CF-variants only slowly grows, it experiences a large increase for Dual-Smp.


The k-barrier coverage can be constructed after k baselines have been fully covered.

there exists some problems as below could be not solved effectively.


As such, the entire ecosystem is as fragile as the weakest CA.

because there is no central, public registry of browser-trusted intermediate authorities, the organizations that control these signing certi.cates may be unknown until certi.cates they have signed are spotted in the wild.


As a result, they move away from items 3 and 4 of the IP-routing-based approach described above.

they still fully adhere to items 1 and 2, and therefore su.er from all of the associated shortcomings.


Thus, con 7 8 gestion window W with BQM is drastically reduced(a= ) A simple network topology is chosen to make it easier to than with normal TCP.

it will take W RTTs to understand the congestion network environment.


In particular, it eliminates data transmitted over the last-mile, i.e., the radio access network, which is known as the performance and resource bottleneck of a cellular network [31].

a network cache does not bring the aforementioned bene.ts but can cut the wide-area latency and enable sharing across users.


This has enabled the introduction of UHF TV services, which provide low-powered television broadcasting and where the signal transmission coverage is more relevant than the data rate.

uHF TV signals are sensitive to external noise and the signal strength reduces over long distances.


In general, in order to cope with this threat we could assume that nodes are tamper-proof.

consistently with a great deal of the literature, we will assume that nodes do not have tamper proof components and that they can be captured.


Many references (e.g., [4]-[6]) concentrates only on the above two extreme cases, i.e, with either the in.nite delay bound or the zero delay bound.

the realistic systems usually tolerate a certain amount of delay for various services.


(9) In order to predict how many collisions will occur over link ij, the fraction of time of HN s T X ratio during V P is estimated.

in the case of multiple HNs, variant HN s T X ratio s should be considered to re.ect the variant e.ect of variant packet sizes and data rates over the estimated num ber of collisions.


For instance, the feature percentage of connections to different hosts (srv_diff_host_rate) is highly related to a DoS attack while hardly related to a R2L attack.

in Equation (2), we don t treat these features differently in distance calculations according to their own effects on detection performance.


They also provide solutions in order that only one receiver (called the leader) responds with a CTS or an ACK.

these solutions are only convenient for low mobility wireless stations, i.e., when there is no need to change the leader.


Successful fraud attacks that degrade a good AP s reputation (or contract its 0%-loss SNR range) are harder to correct because honest users may be dissuaded from using that AP.

since cost, venue, and other external factors will in.uence selectionsinpractice,webelieve some honest users will eventually report on these APs and correct their summary statistics.


Although the costs of the proposal are quite restricted, our scheme is even lighter (it only requires an HMAC).

the key management structure or Ersöz proposal is based on a Logical Key Hierarchy (LKH) architecture in which users share a common key that has to be changed and re-distributed when the group of cognitive radio nodes is modi.ed.


Ants tend to move along paths of high pheromone intensity and release pheromone during theirpassagethusreinforcing thepheromone trail.

pheromone evaporates allowing the system to forget old information and randomly search for new solutions.


s distributed DSS version in our setting would thus generate unnecessary overhead.

the distributed DSS signature scheme introduced in this paper is tailored to the speci.c setting of roaming in which one of the signing parties has complete power over the other.


Most of these tests examine the behavior of TCP implementations on the web servers.

the tests are not restricted to TCP (e.g., the Path MTU Discovery [22] tests).


In this sense, they extend the IGMPv3/MLDv2 protocols for implementation in the mobile domain and improve Proxy Mobile IPv6 to handle multicast e.ciently.

they do not consider any modi.cations across di.erent access networks.


3(b)) and t far apart from a while maintaining their blocking relation, then |at|could be way larger than 2|ac|.

because no pair of nodes has their separation larger than d(G), we have |at| = d(G) |at|=d(G) and consequently TCR(a)= |ac||ac| .


The loss ratio threshold-based scheme seems similar to the one used in ONOE [12].


A mother wavelet is dilated by powers of two and translated to obtain orthonormal wavelet bases.

in the context of network monitoring, we seek to ef.ciently represent a function (performance metrics) de.ned on a network topology which does not, in general, have a regular structure, so standard wavelets cannot be directly applied.


Also, wireless local area network(WLAN) technology has been replacing the role of the access network that was performed by Ethernet technology as WLAN technology develops.

the original WLAN technology has been mainly designed for data applications and does not provide any quality of service(QoS) support such as guaranteed delay, jitter and bandwidth for multimedia applications[1].


For the former two transmissions, if the overlapped links do not exceed the link capacity, both are allowed to transmit according to rule 1.Otherwise, the one with a heavier workload is delayed, and the other is preferred according to rule 2.

the lighter transmission still needs to satisfy rule 1.


We see that the smallest rates of the high-power .ows are comparable for all three MAC designs, even in presence of a large number of low-power links.

weeble MAC assigns signi.cantly better rates to the smallest lowpower .ows.


Only from Equation 2 and 3, we get nexthop(n,t)=F at a = 0, which means that no next hop exists.

in reality, the nexthop di.eres from what we have expected.


Table 1: Distinctions between HLP and BGP Design issue BGP HLP Routing structure Flat Hierarchical Policy structure Support for generic policies Optimize for common case of policies Granularity of routing Pre.x based AS based Style of routing Path vector Hybrid routing Convergence andRoute Stability: To provide reliable reachability, Internet routes shouldbe relatively stable and, when a change is necessary, they should quickly converge to their new steady-state.

bGP is known to su.er from signi.cant route instabilities, route oscillations and long convergence times.


The presented implementation of BISS uses public-key cryptography.

this protocol can be equally implemented with symmetric-key cryptography only (e.g., this can be achieved by replacing the nodes public keys of nodes with authentic Tesla keys).


One could think of tackling the problem using a virus scanner or an intrusion prevention mechanism.

the multi-processor systems-on-chip that lie inside modern routers have relatively small amount of available resources.


Note that RCSP requires positive edge weights, while the weights introduced in the reduction are negative because the CMBBM problem is a maximization problem.

since the so constructed multigraph is acyclic, the RCSP problem is well de.ned even if the edge weights are negative.


If BGP later becomes interested in address 128.16.32.7, it does not need to ask the RIB because it already knows this address is also covered by 128.16.0.0/18.

if BGP asks the RIB about address 128.16.


When no .ow control is enabled (red curve), the size of the congestion window has a periodic, sawtooth like, evolution that is a consequence of the TCP fast retransmit approach to window size management.

when PFC is enabled (blue curve) there are no more dropped packets.


It is not obvious, after all, that networking protocols are like children that they thrive in the normal course of events.

given the abundance of protocols which have been standardized and the much smaller number in common use, one might reasonably conclude that withering away, rather than thriving, is the normal fate of the average protocol.


In short, OD allocates n = M - p RBs to the macro eNodeB, while pico eNodeBs share the other p RBs among them.

in CCD all eNodeBs use all the available M RBs.


One possible cause is that the CPUs are causing memory livelock by polling the packet descriptors in main memory at too high a rate, preventing the DMA controller accessing memory.

when we use the CPU cycle counter to reduce the polling rate this has no effect on the forwarding rate.


This approach simpli.es the re 1Both direct sequence spread spectrum (DSSS) and frequency hopping spread spectrum (FHSS) are included in the IEEE 802.11 speci.cations.

since DSSS has more desirable properties than FHSS, it has been favored in recent wireless standards, including IS-95.


It is called power-efficient gathering in sensor information systems (PEGASIS), which minimizes the energy consumption at each sensor node [11].

little effort has been made for the optimal cluster head distribution, which is an important factor for communication energy efficiency.


start values is the key for an e.cient contention resolution mechanism.

this is not so: if there are only a few SSs taking part in the contention resolution, then a small backo.


There also exists software for the management of CMDBs, which is able to export systems monitoring con.guration .les to Nagios (e.g., 3http://www.lilacplatform.com/ 4http://sourceforge.net/projects/monarch/ 5http://sourceforge.net/projects/ncpl/ i-doit6).

none of these solutions integrates into a Semantic Wiki and none supports the use in a collaborative environment.


They use a game-theoretic approach for managing interference.

their approach does not consider a number of important issues, such as the need for new cross-layer routing metrics or new relay node selection schemes able to handle different QoS levels according to the application priority.


At different timeslot instance, a node may choose different channels, thus appearing at different layers.

based on our channel assignment protocol, the set of layers that a node can appear is pre-determined by the set of g channels it was assigned (its radios will always choose f channels from these g pre-determined channels).


Four access categories (ACs) for EDCA We do not present all the details of the 802.11e MAC.

basically it is expected that the 802.11e can provide different types of QoS support in the WLAN environments.


From Figure 8 which shows the receiving and sending rates without adaptation, it is obvious that as the channel SINR changes, the throughput to user 1 varies.

the sender does not adapt its sending rate to the varying throughput situation but keeps the sending rate higher than what the channel can provide most of the time.


Reducing the 3G tail time and reusing the TCP connections have fixed energy savings, independent from incoming email size and inbox size.

the energy saving of other techniques may depend on the email size or inbox size.


Today, it is easy to share and virtualize compute and storage resources effectively.

implementing network virtualization with bandwidth guarantees on a shared network infrastructure is an inherently complex and challenging task [3 7, 18, 45], which requires three key technologies: 1) An easy-to-use network abstraction model for tenants to accurately express their bandwidth requirements; 2) A workload placement algorithm that ef.ciently allocates datacenter resources to meet the tenant requests, and 3) A scalable runtime mechanism to enforce the bandwidth guarantees and utilize unused bandwidth ef.ciently.


That is, the hidden terminals are required to keep silent during data transmission.

because of large propagation delays in underwater, a successful channel reservation is costly, making this transmission strategy fairly wasteful.


More details and extensions of the DAA approach can be found in [20].

dAA can not guarantee that all packets will be aggregated into one packet.


Several reliable and energy-efficient flooding mechanisms were developed in recent years.

they still have some trade-offs between transmission reliability and energy-efficiency in the flooding messages.


Results from parallel architecture literature might be applicable here.

the load on parallel  machines is primarily scientific computations.


Such a scheme will give more accurate estimations but also incur much more control plane overhead, and therefore it is only suitable for small scale DTNs.

in this paper, we target at large scale networks and later our simulations show that with only one-hop information, it already can greatly help the routing decisions.


If the update message is valid, the R2 doesn t need to notify other BGP routers within the same AS.

if the update message is invalid, R2 sends a new update message to the RR and the RR propagates the update message to all BGP routers within AS so that all BGP routers know the previous update message is invalid.


From paths in BGP tables, one can only infer from an adjacency between two ASes in the AS-level graph that the two ASes connect somewhere.

using Rocketfuel topologies, we can infer where and in how many places these two ASes exchange traf.c.


Since the number of hops is usually related to latency, having a low hop count is, in general, desirable.

this variable does not directly refer to the bandwidth of the path nor to the concentration of routes.


When an attacker attempts to hack into the software-programmable processor cores of the system, they may succeed in changing the processing behavior of the system.

the monitoring systems in the packet processor can detect this change and trigger a response (i.e., packet drop and system recovery).


RSSI obtained from larger frames would tend to miss low RSSI values since the corresponding frames may not be successfully decoded.

drivers vary in how they perform sampling.


Nodes located on the .ow path would be able to fairly queue routing beacons and Flush traf.c.

nodes located off the .ow path, but within interference range of the .ow, would not be able to contend for bandwidth and successfully transmit beacons.


5.5 Drifting Traf.c Demands Up to now, we have assumed that the traf.c demands are static, even though the workload itself is bursty.

the ultimate reason for deploying a traf.c engineering protocol is to adapt the routing quickly to traf.c changes.


IEEE 802.16 also has provision for a distributed scheduling algorithm for mesh mode of operation.

forthepurposeof thispaper, we consider only the centralized scheduling techniques.


Up until the outgoing link saturates, their share is equal.

after the link saturates, the share becomes increasingly unfair.


Note that in such a set-up, the message overhead imposed on the NM(s) would be similar to that imposed on domain controllers in the SANE project [8] and one could use their results to claim that even this can scale.

for a lot of tasks, the NM can use existing control protocols.


As a result, the hubs only need to exchange message IDs, which reduces the auxiliary data overhead.

since the hubs decode messages, the computational complexity increases.


Other nodes that have a copy of this message continue to disseminate the message until they reach the sink or they need to discard it because of cache over.ow.

in the case of transmitting to direct neighbors, the selection of ß and which particular ß neighbors get a copy of a datum requires careful design.


Note that TCP will follow the two logics:advertise window cannot exceed maximum receive buffer size and sending window is the minimum between congestion window andadvertise window.

therefore, the limitation of maximum receivebuffer size will eventually prevent TCP sender from over-shootingand avoid the excessive growth of end-to-end latency (e.g., RTT).this simple hack brings in sub-optimal performance issues due to the highly dynamic nature of mobile data access.


The results were as follows: 15 % P2P Tra.c: 0% False positive, 0.29% False Negative, and 0.17% DK  25 % P2P tra.c: 0% False positive, 0.31% False Negative, 0.156% DK  40 % P2P tra.c: 0% False positive, 0.34% False Negative, 0.149% DK  Even if we add all these probabilities together (as the probability of misclassi.cation), the probabilities compare very well with the misclassi.cation probabilities reported in [10] for the heuristics themselves (for example, false positive rates of 6%).

the slight loss in .delity is compensated by a very large factor reduction in memory (from 96 bits per .ow in the naive scheme to 18 bits per .ow using ACSMs).


Since the number of sub-channels in a practi log(2N) cal OFDM system are much more than the number of users, DIV2 can be expected to provide good performance.

when K is larger or comparable to N, the worst case performance can be arbitrarily bad.


In this case, the selected next hop nodes are most capable of carrying messages to the closer nodes to the destination.

spray and Wait just makes a copy to the nodes around, thus it failed to deliver most of the messages in our experiment.


The DCH transmission is not taken into account in this study.

the HSUPA transmisson needs the DPCCH which is used for uplink power control.


Several previous arts work on linear models, the representative one of which is Vivaldi[6].

they use Euclidean distances which holds the assumption of no TIV.


Topology information disclosure is not a threat by itself, but it can make other attacks more efficient.

encrypting routing information could greatly increase the overhead.


[28] develop a system for detecting anomalies based on sliding window statistics in mobile ad hoc networks (MANETs).

their approach requires nodes to share observations with their neighbors, and so may not be suitable under the privacy constraints inherent in community sensing.


There have also been selected works that deal with mutual interferences directly.

all of them did not re.ect the physical situation accurately.


It occurs if two nodes cannot communicate with each other because they operate on different channels.

the deafness problem plays a minor role in MCExOR.


The .ash usage of TinyOS grows larger when there are more events, due to its redundant code for Figure 8: The usage of .ash memory locality awareness.

lA-TinyOS only slightly increases its .ash usage and uses less .ash memory when there are 3 events or more.


The authentication process combines 802.1X authentication with key management procedures to generate a fresh pairwise key and/or group key, followed by data transmission sessions.

802.11i requires a WEP user to upgrade the hardware in order to use the strongest security mechanisms.


Only[22] considers the use ofintra-.ow coding asinMORE to avoid duplicates without coordination.

it recognizes the signi.cant challenges of applying inter-.ow coding to general opportunistic routing, so it only supports opportunistic receptions over a singlepath.


4.3 Route Optimization It is sometimes suggested that a large proportion of the peering links between large carrier ISPs (tier-1) could emerge as bottlenecks, due to the lack of economic incentive to provision these links and the large volume of traf.c carried over them.

our measurements seem to suggest otherwise.


Since the devices are carried by humans, one of the main challenges to consider in opportunistic networks is the human mobility behavior.

little work exists on how the social behavior of people drives their mobility behavior and how this context information can be systematically leveraged for opportunistic networking applications.


Network simulators (e.g., SSFNet [7]) help operators understand dynamic routing protocol behavior, but simulation represents network behavior in terms of message passing and protocol dynamics over a certain period of time.

network engineers usually just need to know the outcome of the path-selection process and not the low-level timing details.


According to this idea there are some licensees who are authorized to use the spectrum by the related o.cial systems such as FCC in the United States and some other users who do not have the license to use the spectrum of those primary users.

the secondary transmitters should not degrade the communication quality of service of the licensees and thus they should adjust their transmit power so that their interference in.icted upon primary receivers be less than a speci.c threshold set by primary users[1].


Each agent must now co-ordinate with peer agents in other ASes to arrive at a conclusion about the cause and location of a failure.

the declarative nature of the policies enables meaningful communication among the agents during argumentation.


the implementation of context is far cheaper than a garbage collector, in fact cheaper than the malloc/free in a normal program: the cost of memory allocation can be con.ned to constant time using a stack based mechanism.


So far, our discussion of interdomain routing has focused on designs that maintain the current Internet service model of sending and receiving packets to destinations (which themselves might be unicast, multicast, or anycast).

once we insert this level of indirection (through the label in the packet), the service offered by a new routing system need not resemble traditional routing; for instance, such a mechanism might offer a pub/sub interface (as in DONA [11], CCN [10], and other Information-Centric designs).


In order to avoid heavy overhead of control messages researchers try to localize those algorithms by using only the location information in 1-hop.

a drawback, local optimization, is involved in most such localized coverage algorithms.


Alternatively, dAPs in each cluster can run CSMA independently and start synchronous netMIMO transmissions if they acquire channels simultaneously.

such opportunities are rare due to the decentralized and Figure 3: In an unbalanced topology, concurrently serving two clients results in underutilization of the dAP s power budget, leading to low-rate for both.


This issue reveals the fundamental limitations of TDMA (in a distributed manner).

we claim that slot schedules that remove interferences only among those within a two-hop communication range are still useful in enhancing the performance of MAC.


In our ongoing implementation on real nodes, we follow this approach and let the agent handle its energy consumption internally.

using a lower migration rate (lower than the Table 3: False-positive rate for the .ooding attack No.


Since there are L{1,2,...,m} time slots left after the server accomplishes jobs from the .rst m clients, we have: E[pm+1|S, L{1,2,...,m} = s] =P rob{the job of client m +1 is accomplished in t - s attempts} =1 - (1 - pm+1)t-s .

since L{1,2,...,m} - L{1,2,...,m+1} is the number of attempts that the server makes for a job from client less applications, we believe that WLANs can particularly bene.t most from our study due to their wide deployment, and increasing demands of QoS support.


A recent paper [3] has investigated how to combine on-demand routing and delay-tolerant routing1 in intermittently-connected ad hoc networks.

the solution proposed in [3] is basically an extension of the AODV routing protocol [12] to cope with network partitions.


2.5 Complexity and Overhead The NSV edge identi.cation, network partitioning and projection are all done locally by the individual nodes, thus resulting in a constant computation complexity and communication overhead.

to initiate projection, a local .ooding is required in all individual patches, which together yield a communication overhead of O(n) in the entire network, where n is the total number of nodes in the network.


1 Introduction The IEEE 802.11 wireless local area networks (WLANs) have gained extensive consumer markets for high-speed wireless Internet access.

the current 802.11 medium access control (MAC) protocol does not provide quality of service (QoS) guarantee.


This alternative route discovery phase adds considerable overhead to the protocol.

it guarantees that the nodes will participate in the route discovery phase even if they know in advance that they will not be on the shortest path.


In normal circumstances, we believe this is an acceptable design point.

if non-malicious, but information hiding, routing infrastructures become popular, such as described in [22, 35], then this issue may need to be revisited.


Assuming that the work.ow W involves N tasks, t1, t2,..., tN , where t1, t2,..., tq-1 have been activated and tq is the current task to be accomplished.

according to user-task assignment plans generated in the planning phase, some dynamic constraints are violated.


[5] studied the transistor-level analog device and interconnect matching problems.

that work does not focus 2 1 j ) j ) N layer(sj ), for each segment j, 1 = j = kn.


The encryption of the R-SSID in the Probe Response provides rudimentary access control: only authorized clients are able to decrypt the fresh R-SSID.

this is not a strong access-control mechanism, because the attacker could sniff an R-SSID from the Authentication Request of an honest client.


That is, the responder does not normally update any IPsec SA without receiving an explicit UPDATE SA ADDRESSES request from the initiator.

if a SPI collision occurs in the new AR, when the mobile node will initiate a MOBIKE exchange, the new AR will not be able to handle the request.


If ci is very low it is worth becoming an insider independent of technology penetration.

if ci is relatively high compared to co,users lose the incentive to join.


On the USRP platform, real-time decoding is possible with a VA decoder.

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 issue worth mentioning is that modern cellular systems have four or more modes, i.e., they can support up to four or more di.erent channel rates.

obtaining succinct analytical expressions even for three is quite dif.cult.


Business model transformation: Current wireless network is a vertically integrated business where all aspects of wireless service offering acquisition of licensed spectrum, deployment of network, marketing and management of customer facing service are integrated into a single entity.

forces of sharing and virtualization can gradually transform this.


At M=5, it achieves the best lookup count saving of 20.21% at the penalty of the largest FIB expansion of 6.45%.

both M=4 and M=6 show quite similar lookup savings and FIB expansions as M=5.


Hao and Ito even propose a mechanism for dynamically adjusting OSPF weights [19].

changing weights too often increases the number of times that the intradomain routing protocol has to converge, and has an impact on the interdomain routing.


Operators (displayed as dashed boxes) are push-based and are used to integrate custom data-processing into the system.

services (displayed as solid boxes) follow a requestresponse paradigm and are used to implement customized system behavior in terms of service functionality o.ering.


In general, the measured strengths of RF-EMFs in urban environments are considerably below the exposure limits that are known to be hazardous [2].

many e.ects of RF-EMF radiation on the human body are not well understood because there is a lack of long-term and large-scale epidemiological studies quantifying these e.ects [10].


luf is again time-varying and typically zero during normal operation.

we are interested in luf during the most stressful period for network load.


its load vector is YB Recall that users can be parti= B } and its corresponding NBV is B = {1,1,1,2,2}the association X ' presented in Figure 3 has the {1,1,tioned into fairness groups.


First, as expected from previous work, we .nd an extremely slow rate of .xing, with 30% of the hosts vulnerable when we began our survey on day 4 after disclosure still vulnerable almost six months later.

unlike conventional vulnerabilities, which typically show a short, fast .xing phase, we observe a much .atter curve with .xing extending six months after the announcement.


One Chord network model, with its non-central control, strong scalability, load balancing, fault tolerance, and to make inquiries with high directivity makes the advantages of P2P is more prominent.

in reality, Chord ring there is a big difference between the nodes, there are many weak nodes in Chord when nodes as independent, but also responsible for a large number of queries the system and downloads.


8(b) shows the PSNR of the received video both with and withoutinterferencefrom ourUSRP-based802.11implementation.

the .gure shows that at the closest two locations, which are less than6feet awayfrom the802.11interferer, the videois not watchable.fortherestof thelocations,thevideoquality stays watchable.


ARIADNE proposes a clustering-based search algorithm for the indoor localization of a mobile user based on the following .nd ings: ARIADNE constructs .ne-grid signal strength map SS-MAP based on the radio propagation model and the site-speci.c geometry of the building;  The SS-MAP from the propagation model provides real-time estimates without further human intervention.

it is only a close .t to the measurements, or in other words, it is imprecise and small estimation errors are expected for some locations;  Consequently, LMSE may result multiple possible locations in the SS-MAP table, or the unique location corresponding to the LMSE is not necessarily the right position;  If a set of positions (corresponding to low mean square error with respect to a predetermined threshold) is selected, the positions can be grouped into several clusters.


As in the worst-case scenario, the results show quadratic complexity with the CPU time being half of the wall time.

(a) Individual sections are visible using high resolution sample sizes.


map addresses, making it amenable to parallelization, while Minshall s requires a data-structure to store the mapping as it is created.

anonymizing con.gs requires that the IP anonymization scheme has the properties discussed earlier, such as being class-preserving and subnet-address-preserving.


Thus, Wi-Fi network should be the first priority chosen to be setup in indoor setting when the Internet cables are wired in the building.

if it is an outdoor environment or if the indoor building have not been wired with the Internet cables, the Pre-WiMAX or EVDO Ad-Hoc Networks can be chosen to be setup very quickly to provide Internet communications service.


The authors in [14] show how this cost can be minimized by electing the CH randomly with no exchanging messages.

the nodes still need to send messages to join the CH.


For persistent non-responsive .ows, temporary denial of access controls the damage.

such .ows are still granted longterm fair share over [t, t+T ].


Our motivation was to evaluate the entropy of pieces in Replication of Pieces in the Peer Set, LS a torrent.

due to several misbehaving clients, there 80 is a permanent noise created by peers that join and leave the peer set frequently.


A shorter interval is preferred for a higher request rate in order to adapt the caching decision quickly to the changing access patterns.

a shorter interval incurs a higher overhead.


In an ideal scenario in which the sensing is perfect, even a single sensor reading should generate a high level of con.dence.

in practice, the sensor boards are sometimes inaccurate.


Here, the coupling of an evolutionary algorithm for the optimization process with a SAT solver as a powerful repair strategy requires to formulate the constraints for a feasible system implementation as a 01 Integer Linear Program (ILP), as it is e.ciently solvable by Pseudo-Boolean (PB) solvers.

their proposed routing encoding relies on a hop-based strategy to extract valid routings for multi-hop communications for each system implementation: For each message, beside variables cr signaling the usage of a resource for the routing of message c, they create a matrix of variables cr,t with one dimension for resources and one for the number of allowed hops (at least the network diameter) which encode the exact hop number of a resource within the routing, see Fig.1.


While WiFi provides substantially better median throughput in the short drive (roughly 2400 Kbps vs. 500 Kbps) the median throughputs are similar in the long drive.

wiFi has zero throughput on more occasions (roughly 25% vs. 10% for the long drive and 42% vs. 15% for the short drive).


Ethane has been shown to scale well for large enterprise networks (20000 hosts and 10000 new .ows/second).

even if client authentication and encryption are disabled, centrally handing out and installing source routes in multiple switches at the start of each .ow may not scale to large data centers with hundreds of switches, serving 100s of thousands of simultaneous .ows3 .


For example, edge routers can observe the congestion status of a multicast session and enforce fair subscriptions of local receivers.

such schemes violate our Requirement 3 because they make routers aware of the session, its groups, and its congestion control protocol.


These constraints are obtained from coverage and connectivity requirements in latticepatternsgeneratedbyrightparallelepiped a or cuboid ß.

whengenerallatticepatternsareconsidered,coverageconstraints aredif.culttoget andtheyhavemorecomplicated expressions.


Ferret s conclusion on when the link was troubled matches the spikes in link utilization between 12:15 and 17:30.

an SNMP-based solution would have trouble detecting this performance incident.


Suppose that when a BS becomes unreachable, the average time required for the backup to detect that a BS is unreachable and assume the role of PC/PI is Tb, if the backup is not itself unreachable at that time.

if the backup itself is unreachable at the time the PC/PI BS becomes unreachable (which happens with probability Tu/(Tu +Tr)), then the mobile may remain unreachable for a longer time in the worst case, until the mobile performs a subsequent location update with the network.


Such a Markovian process enables closed-form or analytically-tractable solutions in the performance analyses.

based on measurements, it was found that network technologies like Ethernet Local Area Network (LAN) and Integrated Services Digital Network (ISDN)1, application layer protocols like World Wide Web (WWW), TELNET and File Transfer Protocol (FTP), and signaling protocol like Common Channel Signaling Network (CCSN) have self-similar data traffic [4,6,12,13,18,20,27].


Links may need to be resized to accommodate existing customers.

slower changes in tra.c would allow the provider to exploit multiplexing gains and increase the number of customers served.


In a naïve approach, all basestations are selected to relay a downlink packet.

as mobile devices and basestations use a single, shared medium for communication, this has the drawback of occupying a channel in all cells.


When the network is lightly loaded, we observe that our approach, the Qual-based spectrum access scheme, can improve the CT s achievable data rate by 30% as compared to the common spectrum access scheme, the Band-based access.

the Qual-based and Band-based access approaches become equivalent when the network is very loaded.


8 (top graph) that there is no correlation between the number of times a peer is unchoked and how long a peer is interested in the local peer.

we see that the number of unchokes for the peers that are unchoked few times increases slightly with the interested time duration.


Consequently, more nodes have to remain active on the routing paths, resulting in more energy waste due to idle listening.

although MT does not optimize transmission power, is high, MPCP causes slightly higher network contention due to its routings paths contain fewer hops and hence more nodes can run path sharing between different sources.


In general, Range-based techniques are more accurate than Range-free techniques.

they require sensors to be equipped with additional hardware to be able to take the required measures.


Similarly, the work in [10] studied the optimal sensing and transmission times that maximize the so-called spectrum e.ciency under an interference constraint for a single-channel system.

their optimization has ignored the e.ect of a multi-channel setup, whereby the CR may scan multiple channels before starting a transmission.


If the participant is the first participant of the conference to dialin, it is likely that this SIP INVITE will activate the focus and hence the conference.

the Conf-ID must have been reserved prior to its use.


way to a number of new networking paradigms and solutions designed for vehicular environments.

the seamless Internet connectivity o.ered by the 3G/WiMAX infrastructured networks and the capacity boost promised by the upcoming LTE/LTE-A technologies are lurking passengers onboard cars into acting as home-based users.


We can notice that, as discussed in Section 3.3, the proportion of synchronized transmissions decreases with Pt because the number of one-hop neighbors also decreases.

the .gures also show that, by reducing Pt,weobtain much more collisions with hidden nodes (especially at a distance of 100 m), because the spatial reuse increases and nodes closer together can transmit at the same time.


Many variants of this problem have been addressed in literature.

the problem of e.ciently determining if end-to-end .ows are achievable does not seem to have been addressed in the literature.


Some approaches discuss the minimization of the shortfall probability Prob(Y<c) [6].

this work also assumes that Y has a Gaussian distribution.


They try to reduce the duplicate copies of Interest packet that each node received to decrease the traffic overhead.

both solutions will spread the Interest packet to the entire network until the edge, and every single node in the network will be delivered at least one copy of the Interest packet.


While, orignally, powerful engines and languages were used in a central way to e.ciently correlate events and detect situations, the emerging increase in event sources forced the community to investigate into scalable CEP systems by distributing the handling of events.

in reality, CEP is not yet fully exploited and is still establishing itself within the business world.


Others have proposed dynamic mechanisms for creating as well as displaying non-hierarchical relationships derived from hierarchical information, e.g., [3].

the display formats used are essentially lists of links in a tree- like structure, albeit with some visual cues added.


Therefore, it su.ces to .nd the basis that maximizes the di.erence between the two ISNRs, which we call the di.erential ISNR.

since the true f(t) and n(t) are not available directly, an approximation is required; we used the delay data of a congested path as f(t), and the di.erence between the delay data and its shifted version as an approximation of n(t)= f(t) -f(t -.max), where .max is the maximum possible synchronization error (1 second in this paper).


When trying to verify the positions of s1,...,s6, we only choose witnesses in the opposite (right-to-left) traf.c .ow such as node n2,...,n5.

with Rule 1, we would ignore node s7, because it cannot prove that it comes from the upstream of the road, and actually it does not.


With our mobile devices in our hands, we perceive network access as an ubiquitous service.

we often overlook that the place where manypeople spend the majority of their mobile time, the car, is a lot more than a means of transportation.


N. Tie-breaking procedure: The DGA with random priority scheme ensures that the cameras receive unique priorities.

the Area-and Target-based priority assignment schemes may not adhere to the unique priority requirement.


In the case of EDGE/GPRS and 3G, the spike in energy is sustained for almost three seconds, followed by another lower energy plateau of about four and twelve seconds, respectively.

in the case of WiFi, the spike in energy lasts only for a fraction of a second.


Enhancing Location Services with Prediction Ebtisam Amar University of Pierre and Marie Curie Paris, France ebtisam.amar@etu.upmc.fr ABSTRACT Position-based routing is often proposed as a means to achieve scalability in large mobile ad hoc networks.

such routing protocols are heavily dependent on the existence of scalable location management services.


newer than 1 month), we observe slight increase in the average requests, which indicates viewers are mildly more interested in new videos, than the rest.

this trend is not very pronounced when we examine the plot of maximum requests.


From Table 3, we see that the variance of ta increases as the number of links grows.


2.3.3, to maximize the collection of delay samples in front of packet loss, each vLDA should sample the incoming packet stream at rate L/k, where L corresponds to its associated number of losses and k to its length.

in a real scenario, the absolute number of losses that each .ow will experience is unpredictable, which raises the question of how to set the sampling rate.


6.3 Comparison of Routing Overhead Theroutingoverheaddesribeshowmanyroutingmessagesforroutedisoveryandroutemaintenaneneedtobe sentinordertopropagatethedatamessages.Inthispaper, theroutingoverheadisobtainedasfollows: ontrolinBytes Overhead=(I)ontrolinBytes+DatainBytes whereontrolnyeisthetotalnumberofontrolbytes iBtstransmittedandDatainBytesisthetotalnumberofdata bytesreeived.Intheproposedprotool,theadditionalof ontrolbytesaountsforRSETandRNTFmessagesaswell asthepiggybakedneighborinformationofthenodesinthe RREPmessage.However,theroutingoverheadremainsfair whenthenumberoftraffowsinreases,beausethenumberofontrolbytestransmittedisalmostonstantwithout hangewiththeinreasingtraffow.Weanseefrom Fig.I4andI5thattheroutingoverheadsofTBRprotool andproposedprotoolbeomeverylosewitheahothersas 20 40 60 80100 Number of nodes FigureI3:Averageend-to-enddelayasafuntionofnumber ofnodes(40fowswith50pakets/seond).


In addition to these systems, .avors of MapReducefor smartphoneshavebeenimplemented(e.g.,[16]).

such efforts do not address the issues of detecting idle phone usage and partitioning tasks across phones with diverse capabilities.


The buffers within an NoC router can be implemented as either registers or SRAM/DRAM memory [32, 33].

given the relatively small buffer sizes employed, it is more reasonable to use small registers as buffers to avoid the address decoding/encoding latencies of big memories  ViChaR s UBS H=Head flit k  k k vk vk in-use v in-use Between v VCs VCs and vk (1 slot/VC) (k slots/VC) in-use VCs Figure 4.


We can take advantage of the second term of equations (2) and (3) as an evidence for deciding whether MN#2 is a misbehaving node or not.

since there exist liars who respond to a successful transaction with bad reputation or a misbehaved transaction with good reputation, the second term of equations (2) and (3) are weighted by the confidence value CNA,i(tn), where i .


The cost of a type 1 route will be dynamic, with the costs of the internal links added to the metric value assigned at the time of redistribution.

the cost of a type 2 route remains .xed regardless how many internal links it contains.


Communicating via Fire.ies: Geographic Routing on Duty-Cycled Sensors Suman Nath Microsoft Research sumann@microsoft.com ABSTRACT Geographic routing is a useful and scalable point-to-point communication primitive for wireless sensor networks.

previous work on geographic routing makes the unrealistic assumption that all the nodes in the network are awake during routing.


For outdoor scenarios the gray zone tends to be very narrow, so the corresponding type can often be omitted without reducing the accuracy of the arising model signi.cantly.

for more complex indoor propagation environment a separate type might be needed to account for it.


V ) as intended destination, are modeled as jobs of class r. For simplicity, we characterize this tra.c .ow through its average packet arrival rate, say .ra;i.

packets of a .ow originated from mesh node i (i .


Thus the estimations are successively accomplished in real time just after that.

we should know whether the case of (10) is measured or not, because the previously-derived Da(k), Da(k+1), Db(k) and Db(k+1) are obtained in the condition of (10).


5.1.2 From IXP data to IP transit traf.c Most ISPs consider the data of their networks as very con.dential and are reluctant to share it with third parties.

some ISPs share publicly large amounts of operational information data.


We expect that most systems that use SWAMP will do well to structure their scene-graphs using instantiated PROTOs, and use SWAMP to describe changes to PROTO fields, as is done in the successful [Blaxxun 2006] system for avatars and objects.

our SWAMP-based multi-user systems extend previous object and avatar PROTOs in an important way, by adding a velocity field.


Thus, the percents in Table 4 should be viewed as approximations.

the implication from Table 4, consistent with Figure 1, is that the ECT codepoint is not only being cleared in the origin (and destination AS), but also at intermediate AS s. Other notable behaviors For 99% of the website and pre.x traces, the quoted ECN .eld from probe responses had either ECT set for all hops or had ECT cleared at some hop and the .eld remained cleared.


Availability degrades much more gracefully for bounded or- der error and unbounded numerical error because a total serialization order can be determined even in the face of some network partitions.

the nature of numerical error dictates that the system will eventually block (rejecting writes) for a partition of sufficient duration.


The obvious drawback of this method is the increase in the signaling between the domains.

this is done after the completion of the handover and therefore has no real effect in the QoS perceived by the user during the handover.


[9] considered the problem of highly directional antennas and formulated it in a linear programming problem.

scheduling for multi-radio WiMax mesh networks has not been considered in their work.


The reason is that with an initial increase in the collision probability, the utilization of the channel increases, and thereby, the throughput increases.

after a threshold, increase in the collision probability increases only the number of collisions, which increases the time spent in the backo.


Consequently, in Figure 3-c, GEM has the best results.

gossip1 and Gossip5 transmit more packets since they do not consider energy to broadcast.


The purpose and the method of the study are similar to ours.

we use e-mail as a basis of messaging and our approach enables users to establish a seamless integration of wearable computing environment and telecommunication systems with traditional computing environment.


In this research, the loss due to the spread between .oors was considered null, LF (n)= 0, because the measurements were made on a single .oor, the same .oor where the APs are installed.

the attenuation coe.cient N depends on the operating frequency and the type of establishment where the WiFi network is installed, according to Table 1.


Since most often the size (i.e., the length and the width) of such terrestrial networks is significantly larger than the differences in the third dimension (i.e., the height) of the nodes, the 2D assumption is somewhat justified and usually it does not lead to major inaccuracies.

in some environments, this is not the case; the underwater, atmospheric, or space communications being such apparent examples.


Figure 9 shows what we believe to be a router that issues periodic routing update messages.

we have not corroborated this hypothesis, nor do we have other possible explanations for the observed behavior.


By these measures, wireless networks have been a staggering success.

from a security perspective, wireless access points present a number of di.culties.


Demonstrating the value of this approach by using it in real systems and applications should result in the development of more appropriate interfaces for network components.

both administrative and technical considerations must be addressed to provide a better interface for performance prediction purposes.


Clearly,h(r)asymptoticallygoes to p as r getslarger since concurrent transmissions fromdistant nodes become independent.

the p-persistent Aloha scheme can be modeled by setting h(r)= p. 5.1.3 Receptionprobability For a transmission from node i, the reception probability at a receiver j is determined by the product of the probability that j is idle and the transmission from i and j is successful when j is idle.Thenthe .rstprobabilityisgivenby 1-h(dij).


LOCATION AWARE FORWARDING Na¨ively an InP can forward a VN request to a set of InPs in the controller network at random.

this decision is blind to the location requirements of the virtual nodes and the availability of virtual resources at the destination InP to satisfy the constraints for the VN request.


In favorable cases, these signals add coherently in a way that enhances the channel quality (increases received power, increases signal-to-noise ratio, etc.).

in unfavorable cases, these signals will tend to cancel each other out and lead to a poor-quality channel.


The idea of changing the DCS rendezvous point over the time has been mentioned in [17, 12, 2].

it is just mentioned, these works do not analyze which are the cost and implications of such a change and how it a.ects the network performance.


FUTURE WORK Our experiments have demonstrated the feasibility of using ECC as a means of securing patient data.

in order to make ECC operable in a real environment, more tests need to be carried out in order to determine how well ECC holds up for large volumes of data.


Indeed, McGeer [7] observed this problem immediately.

mcGeer s solution redirects tra.c through the controller, introducing substantial overhead and limiting packet-processing throughput.


PMIPv6 performs almost comparable to FMIPv6 in reactive mode using a fast radio access technology.

for slower radio access technologies, PMIPv6 is better than FMIPv6 in reactive mode.


This is true for both multi-channel protocols.

the 802.11 MAC protocol shows unfair TCP performance.


We observe that the use of Quartz increases the cost per server by 7% compared to a two-tier tree structure.

we can achieve a latency reduction of at least 33% in an environment with low network utilization and more than 50% with high network utilization.


On the other hand, if |GI (u)|=CG, the security is said to be topology dependent, i.e., the network code is considered secure if and only if Rank(MGI (u))< CG .

as there is no constraint imposed on how G =(V,E)would be generated in Theorem 2, the resulted graph might violate the internal security requirements.


If the number of errors is high, current protocols try to improve performance by employing aggressive strategies.

if the number of errors is low, they try to maintain reliability by being more conservative.


At the limit, a maximum local lag of zero will end up with a central server and probably a poor critical response time performance.

an in.nite value for MaxLL allows the heuristic to converge toward the peer to peer solution with as many servers as players, reaching the absolute lower bound in terms of critical response time.


This is so because the analytical formulation (11) predicts larger transmission times (i.e larger ymax values) for larger ., and therefore, SU transmits aggressively in each white space.

such aggressive transmission by the SU leads to higher PU interference.


It also uses an handshake to exchange information which introduces additional overhead.

turboRate enables distributed bit rate adaptation for MU-MIMO LANs without explicit coordination and can support clients, with the same or different numbers of antennas, to communicate concurrently with an AP.


This makes the delay of the packets in our solution bigger than the packet of the client-server approach, which is close to zero in the emulation environment.

our solution will pay off in a real environment with limited network bandwidth.


malized time consumed by the CPU to process the packet (i.e., the processing time) is 2.5 µs.


Condition (2) is satis.ed since con.ict nodes are shared by overlapping shifters.

if L has feasible phase assignment, then we color all con.ict nodes in the color (phase) of their shifters; the feature nodes will get the color opposite to the color of adjacent con.ict nodes.


They also comprise many off-chip front-end components (filters, switches, networks, and antenna).

our envisioned 60 GHz transceiver systems will take advantage of the possibility of integrating passive components as well as arrays of antennas directly into the package as show in Figure 3.


In order to relate to the notion of priority in DTNs we have chosen 3 values of utility to re.ect di.erentiation amongst messages.

the approach is general and can be extended to multiple levels of utility.


Deploying .yways inside a container, instead of building a full bisection bandwidth network may allow for cheaper containers, as much less hardware will be required.

inside a container, .yways may suffer from multipath effects, as radiation bounces off metal walls of the container.


This explains Dilemma 1 introduced in Section 3.1: under the random walk model, if the node speed is 1 m/s, an infected device collects fewer neighbors than that under the random direction model, although the node degree distributions produced from both models are similar.

if we increase the node speed up to 3 m/s, the increased dynamics of the device neighborhood relationship under the random walk model results that infected and uninfected devices are well mixed, thus eliminating the constraint that exists at a lower node speed.


On the one hand, the size of content is increasing at an amazing speed, especially along with the high-solution videos and photos wide usage; A single contact opportunity might not provide enough contact opportunity due to the bandwidth constraint.

a large amount of contents are always being generated in MSNs.


Lookup (or routing) protocols such as CAN [24], Chord [31], and Pastry [27] guarantee locating the requested object within a logarithmic number of steps, if the object exists in the system.

aggregated streaming rate at receiver (Kb/s) 800 700 600 500 400 300 200 100 0 Time (seconds) Figure 12: Streaming from multiple peers.


The proposed work is very interesting and divided the architecture into three di.erent blocks: physical, control and coordination.

they do not describe in detail the communication modules which is one of the goals of our work.


If we add CK-model style session identi.ers to each message and the key derivation function, the resulting protocol is still secure in the CKHMQV model.

it is not secure in the CK model: the generic attack on PFS [16] applies to this protocol in the CK model.


Prior work [3, 8, 13] has focused on utilizing more access points simultaneously.

the problem of switching from a set of access points currently in use to a di.erent set has not been extensively explored.


This leads to a view change message excluding pi.

the remaining processes keep pi s phone number and set a down .ag.


In this paper, we have treated each link cost type independently.

if we consider multiple interdependent costs simultaneously, choosing the next hop based on one cost type may not be always the best choice for other costs.


Furthermore, specific methods for embedded systems and sensor networks have been proposed [7].

in order for a complete approach to be applied to embedded systems, a combination of IP marking techniques and custom detection methods is needed.


To evaluate the proposed method we implemented a centralized and modified version of Guha and Khuller.

we must keep in mind that for our purposes, the topology is dynamic, nodes may attach and detach from the network at any time which makes the problem even more challenging.


The heights are usually far greater than 1 for large mobile sites.

mobile sites with small sizes are much more likely to have heights of exact one unit.


It should be noted that, in Figure 2, the SIP Application Server (SIP AS) is shown as the only service that the SP is providing.

the SP could deploy even a non-SIP service (e.g., IPTV [6]) as long as that non-SIP service could be delivered through a session established by the SIP signaling messages.


INTRODUCTION Vehicular ad hoc networks are becoming an integral part of the transportation system to enhance tra.c performance.

due to high vehicle mobility, unexpected driver behavior and variable tra.c environment, maintaining high connectivity of VANETs is still an extremely challenge for many practical applications.


To deal with this issue, researchers have investigated routing based on the prediction of future contacts, taking advantage of nodes mobility history.

most of the previous work focused on the prediction of whether two nodes would have a contact, without considering the time of the contact.


There exist efforts applied for devices with multi-radio interfaces [4, 12], or with specially designed interfaces which can listen simultaneously to different channels [9, 16].

as we have observed, hardware equipped with one half-duplex radio interface are much more popular.


RAPID performs comparably to R3 and SWITCH in the .rst and last half hour of Figure 9(a), which con.rms that it is designed to work in sparsely-connected networks.

its replication policy wastes resources and hurts when network connectivity improves.


similar trends for throughput degradation when N grows.

for N = 3, the MMEs overhead represents about 10% of all frames sent.


values of the link weights (e.g., maximum link weight) in addition to the size of the network [20, 23].

these algorithms are computationally expensive if the values of the link weights and the size of network are large.


Previous works focusing on centralized dynamic sub-carrier assignment for infrastructure cellular networks [9]-[12] have shown that channel diversity significantly increases network capacity.

these approaches proposed for centralized scheduling.


Again, all replicas are useless when all nodes are plain-nodes, so there is no difference among three algorithms.

when plain-nodes and replica-nodes exist together, Chordet shows the shorter lookup path.


For example, the 802.15.4 MAC layers uses preambles to synchronize sleeping senders and receivers, the 802.11 power save mode (PSM) relies on the access point bu.ering, and TDMA MACs have .xed slots, allowing a device to sleep for a .xed duration without the risk of missing messages.

ePC Gen 2 has nondeterministic arrival times of messages and variable round lengths.


Other comparable encryption schemes have similar performance on the same platform.

common public key cryptosystems require 30 100 milliseconds of computation per encryption or per signature veri.cation, 80 900 milliseconds of computation per decryption or per signature generation.


As the antenna separation increases, the beam becomes narrower and more tightly bounds the direction of the source.

instead of a single beam, we start to see multiple beams, despite the fact that there is a single direction along which the actual signal arrives, which causes ambiguity.


If it is not possible to snoop packets of an intended receiver (this is possible if the local node is out of reception range of the transmission but within the carrier sense range of the transmission), the wi.-array will depend on adaptive carrier sense to determine if a particular channel is free.

if the receiver wi.-array is busy with some other interaction, it will not send any ACKs.


All predicates of subscriptions involving a certain attribute are tested only once if index structures are used, and using indexes therefore results in faster filtering.

storage of subscriptions is always required to support unsubscribing.


One option is to use a grounded strip in between the signal lines (forming coplanar waveguides) to mitigate the crosstalk.

signi.cant spacing between signal lines and thick dielectric heights may still be required.


In general, the underlying technologies driving the WWW are largely based on the assumption of wired communication.

unlike the case of a wired environment, the assumptions of large bandwidth availability, low error rates and always-on connectivity are invalidated in a wireless environment [2] [3].


In addition, when ß =0, EDREF is slightly larger than EOrd because the attachment of MACs in the packet also increases packet overhead.

when ß = 1, the impact of energy saving appears.


When topology changes occur frequently, usage of higher Hello rates than default may lead to higher end-to-end connectivity and available bandwidth.

in rather static conditions, low Hello rates are adequate to avoid unnecessary bandwidth and power consumption waste.


These protocols achieve high energy ef.ciency and remove the synchronization overhead required in synchronous duty cycle approaches.

they are mainly optimized for light traf.c loads, and we found that they become less ef.cient in latency, power ef.ciency, and packet delivery ratio as traf.c load increases, due to their long preamble transmissions.


If each sensor knows its exact location, one solution would be to have the network sweep emulate a geometric vertical sweep line moving over the .eld from one side to the opposite side.

when geographic location information is unavailable, the notion of direction given by the common coordinate system shared by all the nodes no longer exists.


(2) Similarly, for server log based streaming media workloads of large video .les, such as CTVoD-04, the fetch-at-most-once e.ect does not exist either.

the access pattern of workload CTVoD-04 deviates from the Zipf model even more signi.cantly than those small .le workloads.


This is mainly due to increase in carrier frequency, bandwidth and required cell throughput.

system efficiency increase is partly compensating the undesired decay in cell range.


It was found that timestamping early in the driver-code for the network interface card provided an excellent compromise of almost no scheduling problems (1 timestamp per 10,000, and then usually with an error under 1ms), and with timestamping noise (dominated by interrupt latency) of the order of at worst 15µs, whilst keeping the code simple and almost entirely at the user-level.

the standard gettimeofday system call to obtain timestamps from the SW clock under Linux suffers from much higher system noise due to the above and other effects.


Lower level network technologies, such as 3G/4G networks or wireless LAN (WLAN or WiFi) networks already enable mobility support, by allowing mobility within the same underlying technology, horizontal hando..

e.ective solutions to enable seamless vertical hando.


There is also no significant difference across age groups.

it is obvious that the narrow age range in the lab experiment lowers the degree of generality of the statement on age difference.


Hence if the Gaussian noise value is greater/ == less than ( P/ - P ) the receiver makes a bit error.

the channel code decoder can correcta certain numberof errors (depending on the amount of redundancyadded) and decode the .nal data.


If the transmission range is too small, nodes forward packets along indirect routes to the destination, or may be unable to reach the destination at all.

if the transmission ranges are high, then the number of simultaneous transmissions that can occur in the network is reduced, thus lowering the network throughput.


Obviously, if nodes A and Al belong to the same local area network, and nodes B and Bl belong to the same local area network, then AB and AlBl should have very similar TIV severity.

we are more interested in whether a more general proximity based relationship exists for nodes that do not belong to the same local area network.


The estimation of the probability of success should account for the number of diagonal blocks expected, which is computable from the probability of ending at gap r - 1 after being at gap r - 2.

this computation will not be addressed here.


INTRODUCTION Many systems, such as ad hoc networks and peer-to-peer systems, require many users to participate, in order to leverage the full bene.ts of the system.

in many cases, users may be required to provide their own resources (e.g., memory, bandwidth, battery power) for others to use, without getting any direct bene.t from that.


The other protocols, such as the transmission control protocol (TCP) migrate and mSCTP also need to change the existing Internet application, which seems to be practically impossible.

the SIP and SMMP do not need to change the routers or transport protocol since they operate in the P2P mode.


Given that regular nodes avoid all interactions with selfish nodes, the selfish nodes are virtually excluded from the networks.

this exclusion should be temporary because some wellbehaving nodes may be misjudged by others as selfish nodes and some selfish nodes may behave better later on.


This way, it is possible to capture the energy spread on multiple paths, and thus guarantee a smaller BER given a .xed SNR.

the price for this is that the end-to-end delay may be heavily affected by the propagation delay of several rays.


For instance, [4] and [12] have proposed Explicit ACKs and Passive Cure schemes to alleviate tra.c overhead carried by replication.

it should also be mentioned that, di.erent from the scenarios employed in [4, 12], messages transmitted in H-EC scheme are encoded.


The relaxation to continuous variables follows similarly using radio-system indexed parameters.

the link channel allocation algorithms will have to be redesigned to split link .ows between various radio systems.


By using these parameters, Table 2 shows that the waiting time WT(H) for QoS-aware scheduler is around 29 ms lower than the one for the round-robin scheduler.

the QoS-aware scheduler gives the low priority traf.c a lower time share.


It is evident that PI coincides with problem PI( r0) when u is a zero vector.

when ul is positive it means that we have relaxed the transformed capacity constraint of link l. We denote the optimal objective value of PI at u by PI* (u).


For example, in Figure 3, S can spoof the identity of host V , specifying IP source address R. and reverse path [V ].

iP src addr: R  IP src addr: B IP dst addr: A IP dst addr: D forward path: [B, D] reverse path: [V] forward path: [ ] reverse path: [V, R , A ]  IP src addr: A IP dst addr: B forward path: [D] reverse path: [V, R ] Figure 3: Reverse Path Spoo.ng Example this sort of spoo.ng does not prevent the receiver from identifying the gateways of spoofed tra.c.


To overcome this issue, we can wait for existing .ows to terminate and only reroute new .ows [22, 38].

since .ow durations are unbounded, this approach cannot guarantee the SLA will be satis.ed: e.g., up to 40% of .ows in cellular networks last longer than 10 minutes [36].1 The only way to both satisfy the SLA and maintain NF accuracy is for the control plane to offer the ability to move NF state alongside updates to network forwarding state.


[20] analyzed a set of publications on routing protocols from 1995 till 2003 and summarized the common assumptions that are used in the evaluation of those protocols: a radio s transmission area is circular; all radios have equal range; if I can hear you, you can hear me (symmetry); if I can hear you at all, I can hear you perfectly; signal strength is a simple function of distance.

according to many researchers these assumptions do not hold and the basic simple propagation models alone do not re.ect the complexity of real radio systems [44, 41, 20].


# Hosts per VLAN (182 VLANs) Current Systematic Mean 82.9 82.9 Std Dev 71.9 57.1 90%ile  193 167 Max 254 195 Table 1: Number of hosts per VLAN with the current and the systematic designs.

about 10% of the VLANs span 5+ buildings, and the largest VLAN spans over 60 buildings.


The tree construction and the scheduling are performed concurrently.

the proposed solutions in [2, 5, 8, 1] do not support multi-channel links when scheduling network nodes.


In the no push case, the number of requests grows in a super-linear manner in order to achieve low live latencies.

in the server push case, the live latency is independent of the request rate changes, making it .exible for the client to adapt to the best con.guration solely considering the required dynamic switching ability.


Normally an AP will broadcast the SSID in Beacons periodically (say, every 60 ms).

an MT can also send a Probe Request with an embedded SSID IE to invite an response from an AP.


The RFC 4186 says that The EAP-SIM protocol should be implemented in such a way that the peers should be protected against triplet querying attacks by malicious software[20].

we show a practical attack against implementation of EAP-SIM protocol in this HNB that gives us complete GSM triplets values including RAND, Kc, and SRES.


One simple method of obtaining source rates is to let each source .ood the network with its rate information before .nding a route to the sink.

this approach incurs too much overhead when there are many source nodes in a network.


We also found that, with a more appropriate parameter setting, it is possible to achieve the desired level of reliability (as well as a better energy efficiency).

in some scenarios this is possible only by choosing parameter values formally not allowed by the standard.


The number of tagged .sh that we recapture, along the number of captured .sh allows us to make an estimate of the total population.

the simple models of capture-recapture assume that all .sh are equally easy (or hard) to catch, so we sample at random from the population.


Deployed in scenarios that range from private households over o.ces to public spaces, smart objects enable ubiquitous smart spaces that build on interaction with mobile users.

ubiquitous interaction with smart ob jects is currently complicated by three factors.


For instance, at a density of 400 vehicles/km2 , UV-CAST transmits about 57% more messages than VoV.

as shown in Figure 4(c), the di.erence in delivery is just about 5%.


In our current antenna typology, these antennas are categorized as Rural antennas.

we expect that the usage patterns of antennas associated with transportation corridors will differ significantly than those located in Rural residential areas.


With a scalable routing structure, even a very small routing table can lead to ef.cient lookups in a few hops.

as currently de.ned, most DHT routing structures are scalable but not .exible and constrain which routing table sizes are possible.


The sel.sh nature of the users is modeled in our setting by making independent routing decisions, so as to maximize their individual performance.

we assume that each node will forward any traf.c routed through it, due to the existence of a packet forwarding service.


The work in [34] focused on selecting egress points such that traf.c loads do not exceed the egress-point capacities, with the secondary objective of minimizing the total distance traveled by the traf.c.

we formulate an optimization problem that minimizes congestion over the links in the network, using the objective function used in earlier traf.c-engineering studies [9].


The source address of the sender is added to the beacon frame to inform the device which transmits its frame in suitable sub-periods.

we do not focus on the solution of the HDP and detail describe in this paper [15].


More recent work [33] solves this instability problem by balancing load over a set of pre-de.ned paths between ingress and egress.

none of these proposals explicitly addresses the problem of egress-point selection, making it appealing to implement TIE even in networks that already support load-sensitive routing.


2.1 Abstract Protocols Protocol analyzers can monitor system communication on di.erent layers of a protocol stack [11].

the parts of the communication design that are not speci.ed as part of a protocol are invisible during analysis.


The only concern for the helper may be the energy consumption.

as shown in [11] that, sometimes the energy-per-bit experienced by the helper stations is decreased by participating in cooperation.


A Mesh node decrypts a downlink Onion and forwards the new Onion to its next hop that is close to the session initiator.

upon receiving an uplink Onion , a Mesh node in the route encrypts it and then forwards the new Onion to its next hop that is closer to the Gateway router.


For example, with a data rate of 2 Mbps and RTS/CTS on, RTT reaches 473 ms with a window size of 2 MSS, while it is only 55 ms with a window size of 3 MSS.

the 3 MSS window size gives the As we increase the hop count beyond 2, the throughput drops signi.cantly and is close to zero for most topologies [6].


The steps above are reminiscent of successive interference cancellation (SIC)[10].


TSV is one of the most promising technologies that is used to implement vertical links in 3D NoC.

tSVs usually occupy large silicon as well as metal area due to its landing pads and space between them.


Work-to-date has largely concentrated on the question of whether non-trivial crosscutting concerns occur in systems software and whether they can be modularized (e.g., [8, 24, 31]).

.ner-grained optimizations may be more prevalent, more technically challenging for aspect-oriented (AO) programming languages, and less compelling examples of improved modularity.


TTDD solves the sink mobility problem using a grid structure.

if the number of source nodes is increased, data dissemination point management can considerably increase the communication and storage overhead of the system, due to the grid structures of data dissemination points from each source node [7].


Synthetic mobility models [27] or aggregate models derived from the movements of many users [14, 28] are useful when a network provider needs the big picture of how their network will be utilized.

such models have little chance of accurately capturing the very unique paths one user takes through their environment.


e.P1 .e.P2}.We de.ne the node partition change rate for a node nk as: |Epart(nk,T )| Rn(nk,T )= (2)tmax -tmin The average node partition change rate for T is de.ned as n 1 ter, we used two graphs, one representing a typic European city, and the other representing Midtown Manhattan.The total simulation time was 3600 s.The speed of nodes was randomly chosen from the interval [0.5, 2.0] m/s.

figure 1 shows the results for the average number of partitions |.|avg(T ) as a function of the number of nodes in the network.For small networks, |.|avg(T )ismostlydetermined by the number of nodes in the network, which de.ne the upper bound of the number of partitions.Once the node density is higher than 75 nodes/km2, which corresponds to 300 nodes in our simulations, |.|avg(T ) steadily decreases.even for larger networks with a density of 600 nodes/km2, i.e.


CAC schemes not only have to ensure that the network meets the QoS of newly arriving calls if accepted, but should also guarantee that QoS of existing calls does not deteriorate.

internet frameworks for QoS provisioning rely, basically, on two architectures: Integrated Services (IntServ) [15] and Differentiated Services (DiffServ) [16].


For example, Figure 12 shows two failures at the network periphery that a network operator could pinpoint with knowledge from the routing con.guration about the next-hops and neighboring networks that connect to each router.

for example, in Figure 12(a), the burst of BGP routing updates would contain only next-hop IP addresses of routers outside the network, as router A changed its next-hop route selection from router B to router C.the failure scenario in Figure 12(b) would cause the monitor at router A to see BGP routing messages with next-hops inside the local network, as router A changed its route selection from a route with the next-hop outside the local network (router C) to one inside the same network (router E).


Based on this technique, there are only two candidate epochs for any incoming packet.

if a valid packet had been sent at the beginning of an epoch, an attacker can replay that packet for the remainder of the epoch as well as ot +on into the next epoch.


Traditionally, both passive and active monitoring approaches have been used for failure localization.

data from passive monitoring is often too noisy and does not e.ectively capture silent or gray failures, whereas active monitoring is potent in detecting faults but limited in its ability to isolate the exact fault location depending on its scale and granularity.


The performance of TCP over a reliable radio bearer (RB) is better than over a raw wireless link, because it avoids the triggering of unnecessary congestion control measures [2] when packets are lost due to propagation errors.

continuous variations in propagation contitions cause changes on avaliable bandwidth as well as high and variable latency in 3G links.


However, the queue should not be smaller than the maximum number of sub-frames per aggregate as this will only decrease the throughput without delay reduction.

if the draining time is less than target, WQM can safely increase the queue size.


We selected Turret [23] because it provides these capabilities.

turret is not designed for wireless networks, but assumes more general message-passing systems.


the IEEE 802.11p as well as the IEEE WAVE [12] and ETSI ITS G5 [9] standard agree on parameters listed in Table 2.


NetShare [13] ensures per-tenant fair sharing of congested links.

neither approach provides any bandwidth guarantees (i.e., the share of one VM can be arbitrarily reduced [18]).


Therefore, the BLI% and the BIU are accessible to the two adjacent networks and are collocated to handle the intersystem roaming of MTs.

the VLR and the MSC provide roaming information within a network and deal with the intrasystem roaming of MTs.


[12] proposed a caching scheme named WAVE, in which the popular contents can be pushed closer to the end users.

wAVE cannot eliminate the caching redundancy and is limited to achieve good caching performance with prediction.


the exact precision to which sensors need to operate is still an open question.


Our scheme can be easily modi.ed to deal with non-uniform destinations without asymptotic loss of performance by routing messages through random intermediate nodes.

the lower bound of Section 3 does not hold if message sources choose very close destinations.


The simple network selection policy used by mobile devices today forces applications to use WiFi whenever available.

our measurement results indicate that a more .exible network selection policy will improve the network performance of mobile applications.


VL2 provides just such a mechanism over a virtual layer 2 infrastructure.

in topologies such as BCube, paths vary in length, and simple ECMP cannot access many of these paths because it only hashes between the shortest paths.


HIP not only provides identifier/locator split but also a key agreement procedure named HIP Base Exchange, which bootstraps security associations between HIP peers.

the heterogeneous and decentralized nature of IoT architecture, coupling resourceconstrained networks with powerful Internet, impedes the use of HIP Base Exchange on small devices due to its computationally expensive cryptographic operations.


The content-side revenue will be less than ßq( Xr).

q.Q r.R if the two transit ISPs are connected, the total revenue will follow Equation (5).


Since the approximation algorithm does not dictate how servers should be allocated when there are multiple websites, we study only the case of single website.

as noted above, even though the insight of high-rate vector quantization is obtained in a continuous model, the server allocation and placement algorithm works on discrete problems with arbitrary (discrete) request rates r. to compare with the analytical (approximate) expression for costs, we choose in our simulations request distributions whose continuum approximations are uniform, Gaussian, and power-law, the three spatial request densities in Examples 2-4, as follows.


The size of each list is a predetermined design parameter and does not increase with total network size.

the scheme uses a label comparison method to check the tree IDs of each backup parent candidate.


Recall that the density of the network in the phenomenon driven scenario correlates with the number of nodes that report their data.

as suggested by the goodput results, a large portion of this energy is wasted when the capacity of the network is exceeded.


GUARAN-TEE will never ask for unnecessary repairing.

the weak zones identi.ed by SEEM may not be complete, in the sense that even if all these zones are repaired, there is no guarantee that Q* will be reached.


*, and can hence infer the presence of group members in these pre.xes.

when R1 receives a packet from Rs, it has no easy way of knowing not to forward toward e. f .


Because network con.gurations are continually forking and because there may always be some ambiguity about the true state of the network, the number of network con.gurations is generally not pared down to one.

we have found that the ISENDER can usually quickly pare down the prior to a smaller list of possibilities as it homes in on a good estimate of the network parameters.


As we have shown earlier, these two operations are more computationally demanding and more likely to be bottlenecks.

bigStation does not compromise the performance, but addresses the MU-MIMO scaling challenge by parallelizing the computation and communication among many simple and low-cost devices.


Prior work [10] has found that only a small number of BGP announcements affect most of the traf.c.

even a few BGP changes can potentially signi.cantly impact most of the traf.c.


A feasible approach consists of delaying all delay tolerant applications until their maximum delay tolerance, and then resorting to the cellular networks if the applications can not .nish.

this approach does not appear much effective, considering that the user has to wait even when there is actually no available Wi-Fi connection.


When a request (for inserting a child) arrives at an unfrozen vertex, it is handledbyProtocol Dyn-Anc, thateventuallygrantsitapermit.

when a request arrives at a frozen vertex v, it is .rst put in a queue at v. When v becomes unfrozen again (whichis guaranteedtooccureventually),therequestsfrom its queue are dequeued one by one, according to the First In First Out discipline, and are handled by Protocol Dyn-Anc.


The authors in [12] integrated trust and reputation for the threat mitigation of Spectrum Sensing Data Falsification (SSDF) attacks on CRNs.

they did not propose any trust modeling for CRNs.


As an example, for an outage target of .0 = 5% from curves we can select CB/N = 10.8 dB and CF /N = 12 dB.

for a given CB/N, it is not possible to arbitrarily Figure 3: UL-UL: Minimum values of (C/N) for the cell-BS and for the femto-BS for variable number of femto-BS and CB/N.


For general topologies, the exact computation becomes computationally quite heavy, and thus impractical for dimensioning purposes.

there are also simple and explicit approximations available for the performance.


Note that, without sophisticated frequency analysis, the acoustic sensing algorithm is not designed to distinguish human voice and vehicle sound.

according to experimentation, a human, even if speaking loudly, does not generate as much acoustic energy as a car passing close to the sensor node.


Since random .ow sampling was originally proposed to improve estimation accuracy of .ow statistics, it seems to be an ideal solution that works well for both tra.c engineering and anomaly detection purposes.

its heavy resource requirements and poor scalability will continue to prohibit its wide-spread deployment.


This is shown by .rst establishing a state-space collapse, i.e., the deviations of queue lengths from the direction c are bounded, independent of heavytra.c parameter E. Since the lower bound of mean queue length is of order of 1 , the deviations from the direction c are negligible compared to the large queue length for a su.ciently small E, and thus the queue lengths concentrate along the normal vector c. Because of this, we also call the normal vector c the line of attraction.

as discussed in Section 3, we are interested in large values of a to provide satisfactory service regularity.


If the transmitter could accurately predict all three components in the SINR (signal, noise, interference) at the receiver, it could directly select the best transmission rate without resorting to probing.

getting the necessary information is complicated because commercial NICs provide only limited information and the receiver-side information is needed by the transmitter.


Most of them exploit the fact that IP tra.c exhibits both temporal and spatial locality to implement route caching.

most of them do not deal with cross-rule dependencies and none of them deal with complex multidimensional packet-classi.cation.


The values were chosen based upon Border Gateway Protocol (BGP) keep_alive_time variable and BGP hold_time variable [24].

the suitable values for these times will be studied in future work.


As seen in the .gure, transfers without loss generally take little more than the ideal duration.

transfers that experience loss take much longer to complete 5 times longer on average.


Valiant routing [2] was developed as a means for load balancing traffic using paths through random intermediate switches.


[19] presents a scheme to improve TCAM power by reduc ing the number of memory locations searched.

[19] needs to restructure the layout of pre.xes in the TCAM subbanks when the distribution undergoes non-trivial changes, complicating the routeupdate cost.


On the other hand, low values for this clause may produce more precise results, since a larger sample will be collected.

such a scenario means a higher energy consumption for sensor nodes.


The tables shows the throughput received by each client after normalization by 20 MHz across the network, such a scheme increases capacity and reduces interference.

in dynamic conditions, using .xed-width channels can be problematic and suboptimal.


The performance of the proposed avoid inter-symbol interference (ISI).

in single carrier techniques is degraded as compared to the LMMSE and better communication systems, complex equalization techniques are than LS estimator.


Dut to MIS protocol utilizes Pseudo Ad-Hoc mode which is provided from IEEE 802.11 wireless interface controller, MIS protocol isn t under threats by forged IEEE 802.11 management frames.

mIS protocol is under threats of DoS attacks by using of forged control messages.


BUDGET MANAGEMENT So far, we assumed the budget is allocated in a centralized manner.

fCP also allows decentralized budget management.


In [9], the similar condition of Problem 1 but with no transmit power constraint is researched.

when both constraints exist and pn are coupled by them, we can relax the coupled constraints one by one using dual decomposing method, until we acquire the suboptimization problems which are easy to be solved.


The general trend of new abstractions in each version is obvious.

its more interesting to note that more than half of these abstractions are optional.


Behavioral data does not tell exactly what the organization and each worker is doing, what each worker says, or what job he or she is engaged in.

it can tell many things by combining individual s memory and experience individual worker s memories and experiences.


Beacons contain the node s id, state, residual energy, a timeout value, and 1-hop neighborhood information.

only information about active neighbors, i.e., cluster heads and bridges, are required and included into the packet.


By exploiting collaborations and information fusion between neighboring sensors, Yang [5] proposed a centralized algorithm to .nd the smallest sensor set which can information-cover the barrier.

all of the above works focus on stationary sensor network[1-7], where sensors cannot move.


Applying Traf.c Merging to Datacenter Networks Alessandro CarregaSuresh SinghRaffaele Bolla University of GenoaPortland State UniversityUniversity of GenoaGenoa, ItalyPortland, OR 97207Genoa, Italyalessandro.carrega@unige.it singh@cs.pdx.edu raffaele.bolla@unige.it Roberto Bruschi National Inter-University Consortium for Telecommunications (CNIT) Genoa, Italy roberto.bruschi@cnit.it ABSTRACT The problem of reducing energy usage in datacenter networks is an important one.

we would like to achieve this goal without compromising throughput and loss characteristics of these networks.


For instance, TCP uses the timestamp option [14] to (among other things) take round-trip time measurements more frequently than once per round-trip time, for the Protection Against Wrapped Sequences [14] algorithm and for detecting spurious timeouts [18].

middleboxes along a path can interfere with the use of TCP options, in an attempt to thwart attackers trying to .ngerprint hosts.


The result is that the queue levels increase at a slower rate and this gives DCA a better chance at avoiding loss.

even in this "best case" environment, the "unnecessary" reactions by DCA to RTI" increases not associated with loss drives the throughput down (by 42% in the moderately congested case and by 53% in the more congested case).


This implies that we need to round down the resampled bids to the nearest priority level.

this modi.cation preserves truthfulness since the modi.ed allocation function is still (weakly) monotone in bids.


Traditional solutions that increase resilience to interference by making 802.11 fall down to a lower bit rate are ineffective against high-power cross-technology interference.

as a result, the most common solution today is to hop away to an 802.11 channel that does notsufferfrominterference[6,38,31,32].theISM band is becoming increasingly crowded, making it dif.cult to .nd aninterference-free channel.Thelack ofinterference-free channels hasledWiFidevice manufacturers[6,11,3]and researchers[29]to develop signal classi.ers thatinform the802.11 user about the root cause oftheproblem(e.g.,Bluetooth, microwave,baby monitor).


The proactive handover schemes generally outperform the reactive handover in handover delay and packet loss.

the proactive approach also has several restrictions, such as erroneous movement and signaling overhead[2].


Best current practices for reducing the size of routing-tables rely on the diligence of network operators to apply static .lters to BGP routes learned from each neighbor.

these techniques cannot aggregate routes originating several hops away, and can sometimes lead to black holes and loops [21].


A key advantage of asynchronous low-power listening protocols [13, 3] is that the sender and receiver can be completely decoupled in their own duty cycles.

these protocols suffer from the overhearing problem, since the long preamble also wakes up nodes who are not the intended receiver of a packet.


See [28] for details on .ow decomposition.

we still have |Mi| > 1, i.e., we have a number of paths that carry the .ow.


An endpoint may read any location (address.o.set ) in the table by using the report address mechanism described below.

an endpoint may only write speci.c o.sets of the report and application addresses; network and .ow statistic addresses are assigned by the AP and are read-only.