Kim L. Blackmore

Orcid: 0000-0002-6592-3346

According to our database1, Kim L. Blackmore authored at least 10 papers between 1997 and 2014.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Estimation of hop count in multi-hop wireless sensor networks with arbitrary node density.
Int. J. Wirel. Mob. Comput., 2014

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks.
Proceedings of the Mobility, Intelligent Networks &Smart Societies, Proceedings of the 2nd BCS International IT Conference 2014, Abu Dhabi, United Arab Emirates, 9, 2014

2013
Mobility Assessment for MANETs Requiring Persistent Links.
Proceedings of the International Workshop on Wireless Traffic Measurements and Modeling, 2013

2012
Mobile Base Station and Clustering to Maximize Network Lifetime in Wireless Sensor Networks.
J. Electr. Comput. Eng., 2012

2010
Word-valued sources: an ergodic theorem, an AEP, and the conservation of entropy.
IEEE Trans. Inf. Theory, 2010

2009
On the Minimum Number of Neighbours for Good Routing Performance in MANETs.
Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 2009

2007
An Analysis Framework for Mobility Metrics in Mobile Ad Hoc Networks.
EURASIP J. Wirel. Commun. Netw., 2007

Strong Stochastic Stability for MANET Mobility Models.
Proceedings of the 15th IEEE International Conference on Networks, 2007

1997
Decision region approximation by polynomials or neural networks.
IEEE Trans. Inf. Theory, 1997

Online learning via congregational gradient descent.
Math. Control. Signals Syst., 1997


  Loading...