Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
692
Social dilemma alleviated by sharing the gains with immediate neighbors
, 2014
"... We study the evolution of cooperation in the evolutionary spatial prisoner’s dilemma game (PDG) and snowdrift game (SG), within which a fraction α of the payoffs of each player gained from direct game interactions is shared equally by the immediate neighbors. The magnitude of the parameter α therefo ..."
Abstract
- Add to MetaCart
We study the evolution of cooperation in the evolutionary spatial prisoner’s dilemma game (PDG) and snowdrift game (SG), within which a fraction α of the payoffs of each player gained from direct game interactions is shared equally by the immediate neighbors. The magnitude of the parameter α
LINK: Location verification through Immediate Neighbors Knowledge
"... Abstract. In many location-based services, the user location is determined on the mobile device and then shared with the service. For this type of interaction, a major problem is how to prevent service abuse by malicious users who lie about their location. This paper proposes LINK (Location verifica ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
verification through Immediate Neighbors Knowledge), a location authentication protocol in which users help verify each other’s location claims. This protocol is independent of the wireless network carrier, and thus works for any third-party service. For each user’s location claim, a centralized Location
Immediate Neighbor Difference I DDQ Test (INDIT) for Outlier Identification
, 2003
"... Increasing values and spread in leakage current makes it impossible to distinguish between faulty and fault-free chips using single threshold method. Neighboring chips on a wafer have similar fault-free properties. By obtaining differences in I DDQ values it is possible to discriminate faulty dice. ..."
Abstract
- Add to MetaCart
Increasing values and spread in leakage current makes it impossible to distinguish between faulty and fault-free chips using single threshold method. Neighboring chips on a wafer have similar fault-free properties. By obtaining differences in I DDQ values it is possible to discriminate faulty dice
GPSR: Greedy perimeter stateless routing for wireless networks
- MOBICOM
, 2000
"... We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of touters and a packer's destination to make packet forwarding decisions. GPSR makes greedy forwarding decisions using only information about a router's i ..."
Abstract
-
Cited by 2290 (8 self)
- Add to MetaCart
's immediate neighbors in the network topology. When a packet reaches a region where greedy forwarding is impossible, the algorithm recovers by routing around the perimeter of the region. By keeping state only about the local topology, GPSR scales better in per-router state than shortest-path and ad
Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems
- IN PROC. OF THE 18TH IFIP/ACM INTERNATIONAL CONFERENCE ON DISTRIBUTED SYSTEMS PLATFORMS,
, 2001
"... This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Intern ..."
Abstract
-
Cited by 1932 (1 self)
- Add to MetaCart
to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality
Energy Conserving Routing in Wireless Ad-hoc Networks
, 2000
"... An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract
-
Cited by 622 (2 self)
- Add to MetaCart
the set of possible one hop away neighbors. Traffic forwarding through multiple hops is employed when the intended destination is not within immediate reach. The nodes have limited initial amounts of energy that is consumed in different rates depending on the power level and the intended receiver. We
LEAP: Efficient Security Mechanisms for Large-scale Distributed Sensor Networks
, 2003
"... Protocol), a key management protocol for sensor networks that is designed to support in-network processing, while at the same time restricting the security impact of a node compromise to the immediate network neighborhood of the compromised node. The design of the protocol is motivated by the observ ..."
Abstract
-
Cited by 469 (22 self)
- Add to MetaCart
Protocol), a key management protocol for sensor networks that is designed to support in-network processing, while at the same time restricting the security impact of a node compromise to the immediate network neighborhood of the compromised node. The design of the protocol is motivated
Neighborly Polytopes and Sparse Solutions of Underdetermined Linear Equations
, 2005
"... Consider a d × n matrix A, with d < n. The problem of solving for x in y = Ax is underdetermined, and has many possible solutions (if there are any). In several fields it is of interest to find the sparsest solution – the one with fewest nonzeros – but in general this involves combinatorial optim ..."
Abstract
-
Cited by 130 (13 self)
- Add to MetaCart
optimization. Let ai denote the i-th column of A, 1 ≤ i ≤ n. Associate to A the quotient polytope P formed by taking the convex hull of the 2n points (±ai) in R d. P is centrosymmetric and is called (centrally) k-neighborly if every subset of k + 1 elements (±ilail)k+1 l=1 are the vertices of a face of P. We
Distributed Kalman filtering in sensor networks with quantifiable performance
- In 2005 Fourth International Symposium on Information Processing in Sensor Networks (IPSN
, 2005
"... We analyze the performance of a distributed Kalman filter proposed in recent work on distributed dynamical systems. This approach to distributed estimation is novel in that it admits a systematic analysis of its performance as various network quantities such as connection density, topology, and band ..."
Abstract
-
Cited by 184 (7 self)
- Add to MetaCart
, and bandwidth are varied. Our main contribution is a frequency-domain characterization of the distributed estimator’s performance; this is quantified in terms of a special matrix associated with the connection topology called the graph Laplacian, and also the rate of message exchange between immediate neighbors
On Neighbor-Selection Strategy in Hybrid
- In Proc. of the 13 th IEEE International Conference on Computer Communications and Networks (ICCCN’04
, 2004
"... Recently, computer users have increased their interests in downloading large-volume contents like movies and software from the Internet, and a new generation of peer-to-peer (P2P) file-swapping applications that aims at improving the efficiency of transfer are gaining popularity. In these P2P app ..."
Abstract
- Add to MetaCart
-selection strategy that performs better than the existing ones. We show that by increasing the content availability of peers from their immediate neighbors, it can significantly improve system performance without trading off users' satisfaction. We also show that the proposed strategy is incentive
Results 1 - 10
of
692
