Sciweavers

256 search results - page 49 / 52
» Power assignment for k-connectivity in wireless ad hoc netwo...
Sort
View
IPPS
2005
IEEE
14 years 1 months 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
JUCS
2006
86views more  JUCS 2006»
13 years 8 months ago
Secure Service Discovery based on Trust Management for ad-hoc Networks
Abstract: In ad-hoc networks, mobile devices communicate via wireless links without the aid of any fixed networking infrastructure. These devices must be able to discover services ...
Celeste Campo, Florina Almenárez Mendoza, D...
WADS
2009
Springer
262views Algorithms» more  WADS 2009»
14 years 2 months ago
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
Chenyu Yan, Yang Xiang, Feodor F. Dragan
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun
SASN
2005
ACM
14 years 1 months ago
On the security of group communication schemes based on symmetric key cryptosystems
Many emerging applications in both wired and wireless networks, such as information dissemination and distributed collaboration in an adversarial environment, need support of secu...
Shouhuai Xu