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 cognitive radio settings with highly dynamic primary activities and with small opportunities for secondary access, the requirement to fairly distribute the temporarily available spectral ranges among the unlicensed users turns out to be of particular relevance. The current paper addresses this issue by presenting a new design formulation that aims to optimize the performance of an orthogonal-frequency-division-multiple-access...
When a content provider (CP) provides peer-to-peer live streaming service, routing decisions based on the knowledge of underlay traffic could lead to much better performance (such as user delay). On the other hand, if the Internet Service Providers (ISPs) provide underlay traffic information to the CP, their overall network cost due to routing inefficiencies could be reduced. There is hence incentive...
In a multihomed video streaming system, a video sequence is simultaneously transmitted over multiple access networks to a client. In this paper, we formulate the rate control and stream adaptation problems into a unified optimization problem, which determines the sending rates of individual networks, selects which video packets to transmit, and assigns each packet to an access network. We propose...
Efficient data aggregation and compression in sensor networks is becoming fundamental with the increase of the number of nodes in the network. Although several data aggregation and compression techniques have been proposed in the literature only few of them can perform in-network compression and can extend lifetime without prior knowledge of the sensed data or without a central coordination. In this...
We investigate the question of what languages can be decided efficiently with the help of a recursive collision-finding oracle. Such an oracle can be used to break collision-resistant hash functions or, more generally, statistically hiding commitments. The oracle we consider, Samd where d is the recursion depth, is based on the identically-named oracle defined in the work of Haitner et al. (FOCS '07)...
Based on the interactive proof of Hamiltonian Cycle (HC) of large directed graph, which is a ??-protocol, we construct a perfectly hiding and computationally binding trapdoor commitment in 2-round from any one-way permutation. Then, based on this trapdoor commitment, we construct perfect zero-knowledge argument of knowledge with negligible error probability in 2-round for NP, assuming only the existence...
When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot-potato routing. As a result, paths in the Internet are suboptimal from a global perspective. For peering ASes who exchange traffic without payments, path trading - complementary deviations from hot- potato routing - appears...
In this paper, firstly, we introduce regenerative multi-way relaying. A half-duplex multi-antenna relay station (RS) assists multiple nodes which want to communicate to each other. Each node has a message and wants to decode the messages from all other nodes. The number of communication phases is equal to the number of nodes, N, such that when N = 2, we have the well known two-way relaying. In the...
The iterative optimization algorithm is a traditional classification method of the pattern recognition. In the iterative optimization algorithm, the primary center of classes is selected by random method. This choice method causes the iterative time increase greatly in the optimization at anaphase. It also has some serious defects which are the selected samples blindly, the presented a local extremum...
Radio frequency identification (RFID) is a popular technology, but some problems still need to be overcome. Hopper and Blum proposed a light-weight authentication protocol, HB protocol, which is especially suitable for devices with low computation ability such as passive RFID tags. Later, HB protocol was proven to be insecure, and Munilla and Peinado amended it by proposing HB-MP and HB-MP protocols...
In ubiquitous wireless environment, mobile devices need a more resilient and convenient network communication software. Mobile ad hoc network (MANET) routing protocols are favored in ubiquitous environments due to its self-organization and self-reconstruction characteristics. Routing protocols however, especially the MANET routing protocols, are suffering from the unexpected topology changes and unreliable...
In cooperative wireless networks, it is often the case that multi-source and multi-relay cooperate to transmit their own data to the destination, namely, the access point. For the cooperative systems, the choice of relay and the allocation of power between the source and the relay are important design issues. In this paper, based on the optimal power allocation between one source and one relay under...
With emergence of group-oriented applications needing content confidentiality, secure group communications have drawn more attention. To provide this service in large groups with highly dynamic memberships, a secure group key management efficient in key establishment and update is the foundation. In this paper, we present a join-tree-based contributory group key management (JDH) to achieve better...
We formalize a model for node capture attacks in which an adversary collects information about the network via eavesdropping on the wireless medium and captures nodes based on the learned information. We show that attacks in this adversary model correspond to NP-hard optimization problems and discuss the behavior of a reasonable heuristic algorithm. We show that the goals of node capture attacks can...
We will construct a perfectly hiding commitment in two rounds from any one-way permutation, which is a negation of this result that O(n/(log n)) rounds is the tight lower bound on the rounds complexity of perfectly hiding commitments from any one-way permutation. Based on our commitments, we will construct a computational zero-knowledge proof for any NP that achieves negligible error probability in...
The technology of sensing and access the potential available spectrum is always a hot topic for cognitive radio networks. Compare to the existing works, this paper proposes a new centralized sensing and access protocol which is based on the premise of contention-aware network flow. The target of this protocol is to maximize the expected throughput of the whole cognitive network. We have proven that...
Peer-to-peer (P2P) technology has emerged as a promising scalable solution for live streaming to large group. In this paper, we address the design of overlay which achieves low source-to-peer delay, is robust to user churn, accommodates of asymmetric and diverse uplink bandwidth, and continuously improves based on existing user pool. A natural choice is the use of mesh, where each peer is served by...
We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity of an ad hoc network. We analyze the performance upper bound of joint routing and scheduling for ad hoc networks that embrace interference by using MPR. We formulate the optimization problem under a deterministic model and seek...
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.