Sciweavers

1687 search results - page 231 / 338
» On the complexity of scheduling in wireless networks
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 6 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
IPCCC
2005
IEEE
16 years 2 hour ago
Real time agreement protocol and resource pre-reservation for wireless system
The third generation of mobile networks aims to offer services diversified to users, while guaranteeing acceptable QoS. This results in the setting up of strategies of increasingl...
Sonia Ben Rejeb, Sami Tabbane, Zièd Choukai...
IPPS
2005
IEEE
16 years 1 hour ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
IPSN
2007
Springer
16 years 16 days ago
Improving wireless simulation through noise modeling
We propose modeling environmental noise in order to efficiently and accurately simulate wireless packet delivery. We measure noise traces in many different environments and propo...
HyungJune Lee, Alberto Cerpa, Philip Levis
COMCOM
2000
105views more  COMCOM 2000»
15 years 6 months ago
Security broker for multimedia wireless LANs
To secure interactive multimedia applications in wireless LANs WLANs it is pertinent to implement a number of security services such as authentication, key exchange and real-time e...
Aura Ganz, Se Hyun Park, Zvi Ganz