Sciweavers

6682 search results - page 405 / 1337
» network 2006
Sort
View
CN
2006
95views more  CN 2006»
15 years 7 months ago
Generalized Nash Bargaining Solution for bandwidth allocation
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing propertie...
Corinne Touati, Eitan Altman, Jérôme ...
IJSN
2006
140views more  IJSN 2006»
15 years 6 months ago
Load-balanced key establishment methodologies in wireless sensor networks
: Wireless Sensor Networks (WSN) pose a need for dynamically establishing a secret key joint to a group of nodes. Elliptic Curve Cryptography (ECC) has emerged as a suitable public...
Ortal Arazi, Hairong Qi
MONET
2006
102views more  MONET 2006»
15 years 6 months ago
Locating and Bypassing Holes in Sensor Networks
In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we ...
Qing Fang, Jie Gao, Leonidas J. Guibas
JSAC
2010
86views more  JSAC 2010»
15 years 5 months ago
A randomized countermeasure against parasitic adversaries in wireless sensor networks
—Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, c...
Panagiotis Papadimitratos, Jun Luo, Jean-Pierre Hu...
CSREASAM
2006
15 years 8 months ago
Increasing Security in Mobile Ad Hoc Networks by Incentives to Cooperate and Secure Routing
A mobile ad hoc network is a self-organizing network that relies on the cooperation of participating nodes in order to function properly. In this network, mobile users arrive withi...
Ebrahim Khosravi, Brandy Tyson