The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In sensor networks, the adversaries can inject false data reports from compromising nodes. Previous approaches for filtering false reports share keys between the source node and its upstream nodes on the path to sink, and rely on intermediate nodes to verify the reports generated by downstream nodes in a probabilistic manner. As a result, false reports have to travel several hops before detected....
We consider an opportunistic channel access problem over multiple primary bands. We exploit primary ACK/NAK packets overhearing to overlay secondary communications on top of permanently busy primary channels. Through the theory of multi-armed restless bandit processes (MARB), we prove optimality of the myopic policy with a simple structure that does not require channel state-transition probabilities...
Ad hoc networks rely on the mutual cooperation among individual nodes to achieve network-wide objectives. However, individual nodes may behave selfishly in order to maximize their own benefits without considering the global benefits of the network. One approach to incentivize nodes cooperation for better global benefits is to establish trust relations among nodes to guide their decision making. In...
Simulation, point estimation, and interval estimation of the bit error rate are rigorously examined. Exact confidence intervals based on the F-distribution approximation for the binomial and negative binomial distributions are derived. Simulations demonstrate 1) that the analysis gives accurate confidence intervals for bit error rate estimators and 2) that the performance of the binomial and negative...
Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the encoding vector. Increasing the field size and generation length presents a fundamental trade-off between packet-based throughput and operational overhead. On the one hand, decreasing the probability of redundant...
Many network pricing schemes have been proposed in recent years for spectrum/network service access. Most of them model the spectrum/service access problem as a cooperative game, where the spectrum/network service is assumed to be open to every user. However, few of them have considered the scenarios that the spectrum/network service is private. In this paper, we study the network pricing of private...
Information flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. While past work has proposed information theoretic metrics (e.g., Shannon entropy, min-entropy, guessing entropy, etc.) to quantify such information leakage, we argue that some of these measures not only result in counter-intuitive measures of leakage, but also...
An advanced CSMA/CA (carrier sense multiple access with collision avoidance) system incorporating total precedence transmission of all CA and MAC frames (known as a full-flying synchronous CSMA/v-MCA system in Japan, where v- MCA means a variable multiple CA) was developed to minimize the time wasted for upstream channels. In this system, the CA procedures and the controls of the MAC frame transmission...
In this paper we address the problem of multicasting individual and common information from a single transmitter (source) to multiple receivers (destinations). We consider the general case where a separate message could be intended for any subset of destinations. We call this problem multicasting in broadcast channel. We derive an achievable rate region for this setup when the `deterministic channel...
Online social networks (OSNs) provide new means of disseminating information about applications and contents served by network providers. OSN members often reveal their usage information and opinion about applications and contents to their neighbors within their social networks. Consequently, sudden popularity and viral propagation of applications among OSN members can put significant burden on network...
Transport protocols that use explicit rate feedback are a promising alternative to the algorithms which use implicit, packet loss based feedback. A key issue in the design of rate controlled communication networks is how new flows may be admitted at a fair and high starting rate. In this paper, for the management of new flows we present a modified NetFPGA Rate Control Protocol (RCP) implementation...
Despite its existing incentives for leecher cooperation, BitTorrent file sharing fundamentally relies on the presence of seeder peers. Seeder peers essentially operate outside the BitTorrent incentives, with two caveats: slow downlinks lead to increased numbers of ``temporary" seeders (who left their console, but will terminate their seeder role when they return), and the copyright liability...
Traffic traces provide valuable data to researchers and organizations alike. However, organizations that provide this information do not wish to expose the internal workings of their networks to potential attack. Traffic trace anonymization attempts to mitigate this concern by hiding sensitive information while preserving most of the empirical value of the trace. Unfortunately, many attacks such as...
In traditional delay tolerant networks (DTNs), there exists a potential assumption that the nodes are willing to help others for packet forwarding. However, in the real application scenarios, such as civilian DTNs, selfish behaviors always widely exist. Therefore, the assumption that nodes are cooperative is not realistic in all applications. Currently, most of the existing incentive mechanism focuses...
This paper considers distributed protocol design for resource allocation (RA) problems. We propose a fully decentralized RA scheme based on the min-sum message passing (MP) approach in which each message is the solution of small distributed allocation problems. Due to the presence of cycles in the network graph, the MP routine may not converge to a fixed point. To this end, we introduce a reweighted...
We present a new loss model for the call-level analysis of a single link, which accommodates calls of different service-classes with elastic bandwidth requirements. Calls arrive in the link according to a Batch Poisson process, a process that can be used to model traffic, which is more 'peaked' and 'bursty' than the Poisson process. The available link bandwidth is shared to calls according to the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.