Sciweavers

2571 search results - page 111 / 515
» Approximation schemes for wireless networks
Sort
View
MOBIHOC
2002
ACM
16 years 6 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
SASN
2005
ACM
16 years 12 days 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
ESAS
2007
Springer
16 years 1 months ago
Key Distribution in Mobile Ad Hoc Networks Based on Message Relaying
Abstract. Securing wireless mobile ad hoc networks (MANETs) is challenging due to the lack of centralized authority and poor connectivity. A key distribution mechanism is central t...
Johann van der Merwe, Dawoud S. Dawoud, Stephen Mc...
SRDS
1998
IEEE
15 years 11 months ago
An Efficient Scheme to Reduce Handoff Dropping in LEO Satellite Systems
The problem of handoffs in cellular networks is compounded in a low earth orbit (LEO) satellite-based cellular network due to the relative motion of the satellites with respect to ...
Suresh Kalyanasundaram, Edwin K. P. Chong, Ness B....
IJNSEC
2010
143views more  IJNSEC 2010»
15 years 1 months ago
A New Secure Remote User Authentication Scheme with Smart Cards
Remote user authentication scheme is one of the simplest and the most convenient authentication mechanisms to deal with secret data over insecure networks. These types of schemes ...
Manoj Kumar