116 search results - page 16 / 24 » A realistic mobility model for wireless networks of scale-fr... |
MOBIHOC
2006
ACM
14 years 6 months ago
2006
ACM
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract— We investigate the secure connectivity of wireless sensor networks under the pairwise key distribution scheme of Chan et al.. Unlike recent work which was carried out u...
FSTTCS
2004
Springer
14 years 3 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
JCM
2006
13 years 6 months ago
2006
Wireless networks are currently experiencing more overload situations than their wireline counterparts because of explosive mobile traffic growth, unpredictable traffic behavior, s...
PERCOM
2006
ACM
14 years 6 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...