Show simple item record

A dynamic shortest path weighted routing mechanism for MANET based on complex network theory

contributor authorYinghe, Wang
contributor authorLin, Chang
contributor authorKai, Yu
contributor authorChong, Tan
contributor authorZhiyong, Bu
date accessioned2020-03-12T22:16:12Z
date available2020-03-12T22:16:12Z
date issued2014
identifier other7000257.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1077121?show=full
formatgeneral
languageEnglish
publisherIEEE
titleA dynamic shortest path weighted routing mechanism for MANET based on complex network theory
typeConference Paper
contenttypeMetadata Only
identifier padid8213359
subject keywordsdata analysis
subject keywordsn very large databases
subject keywordsn I-O-intensive big data jobs
subject keywordsn RCMP
subject keywordsn big data analytics
subject keywordsn data replication
subject keywordsn double data loss events
subject keywordsn finer-grained task scheduling granularity
subject keywordsn first-order failure resilience strategy
subject keywordsn hot-spots
subject keywordsn intermediate job outputs
subject keywordsn job recomputation
subject keywordsn single data loss events
subject keywordsn very large datasets
subject keywordsn Big data
subject keywordsn Educational institutions
subject keywordsn Market research
subject keywordsn Middleware
subject keywordsn Processor scheduling
subject keywordsn Resilience
identifier doi10.1109/IPDPS.2014.102
journal titleetwork Infrastructure and Digital Content (IC-NIDC), 2014 4th IEEE International Conference on
filesize154737
citations0


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record